3rd International ICST Conference on Quality of Service in Heterogeneous Wired/Wireless Networks

Research Article

MESTER: minimum energy spanning tree for efficient routing in wireless sensor networks

  • @INPROCEEDINGS{10.1145/1185373.1185396,
        author={	Yang  Yang  and Huihai 	 Wu  and Weihua  Zhuang},
        title={MESTER: minimum energy spanning tree for efficient routing in wireless sensor networks},
        proceedings={3rd International ICST Conference on Quality of Service in Heterogeneous Wired/Wireless Networks},
        publisher={IEEE},
        proceedings_a={QSHINE},
        year={2006},
        month={8},
        keywords={},
        doi={10.1145/1185373.1185396}
    }
    
  • Yang Yang
    Huihai Wu
    Weihua Zhuang
    Year: 2006
    MESTER: minimum energy spanning tree for efficient routing in wireless sensor networks
    QSHINE
    ACM
    DOI: 10.1145/1185373.1185396
Yang Yang 1, Huihai Wu 2, Weihua Zhuang3
  • 1: University College London, UK
  • 2: Brunel University, UK
  • 3: University of Waterloo, Canada

Abstract

For applications requiring frequent data collections from a remote wireless sensor network, it is a challenging problem to design an efficient routing scheme for comprehensively, accurately and timely delivering data packets in each round of data collection over a long period of time. Unlike previous work targeting at maximizing energy efficiency and network lifetime, we propose and analyze in this paper a new routing scheme, called Minimum Energy Spanning Tree for Efficient Routing (MESTER), which is developed under the design objective of maintaining a high quality in data collection for as long as possible. Compared with the existing Minimum Spanning Tree (MST) based schemes like PEDAP and PEDAP-PA, MESTER can achieve comparable but more balanced performance at a much lower complexity. In addition, we define "throughput efficiency" to characterize our quality-oriented design objective. As a new concept with low granularity (packet level), throughput efficiency is found a fair and stable performance metric to different network sizes, node densities and routing schemes. It provides us an additional insight into the network behavior under different resource and capability constraints.