Location Updates of Mobile Node in Wireless Sensor Networks

2009 ◽  
Author(s):  
Rajiv Misra ◽  
Chittaranjan Mandal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Node ◽  
Wireless Sensor ◽  
Location Updates

An Enhanced Monte Carlo Localization Algorithm for Mobile Node in Wireless Sensor Networks

2013 ◽  
Vol 401-403 ◽  
pp. 1800-1804 ◽  
Author(s):  
Shi Ping Fan ◽  
Yong Jiang Wen ◽  
Lin Zhou
Keyword(s):  
Wireless Sensor Networks ◽  
Monte Carlo ◽  
Sensor Networks ◽  
Mobile Node ◽  
Wireless Sensor ◽  
Distribution Area ◽  
Localization Algorithm ◽  
Monte Carlo Localization ◽  
Sample Points ◽  
Unknown Node

There are some common problems, such as low sampling efficiency and large amount of calculation, in mobile localization algorithm based on Monte Carlo localization (MCL) in wireless sensor networks. To improve these issues, an enhanced MCL algorithm is proposed. The algorithm uses the continuity of the nodes movement to predict the area where the unknown node may reach, constructs high posteriori density distribution area, adds the corresponding weights to the sample points which fall in different areas, and filters the sample points again by using the position relations between the unknown node and its one-hop neighbors which include anchor nodes and ordinary nodes. Simulation results show that the localization accuracy of the algorithm is superior to the traditional localization algorithm. Especially when the anchor node density is lower or the unknown nodes speed is higher, the algorithm has higher location accuracy.

Improving Area Coverage With Mobile Nodes in Wireless Sensor Networks

2021 ◽  
Vol 13 (1) ◽  
pp. 36-48
Author(s):  
Dhruvi Patel ◽  
Arunita Jaekel
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Mobile Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Area Of Interest ◽  
Adequate Coverage ◽  
Considerable Work

Wireless sensor networks (WSN) consist of sensor nodes that detect relevant events in their vicinity and relay this information for further analysis. Considerable work has been done in the area of sensor node placement to ensure adequate coverage of the area of interest. However, in many applications it may not be possible to accurately place individual sensor nodes. In such cases, imprecise placement can result in regions, referred to as coverage holes, that are not monitored by any sensor node. The use of mobile nodes that can ‘visit' such uncovered regions after deployment has been proposed in the literature as an effective way to maintain adequate coverage. In this paper, the authors propose a novel integer linear programming (ILP) formulation that determines the paths the mobile node(s) should take to realize the specified level of coverage in the shortest time. The authors also present a heuristic algorithm that can be used for larger networks.

Sign in / Sign up

Export Citation Format

Share Document