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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Maximum Coverage in WSN using Optimal Deployment Technique

Published on None 2011 by Prabhudutta Mohanty, Priyaranjan Mohapatra
journal_cover_thumbnail

2nd National Conference on Computing, Communication and Sensor Network
Foundation of Computer Science USA
CCSN - Number 4
None 2011
Authors: Prabhudutta Mohanty, Priyaranjan Mohapatra
c3720b92-72d3-4d75-ad7c-c77d710c4ef6

Prabhudutta Mohanty, Priyaranjan Mohapatra . Maximum Coverage in WSN using Optimal Deployment Technique. 2nd National Conference on Computing, Communication and Sensor Network. CCSN, 4 (None 2011), 39-45.

@article{
author = { Prabhudutta Mohanty, Priyaranjan Mohapatra },
title = { Maximum Coverage in WSN using Optimal Deployment Technique },
journal = { 2nd National Conference on Computing, Communication and Sensor Network },
issue_date = { None 2011 },
volume = { CCSN },
number = { 4 },
month = { None },
year = { 2011 },
issn = 0975-8887,
pages = { 39-45 },
numpages = 7,
url = { /specialissues/ccsn/number4/4360-ccsn032/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Special Issue Article
%1 2nd National Conference on Computing, Communication and Sensor Network
%A Prabhudutta Mohanty
%A Priyaranjan Mohapatra
%T Maximum Coverage in WSN using Optimal Deployment Technique
%J 2nd National Conference on Computing, Communication and Sensor Network
%@ 0975-8887
%V CCSN
%N 4
%P 39-45
%D 2011
%I International Journal of Computer Applications
Abstract

Present sensors are inbuilt with sensing capabilities, battery, mobilization and storage capability, for better monitoring of targets and storage of information regarding targets. The sensors can be static or dynamic, depending upon their application. Since the dynamic sensors are costlier, hence are used for supreme purpose. Here we suggest an algorithm for distributed sensor network consisting of homogeneous static nodes. The nodes are deployed as per the graphical illustration regarding the area. This approach is carried out to solve the hole problem and to perform efficient monitoring with minimum number of nodes. Here nodes are deployed statically, one by one, sensing each target in a given field, and thus completing the entire field. This algorithm produces cover set, consisting of sensor nodes, which would monitor the field consisting of targets, completely. A number of cover sets can be generated using the same technique to improve the life period.

References
  1. Chee-Yee Chong, Srikant P. Kumar, “Sensor networks: evolution, opportunity and challenges. “
  2. Dimitrios Zorbas, Dimitris Glynos, Panayiotis Kotzanikolaou ,Christos Douligeris,” Solving coverage problems in wireless sensor network using cover sets”.
  3. I.F.Akyildiz, W.Su, Y. Sankarasubramaniam and E.Cayirci, “Wireless Sensor network: A Survey.”,Presented by Yuyan Xue 11-30-2005.
  4. “Information and Automation for Sustainability” , 2007.ICIAFS 2007. Third International conference on 4-6 Dec 2007 ,76-81.
  5. J.Yick, B. Mukherjee and D.Ghosal,” Wireless sensor Network survey”,The International Journal of Computer and Telecommunication networking 2008.
  6. M. Cardi, D.-Z. Du,” Improving wireless sensor lifetime through power aware Organization”, ACM Wireless Networks 11(3) (2005) 333-340.
  7. S. Slijepcevic, M. Potkonjak, “power efficient organization of Wireless ad hoc sensor networks”, in: Proceedings of International Conference on communications (ICC’01), IEEE, 2001, pp. 472-476.
  8. M. Cardei, J. Wu,” Energy efficient coverage problems in wireless ad-hoc sensor networks”, Computer communications 29(4)(2006)413-420.
  9. M. Cardie, D. MacCallum, M.X. Cheng. M. Min, X.Jia, D. Li,D._z Du,” Wireless sensor networks with energy efficient organization”, Jouranal of International Networks 3(3-4)(2002)213-229.
  10. Z. Abrams, A. Goel, S. Plotkin,” Set k-cover algorithms for energy efficient monitoring in Wireless Sensor Network”, in: Proceedings of Third International Symposium on Informaton Processing in Sensor Networks. ACM. 2004 pp.424-432.
  11. Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, Erdal Cayirci,” A Survey on Sensor Networks”,IEEE2002 , August,163-6804/02.
  12. J. N. Al-Karaki, A. E. Kamal, “Routing Techniques In Wireless Sensor Networks: A Survey”, IEEE Wireless Communications, December 2004.
  13. K. Romer, F. Mattern, E. Zurich “The Design Space of Wireless Sensor Networks” IEEE Wireless Communications, December 2004.
  14. Feras Batarseh, Survey: Barrier Coverage with Wireless Sensor Networks. EEL 6788.
Index Terms

Computer Science
Information Sciences

Keywords

Coverage node deployment cover sets target sensing