Mechanism analysis of regulating Turing instability and Hopf bifurcation of malware propagation in mobile wireless sensor networks

A dynamical model is constructed to depict the spatial-temporal evolution of malware in mobile wireless sensor networks(MWSNs). Based on such a model, we design a hybrid control scheme combining parameter perturbation and state feedback to effectively manipulate the spatiotemporal dynamics of malware propagation. The hybrid control can not only suppress the Turing instability caused by diffusion factor but can also adjust the occurrence of Hopf bifurcation induced by time delay. Numerical simulation results show that the hybrid control strategy can efficiently manipulate the transmission dynamics to achieve our expected desired properties, thus reducing the harm of malware propagation to MWSNs.

A Review and Analysis of Localization Techniques in Underwater Wireless Sensor Networks

In recent years,there has been a rapid growth in Underwater Wireless Sensor Networks(UWSNs).The focus of research in this area is now on solving the problems associated with large-scale UWSN.One of the major issues in such a network is the localization of underwater nodes.Localization is required for tracking objects and detecting the target.It is also considered tagging of data where sensed contents are not found of any use without localization.This is useless for application until the position of sensed content is confirmed.This article’s major goal is to review and analyze underwater node localization to solve the localization issues in UWSN.The present paper describes various existing localization schemes and broadly categorizes these schemes as Centralized and Distributed localization schemes underwater.Also,a detailed subdivision of these localization schemes is given.Further,these localization schemes are compared from different perspectives.The detailed analysis of these schemes in terms of certain performance metrics has been discussed in this paper.At the end,the paper addresses several future directions for potential research in improving localization problems of UWSN.

A Systematic Overview of Underwater Wireless Sensor Networks:Applications,Challenge and Research Perspectives

Underwater Wireless Sensor Networks(UWSNs)are becoming increasingly popular in marine applications due to advances in wireless and microelectronics technology.However,UWSNs present challenges in processing,energy,and memory storage due to the use of acoustic waves for communication,which results in long delays,significant power consumption,limited bandwidth,and packet loss.This paper provides a comprehensive review of the latest advancements in UWSNs,including essential services,common platforms,critical elements,and components such as localization algorithms,communication,synchronization,security,mobility,and applications.Despite significant progress,reliable and flexible solutions are needed to meet the evolving requirements of UWSNs.The purpose of this paper is to provide a framework for future research in the field of UWSNs by examining recent advancements,establishing a standard platform and service criteria,using a taxonomy to determine critical elements,and emphasizing important unresolved issues.

Collaborative Charging Scheduling in Wireless Charging Sensor Networks

Wireless sensor networks (WSNs) have the trouble of limited battery power, and wireless charging provides apromising solution to this problem, which is not easily affected by the external environment. In this paper, we studythe recharging of sensors in wireless rechargeable sensor networks (WRSNs) by scheduling two mobile chargers(MCs) to collaboratively charge sensors. We first formulate a novel sensor charging scheduling problem with theobjective of maximizing the number of surviving sensors, and further propose a collaborative charging schedulingalgorithm(CCSA) for WRSNs. In the scheme, the sensors are divided into important sensors and ordinary sensors.TwoMCs can adaptively collaboratively charge the sensors based on the energy limit ofMCs and the energy demandof sensors. Finally, we conducted comparative simulations. The simulation results show that the proposed algorithmcan effectively reduce the death rate of the sensor. The proposed algorithm provides a solution to the uncertaintyof node charging tasks and the collaborative challenges posed by multiple MCs in practical scenarios.

A Novel Approach to Energy Optimization:Efficient Path Selection in Wireless Sensor Networks with Hybrid ANN

