scholarly journals A Review on Sensor Network Issues and Robotics

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Ji Hyoung Ryu ◽  
Muhammad Irfan ◽  
Aamir Reyaz
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Mobile Sensor Networks ◽  
Wireless Sensor ◽  
Distributed Robotics ◽  
Mobile Sensor ◽  
Network Applications ◽  
Mobile Wireless Sensor ◽  
New Applications

The interaction of distributed robotics and wireless sensor networks has led to the creation of mobile sensor networks. There has been an increasing interest in building mobile sensor networks and they are the favored class of WSNs in which mobility plays a key role in the execution of an application. More and more researches focus on development of mobile wireless sensor networks (MWSNs) due to its favorable advantages and applications. In WSNs robotics can play a crucial role, and integrating static nodes with mobile robots enhances the capabilities of both types of devices and enables new applications. In this paper we present an overview on mobile sensor networks in robotics and vice versa and robotic sensor network applications.

scholarly journals An Elite Hybrid Particle Swarm Optimization for Solving Minimal Exposure Path Problem in Mobile Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (9) ◽  
pp. 2586
Author(s):  
Nguyen Thi My Binh ◽  
Abdelhamid Mellouk ◽  
Huynh Thi Thanh Binh ◽  
Le Vu Loi ◽  
Dang Lam San ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Particle Swarm Optimization ◽  
Sensor Networks ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Mobile Wireless ◽  
Swarm Optimization ◽  
Mobile Wireless Sensor Networks ◽  
Coverage Quality ◽  
Mobile Wireless Sensor

Mobile wireless sensor networks (MWSNs), a sub-class of wireless sensor networks (WSNs), have recently been a growing concern among the academic community. MWSNs can improve network coverage quality which reflects how well a region of interest is monitored or tracked by sensors. To evaluate the coverage quality of WSNs, we frequently use the minimal exposure path (MEP) in the sensing field as an effective measurement. MEP refers to the worst covered path along which an intruder can go through the sensor network with the lowest possibility of being detected. It is greatly valuable for network designers to recognize the vulnerabilities of WSNs and to make necessary improvements. Most prior studies focused on this problem under a static sensor network, which may suffer from several drawbacks; i.e., failure in sensor position causes coverage holes in the network. This paper investigates the problem of finding the minimal exposure paths in MWSNs (hereinafter MMEP). First, we formulate the MMEP problem. Then the MMEP problem is converted into a numerical functional extreme problem with high dimensionality, non-differentiation and non-linearity. To efficiently cope with these characteristics, we propose HPSO-MMEP algorithm, which is an integration of genetic algorithm into particle swarm optimization. Besides, we also create a variety of custom-made topologies of MWSNs for experimental simulations. The experimental results indicate that HPSO-MMEP is suitable for the converted MMEP problem and performs much better than existing algorithms.

scholarly journals Optimized Dislocation of Mobile Sensor Networks on Large Marine Environments Using Voronoi Partitions

2020 ◽  
Vol 8 (2) ◽  
pp. 132
Author(s):  
Mario D’Acunto ◽  
Davide Moroni ◽  
Alessandro Puntoni ◽  
Ovidio Salvetti
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Mobile Sensor Networks ◽  
Wireless Sensor ◽  
Mobile Sensor ◽  
Vast Number ◽  
Voronoi Cells ◽  
Voronoi Partition ◽  
Pollution Event

The real-time environmental surveillance of large areas requires the ability to dislocate sensor networks. Generally, the probability of the occurrence of a pollution event depends on the burden of possible sources operating in the areas to be monitored. This implies a challenge for devising optimal real-time dislocation of wireless sensor networks. This challenge involves both hardware solutions and algorithms optimizing the displacements of mobile sensor networks in large areas with a vast number of sources of pollutant factors based mainly on diffusion mechanisms. In this paper, we present theoretical and simulated results inherent to a Voronoi partition approach for the optimized dislocation of a set of mobile wireless sensors with circular (radial) sensing power on large areas. The optimal deployment was found to be a variation of the generalized centroidal Voronoi configuration, where the Voronoi configuration is event-driven, and the centroid set of the corresponding generalized Voronoi cells changes as a function of the pollution event. The initial localization of the pollution events is simulated with a Poisson distribution. Our results could improve the possibility of reducing the costs for real-time surveillance of large areas, and other environmental monitoring when wireless sensor networks are involved.

