Survey: Wireless Sensor Network

Prasant Kumar Pattnaik; Raghvendra Kumar; Priyanka Pandey

doi:doi:10.11648/j.ijdst.20160202.13

| Peer-Reviewed

Survey: Wireless Sensor Network

Prasant Kumar Pattnaik, Raghvendra Kumar, Priyanka Pandey

Published in International Journal on Data Science and Technology (Volume 2, Issue 2)

Received: 7 January 2016 Accepted: 19 February 2016 Published: 19 February 2016

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

Target Coverage deals with the coverage of a specific set of targets by a set of sensor nodes. In this paper we address the target coverage problem, with the objective of maximizing the network life time and minimizing the energy consumption by a set of sensor nodes of a power constrained wireless sensor network deployed for monitoring of a set of targets with known locations. Here we consider that a large number of sensor nodes are dispersed randomly in close proximity of a set of objectives and send the sensed information to a central processing node. The sensor network life time is defined as the time interval each target is covered by at least one sensor node. A target can be covered by a sensor node if the Euclidean distance between the target and the sensor node is less than or equal to its sensor node’s sensing range.

Published in	International Journal on Data Science and Technology (Volume 2, Issue 2)
DOI	10.11648/j.ijdst.20160202.13
Page(s)	31-35
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2016. Published by Science Publishing Group

Keywords

WSN, Characteristics of WSN, Applications of WSN, Coverage Problem of WSN

References

[1]	M. Cardei, M. T. Thai, Yingshu Li and Weili Wu, "Energy-Efficient Target Coverage in Wireless Sensor Networks," 24^th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM2005), Pp: 1976-1984, vol. 3, 13-17 March 2005.
[2]	M. Cardei and J. Wu, “Energy-Efficient Coverage Problems in Wireless Ad-hoc Sensor Networks”, Computer Communications Journal (Elsevier), Vol. 29, No. 4, pp: 413-420, Feb. 2006.
[3]	Zongheng Zhou, Samir R. Das, Himanshu Gupta. “Connected K-Coverage Problem in Sensor Networks”, Proceedings of the International Conference on Computer Communications and Networks (ICCCN2004), October 11-13, 2004, Chicago, IL, USA 2004, pp-373-378.
[4]	J. Carle and D. Simplot, “Energy Efficient Area Monitoring by Sensor Networks”, IEEE Computer, Vol 37, No 2 (2004), pp 40-46.
[5]	S. Slijepcevic, M. Potkonjak, "Power efficient organization of wireless sensor networks", IEEE International Conference on Communications, vol. 2, pp 472-476, Helsinki, Finland, June 2001.
[6]	K. Kar and S. Banerjee, “Node Placement for Connected Coverage in Sensor Networks”, Proc. Of Wi Opt 2003: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (2003).
[7]	Yu Gu, Jie Li, Baohua Zhao, and Yusheng Ji, "Target Coverage Problem in Wireless Sensor Networks: A Column Generation Based Approach," in Proceedings of 6^th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (2009).
[8]	I.F. Akyildiz, W. Su, Y. Sankara subramaniam and E.Cayirci, “A Survey on Sensor Networks”, IEEE Communications Magazine, (Aug.2002), pp 102-114.
[9]	S. k. Padi and P. K. Pattnaik, “A Novel Distributed Protocol For Randomly Deployed Clustered Based Wireless Sensor Network”, Journal of Theoretical and Applied Information Technology, Vol 15. No. 1, 2010.
[10]	X.-Y. Li, P.-J. Wan and O. Frieder, “Coverage in Wireless Ad-hoc Sensor Networks”, IEEE Transactions on Computers, Vol 52(2002), pp 753-763.

Cite This Article

Plain Text BibTeX RIS

APA Style

Prasant Kumar Pattnaik, Raghvendra Kumar, Priyanka Pandey. (2016). Survey: Wireless Sensor Network. International Journal on Data Science and Technology, 2(2), 31-35. https://doi.org/10.11648/j.ijdst.20160202.13

Copy | Download

ACS Style

Prasant Kumar Pattnaik; Raghvendra Kumar; Priyanka Pandey. Survey: Wireless Sensor Network. Int. J. Data Sci. Technol. 2016, 2(2), 31-35. doi: 10.11648/j.ijdst.20160202.13

Copy | Download

AMA Style

Prasant Kumar Pattnaik, Raghvendra Kumar, Priyanka Pandey. Survey: Wireless Sensor Network. Int J Data Sci Technol. 2016;2(2):31-35. doi: 10.11648/j.ijdst.20160202.13

Copy | Download