In pursuit of enhancing the Wireless Sensor Networks(WSNs)energy efficiency and operational lifespan,this paper delves into the domain of energy-efficient routing protocols.InWSNs,the limited energy resources of Sensor Nodes(SNs)are a big challenge for ensuring their efficient and reliable operation.WSN data gathering involves the utilization of a mobile sink(MS)to mitigate the energy consumption problem through periodic network traversal.The mobile sink(MS)strategy minimizes energy consumption and latency by visiting the fewest nodes or predetermined locations called rendezvous points(RPs)instead of all cluster heads(CHs).CHs subsequently transmit packets to neighboring RPs.The unique determination of this study is the shortest path to reach RPs.As the mobile sink(MS)concept has emerged as a promising solution to the energy consumption problem in WSNs,caused by multi-hop data collection with static sinks.In this study,we proposed two novel hybrid algorithms,namely“ Reduced k-means based on Artificial Neural Network”(RkM-ANN)and“Delay Bound Reduced kmeans with ANN”(DBRkM-ANN)for designing a fast,efficient,and most proficient MS path depending upon rendezvous points(RPs).The first algorithm optimizes the MS’s latency,while the second considers the designing of delay-bound paths,also defined as the number of paths with delay over bound for the MS.Both methods use a weight function and k-means clustering to choose RPs in a way that maximizes efficiency and guarantees network-wide coverage.In addition,a method of using MS scheduling for efficient data collection is provided.Extensive simulations and comparisons to several existing algorithms have shown the effectiveness of the suggested methodologies over a wide range of performance indicators.

Node Coverage Algorithms in Wireless Sensor Networks Using Mobile Agents

This paper proposes fault tolerant algorithms for routing mobile agents in a single channel wireless sensor network which cover every node in the network. These algorithms use local knowledge (assume no knowledge of global deployment or topology, etc). We propose the algorithms and show mathematical analysis to support our claims. The paper ends with simulation studies and discussion of results.

An Asynchronous Clustering and Mobile Data Gathering Schema Based on Timer Mechanism in Wireless Sensor Networks

Recently,Wireless sensor networks(WSNs)have become very popular research topics which are applied to many applications.They provide pervasive computing services and techniques in various potential applications for the Internet of Things(IoT).An Asynchronous Clustering and Mobile Data Gathering based on Timer Mechanism(ACMDGTM)algorithm is proposed which would mitigate the problem of“hot spots”among sensors to enhance the lifetime of networks.The clustering process takes sensors’location and residual energy into consideration to elect suitable cluster heads.Furthermore,one mobile sink node is employed to access cluster heads in accordance with the data overflow time and moving time from cluster heads to itself.Related experimental results display that the presented method can avoid long distance communicate between sensor nodes.Furthermore,this algorithm reduces energy consumption effectively and improves package delivery rate.

Grid-Based Localization Mechanism with Mobile Reference Node in Wireless Sensor Networks

Wireless sensor networks （WSNs） are based on monitoring or managing the sensing area by using the location information with sensor nodes. Most sensor nodes require hardware support or receive packets with location information to estimate their locations, which needs lots of time or costs. In this paper we proposed a localization mechanism using a mobile reference node （MRN） and trilateration in WSNs to reduce the energy consumption and location error. The simulation results demonstrate that the proposed mechanism can obtain more unknown nodes locations by the mobile reference node moving scheme and will decreases the energy consumption and average ocation error.

Dynamic Coverage with Wireless Sensor and Actor Networks in Underwater Environment

This paper studies the problem of dynamic coverage with wireless sensor and actor networks(WSANs) in underwater environment.Different from most existing works,the WSANs consist of two kinds of nodes,i.e.,sensor nodes(SNs) which cannot move autonomously and actor nodes(ANs) which can move autonomously according to the performance requirement.The problem of how to coordinate two kinds of nodes to facilitate dynamic coverage in underwater environment is challenging due to their heterogeneous capabilities.To reduce redundancy of communication links and improve connectivity between ANs and SNs in underwater WSANs,a min-weighted rigid graph based topology optimization scheme is first developed,such that the underwater communication energy consumption can be saved.With the optimized topology,a dynamic coverage strategy is proposed to improve the coverage among SNs and ANs for underwater WSAN where underwater fluid motions are considered.Furthermore,it is proved that the network coverage area is connected by using the min-weighted rigid graph.Finally,simulation results are presented to show the effectiveness of the main results.

Capacity Research in Cluster-Based Underwater Wireless Sensor Networks Based on Stochastic Geometry

