Design & Implementation of Optimal Path Selection In Sleep Awake Cycling In Wireless Sensor Network

2015 ◽  
Vol 03 (06) ◽  
pp. 5480-5487
Author(s):  
Sarvjeet Kaur, E r. Jasmeet Singh
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Optimal Path ◽  
Path Selection ◽  
Wireless Sensor

scholarly journals Optimal path selection algorithm for mobile beacons in sensor network under non-dense distribution

Open Physics ◽  
2018 ◽  
Vol 16 (1) ◽  
pp. 1066-1075
Author(s):  
Guoqing Yu ◽  
Hongtao Ma ◽  
Deden Witarsyah
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Optimal Path ◽  
Path Selection ◽  
Wireless Sensor ◽  
Selection Algorithm ◽  
Optimal Node ◽  
Dense Distribution ◽  
Location Algorithm ◽  
Mobile Beacon

Abstract When the traditional anchor aided location algorithm is used to select the mobile beacon path in the sensor network, there is no analysis of the energy imbalance of nodes in non-dense conditions, the optimal network node cannot be selected, and the selection error of the optimal path of the beacon is larger. A path selection algorithm for mobile beacons in a sensor network under non-dense distribution is proposed. Using the mobile beacon based wireless sensor network location algorithm, the weighted centroid algorithm and the extended Kalman filter (EKF) are used to obtain the accurate location results of the unknown nodes around the mobile beacon in the sensor network under non-dense distribution condition. The optimal node energy partition of the unknown node is obtained by the chaotic differential evolution method, and the optimal location of the optimal energy node in the wireless sensor network is calculated using the dynamic escape particle swarm optimization method, and the optimal beacon path is extracted. The experimental results show that the proposed algorithm can enhance the clustering performance of the optimal node in the wireless sensor network and has a better performance of dynamic node selection in wireless sensor network, and the convergence speed is faster and the operation time is shorter.

scholarly journals Optimal path discovery for two moving sinks with a common junction in a wireless sensor network

2021 ◽  
Vol 23 (2) ◽  
pp. 879
Author(s):  
Satish Tunga ◽  
Sadashiva V. Chakrasali ◽  
N. Shylashree ◽  
Latha B. N. ◽  
Mamatha A. S.
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Optimal Path ◽  
Shortest Paths ◽  
Integrated Approach ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Round Trip ◽  
Binary Integer Programming ◽  
Path Lengths

A new algorithm is described for determining the optimal round-trip paths for two moving sinks in a wireless sensor network. The algorithm uses binary integer programming to select two non-overlapping shortest paths except having a common junction node to cover all the sensor nodes. The two paths are balanced as nearly equal as possible. That is the sensor nodes along each path are equal or differ by just one depending on whether the total number of sensor nodes excluding the junction node is even or odd. In this method, both the path lengths are made equal or very nearly equal while the total length is minimized. This integrated approach is a novel and unique solution to solve the dual moving sink path problem in a wireless sensor network.

Queueing-Network-Based Delay Analysis and Path Selection Improvement of Wireless Sensor Network

2013 ◽  
Vol 11 (4) ◽  
pp. 704-709
Author(s):  
Lin Feng ◽  
Wei Wang ◽  
Tie Qiu ◽  
Weifeng Sun ◽  
Yu Zhou
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Queueing Network ◽  
Path Selection ◽  
Wireless Sensor ◽  
Delay Analysis

scholarly journals An enhancement of path selection to cluster head based on multi-hop routing in two-tier wireless sensor network

2019 ◽  
Vol 9 (6) ◽  
pp. 5360
Author(s):  
Wan Isni Sofiah Wan Din ◽  
Asyran Zarizi Bin Abdullah ◽  
Razulaimi Razali ◽  
Ahmad Firdaus ◽  
Salwana Mohamad ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Data Transmission ◽  
Cluster Head ◽  
Threshold Value ◽  
Path Selection ◽  
Sensor Nodes ◽  
Wireless Sensor

<span lang="EN-US">Wireless Sensor Network (WSN) is a distributed wireless connection that consists many wireless sensor devices. It is used to get information from the surrounding activities or the environment and send the details to the user for future work. Due to its advantages, WSN has been widely used to help people to collect, monitor and analyse data. However, the biggest limitation of WSN is about the network lifetime. Usually WSN has a small energy capacity for operation, and after the energy was used up below the threshold value, it will then be declared as a dead node. When this happens, the sensor node cannot receive and send the data until the energy is renewed. To reduce WSN energy consumption, the process of selecting a path to the destination is very important. Currently, the data transmission from sensor nodes to the cluster head uses a single hop which consumes more energy; thus, in this paper the enhancement of previous algorithm, which is MAP, the data transmission will use several paths to reach the cluster head. The best path uses a small amount of energy and will take a short time for packet delivery. The element of Shortest Path First (SPF) Algorithm that is used in a routing protocol will be implemented. It will determine the path based on a cost, in which the decision will be made depending on the lowest cost between several connected paths. By using the MATLAB simulation tool, the performance of SPF algorithm and conventional method will be evaluated. The expected result of SPF implementation will increase the energy consumption in order to prolong the network lifetime for WSN.</span>

Sign in / Sign up

Export Citation Format

Share Document