Energy-efficient Cluster-based Routing Research Articles

Improved network survivability using multi-threshold adaptive range clustering (M-TRAC) algorithm for energy balancing in wireless sensor networks

Wireless Sensor Networks WSNs have become one of the most prominent areas of research in the field of modern communication systems. But unlike IP based routing, WSNs focus on data centric communication. Thus routing is one of the important issues to be considered for a WSN. As sensor networks are generally deployed in hostile environments, batteries cannot be recharged often. Thus energy conservation is one of the important design parameters for WSNs. Many energy aware routing protocols were proposed in the literature. Cluster based algorithms were proved to be better compared to multi-hop routing. In this paper an attempt is made in proposing a novel cluster based energy efficient routing algorithm for WSNs namely the Multi-Threshold Adaptive Range Clustering M-TRAC algorithm, which incorporates centralized network management with variable thresholds in order to assure a uniform load distribution amongst nodes, thus improving the network lifetime.

Optimizing the operating time of wireless sensor network

A difficult constraint in the design of wireless sensor networks (WSNs) is the limited energy resource of the batteries of the sensors. This limited resource restricts the operating time that WSNs can function in their applications. Routing protocols play a major part in the energy efficiency of WSNs because data communication dissipates most of the energy resource of the networks. There are many energy-efficient cluster-based routing protocols to deliver data from sensors to a base station. All of these cluster-based algorithms are heuristic. The significant benefit of heuristic algorithms is that they are usually very simple and can be utilized for the optimization of large sensor networks. However, heuristic algorithms do not guarantee optimal solutions. This article presents an analytical model to achieve the optimal solutions for the cluster-based routing protocols in WSNs.

Quantifiable Analysis of Energy Efficient Clustering Heuristic

One of the important aspects of MANET is the restraint of quantity of available energy in the network nodes that is the most critical factor in the operation of these networks. The tremendous amount of energy using the mobile nodes in wireless communication medium makes Energy Efficiency a fundamental requirement for mobile ad hoc networks. The cluster-based routing protocols are investigated in several research studies which encourage more well-organized usage of resources in controlling large dynamic networks. Clustering can be done for different purposes, such as, routing efficiency, transmission management, backbone management etc. Less flooding, distributed operation, locally repairing of broken routes and shorter sub-optimal routes are the main features of the Clustering protocol. In this paper, we present quantifiable analysis of energy efficient cluster-based routing protocol for uninterrupted stream queries.

An Optimized Energy-aware Routing Protocol for Wireless Sensor Network

Because sensor nodes typically are battery-powered and in most cases it may not be possible to change or recharge batteries, the key challenge in Wireless Sensor Networks (WSNs) design is the energy-efficiency and how to deal with the trade-off between it and the QoS parameters required by some applications. This paper studies the QoS of an energy-efficient cluster-based routing protocol called Energy-Aware routing Protocol (EAP) in terms of lifetime, delay, loss percentage, and throughput, and proposes some modifications on it to enhance its performance. The modified protocol offers better characteristics in terms of packets loss, delay, and throughput, but slightly affects lifetime negatively. Simulation results showed that the modified protocol significantly outperforms EAP in terms of packet loss percentage by on average 93.4%.

Energy Evaluation of Sensor Protocol based on AI Techniques using CRAWDAD Data

Wireless sensor networks (WSNs) are one of popular communication networks that have garnered most prominent research attention due to their flexibility to sense physical environment parameters and converts into signal form. Battery power is limitation of WSN i.e. network will alive till battery is available. The network lifetime of WSN can be improved by use of energy-efficient cluster-based routing algorithms. In this paper, a key idea is attempting to improvise the LEACH protocol with the help of various clustering techniques and develop improved protocol such as LEACH-K, LEACH-FUZZYC, and LEACH-SOM. Simulation results show that LEACH-FUZZYC outperforms as compare to LEACH, LEACH-K and LEACH-SOM.

An application-specific protocol architecture for wireless microsensor networks

Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.