Academic
Publications
Information flow based routing algorithms for wireless sensor networks

Information flow based routing algorithms for wireless sensor networks,10.1109/GLOCOM.2004.1378059,Yeling Zhang,Ramkumar Mahalingam,Nasir Memon

Information flow based routing algorithms for wireless sensor networks   (Citations: 5)
BibTex | RIS | RefWorks Download
This paper introduces the measure of information as a new criterion for the performance analysis of routing algorithms in wireless sensor networks. We argue that since the objective of a sensor network is to estimate a two dimensional random field, a routing algorithm must maximize information flow about the underlying field over the lifetime of the sensor network. We develop two novel algorithms, MIR (maximum information routing) and CMIR (conditional maximum information routing) designed to maximize information flow, and present a comparison of the algorithms to a previously proposed algorithm-MREP (maximum residual energy path) through simulations. We show that the proposed algorithms give significant improvement in terms of information flow, when compared to MREP.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...So, as energy is the main constraint, all the parameters of performance measurement refer to it, that’s why for the network lifetime, many definitions are given: a) the "death" of the first node determines the death of the network [1]; b) the death of the last node determines the network lifetime...
    • ...<{[SECTION]}>[0,1] η ∈ , so only if η Δ≥ , the network can work, then the...

    Elma Zanajet al. Improving Parameters for Wireless Sensor Networks

    • ...Even though complex algorithms have been used for wireless sensor networks [15-17], their incorporation into adaptive and responsive HVAC has been minimum [18]...

    Addwiteey Chrungooet al. On adaptive HVAC based on a De-Centralized algorithm using K:1 transmi...

    • ...It was realized by the sensor network research community that improving the ratio of packets transmitted to energy consumed by the network is by itself not a good measure of the efficiency of the network [5]...
    • ...However, the fact that the routing paths are chosen in such a way that all nodes die simultaneously (by attempting to postpone the death of the first node) does not automatically imply that the energy utilization is optimal [5]...
    • ...Authors of [5] have exhibited similar thinking and define the network lifetime as the time taken for s ome fraction of nodes in the network to die, which is m ore practical than earlier definitions which use time t o the death of the first node as the network’s lifetime...
    • ...In this paper, we use a new concept called application-tolerable network run-time informationcollecting ability in judging the lifetime of a net work, which is more information oriented compared with the definition used in [5]...
    • ...The definition of “lifetime” should obviously depend on the nature of the application [5]...
    • ...Obviously, this network lifetime definition is more information oriented compared with that in [5], whe re the fraction of live (or dead) nodes instead of the residual information-collecting ability is used to judge the network’s death...

    Qinghua Wanget al. An Effort to Understand the Optimal Routing Performance in Wireless Se...

    • ...It was realized by the sensor network research community that improving the ratio of packets transmitted to power consumed by the network is by itself not a good measure of the efficiency of the network [5]...
    • ...However, the fact that the routing paths are chosen in such a way that all nodes die simultaneously (by attempting to postpone the death of the first node) does not automatically imply that the energy utilization is optimal [5]...
    • ...Yeling et al. have offered similar thoughts in [5] and define the network lifetime as the time taken for some fraction of nodes in the network to die (completely deplete their power), which is more reasonable than earlier definitions that used time to first node death as the lifetime...
    • ...They also attempt to present a good routing able to improve network information collection [5], since maximizing information collection is a natural routing metric for ubiquitous information-collecting purpose wireless sensor networks...
    • ...In this paper, we use application dependent information-collecting power requirement to judge the lifetime of network, which is even more reasonable than the definition used in [5]...
    • ...The definition of “lifetime” should obviously depend on the nature of the application [5]...
    • ...Note this network lifetime definition is different from [5], where a network is declared dead without information consideration...

    Qinghua Wanget al. Bounding the Information Collection Performance of Wireless Sensor Net...

Sort by: