Abstract
Wireless Ad-hoc and Sensor Networks are thecornerstone of decentralised control and optimisation techniquesin numerous sensor-rich application areas. Triggeredby the necessity of autonomous operation within constantlychanging environments, Wireless Ad-hoc and Sensor Networksare characterised by dynamic topologies, regardless the mobilityattributes of their operational nodes. As such, the relativeawareness that each node can obtain of the entire networkdraws the roadmap of viable reconfiguration mechanisms, suchas the establishment of bidirectional connectivity. The issuesaddressed in this paper are related to the bidirectional connectivityconditions over Wireless Ad-hoc and Sensor Networks.Based solely on the relative awareness that each node has ofthe entire network, sufficient end-to-end connectivity conditionsare herein extracted. These conditions, exploiting the notionof relative Delaunay neighbourhoods, formulate the basis of atransmission power adjustment scheme. Without any additionalnetwork overhead, the resulting Relative Delaunay ConnectivityAlgorithm is herein proven to yield an efficient solution to theconnectivity issues. Extensive simulation results are offered toevaluate the performance of the network, resulting from theproposed transmission range adjustment, whilst highlightingthe benefits of the Relative Delaunay Connectivity Algorithm.
Original language | English |
---|---|
Title of host publication | Unknown Host Publication |
Publisher | IEEE Control Society |
Pages | 460-465 |
Number of pages | 6 |
Publication status | Published (in print/issue) - Jun 2012 |
Event | 2012 American Control Conference (ACC) - Montréal, Canada Duration: 1 Jun 2012 → … |
Conference
Conference | 2012 American Control Conference (ACC) |
---|---|
Period | 1/06/12 → … |