scholarly journals Cooperative Search and Rescue with Artificial Fishes Based on Fish-Swarm Algorithm for Underwater Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Wei Zhao ◽  
Zhenmin Tang ◽  
Yuwang Yang ◽  
Lei Wang ◽  
Shaohua Lan

This paper presents a searching control approach for cooperating mobile sensor networks. We use a density function to represent the frequency of distress signals issued by victims. The mobile nodes’ moving in mission space is similar to the behaviors of fish-swarm in water. So, we take the mobile node as artificial fish node and define its operations by a probabilistic model over a limited range. A fish-swarm based algorithm is designed requiring local information at each fish node and maximizing the joint detection probabilities of distress signals. Optimization of formation is also considered for the searching control approach and is optimized by fish-swarm algorithm. Simulation results include two schemes: preset route and random walks, and it is showed that the control scheme has adaptive and effective properties.

Author(s):  
Weijun Wang ◽  
Huafeng Wu ◽  
Xianglun Kong ◽  
Yuanyuan Zhang ◽  
Yang Ye ◽  
...  

In this paper, a novel dynamic position control (PC) approach for mobile nodes (MNs) is proposed for ocean sensor networks (OSNs) which directly utilizes a neural network to represent a PC strategy. The calculation of position estimation no longer needs to be carried out in the proposed scheme, so the localization error is eliminated. In addition, reinforcement learning is used to train the PC strategy, so that the MN can learn a more highly accurate and fast response control strategy. Moreover, to verify its applicability to the real-world environment, we conducted field experiment deployment in OSNs consisting of a MN designed by us and some fixed nodes. The experimental results demonstrate the effectiveness of our proposed control scheme with impressive improvements on PC accuracy by more than 53% and response speed by more than 15%.


Author(s):  
Dhruvi Patel ◽  
Arunita Jaekel

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.


Author(s):  
Guangjie Han ◽  
Wen Shen ◽  
Chuan Zhu ◽  
Lei Shu ◽  
Joel J.P.C. Rodrigues

The key problem of location service in indoor sensor networks is to quickly and precisely acquire the position information of mobile nodes. Due to resource limitation of the sensor nodes, some of the traditional positioning algorithms, such as Two-Phase Positioning (TPP) algorithm, are too complicated to be implemented and they can not provide the real-time localization of the mobile node. We analyze the localization error, which is produced when one tries to estimate the mobile node using trilateration method in the localization process. We draw the conclusion that the localization error is the least when three reference nodes form an equilateral triangle. Therefore, we improve the TPP algorithm and propose Reference Node Selection algorithm based on Trilateration (RNST), which can provide real-time localization service for the mobile nodes. Our proposed algorithm is verified by the simulation experiment. Based on the analysis of the acquired data and comparison with that of the TPP algorithm, we conclude that our algorithm can meet real-time localization requirement of the mobile nodes in an indoor environment, and make the localization error less than that of the traditional algorithm; therefore our proposed algorithm can effectively solve the real-time localization problem of the mobile nodes in indoor sensor networks.


2020 ◽  
Vol 2020 ◽  
pp. 1-17 ◽  
Author(s):  
Hua Wu ◽  
Ju Liu ◽  
Zheng Dong ◽  
Yang Liu

In this paper, a hybrid adaptive MCB-PSO node localization algorithm is proposed for three-dimensional mobile wireless sensor networks (MWSNs), which considers the random mobility of both anchor and unknown nodes. An improved particle swarm optimization (PSO) approach is presented with Monte Carlo localization boxed (MCB) to locate mobile nodes. It solves the particle degeneracy problem that appeared in traditional MCB. In the proposed algorithm, a random waypoint model is incorporated to describe random movements of anchor and unknown nodes based on different time units. An adaptive anchor selection operator is designed to improve the performance of standard PSO for each particle based on time units and generations, to maintain the searching ability in the last few time units and particle generations. The objective function of standard PSO is then reformed to make it obtain a better rate of convergence and more accurate cost value for the global optimum position. Furthermore, the moving scope of each particle is constrained in a specified space to improve the searching efficiency as well as to save calculation time. Experiments are made in MATLAB software, and it is compared with DV-Hop, Centroid, MCL, and MCB. Three evaluation indexes are introduced, namely, normalized average localization error, average localization time, and localization rate. The simulation results show that the proposed algorithm works well in every situation with the highest localization accuracy, least time consumptions, and highest localization rates.


2017 ◽  
Vol 13 (03) ◽  
pp. 160 ◽  
Author(s):  
Zhiyu Qiu ◽  
Lihong Wu ◽  
Peixin Zhang

<p style="margin: 1em 0px; -ms-layout-grid-mode: char;"><span style="font-family: Times New Roman; font-size: medium;">With the development of electronic technology and communication protocols, wireless sensor network technology is developing rapidly. In a sense, the traditional static wireless sensor network has been unable to meet the needs of new applications. However, the introduction of mobile nodes extends the application of wireless sensor networks, despite the technical challenges. Because of its flexibility, the mobile wireless sensor network has attracted great attention, and even small, self-controlled mobile sensor devices have appeared. At present, mobile node localization has become one of the hotspots in wireless sensor networks. As the storage energy of wireless sensor network nodes is limited, and the communication radius is small, many scientists have focused their research direction on the location algorithm of mobile nodes. According to the continuity principle of mobile node movement, in this paper we propose an improved mobile node localization algorithm based on the Monte Carlo Location (MCL) algorithm, and the method can reduce the sampling interval effectively. First of all, this paper introduces the structure and classification of wireless sensor localization technology. Secondly, the principle of the Monte Carlo Location algorithm is described in detail. Thirdly, we propose an efficient method for mobile node localization based on the MCL algorithm. Finally, the effectiveness and accuracy of the new algorithm are verified by comparative analysis.</span></p>


