scholarly journals Equal Area Partition-Based Energy Efficient Routing Algorithm for Circular WSN

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Hu Liqin ◽  
Wang Sanyou ◽  
Ma Fujun ◽  
Zhang Shubo
Keyword(s):  
Energy Efficient ◽  
Data Transfer ◽  
Routing Algorithm ◽  
Energy Utilization ◽  
Energy Efficient Routing ◽  
Equal Area ◽  
Route Maintenance ◽  
Core Technology ◽  
Network Transmission ◽  
The Brain

Wireless sensor network (WSN) is communicating method with each other without the assistance of communication cable. The circular environment is an important application scenario in WSN. As a core technology, routing algorithm is the brain of WSN monitoring system. In this paper, we propose a new routing algorithm named Equal Area Partition Based Energy Efficient Multipath Algorithm (EAPEEM), which tries to exploit sector equal area model in node deployment, data transfer, and route maintenance. Existing algorithms, as compared to our existing models, do not fully match with routing and nodes. One attractive feature of our protocol is its balanced network transmission capacity and improved node energy utilization, which can reduce the possibility of system damage. Simulations show that EAPEEM can retain at least 28.6% of batteries and expand stability by more than 43%.

GPS Aided GEO Augmented Navigation Enabled Energy Efficient Routing for Mobile Ad-hoc Wireless Networks

2017 ◽  
Vol 2 (7) ◽  
pp. 5-8
Author(s):  
Neeraj Verma ◽  
Kuber Mohan
Keyword(s):  
Energy Efficient ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Critical Issue ◽  
Ad Hoc Wireless Networks ◽  
Energy Utilization ◽  
Energy Efficient Routing ◽  
Network Nodes ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Energy is a critical issue in Mobile Ad-hoc Network. Nodes in Network are working in presence of limited or less energy due to dynamic nature of nodes or infrastructure less network. MANET has no infrastructure so nodes in MANET work on dynamic routing. In this way, energy proficient routing is required for reducing energy utilization. Energy proficient routing plans can extraordinarily reduce energy utilization and augments the lifetime of the networks. Scalability of Ad Hoc Networks can be enhanced by using land data, for example, in LAR, GPSR etc. They utilize physical area data; regularly from GPS (Global Positioning System).GPS empowers a gadget to decide their position as in longitude, Latitude and Altitude by getting this data from the satellites. There has been significant effort in proposing energy efficient routing protocols with the help of GAGAN (GPS Aided GEO Augmented Navigation) which have accuracy to approx One meter in India or its neighbor countries. GAGAN is a route framework which is helped by both GPS and nearby telemetry information to possibly give quicker and more exact situating and navigational information.

scholarly journals Holding-time-aware energy-efficient routing algorithm in elastic optical networks

2018 ◽  
Vol 48 (8) ◽  
pp. 1065-1075
Author(s):  
Huanlin LIU ◽  
Derun CHEN ◽  
Yong CHEN ◽  
Lan WU
Keyword(s):  
Optical Networks ◽  
Energy Efficient ◽  
Routing Algorithm ◽  
Holding Time ◽  
Energy Efficient Routing ◽  
Time Aware

scholarly journals Energy Efficient and Reliable Routing Algorithm for Wireless Sensors Networks

2020 ◽  
Vol 10 (5) ◽  
pp. 1885 ◽  
Author(s):  
Liangrui Tang ◽  
Zhilin Lu ◽  
Bing Fan
Keyword(s):  
Energy Efficient ◽  
Routing Algorithm ◽  
Evidence Theory ◽  
Fusion Rule ◽  
Residual Energy ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Entropy Weight ◽  
Reliable Routing ◽  
Index Value

In energy-constrained wireless sensor networks, low energy utilization and unbalanced energy distribution are seriously affecting the operation of the network. Therefore, efficient and reasonable routing algorithms are needed to achieve higher Quality of Service (QoS). For the Dempster–Shafer (DS) evidence theory, it can fuse multiple attributes of sensor nodes with reasonable theoretical deduction and has low demand for prior knowledge. Based on the above, we propose an energy efficient and reliable routing algorithm based on DS evidence theory (DS-EERA). First, DS-EERA establishes three attribute indexes as the evidence under considering the neighboring nodes’ residual energy, traffic, the closeness of its path to the shortest path, etc. Then we adopt the entropy weight method to objectively determine the weight of three indexes. After establishing the basic probability assignment (BPA) function, the fusion rule of DS evidence theory is applied to fuse the BPA function of each index value to select the next hop. Finally, each node in the network transmits data through this routing strategy. Theoretical analysis and simulation results show that DS-EERA is promising, which can effectively prolong the network lifetime. Meanwhile, it can also reach a lower packet loss rate and improve the reliability of data transmission.

Sign in / Sign up

Export Citation Format

Share Document