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.

Delay and Capacity Trade-offs in Mobile Wireless Networks with Infrastructure Support

In this paper,we investigate the trade-offs between delay and capacity in mobile wireless networks with infrastructure support.We consider three different mobility models,independent and identically distributed （i.i.d） mobility model,random walk mobility model with constant speed and L＇evy flight mobility model.For i.i.d mobility model and random walk mobility model with the speed θ（1/n～（1/2））,,we get the theoretical results of the average packet delay when capacityis θ（1）,θ（1/n～（1/2）） individually,where n is the number of nodes.We find that the optimal average packet delay is achieved whencapacity λ（n） 〈（1/（2.n.log_2（1/（（1-e）-（k/n））＋1））,where K is the number of gateways.It is proved that average packet delay D（n） dividedby capacity λ（n） is bounded below by （n/（k·w））.When ω（n～（1/2））≤KO（n（（1-η）·（α＋1））/2）ln n） when K=o（n～η）（0≤η〈1）.We also provethat when ω（1/2）≤K）.

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.

Lightweight Key Management Scheme Using Fuzzy Extractor for Wireless Mobile Sensor Network

The mature design of wireless mobile sensor network makes it to be used in vast verities of applications including from home used to the security surveillance.All such types of applications based on wireless mobile sensor network are generally using real time data,most of them are interested in real time communication directly from cluster head of cluster instead of a base station in cluster network.This would be possible if an external user allows to directly access real time data from the cluster head in cluster wireless mobile sensor network instead of accessing data from base station.But this leads to a serious security breach and degrades the performance of any security protocol available in this domain.Most existing schemes for authentication and cluster key management for external users,exchange a number of messages between cluster head and base station to allow external to access real time data from the base station instead of cluster head.This increase communication cost and delay in such real time access information.To handle this critical issue in cluster wireless mobile sensor network,we propose a lightweight authentication and key management scheme using a fuzzy extractor.In this scheme,any external user can access data directly from the cluster head of any cluster without the involvement of the base station.The proposed scheme only uses the one-way hash functions and bitwise XOR operations,apart from the fuzzy extractor method for the user biometric verification at the login phase.The presented scheme supports scalability for an increasing number of nodes using polynomials.The proposed scheme increases the life-time of the network by decreasing the key pool size.

Packet Drop Battling Mechanism for Energy Aware Detection in Wireless Networks

Network security and energy consumption are deemed to be two important components of wireless and mobile ad hoc networks(WMANets).There are various routing attacks which harm Ad Hoc networks.This is because of the unsecure wireless communication,resource constrained capabilities and dynamic topology.In order to cope with these issues,Ad Hoc On-Demand Distance Vector(AODV)routing protocol can be used to remain the normal networks functionality and to adjust data transmission by defending the networks against black hole attacks.The proposed system,in this work,identifies the optimal route from sender to collector,prioritizing the number of jumps,the battery life,and security,which are fundamental prerequisites.Researches have proposed various plans for detecting the shortest route,as well as ensuring energy conversions and defense against threats and attacks.In this regard,the packet drop attack is one of the most destructive attack against WMANet communication and hence merits special attention.This type of attack may allow the attacker to take control of the attacked hubs,which may lost packets or transmitted information via a wrong route during the packets journey from a source hub to a target one.Hence,a new routing protocol method has been proposed in this study.It applies the concept of energy saving systems to conserve energy that is not required by the system.The proposed method for energy aware detection and prevention of packet drop attacks in mobile ad hoc networks is termed the Ad Hoc On-Demand and Distance Vector–Packet Drop Battling Mechanism(AODV–PDBM).

Detecting and adaptive responding mechanism for mobile WSN

