Improved Fair-Zone technique using Mobility Prediction in WSN

The self-organizational ability of ad-hoc Wireless Sensor Networks (WSNs) has led them to be the most popular choice in ubiquitous computing. Clustering sensor nodes organizing them hierarchically have proven to be an effective method to provide better data aggregation and scalability for the sensor network while conserving limited energy. It has some limitation in energy and mobility of nodes. In this paper we propose a mobility prediction technique which tries overcoming above mentioned problems and improves the life time of the network. The technique used here is Exponential Moving Average for online updates of nodal contact probability in cluster based network.Comment: 10 pages, 7 figures, Published in International Journal Of Advanced Smart Sensor Network Systems (IJASSN

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Wireless Sensor Networks

The aim of this book is to present few important issues of WSNs, from the application, design and technology points of view. The book highlights power efficient design issues related to wireless sensor networks, the existing WSN applications, and discusses the research efforts being undertaken in this field which put the reader in good pace to be able to understand more advanced research and make a contribution in this field for themselves. It is believed that this book serves as a comprehensive reference for graduate and undergraduate senior students who seek to learn latest development in wireless sensor networks

Resource Optimization in Wireless Sensor Networks for an Improved Field Coverage and Cooperative Target Tracking

There are various challenges that face a wireless sensor network (WSN) that mainly originate from the limited resources a sensor node usually has. A sensor node often relies on a battery as a power supply which, due to its limited capacity, tends to shorten the life-time of the node and the network as a whole. Other challenges arise from the limited capabilities of the sensors/actuators a node is equipped with, leading to complication like a poor coverage of the event, or limited mobility in the environment. This dissertation deals with the coverage problem as well as the limited power and capabilities of a sensor node. In some environments, a controlled deployment of the WSN may not be attainable. In such case, the only viable option would be a random deployment over the region of interest (ROI), leading to a great deal of uncovered areas as well as many cutoff nodes. Three different scenarios are presented, each addressing the coverage problem for a distinct purpose. First, a multi-objective optimization is considered with the purpose of relocating the sensor nodes after the initial random deployment, through maximizing the field coverage while minimizing the cost of mobility. Simulations reveal the improvements in coverage, while maintaining the mobility cost to a minimum. In the second scenario, tracking a mobile target with a high level of accuracy is of interest. The relocation process was based on learning the spatial mobility trends of the targets. Results show the improvement in tracking accuracy in terms of mean square position error. The last scenario involves the use of inverse reinforcement learning (IRL) to predict the destination of a given target. This lay the ground for future exploration of the relocation problem to achieve improved prediction accuracy. Experiments investigated the interaction between prediction accuracy and terrain severity. The other WSN limitation is dealt with by introducing the concept of sparse sensing to schedule the measurements of sensor nodes. A hybrid WSN setup of low and high precision nodes is examined. Simulations showed that the greedy algorithm used for scheduling the nodes, realized a network that is more resilient to individual node failure. Moreover, the use of more affordable nodes stroke a better trade-off between deployment feasibility and precision

Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey

Wireless sensor networks (WSNs) consist of autonomous and resource-limited devices. The devices cooperate to monitor one or more physical phenomena within an area of interest. WSNs operate as stochastic systems because of randomness in the monitored environments. For long service time and low maintenance cost, WSNs require adaptive and robust methods to address data exchange, topology formulation, resource and power optimization, sensing coverage and object detection, and security challenges. In these problems, sensor nodes are to make optimized decisions from a set of accessible strategies to achieve design goals. This survey reviews numerous applications of the Markov decision process (MDP) framework, a powerful decision-making tool to develop adaptive algorithms and protocols for WSNs. Furthermore, various solution methods are discussed and compared to serve as a guide for using MDPs in WSNs

Design of implicit routing protocols for large scale mobile wireless sensor networks

Strathclyde theses - ask staff. Thesis no. : T13189Most developments in wireless sensor networks (WSNs) routing protocols address static network scenarios. Schemes developed to manage mobility in other mobile networking implementations do not translate effectively to WSNs as the system design parameters are markedly different. Thus this research focuses on the issues of mobility and scalability in order to enable the full potential of WSNs to self-organise and co-operate and in so doing, meet the requirements of a rich mix of applications. In the goal of designing efficient, reliable routing protocols for large scale mobile WSN applications, this work lays the foundation by firstly presenting a strong case supported by extensive simulations, for the use of implicit connections. Then two novel implicit routing protocols - Virtual Grid Paging (VGP) and Virtual Zone Registration and Paging (VZRP) - that treat packet routing from node mobility and network scalability viewpoints are designed and analysed. Implicit routing exploits the connection availability and diversity in the underlying network to provide benefits such as fault tolerance, overhead control and improvement in QoS (Quality of Service) such as delay. Analysis and simulation results show that the proposed protocols guarantee significant improvement, delivering a more reliable, more efficient and better network performance compared with alternatives.Most developments in wireless sensor networks (WSNs) routing protocols address static network scenarios. Schemes developed to manage mobility in other mobile networking implementations do not translate effectively to WSNs as the system design parameters are markedly different. Thus this research focuses on the issues of mobility and scalability in order to enable the full potential of WSNs to self-organise and co-operate and in so doing, meet the requirements of a rich mix of applications. In the goal of designing efficient, reliable routing protocols for large scale mobile WSN applications, this work lays the foundation by firstly presenting a strong case supported by extensive simulations, for the use of implicit connections. Then two novel implicit routing protocols - Virtual Grid Paging (VGP) and Virtual Zone Registration and Paging (VZRP) - that treat packet routing from node mobility and network scalability viewpoints are designed and analysed. Implicit routing exploits the connection availability and diversity in the underlying network to provide benefits such as fault tolerance, overhead control and improvement in QoS (Quality of Service) such as delay. Analysis and simulation results show that the proposed protocols guarantee significant improvement, delivering a more reliable, more efficient and better network performance compared with alternatives

EFFICIENT DYNAMIC ADDRESSING BASED ROUTING FOR UNDERWATER WIRELESS SENSOR NETWORKS

This thesis presents a study about the problem of data gathering in the inhospitable underwater environment. Besides long propagation delays and high error probability, continuous node movement also makes it difficult to manage the routing information during the process of data forwarding. In order to overcome the problem of large propagation delays and unreliable link quality, many algorithms have been proposed and some of them provide good solutions for these issues, yet continuous node movements still need attention. Considering the node mobility as a challenging task, a distributed routing scheme called Hop-by-Hop Dynamic Addressing Based (H2- DAB) routing protocol is proposed where every node in the network will be assigned a routable address quickly and efficiently without any explicit configuration or any dimensional location information. According to our best knowledge, H2-DAB is first addressing based routing approach for underwater wireless sensor networks (UWSNs) and not only has it helped to choose the routing path faster but also efficiently enables a recovery procedure in case of smooth forwarding failure. The proposed scheme provides an option where nodes is able to communicate without any centralized infrastructure, and a mechanism furthermore is available where nodes can come and leave the network without having any serious effect on the rest of the network. Moreover, another serious issue in UWSNs is that acoustic links are subject to high transmission power with high channel impairments that result in higher error rates and temporary path losses, which accordingly restrict the efficiency of these networks. The limited resources have made it difficult to design a protocol which is capable of maximizing the reliability of these networks. For this purpose, a Two-Hop Acknowledgement (2H-ACK) reliability model where two copies of the same data packet are maintained in the network without extra burden on the available resources is proposed. Simulation results show that H2-DAB can easily manage during the quick routing changes where node movements are very frequent yet it requires little or no overhead to efficiently complete its tasks