scholarly journals Improved continuous enhancement routing solution for energy-aware data aggregation in wireless sensor networks

2018 ◽  
Vol 14 (5) ◽  
pp. 155014771877468 ◽  
Author(s):  
Edson Ticona-Zegarra ◽  
Rafael CS Schouery ◽  
Leandro A Villas ◽  
Flávio K Miyazawa
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Data Aggregation ◽  
Energy State ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Network Nodes ◽  
Battery Energy ◽  
Routing Tree

Wireless sensor networks consist of hundreds or thousands of nodes with limited energy resources, and thus, efficient use of energy is necessary for these networks. Given that transmissions are the most energy-demanding operation, routing algorithms should consider efficient use of transmissions in their designs in order to extend the network lifetime. To tackle these challenges, a centralized algorithm is proposed, called improved continuous enhancement routing (ICER), for computing routing trees of refined quality, based on data aggregation while being aware of the battery energy state. Comparisons between ICER and other known solutions in the literature are performed. Our experiments show that ICER is able to ensure, on average, the survival of 99.6% and the connectivity of 99.3% of the network nodes compared to 90.2% and 72.4% in relation to the best-compared algorithm. The obtained results show that ICER significantly extends the network lifetime while maintaining the quality of the routing tree.

scholarly journals Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
Sohail Jabbar ◽  
Rabia Iram ◽  
Muhammad Imran ◽  
Awais Ahmad ◽  
Anand Paul ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Large Scale ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Route Discovery ◽  
Route Selection ◽  
Energy Aware ◽  
Forwarding Node

Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the routing process through selection of least hop count path with more energy. It consists of three phases, that is, route discovery, forwarding node, and route selection. We have improved the route discovery procedure and mainly concentrate on energy efficient forwarding node and route selection, so that the network lifetime can be prolonged. The four possible cases of forwarding node and route selection are presented. The performance of EASARA is validated through simulation. Simulation results demonstrate the performance supremacy of EASARA over contemporary scheme in terms of various metrics.

Research on Data Aggregation Algorithms Based on OPT in Wireless Sensor Networks

2013 ◽  
Vol 427-429 ◽  
pp. 1991-1994
Author(s):  
Xue Wen He ◽  
Le Ping Zheng ◽  
Kuan Gang Fan ◽  
Sun Han ◽  
Qing Mei Cao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Measurement Accuracy ◽  
Wireless Sensor ◽  
Data Traffic ◽  
Fusion Model ◽  
Design Goal ◽  
Improve Measurement ◽  
Battery Energy

Since wireless sensor networks consist of sensors with limited battery energy, a major design goal is to maximize the lifetime of sensor network. To improve measurement accuracy and prolong network lifetime, reducing data traffic is needed. In the clustering-based wireless sensor networks, a novel data aggregation algorithm based on OPT and Layida Method is proposed. In the proposed method, Layida Method preprocesses data and data fusion model for data integration are used. Its availability is proved by comparing with the results of two existing algorithms.

An Energy Aware Routing Based on Swarm Intelligence for Wireless Sensor Networks

2013 ◽  
Vol 706-708 ◽  
pp. 635-638
Author(s):  
Yong Lv
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Network Lifetime ◽  
Average Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Energy Efficient Routing

Wireless Sensor Networks consisting of nodes with limited power are deployed to collect and distribute useful information from the field to the other sensor nodes. Energy consumption is a key issue in the sensor’s communications since many use battery power, which is limited. In this paper, we describe a novel energy efficient routing approach which combines swarm intelligence, especially the ant colony based meta-heuristic, with a novel variation of reinforcement learning for sensor networks (ARNet). The main goal of our study was to maintain network lifetime at a maximum, while discovering the shortest paths from the source nodes to the sink node using an improved swarm intelligence. ARNet balances the energy consumption of nodes in the network and extends the network lifetime. Simulation results show that compared with the traditional EEABR algorithm can obviously improve adaptability and reduce the average energy consumption effectively.

Energy-Aware Data Aggregation for Grid-Based Wireless Sensor Networks with a Mobile Sink

2007 ◽  
Vol 43 (4) ◽  
pp. 1539-1551 ◽  
Author(s):  
Nen-Chung Wang ◽  
Yung-Fa Huang ◽  
Jong-Shin Chen ◽  
Po-Chi Yeh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Mobile Sink ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Grid Based

A Cluster-Based Routing Tree Construction Algorithm for Wireless Sensor Networks

2011 ◽  
Vol 58-60 ◽  
pp. 2245-2250
Author(s):  
Peng Li ◽  
Yan Jun
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Network Routing ◽  
Wireless Sensor ◽  
Construction Algorithm ◽  
Tree Construction ◽  
Routing Technology ◽  
Cluster Based Routing ◽  
Routing Tree

In the architecture of wireless sensor network, routing technology at the network layer is essential. Since the clustering routing leads in good performance on data aggregation, energy minimization and so on, it has become the focus of the study routing. In this paper, a cluster-based routing tree construction algorithm for Wireless Sensor Networks is proposed. The detail of how to select the intermediate nodes to build the routing gathering tree is also described. The experiments show that the algorithm is effective to extend the network lifetime.

Sign in / Sign up

Export Citation Format

Share Document