Open Access   Article Go Back

A Literature Review in Wireless Sensor Hole Detection Along with Node Scheduling Algorithm

Somil Tyagi1 , Jaspreet Kaur2

Section:Survey Paper, Product Type: Journal Paper
Volume-4 , Issue-8 , Page no. 28-32, Aug-2016

Online published on Aug 31, 2016

Copyright © Somil Tyagi , Jaspreet Kaur . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Somil Tyagi , Jaspreet Kaur, “A Literature Review in Wireless Sensor Hole Detection Along with Node Scheduling Algorithm,” International Journal of Computer Sciences and Engineering, Vol.4, Issue.8, pp.28-32, 2016.

MLA Style Citation: Somil Tyagi , Jaspreet Kaur "A Literature Review in Wireless Sensor Hole Detection Along with Node Scheduling Algorithm." International Journal of Computer Sciences and Engineering 4.8 (2016): 28-32.

APA Style Citation: Somil Tyagi , Jaspreet Kaur, (2016). A Literature Review in Wireless Sensor Hole Detection Along with Node Scheduling Algorithm. International Journal of Computer Sciences and Engineering, 4(8), 28-32.

BibTex Style Citation:
@article{Tyagi_2016,
author = {Somil Tyagi , Jaspreet Kaur},
title = {A Literature Review in Wireless Sensor Hole Detection Along with Node Scheduling Algorithm},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {8 2016},
volume = {4},
Issue = {8},
month = {8},
year = {2016},
issn = {2347-2693},
pages = {28-32},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1027},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1027
TI - A Literature Review in Wireless Sensor Hole Detection Along with Node Scheduling Algorithm
T2 - International Journal of Computer Sciences and Engineering
AU - Somil Tyagi , Jaspreet Kaur
PY - 2016
DA - 2016/08/31
PB - IJCSE, Indore, INDIA
SP - 28-32
IS - 8
VL - 4
SN - 2347-2693
ER -

VIEWS PDF XML
1834 1583 downloads 1540 downloads
  
  
           

Abstract

A sensor network consist of low battery power, low cost, limited storage, tiny sensing devices. The one of the significant challenge in wireless sensor network is how well the network is monitored while maximizing network’s lifetime. Since sensing and transmitting data consume sensors’ energy, so to preserve energy an optimal sensor node scheduling scheme is required where only an optimal number of sensors are activate and other node are eligible to shut down to save their energy which can be used to prolong lifetime of sensor network. In this paper we introduced a node scheduling scheme which is based on optimal Coverage Preserving Scheme (OCoPS) that first check the redundant sensor and then decide to turn itself off. Further, in wireless sensor network there may exist some regions where sensors are not able to sense data or communicate which are called hole regions. Since hole region may jeopardize sensing, communicating or connectivity of sensor network, therefore identification of hole regions is also prime concern. In this paper, we first detect the hole regions in sensor network and then deploying sensors at appropriate location for covering that region. Our hole detection approach is based on Boundary Critical Points. The simulation results demonstrate that the proposed algorithm can lead to a high coverage ratio while keeping long network’s life.

Key-Words / Index Term

WirelessSensor, Scheduling Sensor, Hole Detection, Wireless Network

References

[1] B. Kun, T. Kun, G. Naijie, L.D. Wan, and L. Xiaohu, 2006, “Topological Hole Detection in Sensor Networks with Cooperative Neighbors,” Proc. Int‟l Conf. Systems and Networks Comm. (ICSN ‟06), p. 31, 20.
[2] F. Stefan, 2005, “Topological Hole Detection in Wireless Sensor Networks and its Applications,” Proc. Joint Workshop on Foundations of Mobile Computing, p. 44-53.
[3] F. Stefan and K. Christian, 2006, “Hole Detection or: How Much Geometry Hides In Connectivity?” Proc. 22nd Ann. Symp. Computational Geometry (SCG ‟06), pp. 377-385.
[4] S.P. Fekete, A. Kr€oller, D. Pfisterer, S. Fischer, and C. Buschmann,2004,“Neighborhood-BasedTopology Recognition in Sensor Networks,” Proc. Int‟l Workshop on Algorithmic Aspects of Wireless Sensor Networks, pp. 123-136.
[5] Q. Fang, J. Gao, and L.J. Guibas, 2006, “Locating and Bypassing Holes in Sensor Networks,” Mobile Networks and Applications, vol. 11, no. 2, pp. 187-200.International Journal of Engineering Research and General Science Volume 3, Issue 1, January-February, 2015 ISSN 2091-2730 1094 www.ijergs.org
[6] A. Shirsat and B. Bhargava, 2011, “Local Geometric Algorithm for Hole Boundary Detection in Sensor Networks,” Security and Comm. Networks, vol. 4, no. 9, pp. 1003-1012.
[7] G. Wang, G. Cao, and T.F.L. La Porta, June 2006, “Movement-Assisted Sensor Deployment,” IEEE Trans. Mobile Computing, vol. 5, no. 6, pp. 640-652.
[8] C.Y. Chang, L.L. Hung, S.W. Chang, and Y.C. Chen, 2012, “Decentralized and Energy-Balanced Algorithms for Maintaining Temporal Full-Coverage in Mobile WSNs,” J. Wireless Comm. and Mobile Computing, vol. 12, no. 5, pp. 445-462.
[9] C.Y. Chang, C.Y. Lin, G.J. Yu, and C.H. Kuo, 2013, “An energy-Efficient Hole-Healing Mechanism for Wireless Sensor Networks with Obstacles,” Wireless Comm. and Mobile Computing, vol. 13, no. 4, pp. 377-392.
[10] A. Nadeem, S.K. Salil, and J. Sanjay, 2011, “A Pragmatic Approach to Area Coverage in Hybrid Wireless Sensor Networks,” Wireless Comm. and Mobile Computing, vol. 11, no. 1, pp. 23-45.
[11] X. Li, G. Fletcher, A. Nayak, and I. Stojmenovic, 2012, “Randomized Carrier-Based Sensor Relocation in Wireless Sensor and Robot Networks,” Proc. Ad Hoc Networks, DOI:10.1016/j.adhoc .06.007.
[12] Y. Wang, J. Gao, and S.B. Mitchell, 2006, “Boundary Recognition in Sensor Networks by Topological Methods,” Mobi Com „06, pp. 122-133.
[13] A. Kroller, P. Fekete, D. Pfisterer, and S. Fischer, 2006, “Deterministic Boundary Recognition and Topology Extraction for Large Sensor Networks,” Proc. 17th Ann. ACM-SIAM Symp. Discrete Algorithm (SODA „06), pp. 1000-1009.
[14] Z. Yong and W. Li, June 2009, “A Sensor Deployment Algorithm for Mobile Wireless Sensor Networks,” Proc. 21st Ann. Int‟l Conf. Chinese Control and Decision Conf. (CCDC ‟09), pp. 4642-4647, 17-19.
[15] S. Yangy, M. Liz, and J. Wu, Aug 2007, “Scan-Based Movement-Assisted Sensor Deployment Methods in Wireless Sensor Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 8, pp. 1108-1121.
[16] X. Li, H. Frey, N. Santoro, and I. Stojmenovic, Nov 2011, “Strictly Localized Sensor Self-Deployment for Optimal Focused Coverage,” IEEE Trans. Mobile Computing, vol. 10, no. 11, pp. 1520-1533.
[17] G. Wang, G. Cao, P. Berman, and T. La Porta, May 2007, “Bidding Protocols for Deploying Mobile Sensors,” IEEE Trans. Mobile Computing, vol. 6, no. 5, pp. 563-576.