Underwater wireless sensor networks(UWSNs) have attracted wide attention in recent years.The capacity research on it is still in the initial stage,lacking adequate performance evaluation for network construction.This paper will focus on this subject by theoretical analysis and simulation,aiming to provide some insights for the actual UWSNs construction.According to the structure features of cluster-based UWSNs and the propagation characteristics of underwater acoustic signal,with the combination of signal to interference plus noise ratio,we define some capacity performance metrics,such as outage probability and transmission capacity.Based on the theory of stochastic geometry,a network capacity analytical model used in the cluster-based UWSNs is presented.The simulation results verify the validity of the theoretical analysis,and the cause of error between theoretical and simulation results has also been clearly explained.

Single Mobile Sink Based Energy Efficiency and Fast Data Gathering Protocol for Wireless Sensor Networks

Recently, the exponential rise in communication system demands has motivated global academia-industry to develop efficient communication technologies to fulfill energy efficiency and Quality of Service (QoS) demands. Wireless Sensor Network (WSN) being one of the most efficient technologies possesses immense potential to serve major communication purposes including civil, defense and industrial purposes etc. The inclusion of sensor-mobility with WSN has broadened application horizon. The effectiveness of WSNs can be characterized by its ability to perform efficient data gathering and transmission to the base station for decision process. Clustering based routing scheme has been one of the dominating techniques for WSN systems;however key issues like, cluster formation, selection of the number of clusters and cluster heads, and data transmission decision from sensors to the mobile sink have always been an open research area. In this paper, a robust and energy efficient single mobile sink based WSN data gathering protocol is proposed. Unlike existing approaches, an enhanced centralized clustering model is developed on the basis of expectation-maximization (EEM) concept. Further, it is strengthened by using an optimal cluster count estimation technique that ensures that the number of clusters in the network region doesn’t introduce unwanted energy exhaustion. Meanwhile, the relative distance between sensor node and cluster head as well as mobile sink is used to make transmission (path) decision. Results exhibit that the proposed EEM based clustering with optimal cluster selection and optimal dynamic transmission decision enables higher throughput, fast data gathering, minima delay and energy consumption, and higher

A New Method to Improve Performance of Cooperative Underwater Acoustic Wireless Sensor Networks via Frequency Controlled Transmission Based on Length of Data Links

In this paper a new method to improve performance of cooperative underwater acoustic (UWA) sensor networks will be introduced. The method is based on controlling and optimizing carrier frequencies which are used in data links between network nods. In UWA channels Pathloss and noise power spectrum density (psd) are related to carrier frequency. Therefore, unlike radio communications, in UWA Communications signal to noise ratio (SNR) is related to frequency besides propagation link length. In such channels an optimum frequency in whole frequency band and link lengths cannot be found. In Cooperative transmission, transmitter sends one copy of transmitted data packets to relay node. Then relay depending on cooperation scheme, amplifies or decodes each data packet and retransmit it to destination. Receiver uses and combines both received signals to estimate transmitted data. This paper wants to propose a new method to decrease network power consumptions by controlling and sub-optimizing transmission frequency based on link length. For this purpose, underwater channel parameters is simulated and analyzed in 1km to 10km lengths (midrange channel). Then link lengths sub categorized and in each category, optimum frequency is computed. With these sub optimum frequencies, sensors and base station can adaptively control their carrier frequencies based on link length and decrease network’s power consumptions. Finally Different Cooperative transmission schemes “Decode and Forward (DF)” and “Amplify and Forward (AF)”, are simulated in UWA wireless Sensor network with and without the new method. In receiver maximum ratio combiner (MRC) is used to combining received signals and making data estimations. Simulations show that the new method, called AFC cooperative UWA communication, can improve performance of underwater acoustic wireless sensor networks up to 40.14%.

Connectivity-Based Data Gathering with Path-Constrained Mobile Sink in Wireless Sensor Networks

The design of an effective and robust data gathering algorithm is crucial to the overall performance of wireless sensor networks (WSN). However, using traditional routing algorithms for data gathering is energy-inefficient for sensor nodes with limited power resources and multi-hop communication protocols. Data gathering with mobile sinks provided an effective solution to this problem. The major drawback of this approach is the time and path constraints of the mobile sink, which limit the mobile sink to collect data from all sensor nodes and, then, data routing is still required for these unreachable parts by the mobile sink. This paper presents a new data gathering algorithm called Connectivity-Based Data Collection (CBDC). The CBDC algorithm utilizes the connectivity between sensor nodes so as to determine the trajectory of the mobile sink whilst satisfying its path constraint and minimizing the number of multi-hop communications. The presented results show that CBDC, in comparison with the LEACH-C algorithm, prolongs the network life time at different connectivity levels of sensor networks, varying number of sensor nodes and at different path constraints of the mobile sink.

