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.


Routing, Localization and Positioning Protocols for Wireless Sensor and Actor Networks

Routing, Localization and Positioning Protocols for Wireless Sensor and Actor Networks

Author: Mustafa İlhan Akbaş

Publisher:

Published: 2013

Total Pages: 274

ISBN-13:

DOWNLOAD EBOOK

Wireless sensor and actor networks (WSANs) are distributed systems of sensor nodes and actors that are interconnected over the wireless medium. Sensor nodes collect information about the physical world and transmit the data to actors by using one-hop or multi-hop communications. Actors collect information from the sensor nodes, process the information, take decisions and react to the events. This dissertation presents contributions to the methods of routing, localization and positioning in WSANs for practical applications. We first propose a routing protocol with service differentiation for WSANs with stationary nodes. In this setting, we also adapt a sports ranking algorithm to dynamically prioritize the events in the environment depending on the collected data. We extend this routing protocol for an application, in which sensor nodes float in a river to gather observations and actors are deployed at accessible points on the coastline. We develop a method with locally acting adaptive overlay network formation to organize the network with actor areas and to collect data by using locality-preserving communication.


Automata, Languages and Programming

Automata, Languages and Programming

Author: Luca Aceto

Publisher: Springer Science & Business Media

Published: 2011-06-27

Total Pages: 689

ISBN-13: 3642220118

DOWNLOAD EBOOK

The two-volume set LNCS 6755 and LNCS 6756 constitutes the refereed proceedings of the 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, held in Zürich, Switzerland, in July 2011. The 114 revised full papers (68 papers for track A, 29 for track B, and 17 for track C) presented together with 4 invited talks, 3 best student papers, and 3 best papers were carefully reviewed and selected from a total of 398 submissions. The papers are grouped in three major tracks on algorithms, complexity and games; on logic, semantics, automata, and theory of programming; as well as on foundations of networked computation: models, algorithms and information management.


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.


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.


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.


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.