Sensor Coverage and Actors Relocation in Wireless Sensor and Actor Networks (WSAN)

Sensor Coverage and Actors Relocation in Wireless Sensor and Actor Networks (WSAN)

Author: Praveen Kumar Nagilla

Publisher:

Published: 2010

Total Pages: 63

ISBN-13:

DOWNLOAD EBOOK

Wireless Sensors and Actor Networks (WSAN) have a wide variety of applications such as military surveillance, object tracking and habitat monitoring. Sensors are data gathering devices. Selecting the minimum number of sensors for network coverage is crucial to reduce the cost of installation and data processing time. Actors in a WSAN are decision-making units. They need to be communicating with their fellow actors in order to respond to events. Therefore, the need to maintain a connected inter-actor network at all times is critical. In the Actor Relocation Problem (Chapter 2) of this thesis we considered the problem of finding optimal strategies to restore connectivity when inter-actor network fails. We used a mixed integer programming formulation to find the optimal relocation strategies for actors in which the total travel distance is minimized. In our formulation we used powers of the adjacency matrix to generate constraints that ensure connectivity. In the Sensor Coverage Problem (Chapter 3) we developed a mixed integer programming model to find the minimum number of sensors and their locations to cover a given area. We also developed a bi-level algorithm that runs two separate optimization algorithms iteratively to find the location of sensors such that every point in a continuous area is covered.


Maximizing Connected Coverage Via Controlled Actor Relocation in Wireless Sensor and Actor Networks

Maximizing Connected Coverage Via Controlled Actor Relocation in Wireless Sensor and Actor Networks

Author: Srinivas Janapala

Publisher:

Published: 2008

Total Pages: 55

ISBN-13:

DOWNLOAD EBOOK

Wireless Sensor and Actor Networks (WSANs) have emerged recently with the idea of combining Wireless Sensor Networks (WSNs) and Mobile Ad Hoc Networks (MANETs). In addition to resource constrained sensors, resource rich and mobile actor nodes are employed in WSANs. These actors can collect data from the sensors and perform appropriate actions as a result of processing such data. To perform the actions at all parts of the region in a timely manner, the actors should be deployed in such a way that they might be able to communicate with each other and cover the whole monitored area. In this thesis, we propose a distributed actor deployment algorithm that strives to maximize the coverage of actors without violating the connectivity requirement. We present two techniques for creation of such an actor tree which are based on local pruning of the actor links and spanning tree of the inter-actor network.


Wireless Sensor and Actor Networks

Wireless Sensor and Actor Networks

Author: Muhammad Imran

Publisher: LAP Lambert Academic Publishing

Published: 2011-08

Total Pages: 148

ISBN-13: 9783845429465

DOWNLOAD EBOOK

Wireless Sensor and Actor Networks (WSANs) are gaining growing interest because of their suitability for mission-critical applications that require autonomous and intelligent interaction with the environment. Hazardous application environments make actors susceptible to physical damage. Failure of a critical (i.e. cut-vertex) actor partitions the inter-actor network into disjointed segments while leaving a coverage hole. Maintaining inter-actor connectivity and coverage is extremely crucial in most applications of WSANs where actors have to quickly plan an optimal coordinated response to detected events. This book presents a series of localized novel algorithms that pursue controlled movement of existing (internal) actors to restore the lost connectivity while minimizing the impact on coverage. The performance of proposed approaches is analyzed and validated through extensive simulations. Simulation results confirm the effectiveness of proposed approaches that outperform the best contemporary schemes found in literature. This book should be useful for university students, researchers, faculty members, application designers and people from industry.


Detecting and Connecting Disjoint Sub-networks in Wireless Sensor and Actor Networks

Detecting and Connecting Disjoint Sub-networks in Wireless Sensor and Actor Networks

Author: Fatih Senel

Publisher:

Published: 2008

Total Pages: 65

ISBN-13:

DOWNLOAD EBOOK

Wireless Sensor and Actor Networks (WSANs) can be considered as a combination of a sensor network and an actor network in which powerful and mobile actor nodes can perform application specific actions based on the received data from the sensors. As most of these actions are performed collaboratively among the actors, inter-actor connectivity is one of the desirable features of WSANs. In this thesis, we propose a novel distributed algorithm for establishing a connected inter-actor network topology. Considering initially disjoint sets of actors, our algorithm first initiates a search process by using the underlying sensor network in order to detect the possible sub-networks of actors in the region. After these sub-networks are detected, our algorithm pursues a coordinated actor movement in order to connect the sub-networks and thus achieve inter-actor connectivity for all the actors. This coordinated movement approach exploits the minimum connected dominating set of each sub-network when picking the appropriate actor to move so that the connectivity of each sub-network is not violated. In addition, the approach strives to minimize the total travel distance of actors and their messaging cost in order to extend the lifetime of WSAN. We analytically study the performance of our algorithm. Extensive simulation experiments validate the analytical results and confirm the effectiveness of our approach.


Actor Positioning in Wireless Sensor and Actor Networks Using Matching Theory

