Referenced Items are not available for this document.
In wireless sensor networks, the size of backbone network have a great impact on communication overhead, as well as the network lifetime. It can be designed based on cluster tree. MIS (maximum independent sets) composed of clusterheads is achieved by clustering algorithm, based which MCDS(minimal connected dominating sets) and MST(minimum spanning tree) are built with improved Prim algorithm, and construct backbone network. Besides that, the maintenance and update algorithm of spanning tree is also given. In the end, simulation analysis proves the efficiency of the proposed algorithm.
Published in:
Wireless Communications & Signal Processing, 2009. WCSP 2009. International Conference on
Date of Conference: 13-15 Nov. 2009
- Page(s):
- 1 - 4
- E-ISBN :
- 978-1-4244-5668-0
- Print ISBN:
- 978-1-4244-4856-2
- INSPEC Accession Number:
- 11051973
- Conference Location :
- Nanjing
- Digital Object Identifier :
- 10.1109/WCSP.2009.5371396
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
