Efficient Schemes To Wireless Sensor Networks (WSN) For Improving Lifetime

S. Anandamurugan*
Assistant Professor (SLG), Department of Information Technology, Kongu Engineering College, Perundurai, Erode
Periodicity:April - June'2014
DOI : https://doi.org/10.26634/jwcn.3.1.2739

Abstract

The utilization of Wireless Sensor Networks (WSNs) to a full extent is limited by the limited energy constraints of the individual sensor nodes. Large part of the research in WSNs focus on the development of energy efficient routing protocols. Energy usage is the determining factor in the performance of WSNs. Both the methods of data routing and transferring to the base station are very important because the sensor nodes run on battery power and the energy availability for each sensor node is limited. To maximize the lifetime of the sensor node, it is better to share the energy dissipated throughout the sensor network in order to reduce maintenance and enhance the overall system performance. The proposed Cluster based approach is combined with Ladder Diffusion (LD) and Ant Colony Optimization (ACO) to reduce the power consumption and to solve transmission routing problems in wireless sensor networks. The LD algorithm is employed to route paths for data relay and transmission in wireless sensor networks and it reduces power consumption and processing time to build the routing table. Moreover, to ensure the safety and reliability of data transmission, LD-ACO algorithm[5] provides backup routes to avoid wasted power and processing time when rebuilding the routing table in case part of sensor nodes are missing.

Keywords

Cluster Head; Ant colony Optimization; AODV; Ladder Diffusion; Grade value; Ladder Table; Ladder creating Package

How to Cite this Article?

Anandamurugan, S. (2014). Efficient Schemes to Wireless Sensor Networks (WSN) for improving Lifetime. i-manager’s Journal on Wireless Communication Networks, 3(1), 22-28. https://doi.org/10.26634/jwcn.3.1.2739

References

[1]. M. Hussaini, H. Bello-Salau, A. F. Salami (2012). “Enhanced Clustering Routing Protocol for Power-Efficient Gathering in Wireless Sensor Network”, International Journal of Communication Networks and Information Security, Vol. 4, No. 1,
[2]. Jiguo Yu, Yingying Qi, Guanghui Wang, XinGu, (2012). “A cluster-based routing protocol for wireless sensor networks with nonuniform node distribution”, Information Sciences, Vol.66, pp. 54-61,
[3]. E.M. Royer, C.-K. Toh, (1999). “A review of current routing protocols for ad-hoc mobile networks”, IEEE Personal Communications, Vol.6, pp. 46–55,
[4]. M. Dorigo, L.M. Gambardella, (1997). “Ant colony system: a cooperative learning approach to the traveling salesman problem”, IEEE Computational Intelligence Society, Vol.1, pp. 53–66,
[5]. M. Dorigo, V. Maniezzo, A. Colorni, (2008). “The ant system: optimization by a colony of cooperating agents”, IEEE Systems, Man, and Cybernetics Society, Vol.26, pp. 29–41,
[6]. Rajiv Misra, ChittaranjanMandal, (2006). “Antaggregation: ant colony algorithm for optimal data aggregation in wireless sensor networks”, IFIP International Conference on Wireless and Optical Communications Networks, pp.56-71,
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.