Movement-Assisted & Application-Aware Connectivity Restoration in WSAN » książka
Movement-Assisted & Application-Aware Connectivity Restoration in WSAN
ISBN-13: 9783659753534 / Angielski / Miękka / 2015 / 132 str.
Movement-Assisted & Application-Aware Connectivity Restoration in WSAN
ISBN-13: 9783659753534 / Angielski / Miękka / 2015 / 132 str.
(netto: 264,31 VAT: 5%)
Najniższa cena z 30 dni: 277,53 zł
ok. 10-14 dni roboczych
Bez gwarancji dostawy przed świętami
Darmowa dostawa!
In Wireless Sensor-Actor Networks (WSANs), sensors probe their surroundings and inform actors which respond collaboratively to achieve some desired application missions. Since actors have to coordinate their operation, it is necessary to maintain a strongly connected network topology at all time. A WSAN may get partitioned into disjoint segments, if a critical actor, i.e., a cut-vertex node, fails and causes the loss of multiple inter-actor communication links. The other actors close to the faulty node often exploit their mobility to autonomously restore the lost inter-actor connectivity. We propose a distributed algorithm to restore inter-actor Connectivity with application level Constraints on Actors' Mobility (C DEGREES2AM). Moreover, we investigate the connectivity restoration problem subject to inter-actor communication path length constraints in order to handle the data latency and potential packet loss and propose a Least-Disruptive topology Repair (LeDiR) algorithm. Further, we extend LeDiR and name it Least-Movement Topology Repair (LeMoToR) algorithm. To restore connectivity, LeMoToR strives to relocate the least number of
In Wireless Sensor-Actor Networks (WSANs), sensors probe their surroundings and inform actors which respond collaboratively to achieve some desired application missions. Since actors have to coordinate their operation, it is necessary to maintain a strongly connected network topology at all time. A WSAN may get partitioned into disjoint segments, if a critical actor, i.e., a cut-vertex node, fails and causes the loss of multiple inter-actor communication links. The other actors close to the faulty node often exploit their mobility to autonomously restore the lost inter-actor connectivity. We propose a distributed algorithm to restore inter-actor Connectivity with application level Constraints on Actors Mobility (C^2AM). Moreover, we investigate the connectivity restoration problem subject to inter-actor communication path length constraints in order to handle the data latency and potential packet loss and propose a Least-Disruptive topology Repair (LeDiR) algorithm. Further, we extend LeDiR and name it Least-Movement Topology Repair (LeMoToR) algorithm. To restore connectivity, LeMoToR strives to relocate the least number of nodes.
Czytaj nas na:
KrainaKsiazek.PL - Księgarnia Internetowa
