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.

Computation Rate Maximization in Multi-User Cooperation-Assisted Wireless-Powered Mobile Edge Computing with OFDMA

In the era of Internet of Things(Io T),mobile edge computing(MEC)and wireless power transfer(WPT)provide a prominent solution for computation-intensive applications to enhance computation capability and achieve sustainable energy supply.A wireless-powered mobile edge computing(WPMEC)system consisting of a hybrid access point(HAP)combined with MEC servers and many users is considered in this paper.In particular,a novel multiuser cooperation scheme based on orthogonal frequency division multiple access(OFDMA)is provided to improve the computation performance,where users can split the computation tasks into various parts for local computing,offloading to corresponding helper,and HAP for remote execution respectively with the aid of helper.Specifically,we aim at maximizing the weighted sum computation rate(WSCR)by optimizing time assignment,computation-task allocation,and transmission power at the same time while keeping energy neutrality in mind.We transform the original non-convex optimization problem to a convex optimization problem and then obtain a semi-closed form expression of the optimal solution by considering the convex optimization techniques.Simulation results demonstrate that the proposed multi-user cooperationassisted WPMEC scheme greatly improves the WSCR of all users than the existing schemes.In addition,OFDMA protocol increases the fairness and decreases delay among the users when compared to TDMA protocol.

Machine Learning for 5G and Beyond:From ModelBased to Data-Driven Mobile Wireless Networks

During the past few decades,mobile wireless communications have experienced four generations of technological revolution,namely from 1 G to 4 G,and the deployment of the latest 5 G networks is expected to take place in 2019.One fundamental question is how we can push forward the development of mobile wireless communications while it has become an extremely complex and sophisticated system.We believe that the answer lies in the huge volumes of data produced by the network itself,and machine learning may become a key to exploit such information.In this paper,we elaborate why the conventional model-based paradigm,which has been widely proved useful in pre-5 G networks,can be less efficient or even less practical in the future 5 G and beyond mobile networks.Then,we explain how the data-driven paradigm,using state-of-the-art machine learning techniques,can become a promising solution.At last,we provide a typical use case of the data-driven paradigm,i.e.,proactive load balancing,in which online learning is utilized to adjust cell configurations in advance to avoid burst congestion caused by rapid traffic changes.

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.

A Wireless Intrusion Alerts Clustering Method for Mobile Internet

With the rapid development of mobile Internet, people pay increasing attention to the wireless network security problem. But due to the specificity of the wireless network, at present it is rare to see the research of wireless intrusion alerts clustering method for mobile Internet. This paper proposes a Wireless Intrusion Alert Clustering Method(WIACM) based on the information of the mobile terminal. The method includes alert formatting, alert reduction and alert classification. By introducing key information of the mobile terminal device, this method aggregates the original alerts into hyper alerts. The experimental results show that WIACM would be appropriate for real attack scenarios of mobile Internet, and reduce the amount of alerts with more accuracy of alert analysis.

Node deployment strategy optimization for wireless sensor network with mobile base station

The optimization of network performance in a movement-assisted data gathering scheme was studied by analyzing the energy consumption of wireless sensor network with node uniform distribution. A theoretically analytical method for avoiding energy hole was proposed. It is proved that if the densities of sensor nodes working at the same time are alternate between dormancy and work with non-uniform node distribution. The efficiency of network can increase by several times and the residual energy of network is nearly zero when the network lifetime ends.

Energy-Efficient Transmission Scheme for Mobile Data Gathering in Wireless Sensor Networks

Energy conservation in Wireless Sensor Networks (WSNs) has always been a crucial issue and has received increased attention in the recent years. A transmission scheme for energy-constrained WSNs is proposed in this paper. The scheme, called MIHOP (MIMO and Multi-hop), combines cluster-based virtual MIMO and multi-hop technologies. The multihop mode is employed in transmitting data when the related sensors are located within a specific number of hops from the sink, and the virtual MIMO mode is used in transmitting data from the remaining sensor nodes. We compare the energy consumption of different transmission schemes and propose an algorithm for determining the optimal hop count in MIHOP. A controllable mobile sink that reduces the energy consumed in sensor transmission is also adopted for data collection. The theoretical analysis and the Monte Carlo simulation demonstrate that the proposed scheme significantly outperforms individual virtual MIMO, multi-hop technologies, and double-string networks in terms of energy conservation. The energy consumption levels under the MIHOP scheme are approximately 12.98%, 47.55% and 48.30% less than that under virtual MIMO schemes, multi-hop networks and doublestring networks, respectively.

Online Computation Offloading and Trajectory Scheduling for UAV-Enabled Wireless Powered Mobile Edge Computing

The unmanned aerial vehicle(UAV)-enabled mobile edge computing(MEC) architecture is expected to be a powerful technique to facilitate 5 G and beyond ubiquitous wireless connectivity and diverse vertical applications and services, anytime and anywhere. Wireless power transfer(WPT) is another promising technology to prolong the operation time of low-power wireless devices in the era of Internet of Things(IoT). However, the integration of WPT and UAV-enabled MEC systems is far from being well studied, especially in dynamic environments. In order to tackle this issue, this paper aims to investigate the stochastic computation offloading and trajectory scheduling for the UAV-enabled wireless powered MEC system. A UAV offers both RF wireless power transmission and computation services for IoT devices. Considering the stochastic task arrivals and random channel conditions, a long-term average energyefficiency(EE) minimization problem is formulated.Due to non-convexity and the time domain coupling of the variables in the formulated problem, a lowcomplexity online computation offloading and trajectory scheduling algorithm(OCOTSA) is proposed by exploiting Lyapunov optimization. Simulation results verify that there exists a balance between EE and the service delay, and demonstrate that the system EE performance obtained by the proposed scheme outperforms other benchmark schemes.

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.

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.

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

