In wireless sensor network, random deployment of nodes may cause serious coverage overlapping and the death of the nodes may also cause severe coverage problems in original network. There are several hole repair algorithms which take density of the nodes in the post deployment scenario. These algorithms consider limited mobility of the nodes and nodes with higher degree of coverage overlapping is selected. Coverage holes of the network are repaired by moving nodes which has high degree of density. This maintains uniform network density without increasing the coverage degree of the neighbor node. Single and multiple node failure is considered. Due to continuous node failure, the network may not be healed after certain healing process. The node cannot move when the energy goes below the critical level. To avoid this type of problem, the failure detection based on the energy loss is proposed. Nodes with low energy level are identified and are completely replaced by actor nodes.Actors are usually resource-rich devices equipped with better processing capabilities, stronger transmission powers and longer battery life.Here the hole detection and replacing are based on three distinct phases 1) hole identification 2) hole discovery and border detection 3) Node healing and replacement. Distributed and localized holedetection and healing algorithm deals with the holes of various forms and sizes despite node distribution and density. The proposed algorithm consumes less amount of energy when compared to existing algorithm.
D. Jewel, P. Brundha, D. C. Joy Winnie Wise, G. Aravind Swaminathan
WSN, Coverage Overlapping, Hole Detection, Hole Repair Algorithm
- Ammari H.M. and Das S.K. (2012), ‘Centralized and clustered k-coverage protocols for wireless sensor networks’, IEEE Trans. Comput., vol. 61, no. 1, pp. 118–133.
- Bai X., Yun Z., Xuan D. and Lai T.H. (2010), ‘Optimal patterns for four connectivity and full coverage in wireless sensor networks’, IEEE Trans. Mobile Comput., vol. 9, no. 3, pp. 435–448.
- Gupta H., Zhou Z., Das S.R. and Gu Q. (2006), ‘Connected sensor cover:Self-organization of sensor networks for efficient query execution’,IEEE/ACM Trans. Netw., vol. 14, no. 1, pp. 55–67.
- Ma C., He J., Chen H.H. and Tang Z.(2013),‘Coverage overlapping problems in applications of IEEE 802.15.4 wireless sensor networks’, in Proc. IEEE Wireless Commun. Netw. Conf., pp. 4364–4369.
- Mahboubi H., Habibi J., Aghdam A.G. and Sayrafian-Pour K. (2013), ‘Distributed deployment strategies for improved coverage in a network of mobile sensors with prioritized sensing field’, IEEE Trans. Ind. Informat., vol. 9, no. 1.
- Megerian S., Koushanfar F., Potkonjak M. and Srivastava M.B. (2005), ‘Worst and best-case coverage in sensor networks’, IEEE Trans. Mobile Comput., vol. 4, no. 1, pp. 84–92.
- Ram S.S., Manjunath D., Iyer S.K. and Yogeshwaran D. (2007), ‘On the path coverage properties of random sensor networks’, IEEETrans. Mobile Comput., vol. 6, no. 5, pp. 494–506.
- Razafindralambo T. and Simplot-Ryl D.(2011), ‘Connectivity preservation and coverage schemes for wireless sensor networks’, IEEE Trans. Autom. Control, vol. 56, no. 10, pp. 2418–2428.
- Shiu L.C., Lee C.Y. and Yang C.S. (2011), ‘The divide-and-conquer deployment algorithm based on triangles for wireless sensor networks’, IEEE Sensors J., vol. 11, no. 3, pp. 781–790.
- Tseng Y.C., Chen P.Y. and Chen W.T. (2012), ‘k-Angle object coverage problem in a wireless sensor network’, IEEE Sensors J., vol. 12,no. 12, pp. 3408–3416.
- Wang G., Cao G. and Porta T.F. (2006) , ‘Movement-assisted sensor deployment’, IEEE Trans. Mobile Comput., vol. 5, no. 6, pp. 640–652.
- Wang X., Han S., Wu Y. and Wang X. (2013), ‘Coverage and energy consumption control in mobile heterogeneous wireless sensor Networks’, IEEE Trans. Autom. Control, vol. 58, no. 4, pp. 975–988, Apr. 2013.
- Wu J. and Sun N. (2012) ‘Optimum sensor density in distortion-tolerant wireless sensor networks’, IEEE Trans. Wireless Commun., vol. 11, no. 6, pp. 2056–2064, Jun. 2012.
- Yang S., Li M. and Wu J. (2007), ‘Scan-based movement-assisted sensor deployment methods in wireless sensor networks’, IEEE Trans.ParallelDistrib. Syst., vol. 18, no. 8, pp. 1108–1121.
- Zhang C., Bai X., Teng J. and Xuan D. (2010), ‘Constructing low-connectivity and full-coverage three dimensional sensor networks’, IEEE J. Sel. Areas Commun., vol. 28, no. 7, pp. 984–993.
- Shahram Babaie1 and SeyedSajadPirahesh, “Hole Detection for Increasing Coverage in Wireless SensorNetwork Using Triangular Structure”, IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 1, No 2, January 2012 ISSN (Online): 1694-0814 www.IJCSI.org
- FarhadNematy and NaeimRahmani,”Using Voronoi Diagram and Genetic Algorithm to Deploy Nodes in Wireless Sensor Network”, JSCSE, Vol. 3, No. 3, Special Issue: [SCSE’13], San Francisco, CA, U.S.A., March 2013 Doi: 10.7321/jscse.v3.n3.107 e-ISSN: 2251-75.
- Rajat Bhardwaj and Hitesh Sharma, “Holes in Wireless Sensor Networks”, Lovely Professional University, Phagwara, Punjab, India, firstname.lastname@example.org
|Published in :
||Volume 2 | Issue 2 | March-April - 2016
|Date of Publication
Cite This Article
D. Jewel, P. Brundha, D. C. Joy Winnie Wise, G. Aravind Swaminathan, "Improved Hole Detection Healing and Replacing Algorithm for Optimal Coverage in Wireless Sensor Networks", International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 2, Issue 2, pp.724-731, March-April-2016.
URL : http://ijsrset.com/IJSRSET1622230.php