CFP last date
22 April 2024
Reseach Article

Analysis of Network Lifetime for Wireless Sensor Network

by Swarup Kumar Mitra, Pradipta Ghosh, Mrinal Kanti Naskar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 32 - Number 1
Year of Publication: 2011
Authors: Swarup Kumar Mitra, Pradipta Ghosh, Mrinal Kanti Naskar
10.5120/3873-5413

Swarup Kumar Mitra, Pradipta Ghosh, Mrinal Kanti Naskar . Analysis of Network Lifetime for Wireless Sensor Network. International Journal of Computer Applications. 32, 1 ( October 2011), 39-45. DOI=10.5120/3873-5413

@article{ 10.5120/3873-5413,
author = { Swarup Kumar Mitra, Pradipta Ghosh, Mrinal Kanti Naskar },
title = { Analysis of Network Lifetime for Wireless Sensor Network },
journal = { International Journal of Computer Applications },
issue_date = { October 2011 },
volume = { 32 },
number = { 1 },
month = { October },
year = { 2011 },
issn = { 0975-8887 },
pages = { 39-45 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume32/number1/3873-5413/ },
doi = { 10.5120/3873-5413 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:18:03.372517+05:30
%A Swarup Kumar Mitra
%A Pradipta Ghosh
%A Mrinal Kanti Naskar
%T Analysis of Network Lifetime for Wireless Sensor Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 32
%N 1
%P 39-45
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Wireless Sensor Network (WSN) consists of motes which are equipped with limited battery and requires energy management for enhanced Network Lifetime. In this paper we have adopted a deployment strategy which is performed over a region of interest (ROI) obtained from contour integration of one hop to other. The selection of motes depending on the type of application is also analyzed. The necessity of proper resource utilization in a sensor network enables us to propose a realistic radio model which considers the sorted power level from discrete radio model. The utility of Network coding is also adapted for enhanced throughput and robustness of the network.

References
  1. Potlie, G., “Wireless Sensor Networks,” in Information Theory Workshop, 1998, June 1998, pp. 139-140.
  2. Pottie, G. and Kaiser, W., “Wireless Integrated Network Sensors,” Communications of the ACM, vol. 43, no. 5, pp. 51-58, May 2000.
  3. Kahn, J. M., Katz, R. H., and Pister, K. S. J., “Mobile Networking for Smart Dust,” in Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom ’99), Aug. 1999.
  4. Bhardwaj, M., Garnett, T., and Chandrakasan, A. P., “Upper bounds on the lifetime of sensor networks,” in Communications, 2001. ICC 2001.IEEE International Conference on, vol. 3, Helsinki, Finland, 2001, pp. 785– 790.
  5. Bhardwaj, M. and Chandrakasan, A. P., “Bounding the lifetime of sensor networks via optimal role assignments,” in INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, vol. 3, 2002, pp. 1587– 1596.
  6. Azad, A. P. and Chockalingam, A., “WLC12-2: Bounds on the lifetime of wireless sensor networks employing multiple data sinks,” in Global Telecommunications Conference, 2006. GLOBECOM ’06. IEEE, San Francisco, CA, USA, Nov. 2006, pp. 1–5.
  7. Blough, D. M. and Santi, P., “Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks,” in MobiCom ’02: Proceedings of the 8th annual international conference on Mobile computing and networking. New York, NY, USA: ACM Press, 2002, pp. 183–192.
  8. Zhang, H. and Hou, J., “On deriving the upper bound of - lifetime for large sensor networks,” in MobiHoc ’04: Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing. New York, NY, USA: ACM Press, 2004, pp. 121–132.
  9. Rai, V. and Mahapatra, R. N., “Lifetime modeling of a sensor network,” in DATE ’05: Proceedings of the conference on Design, Automation and Test in Europe. Washington, DC, USA: IEEE Computer Society, 2005, pp. 202–203.
  10. Kolcihn, V., Sevast’yanov, B., and Chistyakov, V., “Random Allocations,” A. V. Balakrishnan, Ed. Washington D.c.: Winston and Sons, 1978.
Index Terms

Computer Science
Information Sciences

Keywords

Contour Integration Event generation model Packet generation rate Realistic radio model Poisson distribution Network Simulator 2.33