Enhancing the Life Time of a Wireless Sensor Network by Ranking and Recovering the Fault Nodes

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)
© 2014 by IJETT Journal
Volume-15 Number-8
Year of Publication : 2014
Authors : Reghunath E V , Pankaj Kumar , Ashok Babu
  10.14445/22315381/IJETT-V15P278

Citation 

Reghunath E V , Pankaj Kumar , Ashok Babu. "Enhancing the Life Time of a Wireless Sensor Network by Ranking and Recovering the Fault Nodes ", International Journal of Engineering Trends and Technology (IJETT), V15(8),410-413 Sep 2014. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group

Abstract

Wireless sensor networks consist of set of specially designed electronic devices called nodes. Each sensor node has an ability of collecting information from the environment it is used for. It will collect environmental conditions such as temperature, sound, pressure, vibration, motion from different locations. The performance of the wireless sensor network may vary due to certain situations like the breaking of the data routing path, data loss during transmission, reducing the battery power of nodes during data transmission. The sensor node will consume more battery power at the time of data transmission as well as reception. Hence the battery power will decrease to a limit, means the node becomes fault or unusable. It should be replaced. Here we are proposing a new method for finding the least number of fault nodes for replacement.

References

[1] Hong-Chi Shih, Jiun-Huei Ho, Bin-Yih Liao and Jeng –Shyang Pan, “Fault Node Recovery Algorithm for a wireless sensor network.” IEEE Sensors Journal, Vol-13, No. 7, July2013
[2] J. H. Ho, H. C. Shih, B. Y. Liao and S. C. Chu,” A Ladder Diffusion Algorithm Using Ant Colony Optimization for Wireless Sensor Networks”, Information Sciences, (2011)
[3] Z. He, B. S. Lee, and X. S. Wang, “Aggregation in sensor networks With a user-provided quality of service goal,” Inf. Sci., vol. 178, no.9, PP. 2128 – 2149, 2008.
[4] T. P. Hong and C. H. Wu, “An improved weighted clustering algorithm For determination of application nodes in heterogeneous sensor Networks” J. Inf. Hiding Multimedia Signal Process, vol. 2, no. 2, pp. 173-184, 2011
[5] C Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann and F. Silva, “Directed diffusion for wireless sensor networking,” IEEE/ ACM Trans. Netw., vol. 11, no. 1, pp. 2–16, Feb. 2003
[6] E. M. Royer and C. K. Toh, “A review of current routing protocols for Ad -hoc mobile networks,” IEEE Personal Commun.., vol. 6, no. 2, pp. 46–55, Apr. 1999.
[7] M.Gen and R. Cheng, Genetic Algorithms and Engineering Design. New York, NY, USA: Wiley, 1997

Keywords
Grade Diffusion Algorithm, Direct Diffusion Algorithm, Genetic Algorithm, Fault Node Recovery Algorithm