Network lifetime maximization for time-sensitive data gathering in wireless sensor networks

Many data‐gathering protocols for wireless sensor networks use clustering technology for prolonging network lifetime. Cluster‐based protocols reduce the total energy consumption via data aggregation and balance energy consumption via clusterhead rotation. However, most existing protocols focus on load balance within each cluster. The energy consumption of the entire network is still unbalanced and this uneven energy dissipation can significantly reduce network lifetime. We propose an even energy dissipation protocol (EEDP) for efficient cluster‐based data gathering in wireless sensor networks. In EEDP, sensor data are forwarded to the base station (BS) via multiple chains of clusterheads. Each chain uses a rotation scheme to balance energy consumption among clusterheads and avoid the formation of a hot spot. We developed efficient algorithms to organize clusterheads into multiple chains, such that the traffic load is evenly distributed among different chains. Analysis and simulation results show that EEDP achieves better load balance than several existing protocols and significantly increases network lifetime. Copyright © 2007 John Wiley & Sons, Ltd.

Wireless networks play a crucial role in the communication systems nowadays. Wireless networks are being increasingly used in the communication among devices of the most varied types and sizes. User mobility, affordability, flexibility and ease of use are few of many reasons for making them very appealing to new applications and more users everyday. A Wireless Sensor Network (WSN) is composed of sensor nodes spread over the field to sense the data. The sensed data must be gathered & transmitted to Base Station (BS) for end user queries. The used sensor nodes being in- expensive having low computation power & limited energy so are not as much reliable as their expensive macro sensor counter parts but their size and cost enable hundred to thousand of micro sensors to achieve high quality fault tolerant system. In an environment where in each round all sensor nodes have to send data to base station; it is required to effectively utilize energy of sensor nodes so as to increase the life- time of the system. The use of data aggregation & fusion as proposed in LEACH increases system lifetime by a factor of 8 as compared to conventional routing protocols. In this work, our main focus is the static sensors are randomly selected and the base stations have their information all a priori. Basically, the sensors are in direct communication range of each other and can transmit to and receive from the base station. The nodes periodically sense the environment and have always data to send in each round of communication. The nodes fuse/ aggregate the data they receive from the others with their own data, and produce only one packet regardless of how many packets they receive. The problem is to find a routing scheme or an efficient protocol to deliver data packets collected from sensor nodes to the base station. It maximizes the lifetime of the sensor network under the system model given above. However, the definition of quality of service of the sensor network provides is not specified. Secondly, where the nodes are densely deployed, the quality of the system is affected as soon as a significant amount of nodes die, since adjacent nodes record identical or related data. In this case, the lifetime of the network is the time elapsed until half of the nodes or some specified portion of the nodes die. In general terms, the time in rounds where the last node depletes all of its energy defines the lifetime of the overall sensor network. Taking these different possible requirements under consideration, our work provides a proper timing of all deaths for all algorithms in detail as well as chooses the shortest possible path for communication with better memory management scheme and leaves the decision which one to choose to system designers.

Prolonged network lifetime, scalability and efficient load balancing are essential for optimal performance of a wireless sensor network. Clustering provides an effective way of extending the lifetime of a sensor network. Clustering is the process that divides sensor networks into smaller localized group (called clusters) of members with a cluster head. Clustering protocols need to elect optimal number of clusters in hierarchically structured wireless sensor networks. Any clustering scheme that elects clusters uniformly (irrespective of the distance from Base Station) incurs excessive energy usage on clusters proximal and distant to Base Station. In single hop networks a gradual increment in the energy depletion rate is observed as the distance from the cluster head increases[17]. This work focuses on the analysis of wasteful energy consumption within a uniform cluster head election model (EPEM) and provides an analytical solution to reduce the overall consumption of energy usage amongst the clusters elected in a wireless sensor network. A circular model of sensor network is considered, where the sensor nodes are deployed around a centrally located Base Station. The sensor network is divided into several concentric rings centred at the Base Station. A model, Unequal Probability Election Model (UEPEM), which elects cluster heads non-uniformly is proposed. The probability of cluster head election depends on the distance from the Base Station. UEPEM reduces the overall energy usage by about 21% over EPEM. The performance of UEPEM improves as the number of rings is increased.

RPL is the routing protocol for low-power and lossy networks and has recently been considered as the standard routing protocol for IPv6 based wireless sensor networks using the IEEE 802.15.4 protocol. RPL is oriented towards supporting multi-point to point communications in which multiple points typically communicate with one sink node that considered the root of the RPL tree. RPL aims to minimize the cost to reach the sink node from any node in the network using an objective function. However, RPL lacks a load balancing mechanism to maximize the lifetime of the battery-powered wireless sensor networks by preventing overloaded nodes from being drained quickly. In this paper, we propose the Minimum Degree RPL (MD-RPL) which builds a minimum degree spanning tree to enable load balancing in RPL. MD-RPL modifies the original tree formed by RPL to decrease its degree. Extensive simulations were carried out to evaluate the proposed scheme using the COOJA simulator. Our MD-RPL results in up to 15.6% improvement in the maximum power consumed which implies an improvement in the lifetime of the network.

Wireless sensor networks (WSNs) abiding a huge quantity of inexpensive, low consumption and intense sensor nodes and sole or additional decline or base stations. Those nodes are tiny in dimension and can carry out numerous significant affairs, as well as event sensing, in order processing, and data communication. Owed to different compensation such as simplicity of consumption, comprehensive transmission range, and identity association, WSNs have been interchanging the conventional networks. The promising and innovative network of wirelessly connected devices, which consist of video, audio streams, scalar sensor data and others, is Wireless Multimedia Sensor Network (WMSN). The multimedia data depends on superiority to overhaul (Qos) parameters, like await, channel utilization, network life time throughput and distortion etc is the main aim to optimized delivery of these networks. In multimedia network each packets are communicated with each other so not on time incoming packets and lots of packets are evenly. In WMSNs challenging task to guarantee resource constrained, high data rate, and soft delay limit beside with energy reduced. In this paper, we provide Survey on comparison of different protocol of Wireless sensor network and wirelesss multimedia sensor network like Greedy Perimeter Stateless Routing for Wireless Networks (GPSR), Real-time and Energy Aware Qos routing protocol (REAR), Temporary ordered routing Algorithm (TORA) and Dynamic source routing (DSR). This different protocols with WMSN are compared in requisites of throughput, end-to-end delay, network life time.

In this paper, we consider a Wireless Sensor Network (WSN) with Wireless Energy Transfer (WET) capability, and we focus on the data gathering in a multi-hop scenario. In fact, we assume that any wireless sensor that needs the help of relays to deliver the packet may transfer energy as a kind of reward or payment. We assume that only few sensors have direct reliable channel to the sink Base Station (BS), i.e. sensors that are close the BS. Hence, other sensors should relay on them to transmit their packets to the BS. We assume that the nodes of the WSN are selfish and aim to maximize their utility function, which mainly accounts for their energy consumption. We propose a multi-level multi-leader-follower Stackelberg game framework to analyse the competition between users. Particularly, we characterise the Stackelberg equilibrium (SE) for the three-hop WSN, and we propose a distributed algorithm to achieve the SE. Moreover, we show that the network lifetime is enhanced compared to other multi-hop data transmission in WSN.

Wireless Sensor Network (WSN) is a promising approach for a variety of applications. Because of limitation of energy resource, memory space and processing capability of sensor nodes, it is very difficult to implement IP-based routing protocols in WSN. Recently, many research focus on developing special routing protocols for WSNs with the main design criteria: energy efficiency, load balance and reliability. The most well known routing protocol class is hierarchical which divides network into many clusters. Each cluster is represented by a cluster head (CH) that is responsible for receiving data from all non-CH members, aggregating these data and sending to the base station (BS). In order to balance energy consumption of the entire network, CHs are not fixed but rotated. Therefore, the hierarchical protocols can decrease and balance the energy consumption and prolong network lifetime. LEACH is one of the first cluster-based for WSN, which includes distributed cluster formation. In this paper, we propose a new hierarchical routing protocol (called EL-LEACH: Energy and Load balance LEACH) which achieves energy efficiency and load balance. Our simulation result shows that our new scheme EL-LEACH achieves better energy consumption, load balance and network life time than other well known LEACH protocols.

Topology is important for any type of networks because it has great impact on the performance of the network. For wireless sensor networks (WSN), regular topologies, which can help to efficiently save energy and achieve long networking lifetime, have been well studied in [1, 4, 5, 7, 9]. However, little work is focused on routing in patterned WSNs except the shortest path routing with the knowledge of global location information. In this paper, we propose a routing protocol based on random walk. It doesn’t require global location information. Moreover, the random walk routing achieves load balancing property inherently for WSNs which is difficult to achieve for other routing protocols. We also prove that the random walk routing consumes the same amount of energy as the shortest path routing in the scenarios where the message required to be sent to the base station is in comparatively small size with the inquiry message among neighboring nodes. Since in many applications of WSNs, sensor nodes often send only beeplike small messages to the base station to report their status, our proposed random walk routing is a viable scheme. Though the random walk routing provides load balancing in the WSN, the nodes near to the base station (BS) are inevitably under heavier burden than the nodes far from the base station. Therefore we further propose a density-aware deployment scheme to guarantee that the heavy-load nodes do not affect the network lifetime even if they are exhausted.

In wireless sensor network, many sensor nodes are distributed in the field. They communicate the sensing data each other and forward it to sink. Routing protocols, which define the delivery methods of sending data, affect to the lifetime of sensor network. This paper proposes RTAF that is a routing-tree construction algorithm of sensor nodes by a single flooding process in wireless sensor network. A routing tree is constructed by selecting a parent node using the forward-direction flooding packet and gathering children nodes using the reverse-direction flooding packet. In this process, a node with much energy becomes the parent node. And the routing tree is periodically reconstructed in order to distribute the loads of parent nodes. The proposed algorithm compared performance with Modified-LEACH using NS2 network simulation tool. The simulation result shows that the proposed algorithm constructs a routing-tree faster and reduced 40-80% in routing-tree construction packet.

Data gathering is a major function of many applications in wireless sensor networks. The most important issue in designing a data gathering algorithm is how to save energy of sensor nodes while meeting the requirements of special applications or users. Wireless sensor networks are characterized by centralized data gathering, multi-hop communication and many to one traffic pattern. These three characteristics can lead to severe packet collision, network congestion and packet loss, and even result in hot-spots of energy consumption thus causing premature death of sensor nodes and entire network. In this paper, we propose a load balance data gathering algorithm that classifies sensor nodes into different layers according to their distance to sink node and furthermore, divides the sense zone into several clusters. Routing trees are established between sensor node and sink depending on the energy metric and communication cost. For saving energy consumption, the target of data aggregation scheme is adopted as well. Analysis and simulation results show that the algorithm we proposed provides more uniform energy consumption among sensor nodes and can prolong the lifetime of sensor networks.

A wireless sensor network (WSN) comprised of a plurality of sensor nodes powered by their internal batteries and one or more base stations. Efficient utilization of the energy resources leads to prolonged network lifetime. In this study, the effects of limiting the total hop count within the network on network lifetime is investigated by using a mixed integer programming (MIP) framework. Our results show that when the hop count of network is limited by minimum hop count, lifetime of network can decrease by %40 of the lifetime obtained without any constraint on hop count. If hop count limit of network is increased by %10, lifetime of network can reach %98 of maximum lifetime obtained without any restrictions on hop count.

Cognitive Radio Sensor Networks (CRSNs) have become an integral portion of the new generation of smart Wireless Sensor Networks (WSNs) technology. Moreover, efficient clustering and routing could enhance the network performance by taking into account the stability and connectivity of the network that expands the network's lifetime. In this paper, we propose a scheme that aims to construct an energy-efficient clustering for CRSNs through saving the intra-communication energy between nodes into the cluster, in addition to the inter-communication energy between Cluster Head (CH) nodes to the Base Station (BS). The scheme utilizes evaluation criteria to define the CH node for each cluster by calculating a weight value for each node, and depending on the maximum weight value for nodes, the CH is picked. Moreover, to establish a route between CHs, we consider common channels between them plus the shortest distance from cluster heads to the sink. In this way, clustering and routing could enhance the network performance and extend the lifetime. To corroborate the proposed scheme, extensive simulations in MATLAB were carried out and the results of the simulation showed the superiority of the proposed technique over other algorithms in terms of the network’s lifetime.

Wireless sensor networks (WSNs) consist of a large number of small, low data rate and inexpensive nodes that communicate in order to sense or control a physical phenomenon. The major difference between the WSN and the traditional wireless network is that sensors are very sensitive to energy consumption. Moreover, the performance of the sensor network applications highly depends on the lifetime of the network and we expect the lifetime of several months to several years. Thus, energy saving is crucial in designing long-lived wireless sensor networks. Many researchers have focused on developing energy efficient cluster based protocols for WSNs, but there has not been much research on event driven WSNs and, their focus is on continuous driven networks. In this paper, we propose a modified algorithm of Low Energy Adaptive Clustering Hierarchy (LEACH) protocol which is a well known energy efficient clustering algorithm for WSNs. Our modified protocol called “Adaptive and Energy Efficient Clustering Algorithm for Event-Driven Application in Wireless Sensor Networks (AEEC)” is aimed at prolonging the lifetime of a sensor network by balancing energy usage of the nodes. AEEC makes the nodes with more residual energy have more chances to be selected as cluster head. Also, we use elector nodes which take the responsibility of collecting energy information of the nearest sensor nodes and selecting the cluster head. We compared the performance of our AEEC algorithm with the LEACH protocol using simulations .

The technological development of Internet of Things (IoT) applications is emerging and attracting the attention of the real world in the automated industry, agriculture, environment, and scientific community. In most scenarios, extending the network lifetime of an IoT network is highly challenging because of constrained nodes. The wireless sensor network (WSN) is the core component of IoT applications. In addition, the WSN nodes are required for the network processes, particularly routing, energy maintenance, load balance, congestion control, packet delivery, quick response, and more. The failure of any of the above network processes will affect the entire network operation. IPv6 Routing Protocol for Low-power and Lossy network (RPL) provides high routing solutions to IoT applications requirements. The load balance, congestion control, traffic load, and bottleneck problems are still open issues in the RPL. To resolve the load balance issue, we propose a weighted sum method objective function (WSM-OF), which provides the ability to select the alternative parent in routing by RPL metrics. WSM-OF adopts congestion control and load balancing to avoid heavy traffic and extend the network's node lifetime. The network parameters of control overhead, jitter, packet delivery ratio, parent switching, energy consumption, latency, and network lifetime are implemented and analyzed through the COOJA simulator. The result shows that the WSM-OF improves the network performance and significantly enhances the network lifetime by up to 7.8%.

Energy efficient collaborative proactive routing protocol for Wireless Sensor Network