scholarly journals Efficient Hybrid Detection of Node Replication Attacks in Mobile Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Ze Wang ◽  
Chang Zhou ◽  
Yiran Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Sensor Networks ◽  
Local Area ◽  
Wireless Sensor ◽  
Node Mobility ◽  
Mobile Sensor ◽  
Mobile Nodes ◽  
Hybrid Detection ◽  
Static Wireless Sensor Networks

The node replication attack is one of the notorious attacks that can be easily launched by adversaries in wireless sensor networks. A lot of literatures have studied mitigating the node replication attack in static wireless sensor networks. However, it is more difficult to detect the replicas in mobile sensor networks because of their node mobility. Considering the limitations of centralized detection schemes for static wireless sensor networks, a few distributed solutions have been recently proposed. Some existing schemes identified replicated attacks by sensing mobile nodes with identical ID but different locations. To facilitate the discovery of contradictory conflicts, we propose a hybrid local and global detection method. The local detection is performed in a local area smaller than the whole deployed area to improve the meeting probability of contradictory nodes, while the distant replicated nodes in larger area can also be efficiently detected by the global detection. The complementary two levels of detection achieve quick discovery by searching of the replicas with reasonable overhead.

Mobile Wireless Sensor Networks K-Covering Algorithm

2011 ◽  
Vol 216 ◽  
pp. 617-620
Author(s):  
Xin Lian Zhou ◽  
Bin Xiao ◽  
Jing Liang Cheng
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Mobile Wireless ◽  
Mobile Wireless Sensor Network ◽  
Mobile Wireless Sensor Networks ◽  
Mobile Wireless Sensor ◽  
Coverage Holes

In mobile wireless sensor networks, sensor nodes may due to their own moves, energy loss, physical damage, errors and failures or other factors, will result the case of coverage holes, and then lead to inefficient network coverage. This paper designed a new algorithm based on clustering approach for mobile wireless sensor network, can monitor the network in real-time and repairing coverage holes quickly. Simulation results show that, the algorithm used in mobile wireless sensor network not only can achieve the desired uniformity of coverage, but also increase the coverage area, and better performance than the Virtual force algorithm(VFA) [1].

Study on the Hierarchical Routing Protocols for Wireless Sensor Networks

2016 ◽  
Vol 850 ◽  
pp. 43-51
Author(s):  
Sherif Moussa ◽  
Ghada Abdel Halim ◽  
Salah Ramadan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Routing Protocols ◽  
Network Architecture ◽  
Wireless Sensor ◽  
Design Parameters ◽  
Hierarchical Routing ◽  
Network Applications ◽  
Main Challenge

Routing the sensed data is considered a main challenge in Wireless Sensor Networks (WSN) because the routing characteristics may vary depending on the network application and/or the network architecture. Since most sensor network applications work in clusters, hierarchical routing protocols have been developed to fit this network topology. This paper introduces the performance differentials for most common hierarchical routing protocols such as Low Energy Adaptive Clustering Hierarchy (LEACH) and Threshold sensitive Energy Efficient sensor Network protocol (TEEN). The design parameters of sensor networks are analyzed to present a classification and comparison of LEACH, TEEN routing protocols. The two protocols are analyzed using different mobility models using NS2 simulation tool. This comparison reveals the important features that need to be taken into consideration while designing and evaluating new routing protocols for sensor networks.

scholarly journals Mobility Assisted Sensor Node Self-Deployment for Maximizing the Coverage of Wireless Sensor Networks using A Genetic Algorithm

2013 ◽  
Vol 10 (2) ◽  
pp. 33
Author(s):  
VV Juli ◽  
J Raja
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Matlab Simulation ◽  
Mobile Sensor ◽  
Adequate Coverage ◽  
And Control

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. 

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.

Sign in / Sign up

Export Citation Format

Share Document