@article{10.11648/j.ijdst.20160202.13,
  author = {Prasant Kumar Pattnaik and Raghvendra Kumar and Priyanka Pandey},
  title = {Survey: Wireless Sensor Network},
  journal = {International Journal on Data Science and Technology},
  volume = {2},
  number = {2},
  pages = {31-35},
  doi = {10.11648/j.ijdst.20160202.13},
  url = {https://doi.org/10.11648/j.ijdst.20160202.13},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ijdst.20160202.13},
  abstract = {Target Coverage deals with the coverage of a specific set of targets by a set of sensor nodes. In this paper we address the target coverage problem, with the objective of maximizing the network life time and minimizing the energy consumption by a set of sensor nodes of a power constrained wireless sensor network deployed for monitoring of a set of targets with known locations. Here we consider that a large number of sensor nodes are dispersed randomly in close proximity of a set of objectives and send the sensed information to a central processing node. The sensor network life time is defined as the time interval each target is covered by at least one sensor node. A target can be covered by a sensor node if the Euclidean distance between the target and the sensor node is less than or equal to its sensor node’s sensing range.},
 year = {2016}
}

Copy | Download

TY  - JOUR
T1  - Survey: Wireless Sensor Network
AU  - Prasant Kumar Pattnaik
AU  - Raghvendra Kumar
AU  - Priyanka Pandey
Y1  - 2016/02/19
PY  - 2016
N1  - https://doi.org/10.11648/j.ijdst.20160202.13
DO  - 10.11648/j.ijdst.20160202.13
T2  - International Journal on Data Science and Technology
JF  - International Journal on Data Science and Technology
JO  - International Journal on Data Science and Technology
SP  - 31
EP  - 35
PB  - Science Publishing Group
SN  - 2472-2235
UR  - https://doi.org/10.11648/j.ijdst.20160202.13
AB  - Target Coverage deals with the coverage of a specific set of targets by a set of sensor nodes. In this paper we address the target coverage problem, with the objective of maximizing the network life time and minimizing the energy consumption by a set of sensor nodes of a power constrained wireless sensor network deployed for monitoring of a set of targets with known locations. Here we consider that a large number of sensor nodes are dispersed randomly in close proximity of a set of objectives and send the sensed information to a central processing node. The sensor network life time is defined as the time interval each target is covered by at least one sensor node. A target can be covered by a sensor node if the Euclidean distance between the target and the sensor node is less than or equal to its sensor node’s sensing range.
VL  - 2
IS  - 2
ER  -

Copy | Download

Author Information

Prasant Kumar Pattnaik

School of Computer Engineering, Kalinga Institute of Industrial Technology University, Bhubaneswar, Odisha, India
Raghvendra Kumar

Department of Computer Science and Engineering, Lakshmi Narain College of Technology, Jabalpur, M.P., India
Priyanka Pandey

Department of Computer Science and Engineering, Takshshila Institute of Engineering and Technology, Jabalpur, M.P., India

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Prasant Kumar Pattnaik, Raghvendra Kumar, Priyanka Pandey. (2016). Survey: Wireless Sensor Network. International Journal on Data Science and Technology, 2(2), 31-35. https://doi.org/10.11648/j.ijdst.20160202.13

Copy | Download

ACS Style

Prasant Kumar Pattnaik; Raghvendra Kumar; Priyanka Pandey. Survey: Wireless Sensor Network. Int. J. Data Sci. Technol. 2016, 2(2), 31-35. doi: 10.11648/j.ijdst.20160202.13

Copy | Download

AMA Style

Prasant Kumar Pattnaik, Raghvendra Kumar, Priyanka Pandey. Survey: Wireless Sensor Network. Int J Data Sci Technol. 2016;2(2):31-35. doi: 10.11648/j.ijdst.20160202.13

Copy | Download

@article{10.11648/j.ijdst.20160202.13,
  author = {Prasant Kumar Pattnaik and Raghvendra Kumar and Priyanka Pandey},
  title = {Survey: Wireless Sensor Network},
  journal = {International Journal on Data Science and Technology},
  volume = {2},
  number = {2},
  pages = {31-35},
  doi = {10.11648/j.ijdst.20160202.13},
  url = {https://doi.org/10.11648/j.ijdst.20160202.13},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ijdst.20160202.13},
  abstract = {Target Coverage deals with the coverage of a specific set of targets by a set of sensor nodes. In this paper we address the target coverage problem, with the objective of maximizing the network life time and minimizing the energy consumption by a set of sensor nodes of a power constrained wireless sensor network deployed for monitoring of a set of targets with known locations. Here we consider that a large number of sensor nodes are dispersed randomly in close proximity of a set of objectives and send the sensed information to a central processing node. The sensor network life time is defined as the time interval each target is covered by at least one sensor node. A target can be covered by a sensor node if the Euclidean distance between the target and the sensor node is less than or equal to its sensor node’s sensing range.},
 year = {2016}
}

Copy | Download

TY  - JOUR
T1  - Survey: Wireless Sensor Network
AU  - Prasant Kumar Pattnaik
AU  - Raghvendra Kumar
AU  - Priyanka Pandey
Y1  - 2016/02/19
PY  - 2016
N1  - https://doi.org/10.11648/j.ijdst.20160202.13
DO  - 10.11648/j.ijdst.20160202.13
T2  - International Journal on Data Science and Technology
JF  - International Journal on Data Science and Technology
JO  - International Journal on Data Science and Technology
SP  - 31
EP  - 35
PB  - Science Publishing Group
SN  - 2472-2235
UR  - https://doi.org/10.11648/j.ijdst.20160202.13
AB  - Target Coverage deals with the coverage of a specific set of targets by a set of sensor nodes. In this paper we address the target coverage problem, with the objective of maximizing the network life time and minimizing the energy consumption by a set of sensor nodes of a power constrained wireless sensor network deployed for monitoring of a set of targets with known locations. Here we consider that a large number of sensor nodes are dispersed randomly in close proximity of a set of objectives and send the sensed information to a central processing node. The sensor network life time is defined as the time interval each target is covered by at least one sensor node. A target can be covered by a sensor node if the Euclidean distance between the target and the sensor node is less than or equal to its sensor node’s sensing range.
VL  - 2
IS  - 2
ER  -

Copy | Download