Energy optimization for chain-based data gathering in wireless sensor networks (original) (raw)
Related papers
International Journal of Engineering Research and Technology (IJERT), 2012
https://www.ijert.org/energy-efficiency-in-chain-based-hierarchical-data-gathering-protocol-for-wireless-sensor-networks https://www.ijert.org/research/energy-efficiency-in-chain-based-hierarchical-data-gathering-protocol-for-wireless-sensor-networks-IJERTV1IS10232.pdf Wireless sensor network nodes are very tiny in size and their cost is also not very high. They are deployed in any geographical region in a random fashion. During the process of data sensing, data gathering and data transmission, the charge of the power unit associated with any node gets low, after certain time, i.e., each node has its life time. The life time of nodes directly affect the life time of the sensor network. Therefore, it is very important to conserve the power of the nodes so that the life time of the entire network can be conserved. Hence the requirement of a power efficient data gathering protocol is very important to serve the purpose in wireless sensor network. In the proposed work, it is being tried to change the idea relating to the data gathering and transmission of the existing model, as, chain leaders belonging to certain covering angle will only transmit the gathered data to the another chain leader of the same covering angle. This research can provide better efficiency, resource consumption and longer network lifetime.
Post-Deployment Energy-Efficient Schemes in Wireless Sensor Networks
Advances in Wireless Technologies and Telecommunication, 2019
Once wireless sensor networks are deployed, they are expected to work autonomously for a long time. However, the limited energy of sensor nodes is the main constraint in achieving it. Therefore, to increase the overall lifetime of sensor networks, the sensors must use their limited energy source in an energy-efficient manner. In wireless sensor networks, logical topologies play a significant role in ensuring various constraints such as effective use of limited resources, bandwidth utilization, latency, and quality of communication. In this chapter, the authors discuss three famous energy-efficient topologies of sensor networks that minimize the overall energy consumption during the communication process. These topologies are cluster, chain, and tree-based. The authors highlight the design issues of each topology and discuss the benefits of each topology over other topology. The focus of the chapter will be more on cluster-based rather than chain and tree as it is widely used compare...
A Chain-Based Routing Protocol to Maximize the Lifetime of Wireless Sensor Networks
Wireless Sensor Network, 2013
Energy conservation is a key issue in the design of systems based on wireless sensor networks. Clustering routing protocols have been developed in order to reduce the network traffic toward the sink and therefore prolong the network lifetime. An alternative of clustering is to build chains instead of clusters. In this context, we propose a routing protocol for Wireless Sensor Networks (WSN). It is based on constructing multiple chains in the direction of the sink. The first node of each chain sends data to the closest node in the same chain. This latter collects, aggregates and transmits data to the next closest node. This process repeats until reaching the last node, which aggregates and transmits data directly to the sink. An improvement of this approach is proposed. It works as follows: In addition to forming multiple chains as previously, it constructs a main chain, which includes leader node of each chain. Since, initially all main chain nodes have the same amount of power, the nearest node to the sink aggregates data from others then transmits it to the sink. In the next transmission, main chain node having the higher residual energy performs this task. Compared with the first approach, simulation results show that improvement approach consumes less energy and effectively extends the network lifetime.
Energy Saving in Wireless Sensor Networks
International Journal of Computer Science & Engineering Survey, 2012
A wireless sensor network (WSN) consists of a large number of sensor nodes which are deployed over an area to perform local computations based on information gathered from the surroundings. Each node in the network is equipped with a battery, but it is almost very difficult to change or recharge batteries; therefore, the crucial question is: "how to prolong the network lifetime to such a long time?" Hence, maximizing the lifetime of the network through minimizing the energy is an important challenge in WSN; sensors cannot be easily replaced or recharged due to their ad-hoc deployment in hazardous environment. Considering that energy saving acts as one of the hottest topics in wireless sensor networks, we will survey the main techniques used for energy conservation in sensor networks. The main focus of this article is primarily on duty cycling schemes which represent the most compatible technique for energy saving and we also focus on the data-driven approaches that can be used to improve the energy efficiency. Finally, we will make a review on some communication protocols proposed for sensor networks.
Enhance Energy Utilization in WSN by using Chain Based Protocol
Implementation and analysis of Existing chain based protocol in Matlab Environment. An improvement to the chain based protocol decision making parameter to select the next node in chain. Nodes in Wireless Sensor Network (WSN) are energy-constrained and have limited bandwidth. PEGASIS (Power-Efficient Gathering in Sensor Information Systems) presented is an excellent solution on energy efficiency where each node communicates only with a close neighbor and takes turns transmitting to the BS(Base Station). In this dissertation “An (IEECB) Improved Chain Based Protocol to Enhance Energy Utilization in WSN” that is an improvement over existing PEGASIS. IEECB uses distances between nodes and the BS and remaining energy levels of nodes to decide which node will be the leader that takes charge of transmitting data to the BS. Also, IEECB adopts distance threshold to avoid formation of LL (Long Link) on the chain. Simulated results show that IEECB outperforms existing PEGASIS in the lifetime of WSN. The proposed PEGASIS is used for eliminating the overhead of dynamic cluster formation, minimizing the distance non leader-nodes must transmit, limiting the number of transmissions and receives among all nodes, and using only one transmission to the BS per round.
In this paper, we present two new chain formation techniques: Multi-chain Energy-efficient routing (ME) and Cost Optimization with Multi-chaining for Energy efficient communication (COME) for Wireless Sensor Networks (WSNs)supported by linear programming based mathematical models for network representation and energy consumption. ME protocol divides network area into subareas of equal size, which contain equal number of randomly deployed nodes. Furthermore, minimum distance based next hop for data transmission is used and the sojourn locations are adjusted in a way that, at a time when data reaches to the last node of the chain (terminator node), BS moves to the possible nearest location of that node (sojourn location). ME protocol uses a shorter route for communication because of its multi-chain approach. COME protocol closely inspects the energy costs and selects route with minimum energy cost. We calculated dropped packets in each protocol. Furthermore, confidence interval calculation estimates the possible error bars within which results may vary. Simulations show; (i) improved results for our proposed protocols as compared to PEGASIS in terms of the stability period, network lifetime, dropped packets and throughput, and (ii) moderate decay for PEGASIS protocol, sharp and flat decays incase of the proposed ME and COME protocols, respectively, whenever these protocols are subjected up to 2 fold increase in network area as well as the number of nodes. Each node follows the same procedure for next hop discovery till information reaches BS. Each round results in the formation of a single chain within a sub region. Our proposed COME protocol is range based multichain approach with BS mobility at sojourn locations. Hence, division of network area into multi-regions is according to ME protocol. As, hops minimization in the communication process is a key feature of this protocol that is why discovery of next hop is based on communication range of a node. As a result, energy cost is minimized which it reflects in simulation results.
Improved Enhanced Chain Based Energy Efficient Wireless Sensor Network
Wireless Sensor Network, 2013
In this paper, we have proposed an energy efficient chain based protocol which is an improvement over ECBSN (Energy Efficient Chain Based Sensor Network). ECBSN protocol has certain deficiencies like the non optimal selection of leader nodes in rounds, aggregation and transmission of data by head nodes that leads to unbalanced energy consumption. Aiming at these problems, an improved chain based protocol is proposed. IECBSN adopts a new method of selection of leader nodes based on selection value (SV) parameter .To lower energy consumption further, one more level of hierarchy has been added with a head leader node, which will aggregate data from the leader nodes and pass it to the base station. IECBSN shows an improvement of 20%-35% as compare to PEGASIS (Power Efficient Gathering in Sensor Information System) and 5% t to 7% from ECBSN on energy consumption and improves network lifetime.
In this paper, we present two new chain formation techniques: Multi-chain Energy-efficient routing (ME) and Cost Optimization with Multi-chaining for Energy efficient communication (COME) for Wireless Sensor Networks (WSNs)supported by linear programming based mathematical models for network representation and energy consumption. ME protocol divides network area into subareas of equal size, which contain equal number of randomly deployed nodes. Furthermore, minimum distance based next hop for data transmission is used and the sojourn locations are adjusted in a way that, at a time when data reaches to the last node of the chain (terminator node), BS moves to the possible nearest location of that node (sojourn location). ME protocol uses a shorter route for communication because of its multi-chain approach. COME protocol closely inspects the energy costs and selects route with minimum energy cost. We calculated dropped packets in each protocol. Furthermore, confidence interval calculation estimates the possible error bars within which results may vary. Simulations show; (i) improved results for our proposed protocols as compared to PEGASIS in terms of the stability period, network lifetime, dropped packets and throughput, and (ii) moderate decay for PEGASIS protocol, sharp and flat decays incase of the proposed ME and COME protocols, respectively, whenever these protocols are subjected up to 2 fold increase in network area as well as the number of nodes. Each node follows the same procedure for next hop discovery till information reaches BS. Each round results in the formation of a single chain within a sub region. Our proposed COME protocol is range based multichain approach with BS mobility at sojourn locations. Hence, division of network area into multi-regions is according to ME protocol. As, hops minimization in the communication process is a key feature of this protocol that is why discovery of next hop is based on communication range of a node. As a result, energy cost is minimized which it reflects in simulation results.
Reducing The Energy Consumed During Multihop Transmissions in Wireless Sensor Networks
International Conference on Sensor Technologies and Applications, 2020
Reducing energy consumption in Wireless Sensor Networks (WSN) is important in order to lengthen the network lifetime and reduce maintenance cost. Although its substantial contribution, the energy consumed to overhear is often omitted in energy calculations. However, here it is included to model the tradeoff between the expected number of transmissions, transmission range, number of hops, and overhearing, to discover the optimal distance between the nodes along the routing path. Our calculations show that to reduce energy consumption, the node should choose their successors close enough to prevent the expected number of transmissions from exceeding 1.4. The access protocol is Low Power Listening (LPL), and we also present a solution to reduce the energy consumption of the nodes that are crucial for maintaining an operational network, i.e., the nodes whose successor is the sink.