Adding the reliability on tree based topology construction algorithms for wireless sensor networks

Fiaz, M., Yousaf, R., Hanfi, M., Asif, W., Qureshi, H. K. & Rajarajan, M. (2014). Adding the reliability on tree based topology construction algorithms for wireless sensor networks. Wireless Personal Communications, 74(2), pp. 989-1004. doi: 10.1007/s11277-013-1334-2

[img]
Preview
PDF - Accepted Version
Download (863kB) | Preview

Abstract

Topology control is a technique used in wireless sensor networks to maximize energy efficiency and network lifetime. In previous literature, many tree based techniques have been proposed to save energy and increase the network lifetime. In tree based algorithms, the most promising solution is the formation of a network backbone, which serves on behalf of rest of the nodes in the network and therefore leading towards Connected Dominating Set (CDS) formulation. However, one imminent problem with all tree based solution is a compromise on network reliability. Therefore, to address reliability issues in tree based solutions, in this paper, we propose Poly3 which maintains cliques of size three in order to achieve network reliability on top of the CDS algorithm. This makes the network more robust to link removal. Our empirical and mathematical analysis reveals that Poly3 provides better reliability than algorithms of the same kind.

Item Type: Article
Additional Information: The final publication is available at Springer via http://dx.doi.org/10.1007/s11277-013-1334-2
Uncontrolled Keywords: Connected dominating set, Average path length, Reliability
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: School of Engineering & Mathematical Sciences > Engineering
URI: http://openaccess.city.ac.uk/id/eprint/4484

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics