Maximizing the System Lifetime in Wireless Sensor Networks using Improved Routing Algorithm

In wireless sensor networks, the maximum lifetime routing problem has received increasing attention among researchers. There are several critical features that need to be considered while designing a wireless sensor networks such as cost, network lifetime and Quality of service. Due to the limitation on the energy of sensor nodes, energy efficient routing is a very important issue in sensor networks. Therefore, to prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. One solution is to formulate the routing problem as a linear programming problem by maximizing the time at which the first node runs out of battery. In this paper, with the notion of maximizing the system lifetime, we implemented a new heuristic and evaluated the performance of it with the existing algorithm called flow augmentation algorithm. Further, our experimental results demonstrate that the proposed algorithm significantly outperform FA algorithm, in terms of system lifetime

Novel Energy Aware Hierarchical Round Robin Schedule Cluster-Based (NEAHRC) Routing Protocol

Wireless sensor networks (WSNs) are developing as vital and prevalent ways of providing persistent computing environments for various applications. Unstable energy consumption is an essential problem in WSNs, categorised by multi-hop routing and a many-to-one traffic pattern. In an energy-aware routing approach, the protocols focus on minimizing the total energy consumption and maximizing the network lifetime. In this paper, we propose a novel energy aware hierarchical round robin schedule cluster-based (NEAHRC) routing protocol to improve the energy consumption of wireless sensor network and prolong its system lifetime. We also evaluate the proposed algorithm via simulations

PERFORMANCE ANALYSIS OF MULTI-HOP ROUTING PROTOCOLS FOR WSN’S

A wireless sensor network (WSN) is a wireless network consisting of spatially distributed autonomous devices using sensors to monitor physical or environmental conditions. A WSN system incorporates a gateway that provides wireless connectivity back to the wired world and distributed nodes. A key concern in WSN technology is to enhance the network lifetime and to reduce the energy consumption of the sensor network. Many routing protocols available for maximizing the network lifetime. In this paper, we have been propose a gateway based energy efficient routing protocol (GEAR) for Wireless Sensor Networks (WSNs) and also compare the performance of our protocol with LEACH (Low Energy Adaptive Clustering Hierarchy). Performance analysis and compared statistic results show that our proposed protocol perform well in terms of energy consumption and network lifetime

An ant colony optimization approach for maximizing the lifetime of heterogeneous wireless sensor networks

Maximizing the lifetime of wireless sensor networks (WSNs) is a challenging problem. Although some methods exist to address the problem in homogeneous WSNs, research on this problem in heterogeneous WSNs have progressed at a slow pace. Inspired by the promising performance of ant colony optimization (ACO) to solve combinatorial problems, this paper proposes an ACO-based approach that can maximize the lifetime of heterogeneous WSNs. The methodology is based on finding the maximum number of disjoint connected covers that satisfy both sensing coverage and network connectivity. A construction graph is designed with each vertex denoting the assignment of a device in a subset. Based on pheromone and heuristic information, the ants seek an optimal path on the construction graph to maximize the number of connected covers. The pheromone serves as a metaphor for the search experiences in building connected covers. The heuristic information is used to reflect the desirability of device assignments. A local search procedure is designed to further improve the search efficiency. The proposed approach has been applied to a variety of heterogeneous WSNs. The results show that the approach is effective and efficient in finding high-quality solutions for maximizing the lifetime of heterogeneous WSNs

Energy Efficient Design of Wireless Ad Hoc Networks

The concept of wireless is not new. When the packet switching technology, the fabric of the Internet was introduced by the Department of Defense, the ARPANET ,it understood the potential of packet switched radio technology to interconnect mobile nodes .The DARPA around early 70’s helped establish the base of ad hoc wireless networking. This is a technology that enables untethered wireless networking environments where there is no wired or cellular infrastructure. Wireless Ad hoc Networks since then is a fast developing research area with a vast spectrum of applications. Wireless sensor network systems enable the reliable monitoring of a variety of environments for both civil and military applications. The Energy efficiency continues to be a key factor in limiting the deployability of ad-hoc networks. Deploying an energy efficient system exploiting the maximum lifetime of the network has remained a great challenge since years. The time period from the instant at which the network starts functioning to the time instant at which the first network node runs out of energy, i.e. the network lifetime is largely dependent on the system energy efficiency. This thesis looks at energy efficient protocols, which can have significant impact on the lifetime of these networks. The cluster heads get drain out maximum energy in the wireless ad hoc networks. The proposed algorithm deals with minimizing the rate of dissipation of energy of cluster heads. The algorithm LEAD deals with energy efficient round scheduling of cluster head followed by allocation of nodes to the cluster heads maximizing network lifetime using ANDA