CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Survey on Localization and Covering Techniques in Wireless Sensor Networks

by Lokesh Poudyal, Biswaraj Sen
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 67 - Number 7
Year of Publication: 2013
Authors: Lokesh Poudyal, Biswaraj Sen
10.5120/11408-6734

Lokesh Poudyal, Biswaraj Sen . A Survey on Localization and Covering Techniques in Wireless Sensor Networks. International Journal of Computer Applications. 67, 7 ( April 2013), 23-27. DOI=10.5120/11408-6734

@article{ 10.5120/11408-6734,
author = { Lokesh Poudyal, Biswaraj Sen },
title = { A Survey on Localization and Covering Techniques in Wireless Sensor Networks },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 67 },
number = { 7 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 23-27 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume67/number7/11408-6734/ },
doi = { 10.5120/11408-6734 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:24:04.261863+05:30
%A Lokesh Poudyal
%A Biswaraj Sen
%T A Survey on Localization and Covering Techniques in Wireless Sensor Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 67
%N 7
%P 23-27
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Wireless Sensor Network (WSN) has gained popularity in diverse application fields owing to the inexpensive sensor nodes also called as motes. These sensor nodes are either deployed randomly or placed manually depending on the type of applications. The services of WSN are tremendously being used in application areas such as disaster relief, search and rescue, target tracking, battlefield and many more. Due to the application of WSN in such environments, it is not possible to manually deploy sensor nodes and therefore, the nodes are randomly deployed in the area of interest. Due to the random placement of the sensor nodes, it becomes essential to determine the location of the nodes in order to facilitate communication between nodes as well as Base Station (BS). Further, in case of random node deployment, the usual practice is to deploy a very large number of nodes (more than that of the requirement) in the area of interest. This is done in order to achieve fault tolerance, thus opening a large number of research directions to determine the optimal number of nodes participating in WSN 'covering' problem. This paper deals with an insight on the various localization and coverage techniques used in WSN. Further this paper tries to establish the interdependence between the localization and covering techniques.

References
  1. Pal. 2010. "Localization Algorithms in Wireless Sensor Networks: Current Approaches and Future Challenges", Network Protocols and Algorithms, ISSN 1943-3581, Vol. 2, No. 1.
  2. Ghosh and S. K. DAS. 2006. 'Coverage and Connectivity Issues in Wireless Sensor Networks',Mobile, Wireless, and Sensor Networks: Technology, Applications, and Future Directions, Akkihebbal L. Ananda, Mun Choon Chan, and Wei Tsang Doi Copyright, John Wiley & Sons, Inc, pp:221-256,
  3. D. W. Gage. 1992. Command control for many-robot systems, Proc. 19th Annual AUVS Technical Symp. Reprinted in Unmanned Syst. Mag. 10(4):28–34.
  4. D. G. Anand, H. G. Chandrakanthand M. N. Giriprasad. 2011. "Energy Efficient Coverage Problems in Wireless Ad Hoc Sensor Networks", Advanced Computing: An International Journal(ACIJ), Vol No . 2, , DOI : 10. 5121/acij. 2011. 2204, pp:42-50.
  5. E. Shih, S. Cho, N. Ickes, R. Min, A. Sinha, A. Wang, A. Chandrakasan. 2001. "Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks",In Proceedings of ACM MobiCom'01, Rome, Italy, pp. 272–286.
  6. G. J. Fan and ShiYao Jin. 2010. "Coverage Problem in Wireless Sensor Network:A Survey", Journal of Networks, VOL. 5, NO. 9 ,pp:1033-1041.
  7. G. Shankar , T. G. Basavaraju , D. H. Manjaiah, S. K. Sarkar. (July 2 – 4, 2008). "Issues in Wireless Sensor Networks", In Proceedings of the World Congress on Engineering Vol I WCE (July 2 – 4, 2008), London, U. K. , ISBN:978-988-98671-9-5.
  8. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci. 2002. "Wireless sensor networks: a survey,Computer Networks", Published by Elsevier Science B. V. PII: S13 8 9-1 2 86 (0 1 )0 03 0 2- 4, pp: 393–422.
  9. J. Norman. 2011. "Connectivity and Coverage in Hybrid Wireless Sensor Networks using Dynamic Random Geometric Graph Model", International journal on applications of graph theory in wireless ad hoc networks and sensor networks (GRAPH-HOC) Vol. 3, No. 3, DOI : 10. 5121/jgraphoc. 3304 39,pp:39-47.
  10. R. Mulligan and H. M. Ammari. 2010. "Coverage in Wireless Sensor Networks: A Survey,Network Protocols and Algorithms", ISSN 1943-3581, Vol. 2, No. 2,pp: 27-53.
  11. S. Gandhama, M. Dawandeb, R. Prakash. 2008. "Link scheduling in wireless sensor networks: Distributed edge-coloring revisited", J. Parallel Distrib. Comput. 68, doi:10. 1016/j. jpdc. 2007. 12. 006, pp:1122–1134.
  12. H. Zhang and J. C. Hou. 2004. Maintaining sensing coverage and connectivity in large sensor networks, Proc. Int. Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless and Peer-to-Peer Networks (AlgoSensors), Florida.
  13. D. Tian and N. D. Georganas. 2002. A coverage-preserving node scheduling scheme for large wireless sensor networks, Proc. 1st ACMInt. Workshop onWireless Sensor Networks and Applications (WSNA'02), Atlanta, GA, pp. 32–41.
  14. Y. Gao, K. Wu, and F. Li. 2003. Analysis on the redundancy of wireless sensor networks, Proc. 2nd ACM Int. Conf. Wireless Sensor Networks and Applications (WSNA'03), San Diego, CA, pp. 108–114.
  15. G. M. Crippen, T. F. Havel. 1988. Distance Geometry and Molecular Conformation, John Wiley and Sons Inc. , New York.
  16. U. Bischoff, M. Strohbach, M. Hazas, and G. Kortuem. 2006. Constraint-based distance estimation in ad-hoc wireless sensor networks. In Proceedings of the Third European Workshop on Wireless Sensor Networks (EWSN), pp. 54–68.
  17. J. Bachrach and C. Taylor,Localization in sensor networks. 2005. " in Handbook of Sensor Networks (I. Stojmenovic,ed. ), pp: 1-38.
  18. Loukas Lazos and Radha Poovendran. 2005. "HiRLoc: High-resolution Robust Localization for Wireless Sensor Networks", OMB No. 0704-0188, pp 1-15.
  19. Loukas Lazos and Radha Poovendran. 2005. "SeRLoc: Secure Range-Independent Localization for Wireless Sensor Networks", WiSe'04, Philadelphia, Pennsylvania, ACM Transactions on Sensor Networks, Vol. 1, No. 1, pp. 73–100.
  20. D. J. Torrieri, "Statistical theory of passive location systems. 1984. " IEEE Transactions on Aerospace and Electronic Systems, vol. AES-20, no. 2, pp. 183–198.
  21. M. Gavish and A. J. Weiss. 1992. "Performance analysis of bearing-only target location algorithms," IEEE Transactions on Aerospace and Electronic Systems, vol. 28, no. 3, pp. 817–828.
  22. Y. Hu, A. Perrig, and D. Johnson. 2003. Packet Leashes : A Defense Against Wormhole Attacks in Wireless Ad Hoc Networks, In Proc. of INFOCOM, San Francisco, CA, USA.
  23. S. C? apkun, J. Hubaux. 2005. Secure Positioning of Wireless Devices with Application to Sensor Networks, In Proceedings of the IEEE INFOCOM.
  24. P. Bahl and V. Padmanabhan. 2000. RADAR: An In-Building RF-Based User Location and Tracking System, In Proceedings of the IEEE INFOCOM, Tel-Aviv, Israel, pp. 775–784.
Index Terms

Computer Science
Information Sciences

Keywords

WSN SERLOC HIRLOC

Powered by PhDFocusTM