2013 ◽  
Vol 4 (2) ◽  
pp. 40-54
Author(s):  
Bilal Muhammad Khan ◽  
Rabia Bilal

In this paper a high throughput, low latency, mobility adaptive and energy efficient medium access protocol (MAC) called Mobility Adaptive (MA) for wireless sensor networks. MA-MAC ensures that transmissions incur no collisions, and allows nodes to undergo sleep mode whenever they are not transmitting or receiving. It uses delay allocation scheme based on traffic priority at each node and avoids allocating same backoff delay for more than one node unless they are in separate clusters. It also allows nodes to determine when they can switch to sleep mode during operation. MA-MAC for mobile nodes provides fast association between the mobile node and the cluster coordinator. The proposed MAC performs well in both static and mobile scenarios, which shows its significance over existing MAC protocols proposed for mobile applications. The performance of MA-MAC is evaluated through extensive simulation, analysis and comparison with other mobility aware MAC protocols. The results show that MA-MAC outperforms significantly the existing CSMA/CA, Sensor Mac (S-MAC), Mobile MAC (MOB-MAC), Mobility aware Delay sensitive MAC (MD-MAC) and Dynamic Sensor MAC (DS-MAC) protocols including throughput, latency and energy consumption.


2019 ◽  
Vol 14 ◽  
Author(s):  
Tayyab Khan ◽  
Karan Singh ◽  
Kamlesh C. Purohit

Background: With the growing popularity of various group communication applications such as file transfer, multimedia events, distance learning, email distribution, multiparty video conferencing and teleconferencing, multicasting seems to be a useful tool for efficient multipoint data distribution. An efficient communication technique depends on the various parameters like processing speed, buffer storage, and amount of data flow between the nodes. If data exceeds beyond the capacity of a link or node, then it introduces congestion in the network. A series of multicast congestion control algorithms have been developed, but due to the heterogeneous network environment, these approaches do not respond nor reduce congestion quickly whenever network behavior changes. Objective: Multicasting is a robust and efficient one-to-many (1: M) group transmission (communication) technique to reduced communication cost, bandwidth consumption, processing time and delays with similar reliability (dependability) as of regular unicast. This patent presents a novel and comprehensive congestion control method known as integrated multicast congestion control approach (ICMA) to reduce packet loss. Methods: The proposed mechanism is based on leave-join and flow control mechanism along with proportional integrated and derivate (PID) controller to reduce packet loss, depending on the congestion status. In the proposed approach, Proportional integrated and derivate controller computes expected incoming rate at each router and feedback this rate to upstream routers of the multicast network to stabilize their local buffer occupancy. Results: Simulation results on NS-2 exhibit the immense performance of the proposed approach in terms of delay, throughput, bandwidth utilization, and packet loss than other existing methods. Conclusion: The proposed congestion control scheme provides better bandwidth utilization and throughput than other existing approaches. Moreover, we have discussed existing congestion control schemes with their research gaps. In the future, we are planning to explore the fairness and quality of service issue in multicast communication.


2016 ◽  
Vol 3 ◽  
pp. 21-30 ◽  
Author(s):  
Ignacio Del Castillo ◽  
Félix Tobajas ◽  
Roberto Esper-Chaín ◽  
Valentín De Armas

2014 ◽  
Vol 2014 ◽  
pp. 1-16
Author(s):  
Peer Azmat Shah ◽  
Halabi B. Hasbullah ◽  
Ibrahim A. Lawal ◽  
Abubakar Aminu Mu’azu ◽  
Low Tang Jung

Due to the proliferation of handheld mobile devices, multimedia applications like Voice over IP (VoIP), video conferencing, network music, and online gaming are gaining popularity in recent years. These applications are well known to be delay sensitive and resource demanding. The mobility of mobile devices, running these applications, across different networks causes delay and service disruption. Mobile IPv6 was proposed to provide mobility support to IPv6-based mobile nodes for continuous communication when they roam across different networks. However, the Route Optimization procedure in Mobile IPv6 involves the verification of mobile node’s reachability at the home address and at the care-of address (home test and care-of test) that results in higher handover delays and signalling overhead. This paper presents an enhanced procedure, time-based one-time password Route Optimization (TOTP-RO), for Mobile IPv6 Route Optimization that uses the concepts of shared secret Token, time based one-time password (TOTP) along with verification of the mobile node via direct communication and maintaining the status of correspondent node’s compatibility. The TOTP-RO was implemented in network simulator (NS-2) and an analytical analysis was also made. Analysis showed that TOTP-RO has lower handover delays, packet loss, and signalling overhead with an increased level of security as compared to the standard Mobile IPv6’s Return-Routability-based Route Optimization (RR-RO).


Sign in / Sign up

Export Citation Format

Share Document