Cluster Based Secure Dynamic Keying Technique for Heterogeneous Mobile Wireless Sensor Networks

In Heterogeneous Wireless Sensor Networks, the mobility of the sensor nodes becomes essential in various applications. During node mobility, there are possibilities for the malicious node to become the cluster head or cluster member. This causes the cluster or the whole network to be controlled by the malicious nodes. To offer high level of security, the mobile sensor nodes need to be authenticated. Further, clustering of nodes improves scalability, energy efficient routing and data delivery. In this paper, we propose a cluster based secure dynamic keying technique to authenticate the nodes during mobility. The nodes with high configuration are chosen as cluster heads based on the weight value which is estimated using parameters such as the node degree, average distance, node's average speed, and virtual battery power. The keys are dynamically generated and used for providing security. Even the keys are compromised by the attackers, they are not able to use the previous keys to cheat or disuse the authenticated nodes. In addition, a bidirectional malicious node detection technique is employed which eliminates the malicious node from the network. By simulation, it is proved that the proposed technique provides efficient security with reduced energy consumption during node mobility.

A Three-Dimensional Range-Free Localization Algorithm Based on Mobile Beacons for Wireless Sensor Networks

In wireless sensor networks （WSNs） the position information of individual nodes is a matter of vital importance because allows the implementation of necessary network functions such as routing, querying and other applications. The objective of this paper is to propose an algorithm of three-dimensional distributed range-free localization for WSNs, using a mobile beacon （MB） equipped with a rotary and tilting directional antenna. This algorithm, denominated as the three-dimensional azimuthally defined area localization algorithm （3D- ADAL）, is executed in each sensor node and is based only on the analysis of the information received from the MB, therefore is energy efficient and contributes to extend the lifetime of the sensor network. Additionally the proposed algorithm has the advantage of being simple and economical. The simulation results show that the proposed algorithm is a practical, effective and accurate method for a three-dimensional location of sensor nodes in a WSN.

Localized Coverage Connectivity Based on Shape and Area Using Mobile Sensor Robots in Wireless Sensor Networks

A wireless sensor network (WSN) is spatially distributing independent sensors to monitor physical and environmental characteristics such as temperature, sound, pressure and also provides different applications such as battlefield inspection and biological detection. The Constrained Motion and Sensor (CMS) Model represents the features and explain k-step reach ability testing to describe the states. The description and calculation based on CMS model does not solve the problem in mobile robots. The ADD framework based on monitoring radio measurements creates a threshold. But the methods are not effective in dynamic coverage of complex environment. In this paper, a Localized Coverage based on Shape and Area Detection (LCSAD) Framework is developed to increase the dynamic coverage using mobile robots. To facilitate the measurement in mobile robots, two algorithms are designed to identify the coverage area, (i.e.,) the area of a coverage hole or not. The two algorithms are Localized Geometric Voronoi Hexagon (LGVH) and Acquaintance Area Hexagon (AAH). LGVH senses all the shapes and it is simple to show all the boundary area nodes. AAH based algorithm simply takes directional information by locating the area of local and global convex points of coverage area. Both these algorithms are applied to WSN of random topologies. The simulation result shows that the proposed LCSAD framework attains minimal energy utilization, lesser waiting time, and also achieves higher scalability, throughput, delivery rate and 8% maximal coverage connectivity in sensor network compared to state-of-art works.

A synchronous duty-cycled reservation based MAC protocol for underwater wireless sensor networks

