Network resilience in low-resource mobile wireless sensor networks

Wireless sensor networks (WSNs) are deployed in numerous mission critical applications in which the network needs to remain active for as long as possible while delivering quality information to a base station. However, WSNs suffer from a wide range of attacks due to their limited processing and energy capabilities. Their resiliency, however, depends on fast recovery from such attacks being achieved. In recent work, the authors developed and implemented clustering, reprogramming and authentication protocols involved in recovering stationary WSNs with low resources. In this paper, we determine the additional resources required in implementing these protocols in a mobile WSN.

We present recovery protocols on TinyOS motes for a low-resourced, mobile deployment. We describe the issues we encountered in the implementation. We present times, RAM and ROM needed to run the recovery protocols and compare these with the stationary case, demonstrating that the additional cost of reprogramming in a mobile WSN is less than 25% of that in a stationary WSN and the additional cost of re-clustering in a mobile WSN is less than 9% of that in a stationary WSN. Authentication has an insignificant cost increase.

Hierarchical workflow management in wireless sensor network

To build the service-oriented applications in a wireless sensor network (WSN), the workflow can be utilized to compose a set of atomic services and execute the corresponding pre-designed processes. In general, WSN applications rely closely on the sensor data which are usually inaccurate or even incomplete in the resource-constrained WSN. Then, the erroneous sensor data will affect the execution of atomic services and furthermore the workflows, which form an important part in the bottom-to-up dynamics of WSN applications. In order to alleviate this issue, it is necessary to manage the workflow hierarchically. However, the hierarchical workflow management remains an open and challenging problem. In this paper, by adopting the Bloom filter as an effective connection between the sensor node layer and the upper application layer, a hierarchical workflow management approach is proposed to ensure the QoS of workflow-based WSN application . The case study and experimental evaluations demonstrate the capability of the proposed approach.

Fuzzy logic optimized wireless sensor network routing protocol

Wireless sensor networks (WSNs) are used in health monitoring, tracking and security applications. Such networks transfer data from specific areas to a nominated destination. In the network, each sensor node acts as a routing element for other sensor nodes during the transmission of data. This can increase energy consumption of the sensor node. In this paper, we propose a routing protocol for improving network lifetime and performance. The proposed protocol uses type-2 fuzzy logic to minimize the effects of uncertainty produced by the environmental noise. Simulation results show that the proposed protocol performs better than a recently developed routing protocol in terms of extending network lifetime and saving energy and also reducing data packet lost.

A block-aware hybrid data dissemination with hotspot elimination in wireless sensor network

As a significant milestone in the data dissemination of wireless sensor networks (WSNs), the comb-needle (CN) model was developed to dynamically balance the sensor data pushing and pulling during hybrid data dissemination. Unfortunately, the hybrid push-pull data dissemination strategy may overload some sensor nodes and form the hotspots that consume energy significantly. This usually leads to the collapse of the network at a very early stage. In the past decade, although many energy-aware dynamic data dissemination methods have been proposed to alleviate the hotspots issue, the block characteristic of sensor nodes has been overlooked and how to offload traffic from hot blocks with low energy through long-distance hybrid dissemination remains an open problem. In this paper, we developed a block-aware data dissemination model to balance the inter-block energy and eliminate the spreading of intra-block hotspots. Through the clustering mechanism based on geography and energy, "similar" large-scale sensor nodes can be efficiently grouped into specific blocks to form the global block information (GBI). Based on GBI, the long-distance block-cross hybrid algorithms are further developed by effectively aggregating inter-block and intra-block data disseminations. Extensive experimental results demonstrate the capability and the efficiency of the proposed approach. © 2014 Elsevier Ltd.

Clustering versus evenly distributing energy dissipation in wireless sensor routing for prolong network lifetime

A novel Cluster Heads (CH) choosing algorithm based on both Minimal Spanning Tree and Maximum Energy resource on sensors, named MSTME, is provided for prolonging lifetime of wireless sensor networks. MSTME can satisfy three principles of optimal CHs: to have the most energy resource among sensors in local clusters, to group approximately the same number of closer sensors into clusters, and to distribute evenly in the networks in terms of location. Simulation shows the network lifetime in MSTME excels its counterparts in two-hop and multi-hop wireless sensor networks.

Network lifetime of application-specific randomly deployed wireless sensor networks in arbitrary sensor density

In many cases, sensors are randomly deployed in Wireless Sensor Networks (WSN), called Sensor-Randomly-Deployed WSN (SRD WSN). Several cluster-based routing protocols are provided to maximize network lifetime of SRD WSN in different sensor densities. LEACH performs better than direct routing in the density of 0.01. BCDCP excels LEACH in the density of 0.05. DMSTRP outperforms LEACH and BCDCP in the density of. However, simulation results under one or two kinds of sensor densities are not strong enough to prove the optimum of the routing protocols. In this paper, we give the general formulas to compute the network lifetimes of the above three routing protocols, discuss their optimal number of clusters, and compare their optimal network lifetime in arbitrary sensor densities. These formulas can provide more general design guidelines applicable to SRD WSN than simulation results under only one or two kinds of sensor densities. © 2007 IEEE.