Mobile wireless sensor network(WSN)composed by mobile terminals has a dynamic topology and can be widely used in various fields.However,the lack of centralized control,dynamic topology and limited energy supply make the network layer of mobile WSN be vulnerable to multiple attacks,such as black hole(BH),gray hole(GH),flooding attacks(FA)and rushing attacks(RU).Existing researches on intrusion attacks against mobile WSN,currently,tend to focus on targeted detection of certain types of attacks.The defense methods also have clear directionality and is unable to deal with indeterminate intrusion attacks.Therefore,this work will design an indeterminate intrusion attack oriented detecting and adaptive responding mechanism for mobile WSN.The proposed mechanism first uses a test sliding window(TSW)to improve the detecting accuracy,then constructs parameter models of confidence on attack(COA),network performance degradation(NPD)and adaptive responding behaviors list,finally adaptively responds according to the decision table,so as to improve the universality and flexibility of the detecting and adaptive responding mechanism.The simulation results show that the proposed mechanism can achieve multiple types of intrusion detecting in multiple attack scenarios,and can achieve effective response under low network consumption.

Cooperative distributed target tracking algorithm in mobile wireless sensor networks

The paper proposes a cooperative distributed target tracking algorithm in mobile wireless sensor networks.There are two main components in the algorithm:distributed sensor-target assignment and sensor motion control.In the key idea of the sensor-target assignment,sensors are considered as autonomous agents and the defined objective function of each sensor concentrates on two fundamental factors:the tracking accuracy and the tracking cost.Compared with the centralized algorithm and the noncooperative distributed algorithm,the proposed approach will not only lead to reasonable measuring performance but also benefit system with low computational complexity and communication energy.Also,a sensor motion algorithm based on gradient control is presented in the paper to trace the targets to reduce tracking error.Simulation results show that the cooperative distributed sensor assignment algorithm has advantages over the centralized algorithm without sacrificing much tracking performance.

A New Protocol for the Detection of Node Replication Attacks in Mobile Wireless Sensor Networks

Wireless sensor networks （WSNs） are often deployed in harsh environments. Thus adversaries can capture some nodes, replicate them and deploy those replicas back into the strategic positions in the network to launch a variety of attacks. These are referred to as node replication attacks. Some methods of defending against node replication attacks have been proposed, yet they are not very suitable for the mobile wireless sensor networks. In this paper, we propose a new protocol to detect the replicas in mobile WSNs. In this protocol, polynomial-based pair-wise key pre-distribution scheme and Counting Bloom Filters are used to guarantee that the replicas can never lie about their real identifiers and collect the number of pair-wise keys established by each sensor node. Replicas are detected by looking at whether the number of pair-wise keys established by them exceeds the threshold. We also derive accurate closed form expression for the expected number of pair-wise keys established by each node, under commonly used random waypoint model. Analyses and simulations verify that the protocol accurately detects the replicas in the mobile WSNs and supports their removal.

QoS multicast routing protocol in hierarchical wireless MANET

A wireless MANET is a self-configurable network in which mobile, battery-powered devices dynamically create and change the network topology without relying on any intrastructure or administrative support. It offers unique benefits for certain environments, but there are still several open issues to be resolved before realizing these benefits, including QoS routing, multicasting, and mobility management. Specifically, an efficient QoS multicast routing protocol is needed, This paper presents a hierarchical QoS multicast routing protocol （QMRP） for mobile ad hoc networks. It can provide QoS-sensitive routes in a scalable and flexible way, in the network environment with mobility. In the proposed QMRP scheme, each local node only needs to maintain local multicast routing information and/or summary information of other clusters （or domains） but does not require any global ad hoc network states to be maintained. The QMRP also allows any ad hoc group member to join/leave the multicast group dynamically and supports multiple QoS constraints. This paper presents formal description and main procedures for realizing routing decision process of the QMRP and the proof of correctness and complexity analysis of the protocol. The performance measures of QMRP are evaluated using simulation. The simulation results verify the efficiency and availability of QMRP.

Collaborative Mobile Charging and Coverage

Wireless energy charging using mobile vehicles has been a viable research topic recently in the area of wireless networks and mobile computing. This paper gives a short survey of recent research conducted in our research group in the area of collaborative mobile charging. In collaborative mobile charging, multiple mobile chargers work together to accomplish a given set of ob jectives. These ob jectives include charging sensors at different frequencies with a minimum number of mobile chargers and reaching the farthest sensor for a given set of mobile chargers, subject to various constraints, including speed and energy limits of mobile chargers. Through the process of problem formulation, solution construction, and future work extension for problems related to collaborative mobile charging and coverage, we present three principles for good practice in conducting research. These principles can potentially be used for assisting graduate students in selecting a research problem for a term project, which can eventually be expanded to a thesis/dissertation topic.