Always-optimally-coordinated candidate selection algorithm for peer-to-peer files sharing system in mobile self-organized networks

In order to improve the performance of peer-to-peer files sharing system under mobile distributed en- vironments, a novel always-optimally-coordinated （AOC） criterion and corresponding candidate selection algorithm are proposed in this paper. Compared with the traditional min-hops criterion, the new approach introduces a fuzzy knowledge combination theory to investigate several important factors that influence files transfer success rate and efficiency. Whereas the min-hops based protocols only ask the nearest candidate peer for desired files, the selection algorithm based on AOC comprehensively considers users＇ preferences and network requirements with flexible balancing rules. Furthermore, its advantage also expresses in the independence of specified resource discovering protocols, allowing for scalability. The simulation results show that when using the AOC based peer selection algorithm, system performance is much better than the rain-hops scheme, with files successful transfer rate improved more than 50% and transfer time re- duced at least 20%.

Optimization of an Underwater Wireless Sensor Network Architecture with Wave Glider as a Mobile Gateway

This paper presents an original probabilistic model of a hybrid underwater wireless sensor network(UWSN),which includes a network of stationary sensors placed on the seabed and a mobile gateway.The mobile gateway is a wave glider that collects data from the underwater network segment and retransmits it to the processing center.The authors consider the joint problem of optimal localization of stationary network nodes and the corresponding model for bypassing reference nodes by a wave glider.The optimality of the network is evaluated according to the criteria of energy efficiency and reliability.The influence of various physical and technical parameters of the network on its energy efficiency and on the lifespan of sensor nodes is analyzed.The analysis is carried out for networks of various scales,depending on the localization of stationary nodes and the model of bypassing the network with a wave glider.As a model example,the simulation of the functional characteristics of the network for a given size of the water area is carried out.It is shown that in the case of a medium-sized water area,the model of“bypassing the perimeter”by a wave glider is practically feasible,energy efficient and reliable for hourly data measurements.In the case of a large water area,the cluster bypass model becomes more efficient.

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.

Balanced energy-efficient relay selection scheme in wireless mobile relay networks

In order to resolve the relay selection problem in wireless mobile relay networks （WMRNs）, a novel balanced energy-efficient mobile relay selection scheme is proposed in this paper. Compared with traditional counter-based algorithm, distance and energy consumption are considered from network respect to provide a better network lifetime performance in the proposed scheme. Also, it performs well when nodes move freely at high speed. A random assessment delay （RAD） mechanism is added to avoid collisions and improve transmission efficiency. Simulation results reveal that, the proposed scheme has advantages in prolonging network lifetime, balancing energy compared with existing counter-based scheme. consumption and reducing the total energy consumption

A New Dynamic Self-Organizing Method for Mobile Robot Environment Mapping

To solve the mapping problem for the mobile robots in the unknown environment, a dynamic growing self-organizing map with growing-threshold tuning automatically algorithm (DGSOMGT) based on Self-organizing Map is proposed. It introduces a value of spread factor to describe the changing process of the growing threshold dynamically. The method realizes the network structure growing by training through mobile robot movement constantly in the unknown environment. The proposed algorithm is based on self-organizing map and can adjust the growing-threshold value by the number of network neurons increasing. It avoids tuning the parameters repeatedly by human. The experimental results show that the proposed method detects the complex environment quickly, effectively and correctly. The robot can realize environment mapping automatically. Compared with the other methods the proposed mapping strategy has better topological properties and time property.

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.

Resonant-Inductive Wireless Power Transfer for Autonomous Mobile Robots

Due to the increasing commercial interest in autonomy and sustainability,this paper reviews and presents a comprehensive summary of the resonant-inductive power transmission(RPT)technology for autonomous mobile robots.It outlines historic and recent research activities in wireless power transmission,covering the fundamental operation of microwave,capacitive and inductive power transfer technologies,state-of-the-art developments in RPT for high-power applications,current design and health standards,technological drawbacks,and possible future trends.In this paper,coupling-enhanced pad designs,adaptive tuning techniques,compensation network designs,and control techniques are explored.Major design issues such as coupling variation,frequency splitting,and bifurcation are reviewed.The difference between maximum power transfer and maximum energy efficiency is highlighted.Human exposure guidelines are summarized from documentations provided by the Institute of Electrical and Electronics Engineers(IEEE)and the International Commission on Non-ionizing Radiation Protection(ICNIRP).Other standards like WPC’s Qi and Airfuel design standards are also summarized.Finally,the possible trends of the relevant research and development,particularly dynamic charging,are discussed.The intention of this review is to encourage designs that will relieve robot operators of the burden of frequent manual recharging,and to reduce downtime and increase the productivity of autonomous mobile robots in industrial environments.

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.