Energy Efficient Low-Cost Virtual Backbone Construction for Optimal Routing in Wireless Sensor Networks

K. Mohaideen Pitchai and B. Paramasivan

Mathematical Problems in Engineering, 2014, vol. 2014, 1-7

Abstract:

Many prominent applications in wireless sensor networks which require collected information have to be routed to end nodes in an efficient manner. In general, weighted connected dominating Sets (WCDS) based routing is a promising approach for enhancing the routing efficiency in sensor networks. Backbone has been used extensively in routing. Here an efficient WCDS algorithm for constructing a virtual backbone with low total cost, hop spanning ratio, and minimum number of dominators is proposed. We report a systematic approach, which has three phases. Initial phase considers the issues of revoking a partial CDS tree from a complete CDS tree. Secondary and final phases make the design of the complete algorithm by considering the determination of dominators using an iteration process. Our findings reveal better performance than the existing algorithms in terms of total cost, hop spanning ratio, and number of dominators.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/360694.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/360694.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:360694

DOI: 10.1155/2014/360694

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().