Actor Positioning in Wireless Sensor and Actor Networks Using Matching Theory

Author: Ismail Guneydas

Publisher:

Published: 2008

Total Pages: 46

ISBN-13:

DOWNLOAD EBOOK

In most of the Wireless Sensor and Actor Network (WSAN) applications, the locations for the actors are determined autonomously by the collaboration of actors and/or sensors in order to eliminate human intervention as much as possible. In this thesis, we propose an actor-CH location matching algorithm which will detect the CH locations and assign the actors to such locations in a distributed manner with the minimized travel distance. We adapt the Gale-Shapley (G-S) stable matching algorithm from Matching Theory in order to prevent conflicts and minimize the travel distance. We evaluated the performance of our approach through simulation and have shown that our approach can produce results very close to the brute force approach.


Wireless Sensor and Actuator Networks

Wireless Sensor and Actuator Networks

Author: Amiya Nayak

Publisher: John Wiley & Sons

Published: 2010-02-12

Total Pages: 316

ISBN-13: 9780470570500

DOWNLOAD EBOOK

This timely book offers a mixture of theory, experiments, and simulations that provides qualitative and quantitative insights in the field of sensor and actuator networking. The chapters are selected in a way that makes the book comprehensive and self-contained. It covers a wide range of recognized problems in sensor networks, striking a balance between theoretical and practical coverage. The book is appropriate for graduate students and practitioners working as engineers, programmers, and technologists.


Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20-22, 2011

Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20-22, 2011

Author: Kusum Deep

Publisher: Springer Science & Business Media

Published: 2012-04-15

Total Pages: 1048

ISBN-13: 8132204875

DOWNLOAD EBOOK

The objective is to provide the latest developments in the area of soft computing. These are the cutting edge technologies that have immense application in various fields. All the papers will undergo the peer review process to maintain the quality of work.


Optimal Coverage in Wireless Sensor Networks

Optimal Coverage in Wireless Sensor Networks

Author: Weili Wu

Publisher: Springer Nature

Published: 2020-09-30

Total Pages: 297

ISBN-13: 3030528243

DOWNLOAD EBOOK

This book will serve as a reference, presenting state-of-the-art research on theoretical aspects of optimal sensor coverage problems. Readers will find it a useful tool for furthering developments on theory and applications of optimal coverage; much of the content can serve as material for advanced topics courses at the graduate level. The book is well versed with the hottest research topics such as Lifetime of Coverage, Weighted Sensor Cover, k-Coverage, Heterogeneous Sensors, Barrier, Sweep and Partial Coverage, Mobile Sensors, Camera Sensors and Energy-Harvesting Sensors, and more. Topics are introduced in a natural order from simple covers to connected covers, to the lifetime problem. Later, the book begins revisiting earlier problems ranging from the introduction of weights to coverage by k sensors and partial coverage, and from sensor heterogeneity to novel problems such as the barrier coverage problem. The book ends with coverage of mobile sensors, camera sensors, energy-harvesting sensors, underwater sensors, and crowdsensing.


A Complete Guide to Wireless Sensor Networks

A Complete Guide to Wireless Sensor Networks

Author: Ankur Dumka

Publisher: CRC Press

Published: 2019-05-31

Total Pages: 357

ISBN-13: 1000001946

DOWNLOAD EBOOK

This book provides comprehensive coverage of the major aspects in designing, implementing, and deploying wireless sensor networks by discussing present research on WSNs and their applications in various disciplines. It familiarizes readers with the current state of WSNs and how such networks can be improved to achieve effectiveness and efficiency. It starts with a detailed introduction of wireless sensor networks and their applications and proceeds with layered architecture of WSNs. It also addresses prominent issues such as mobility, heterogeneity, fault-tolerance, intermittent connectivity, and cross layer optimization along with a number of existing solutions to stimulate future research.


Distributed Recovery of Actor Failures in Wireless Sensor and Actor Networks

Distributed Recovery of Actor Failures in Wireless Sensor and Actor Networks

Author: Aravind Thimmapuram

Publisher:

Published: 2008

Total Pages: 52

ISBN-13:

DOWNLOAD EBOOK

Wireless sensor and actor networks (WSANs) additionally employ actor nodes within the wireless sensor network (WSN) which can process the sensed data and perform certain actions based on this collected data. In most applications, inter-actor coordination is required to provide the best response. This suggests that the employed actors should form and maintain a connected inter-actor network at all times. However, WSANs often operate unattended in harsh environments where actors can easily fail or get damaged. Such failures can partition the inter-actor network and thus eventually make the network useless. In order to handle such failures, in this thesis we present a connected dominating set (CDS) based partition detection and recovery algorithm. The idea is to identify whether the failure of a node causes partitioning or not in advance. If a partitioning is to occur, the algorithm designates one of the neighboring nodes to initiate the connectivity restoration process. This process involves repositioning of a set of actors in order to restore the connectivity. The overall goal in this restoration process is to localize the scope of the recovery and minimize the movement overhead imposed on the involved actors. The effectiveness of the approach is validated through simulation experiments.