Energy-saving in Wireless Sensor Networks Considering Mobile Sensor Nodes

2011 ◽  
Author(s):  
Tao Yang ◽  
Gjergji Mino ◽  
Leonard Barolli ◽  
Arjan Durresi ◽  
Fatos Xhafa
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Saving ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Sensor ◽  
Mobile Sensor Nodes

scholarly journals Fault Tolerant Line-Based Barrier Coverage Formation in Mobile Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Jie Shen ◽  
Zhibo Wang ◽  
Zhi Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fundamental Problem ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Barrier Coverage ◽  
Localization Algorithm ◽  
Mobile Sensor ◽  
Location Errors ◽  
Mobile Sensor Nodes

Barrier coverage is a fundamental problem for lots of applications in wireless sensor networks. In reality, sensor nodes’ true locations may not be known to us considering that not every sensor node is equipped with a GPS. The measured locations of sensor nodes obtained by applying node localization algorithm often have errors, which makes it difficult to form a line-based barrier with mobile sensor nodes. In this paper, we study how to efficiently schedule mobile sensor nodes to form a barrier when sensor nodes suffer from location errors. We explore the relationship between the existence of uncovered hole and location errors and find that the lengths of uncovered holes are decided by the cumulative location errors. We also propose a method in frequency domain to efficiently calculate the distributions of the cumulative location errors. The possibility of the existence of uncovered holes can be derived by analyzing the step responses of the cumulative location errors. Extensive experimental results demonstrate the effectiveness of the proposed algorithm.

scholarly journals Improved Network Lifetime in Mobile Wireless Sensor Networks using Adaptive Algorithms

2019 ◽  
Vol 8 (2) ◽  
pp. 2131-2135
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Sensor ◽  
Mobile Wireless ◽  
Battery Power ◽  
Mobile Sensor Nodes ◽  
Mobile Wireless Sensor

Mobile Wireless Sensor Networks (MWSNs) have gained a lot of attention because of their applicability in different types of applications such as environment, healthcare, agriculture, industry automation, public safety, security and military surveillance. MWSNs are suffered from poor network lifetime because of the continuous disconnections between the mobile sensor nodes as they have limited battery power. This paper proposed and implement an adaptive algorithm(d-DSR) (implemented in DSR routing protocol) using ns-2.34,that handles the continuous disconnections because of low battery power of the mobile sensor nodes and improves the performance of the network in terms of throughput, packet delivery fraction, delay and network lifetime.

scholarly journals Delay Tolerance and Energy Saving in Wireless Sensor Networks with a Mobile Base Station

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Oday Jerew ◽  
Nizar Al Bassam
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Saving ◽  
Data Gathering ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hop Count ◽  
Tour Length ◽  
Mobile Base

Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile devices. A mobile device roams sensing fields and collects data from sensors through a short transmission range. Multihop communication is used to improve data gathering by reducing the tour length of the mobile device. In this paper we study the trade-off between energy saving and data gathering latency in wireless sensor networks. In particular, we examine the balance between the relay hop count and the tour length of a mobile Base Station (BS). We propose two heuristic algorithms, Adjacent Tree-Bounded Hop Algorithm (AT-BHA) and Farthest Node First-Bounded Hop Algorithm (FNF-BHA), to reduce energy consumption of sensor nodes. The proposed algorithms select groups of Collection Trees (CTs) and a subset of Collection Location (CL) sensor nodes to buffer and forward data to the mobile BS when it arrives. Each CL node receives sensing data from its CT nodes within bounded hop count. Extensive experiments by simulation are conducted to evaluate the performance of the proposed algorithms against another heuristic. We demonstrate that the proposed algorithms outperform the existing work with the mean of the length of mobile BS tour.

Sign in / Sign up

Export Citation Format

Share Document