A Heuristic for Minimum Connected Dominating Set with Local Repair for Wireless Sensor Networks

Author(s):  
Mritunjay Rai ◽  
S. Verma ◽  
S. Tapaswi
2018 ◽  
Vol 14 (1) ◽  
pp. 155014771875563 ◽  
Author(s):  
Gulshan Kumar ◽  
Mritunjay Kumar Rai ◽  
Rahul Saha ◽  
Hye-jin Kim

Localization is one of the key concepts in wireless sensor networks. Different techniques and measures to calculate the location of unknown nodes were introduced in recent past. But the issue of nodes’ mobility requires more attention. The algorithms introduced earlier to support mobility lack the utilization of the anchor nodes’ privileges. Therefore, in this article, an improved DV-Hop localization algorithm is introduced that supports the mobility of anchor nodes as well as unknown nodes. Coordination of anchor nodes creates a minimum connected dominating set that works as a backbone in the proposed algorithm. The focus of the research paper is to locate unknown nodes with the help of anchor nodes by utilizing the network resources efficiently. The simulated results in network simulator-2 and the statistical analysis of the data provide a clear impression that our novel algorithm improves the error rate and the time consumption.


2019 ◽  
Vol 1 (2) ◽  
pp. 10-15
Author(s):  
Vijayalakshmi D ◽  
Kalaivani R

It is largely applied in Wireless Sensor Networks (WSN). It acts as a virtual backbone in WSNs.algorithms of finding such minimum connected dominating set was studied. A new algorithm for constructing a routing in WSN using one of the algorithms is proposed and implemented using java language. The sampleoutputs are also included


Sign in / Sign up

Export Citation Format

Share Document