By Topic

Dynamic Minimal Spanning Tree Routing Protocol for Large Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Guangyan Huang ; Advanced Test Technology Lab., Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China, 100080. Email: ; Xiaowei Li ; Jing He

Hundreds or thousands of wireless sensor nodes with limited energy resource are randomly scattered in the observation fields to extract the data messages for users. Because their energy resource cannot be recharged, energy efficiency becomes one of the most important problems. LEACH is an energy efficient protocol by grouping nodes into clusters and using cluster heads (CH) to fuse data before transmitting to the base station (BS). BCDCP improves LEACH by introducing a minimal spanning tree (MST) to connect CHs and adopting iterative cluster splitting algorithm to choose CHs or form clusters. This paper proposes another innovative cluster-based routing protocol named dynamic minimal spanning tree routing protocol (DMSTRP), which improves BCDCP by introducing MSTs instead of clubs to connect nodes in clusters. Simulation results show that DMSTRP excels LEACH and BCDCP in terms of both network lifetime and delay when the network size becomes large

Published in:

Industrial Electronics and Applications, 2006 1ST IEEE Conference on

Date of Conference:

24-26 May 2006