Energy-efficiency analysis of cluster-based routing protocols in wireless sensor network

This paper extends the conditions of the cluster-based routing protocols in terms of general algorithm complexity of data fusion, general compressing ratio of data fusion, and network area with long distance. Corresponding three general evaluation methods to evaluate the energy efficiency of the cluster-based routing protocols such as LEACH, PEGASIS, and BCDCP are provided. Moreover, three facts are found in them: (1) High-level software energy macro model is used to compute the energy dissipation of general data fusion software and make the constant value of energy dissipation of 1-bit data fusion an especial instance. (2) Multi-hop energy efficiency is related to the radio hardware parameters and the dynamic topology of network and the above protocols do not exploit the best use of the energy efficiency of multi-hop scheme. (3) High-energy dissipation non-cluster-head nodes, whose number changes with the density of the sensor nodes in clusters, worsen the death of nodes. The numerical results of experiments reprove these discoveries. Furthermore, they provide helpful guide for improving the above routing protocols to extent their application ranges.

Speed control and policing in a cellular mobile network: speedNet

In this paper, we describe SpeedNet, a GSM network variant which resembles an ad hoc wireless mobile network where base stations keep track of the velocities of mobile users (cars). SpeedNet is intended to track mobile users and their speed passively for both speed policing and control of traffic. The speed of the vehicle is controlled in a speed critical zone by means of an electro-mechanical control system, suitably referred to as VVLS (Vehicular Velocity Limiting System). VVLS is mounted on the vehicle and responds to the command signals generated by the base station. It also determines the next base station to handoff, in order to improve the connection reliability and bandwidth efficiency of the underlying network. Robust Extended Kalman Filter (REKF) is used as a passive velocity estimator of the mobile user with the widely used proportional and integral controller speed control. We demonstrate through simulation and analysis that our prediction algorithm can successfully estimate the mobile user’s velocity with low system complexity as it requires two closest mobile base station measurements and also it is robust against system uncertainties due to the inherent deterministic nature in the mobility model.

End-to-end QoS framework for heterogeneous wired-cum-wireless networks

With information access becoming more and more ubiquitous, there is a need for providingQoSsupport for communication that spans wired and wireless networks. For the wired side, RSVP/SBM has been widely accepted as a flow reservation scheme in IEEE 802 style LANs. Thus, it would be desirable to investigate the integration of RSVP and a flow reservation scheme in wireless LANs, as an end-to-end solution for QoS guarantee in wired-cum-wireless networks. For this purpose, we propose WRESV, a lightweight RSVPlike flow reservation and admission control scheme for IEEE 802.11 wireless LANs. Using WRESV, wired/wireless integration can be easily implemented by cross-layer interaction at the Access Point. Main components of the integration are RSVP-WRESV parameter mapping and the initiation of new reservation messages, depending on where senders/receivers are located. In addition, to support smooth roaming of mobile users among different basic service sets (BSS), we devise an efficient handoff scheme that considers both the flow rate demand and network resource availability for continuous QoS support. Furthermore, various optimizations for supporting multicast session and QoS re-negotiation are proposed for better performance improvement. Extensive simulation results showthat the proposed scheme is promising in enriching the QoS support of multimedia applications in heterogeneous wired-cum-wireless networks.

User mobility prediction in hybrid and ad hoc wireless networks

Next Generation Networks will employ hybrid network architectures using both cellular and ad hoc networking concepts. The vision of real-time
multimedia services requires that mobility management be addressed in a proactive manner. If the user movements can be predicted accurately in a
hybrid network environment then handoff/cluster change, resource reservation and context transfer procedures can be efficiently completed as required by node mobility. In this work we propose a sectorized ad hoc mobility prediction scheme for cluster change prediction. Simulation study of the scheme shows it to be efficient in terms of prediction accuracy and prediction related control overhead despite randomness in user movement.

Mobility prediction for seamless mobility in wireless networks

One of the requirements for seamless mobility is efficient resource reservation and context transfer procedures during handoff. If context transfer and resource reservation can occur prior to handoff continuation of the same level of service as at the previous connection point is possible. Resource reservation is required to be non-aggressive for optimal use of limited bandwidth and a low call-blocking probability. In this work we present a method of mobility prediction that can aid in achieving seamless mobility. In order to optimise the efficiency of a resource reservation algorithm we believe accurate prediction of the future movements of the user is required.

A review on current work in mobility prediction for wireless networks

The vision of next generation networks (4G & beyond) is to make possible seamless mobility across heterogeneous networks and to support real-time multimedia services. This would require intra/inter-domain handovers and service reconfiguration procedures to be completed with minimum latency. Mobility Prediction has been identified as a key abettor to this goal. The increasing ease of coupling between the mobile user and the network requires that a mobility prediction scheme that is to be deployed in next generation networks be capable of high levels of prediction accuracy despite randomness in user movement. In this work we have presented a survey on mobility prediction schemes that have been proposed for wireless networks. The results of our simulation study focused on the robustness of different schemes to randomness in user movement are also presented.