Comparison Evaluation of Static and Mobile Sensor Nodes in Wireless Sensor Networks Considering Packet-Loss and Delay Metrics

Author(s):  
Tao Yang ◽  
Leonard Barolli ◽  
Jiro Iwashige ◽  
Arjan Durresi ◽  
Fatos Xhafa
2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Jie Shen ◽  
Zhibo Wang ◽  
Zhi Wang

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.


2019 ◽  
Vol 8 (2) ◽  
pp. 2131-2135

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.


2013 ◽  
Vol 10 (2) ◽  
pp. 33
Author(s):  
VV Juli ◽  
J Raja

Wireless sensor networks extend the capability to monitor and control far-flung environments. However, sensor nodes must be deployed appropriately to reach an adequate coverage level for the successful acquisition of data. Modern sensing devices are able to move from one place to another for different purposes and constitute the mobile sensor network. This mobile sensor capability could be used to enhance the coverage of the sensor network. Since mobile sensor nodes have limited capabilities and power constraints, the algorithms which drive the sensors to optimal locations should extend the coverage. It should also reduce the power needed to move the sensors efficiently. In this paper, a genetic algorithm- (GA) based sensor deployment scheme is proposed to maximize network coverage, and the performance was studied with the random deployment using a Matlab simulation. 


Sign in / Sign up

Export Citation Format

Share Document