Distributed Algorithms for Event Reporting in Mobile-Sink WSNs for Internet of Things

Wireless Sensor Networks（WSNs） have many applications, such as climate monitoring systems, fire detection, smart homes, and smart cities. It is expected that WSNs will be integrated into the Internet of Things（IoT）and participate in various tasks. WSNs play an important role monitoring and reporting environment information and collecting surrounding context. In this paper we consider a WSN deployed for an application such as environment monitoring, and a mobile sink which acts as the gateway between the Internet and the WSN. Data gathering is a challenging problem in WSNs and in the IoT because the information has to be available quickly and effectively without delays and redundancies. In this paper we propose several distributed algorithms for composite event detection and reporting to a mobile sink. Once data is collected by the sink, it can be shared using the IoT infrastructure. We analyze the performance of our algorithms using WSNet simulator, which is specially designed for event-based WSNs. We measure various metrics such as average residual energy, percentage of composite events processed successfully at the sink, and the average number of hops to reach the sink.

BGMM： A Body Gauss-Markov Based Mobility Model for Body Area Networks

Existing mobility models have limitations in their ability to simulate the movement of Wireless Body Area Network（WBAN） since body nodes do not exactly follow either classic mobility models or human contact distributions. In this paper, we propose a new mobility model called Body Gauss–Markov Mobility（BGMM） model,which is oriented specially to WBAN. First, we present the random Gauss-Markov mobility model as the most suitable theoretical basis for developing our new model, as its movement pattern can reveal real human body movements. Next, we examine the transfer of human movement states and derive a simplified mathematical Human Mobility Model（HMM）. We then construct the BGMM model by combining the RGMM and HMM models. Finally,we simulate the traces of the new mobility model. We use four direct metrics in our proposed mobility model to evaluate its performance. The simulation results show that the proposed BGMM model performs with respect to the direct mobility metrics and can effectively represent a general WBAN-nodes movement pattern.

A Comparison of Mamdani and Sugeno Fuzzy Based Packet Scheduler for MANET with a Realistic Wireless Propagation Model

The mobile nature of the nodes in a wireless mobile ad-hoc network(MANET) and the error prone link connectivity between nodes pose many challenges. These include frequent route changes, high packet loss, etc. Such problems increase the end-toend delay and decrease the throughput. This paper proposes two adaptive priority packet scheduling algorithms for MANET based on Mamdani and Sugeno fuzzy inference system. The fuzzy systems consist of three input variables: data rate, signal-to-noise ratio(SNR) and queue size. The fuzzy decision system has been optimised to improve its efficiency. Both fuzzy systems were verified using the Matlab fuzzy toolbox and the performance of both algorithms were evaluated using the riverbed modeler(formally known as OPNET modeler). The results were compared to an existing fuzzy scheduler under various network loads, for constant-bit-rate(CBR) and variable-bit-rate(VBR) traffic. The measuring metrics which form the basis for performance evaluation are end-to-end delay, throughput and packet delivery ratio. The proposed Mamdani and Sugeno scheduler perform better than the existing scheduler for CBR traffic. The end-to-end delay for Mamdani and Sugeno scheduler was reduced by an average of 52 % and 54 %, respectively.The performance of the throughput and packet delivery ratio for CBR traffic are very similar to the existing scheduler because of the characteristic of the traffic. The network was also at full capacity. The proposed schedulers also showed a better performance for VBR traffic. The end-to-end delay was reduced by an average of 38 % and 52 %, respectively. Both the throughput and packet delivery ratio(PDR) increased by an average of 53 % and 47 %, respectively. The Mamdani scheduler is more computationally complex than the Sugeno scheduler, even though they both showed similar network performance. Thus, the Sugeno scheduler is more suitable for real-time applications.