Publication Type

Conference Proceeding Article

Version

acceptedVersion

Publication Date

12-2007

Abstract

Designing energy-efficient routing protocols to effectively increase the networks' lifetime and provide the robust network service is one of the important problems in the research of wireless sensor networks. Using the hyper-graph theory, the paper represents large-scale wireless sensor networks into a hyper-graph model, which can effectively decrease the control messages in routing process. Based on this mathematic model, the paper presents the minimum spanning hyper-tree routing algorithm in synchronous wireless sensor networks (MSHT-SN), which builds a minimum energy consumption tree for data collection from multi-nodes to Sink node. The validity of the algorithm is proved by the theatrical analysis. Finally, the simulation is proposed to prove the MSHT-SN algorithm is right and effective. It can increase the transmitting success rate and effectively save the scarce energy.

Keywords

Routing algorithm, Spanning hyper-tree, Synchronous networks, Wireless sensor network

Discipline

Operations Research, Systems Engineering and Industrial Engineering | Theory and Algorithms

Research Areas

Intelligent Systems and Optimization

Publication

Proceedings of the 2007 IET Conference on Wireless, Mobile and Sensor Networks, Shanghai, December 12-14

First Page

245

Last Page

248

ISBN

9780863418365

Identifier

10.1049/cp:20070129

Publisher

IEEE

City or Country

New York

Additional URL

https://doi.org/10.1049/cp:20070129

Download

Share

COinS