To design an energy-efficient Medium Access Control(MAC)protocol for the Underwater Wireless Sensor Networks(UWSNs)is an urgent research issue since depleted batteries cannot be recharged or replaced in the underwater environment.Moreover,the underwater acoustic channels are affected by hindrances such as long propagation delay and limited bandwidth,which appear in the design of the MAC protocol for the UWSNs.The available MAC protocols for the terrestrial wireless sensor networks exhibit low performance in energy efficiency,throughput and reliability in the UWSNs,and cannot be used in the UWSNs directly because of their unique characteristics.This paper proposes a synchronous duty-cycled reservation-based MAC protocol named Ordered Contention MAC(OCMAC)protocol.The basic mechanism of this protocol is to schedule data transmission by transmitters through the scheduling of Ready To Send(RTS)frames.The protocol eliminates the possible collision during data transmission and improves communication efficiency.The paper analyzes the performance in energy efficiency,throughput and reliability of the protocol by modeling the queuing behavior of OCMAC with a Markov Chain process.Furthermore,the analytical model is validated through a simulation study.The analysis results demonstrated that while providing good throughput and reliability,OCMAC can achieve energy saving.

An Efficient Path Planning Strategy in Mobile Sink Wireless Sensor Networks

Wireless sensor networks (WSNs) are considered the backbone ofthe Internet of Things (IoT), which enables sensor nodes (SNs) to achieveapplications similarly to human intelligence. However, integrating a WSNwith the IoT is challenging and causes issues that require careful exploration.Prolonging the lifetime of a network through appropriately utilising energyconsumption is among the essential challenges due to the limited resourcesof SNs. Thus, recent research has examined mobile sinks (MSs), which havebeen introduced to improve the overall efficiency of WSNs. MSs bear theburden of data collection instead of consuming energy at the routeing bySNs. In a network, some areas generate more data through SNs that containfrequent, urgent messages. These messages carry sensitive data that must bedelivered immediately to user applications. Collecting such messages via MSs,especially on a large scale, increases delays, which are not tolerable in some realapplications. This issue has not been studied much. Thus, the present studyutilises the advantages of the priority parameter to concentrate on these areasand proposes a new model named ‘energy efficient path planning of MS-basedarea priority’ (EEPP-BAP). This method involves non-urgent and urgentmessages. It is comprised of four procedures. Initially, after SNs are distributedrandomly in a wide monitoring field, the monitoring field is partitionedinto equal zones according to priority, either differently or equally. Next isclustering based on the cluster head (CH) selected to perform the particleswarm optimisation algorithm (PSO). Then, the MS moves first to the zoneswith higher priority and less distance to perform the brain storm optimisationalgorithm. Finally, for urgent messages from the other zones at which theMS continues, the proposed approach establishes a routeing technique usingmulti-hop communication based on the MS position and using PSO. The proposed solution is aimed at delivering urgent messages to MSs free of latencyand with minimal packet loss. The simulation results proved that the EEPPBAP method can improve network performance compared with other modelsbased on different parameters that have been used to construct the controlledmovement of MSs in large-scale environments involving urgent messages. Theproposed method increased the average lifetime of SNs to 206.6% on average,reduced the average end-to-end delay to 7.1%, and increased the averagepacket delivery ratio to 36.9%.

New Localization Technique for Mobile Wireless Sensor Networks Using Sectorized Antenna

Recently, there has been much focus on mobile sensor networks, and we have even seen the development of small-profile sensing devices that are able to control their own movement. Although it has been shown that mobility alleviates several issues relating to sensor network coverage and connectivity, many challenges remain. Among these, the need for position estimation is perhaps the most important. It is too expensive to include a GPS receiver with every sensor node. Hence, localization schemes for sensor networks typically use a small number of seed nodes that know their location and protocols whereby other sensor nodes estimate their location from the messages they receive. In this paper, we propose a new technique to localize mobile sensor nodes using sectorized antenna. We consider that both sensor nodes and seeds are mobile, and argue that mobility can be exploited to improve the accuracy and precision of localization. It is tested extensively in a simulation environment and compared with other existing methods. The results of our experiments clearly indicate that our proposed approach can achieve a high accuracy without need of high density of seeds.

Data Collection Strategy in Low Duty Cycle Wireless Sensor Networks with Mobile Sink

The lifetime of wireless sensor networks can be improved by imposing low duty cycle, but doing so could not solve unbalanced energy consumption and will increase transmission latency. To avoid this, this paper gives a new method to collect data by mobile sink. The proper data collection route is selected according to the sink speed and buffer size of the sensors. The sensors only wake up when the sink approaches them. When certain sensors detect an emergency, the sink catches the message quickly and moves to the hotspot to decrease message relay in the network. The result of simulation by OPNET shows that this protocol can reduce transmission data in the network and prolong the network lifetime.