TY - GEN
T1 - RF-power overlapping control for connectivity awareness in wireless Ad-Hoc and Sensor Networks
AU - Panousopoulou, Athanasia
AU - Tzes, Anthony
PY - 2010
Y1 - 2010
N2 - In this paper a novel power control scheme for establishing end-to-end connectivity over Wireless Ad-Hoc and Sensor Networks (WASN) is presented. Based on a deterministic connectivity model, the proposed scheme exploits overlapping information related to the properties of the network's Delaunay graph and localization. Sufficient conditions for establishing end-to-end connectivity over the WASN are provided; these are strongly attached to the properties of the network's Delaunay graph, formed by the nodes'spatial distribution. Under the provision of the Delaunay-related overlapping information to the network's operating nodes, these sufficient conditions are utilized for the construction of a distributed Shortest Path-like algorithm. Without any additional network interaction, the resulting Distributed Delaunay Connectivity Algorithm (DDelCA) is capable of adjusting the nodal transmission power to the minimum value that establishes the network's end-to-end connectivity. Extensive simulation results are offered to evaluate the network's performance using the DDelCA transmission power configuration and highlight the benefits of the DDelCA scheme.
AB - In this paper a novel power control scheme for establishing end-to-end connectivity over Wireless Ad-Hoc and Sensor Networks (WASN) is presented. Based on a deterministic connectivity model, the proposed scheme exploits overlapping information related to the properties of the network's Delaunay graph and localization. Sufficient conditions for establishing end-to-end connectivity over the WASN are provided; these are strongly attached to the properties of the network's Delaunay graph, formed by the nodes'spatial distribution. Under the provision of the Delaunay-related overlapping information to the network's operating nodes, these sufficient conditions are utilized for the construction of a distributed Shortest Path-like algorithm. Without any additional network interaction, the resulting Distributed Delaunay Connectivity Algorithm (DDelCA) is capable of adjusting the nodal transmission power to the minimum value that establishes the network's end-to-end connectivity. Extensive simulation results are offered to evaluate the network's performance using the DDelCA transmission power configuration and highlight the benefits of the DDelCA scheme.
KW - Delaunay graphs
KW - End-to-end connectivity
KW - Power control
KW - Wireless ad hoc and sensor networks
UR - http://www.scopus.com/inward/record.url?scp=80051927952&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80051927952&partnerID=8YFLogxK
U2 - 10.3182/20100913-2-FR-4014.00041
DO - 10.3182/20100913-2-FR-4014.00041
M3 - Conference contribution
AN - SCOPUS:80051927952
SN - 9783902661821
T3 - IFAC Proceedings Volumes (IFAC-PapersOnline)
SP - 275
EP - 280
BT - 2nd IFAC Workshop on Distributed Estimation and Control in Networked Systems, NecSys'10
PB - IFAC Secretariat
ER -