Adding the Reliability on Tree Based Topology Construction Algorithms for Wireless Sensor Networks

Authors:
Mahzeb Fiaz;Roomana Yousaf;Maryam Hanfi;Waqar Asif;Hassaan Khaliq Qureshi;Muttukrishnan Rajarajan
Affiliations:
School of Electrical Engineering and Computer Science (SEECS), National University of Sciences and Technology (NUST), Islamabad, Pakistan;School of Electrical Engineering and Computer Science (SEECS), National University of Sciences and Technology (NUST), Islamabad, Pakistan;School of Electrical Engineering and Computer Science (SEECS), National University of Sciences and Technology (NUST), Islamabad, Pakistan;School of Electrical Engineering and Computer Science (SEECS), National University of Sciences and Technology (NUST), Islamabad, Pakistan and School of Engineering and Mathematical Sciences, City ...;School of Electrical Engineering and Computer Science (SEECS), National University of Sciences and Technology (NUST), Islamabad, Pakistan;School of Engineering and Mathematical Sciences, City University, London, UK
Venue:
Wireless Personal Communications: An International Journal
Year:
2014

Citing 5
Cited 0

Energy efficient distributed connected dominating sets construction in wireless sensor networks

Proceedings of the 2006 international conference on Wireless communications and mobile computing
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication

IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks

IEEE Transactions on Mobile Computing
Cytoscape 2.8

Bioinformatics
Poly: A reliable and energy efficient topology control protocol for wireless sensor networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

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.