A Locating Mechanism for Multiple Mobile Nodes in Wireless Sensor Networks

2006 ◽  
Author(s):  
Sung-Min Lee ◽  
Hojung Cha
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Mobile Nodes

scholarly journals Using Mobile Elements as Dynamic Bridges in Sparse Wireless Sensor Networks

2014 ◽  
pp. 107
Author(s):  
Hoang Dang Hai ◽  
Thorsten Strufe ◽  
Pham Thieu Nga ◽  
Hoang Hong Ngoc ◽  
Nguyen Anh Son ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Exchange ◽  
Data Transfer ◽  
Mobile Elements ◽  
Sensor Nodes ◽  
Pollution Monitoring ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Road Distance

Sparse  Wireless  Sensor  Networks  using several  mobile  nodes  and  a  small  number  of  static sensor  nodes  have  been  widely  used  for  many applications,  especially  for  traffic-generated  pollution monitoring.  This  paper  proposes  a  method  for  data collection and forwarding using Mobile Elements (MEs), which are moving on predefined trajectories in contrast to previous works that use a mixture of MEsand static nodes. In our method, MEscan be used as data collector as well as dynamic bridges for data transfer. We design the  trajectories  in  such  a  way,  that  they  completely cover  the  deployed  area  and  data  will  be  gradually forwarded  from  outermost  trajectories  to  the  center whenever  a  pair  of MEs contacts  each  other  on  an overlapping road distance of respective trajectories. The method  is based  on  direction-oriented  level  and  weight assignment.  We  analyze  the  contact  opportunity  for data  exchange  while MEs move.  The  method  has  been successfully tested for traffic pollution monitoring in an urban area.

scholarly journals Energy Efficient Trust Node Based Routing Protocol (EETRP) to Maximize the Lifetime of Wireless Sensor Networks in Plateaus

2019 ◽  
Vol 15 (06) ◽  
pp. 113 ◽  
Author(s):  
Nandoori Srikanth ◽  
Muktyala Sivaganga Prasad
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Energy Limitation

<p>Wireless Sensor Networks (WSNs) can extant the individual profits and suppleness with regard to low-power and economical quick deployment for numerous applications. WSNs are widely utilized in medical health care, environmental monitoring, emergencies and remote control areas. Introducing of mobile nodes in clusters is a traditional approach, to assemble the data from sensor nodes and forward to the Base station. Energy efficiency and lifetime improvements are key research areas from past few decades. In this research, to solve the energy limitation to upsurge the network lifetime, Energy efficient trust node based routing protocol is proposed. An experimental validation of framework is focused on Packet Delivery Ratio, network lifetime, throughput, energy consumption and network loss among all other challenges. This protocol assigns some high energy nodes as trusted nodes, and it decides the mobility of data collector.  The energy of mobile nodes, and sensor nodes can save up to a great extent by collecting data from trusted nodes based on their trustworthiness and energy efficiency.  The simulation outcome of our evaluation shows an improvement in all these parameters than existing clustering and Routing algorithms.<strong></strong></p>

scholarly journals An improved DV-Hop localization with minimum connected dominating set for mobile nodes in wireless sensor networks

2018 ◽  
Vol 14 (1) ◽  
pp. 155014771875563 ◽  
Author(s):  
Gulshan Kumar ◽  
Mritunjay Kumar Rai ◽  
Rahul Saha ◽  
Hye-jin Kim
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Wireless Sensor ◽  
Network Simulator ◽  
Localization Algorithm ◽  
Mobile Nodes ◽  
Minimum Connected Dominating Set ◽  
Anchor Nodes

Localization is one of the key concepts in wireless sensor networks. Different techniques and measures to calculate the location of unknown nodes were introduced in recent past. But the issue of nodes’ mobility requires more attention. The algorithms introduced earlier to support mobility lack the utilization of the anchor nodes’ privileges. Therefore, in this article, an improved DV-Hop localization algorithm is introduced that supports the mobility of anchor nodes as well as unknown nodes. Coordination of anchor nodes creates a minimum connected dominating set that works as a backbone in the proposed algorithm. The focus of the research paper is to locate unknown nodes with the help of anchor nodes by utilizing the network resources efficiently. The simulated results in network simulator-2 and the statistical analysis of the data provide a clear impression that our novel algorithm improves the error rate and the time consumption.

scholarly journals Method for Patching Three-Dimensional Surface Coverage Loopholes of Hybrid Nodes in Wireless Sensor Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-19
Author(s):  
Zhanjun Hao ◽  
Hongwen Xu ◽  
Xiaochao Dang ◽  
Nanjiang Qu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Three Dimensional ◽  
Wireless Sensor ◽  
Utilization Rate ◽  
Network Coverage ◽  
Mobile Nodes ◽  
Research Information ◽  
Information Monitoring ◽  
Dimensional Surface

Target sensing and information monitoring using wireless sensor networks have become an important research field. Based on two-dimensional plane research, information monitoring, and transmission for three-dimensional curved target events, due to the uneven deployment of nodes and failures in sensor networks, there are a lot of coverage loopholes in the network. In this paper, a method of detecting and repairing loopholes in monitoring the coverage of three-dimensional surface targets with hybrid nodes is proposed. In the target monitoring area where the hybrid nodes are randomly deployed, the three-dimensional surface cube is meshed, and the coverage loopholes are gradually detected according to the method of computational geometry, and then, the redundant mobile nodes around the coverage loopholes are selected. According to the calculated distance to cover the moving direction and distance of the loophole, the virtual force is used to adjust the mobile nodes to repair the coverage loopholes. Simulation results show that compared with other algorithms, this algorithm has a higher utilization rate of mobile nodes, uses fewer nodes to complete coverage, reduces network coverage costs, meets the overall network coverage requirements, and has lower mobile energy consumption and longer network life. The actual scene further verifies the good connectivity and high coverage of the whole network.

Coverage Optimization of Hybrid Wireless Sensor Networks Based on Modified Particle Swarm Algorithm

2013 ◽  
Vol 846-847 ◽  
pp. 914-917
Author(s):  
Su Fen Yao ◽  
Jian Qiang Zhao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Pso Algorithm ◽  
Wireless Sensor ◽  
Particle Swarm Algorithm ◽  
Local Optimum ◽  
Network Coverage ◽  
Mobile Nodes ◽  
Coverage Optimization ◽  
Adaptive Neighborhood

A strategy for controlling mobile nodes based on PSO algorithm with neighborhood disturbance was proposed for improving the network coverage rate in wireless sensor networks. The non-dominated sorting strategy was led into basic PSO algorithm to seek best particle and adaptive neighborhood disturbance operation was used to conquer the drawback of PSO falling into local optimum. Therefore, the effect of network coverage had been improved and the network energy consumption can be reduced.

Sign in / Sign up

Export Citation Format

Share Document