TY - GEN
T1 - Placing and maintaining a core node in wireless ad hoc sensor networks
AU - Dvir, Amit
AU - Segal, Michael
PY - 2007/1/1
Y1 - 2007/1/1
N2 - Wireless Ad hoc sensor networks are characterized by several constraints, such as bandwidth, delay, power, etc. These networks are examined by constructing a tree network. A core node usually chosen to be the median or center of the multicast tree network with a tend to minimize a performance metric, such as delay or bandwidth. In this paper, we present new efficient strategy for constructing and maintaining a core node in multicast tree for wireless ad hoc sensor networks that undergo dynamic changes based on local information. The new core (centdian) function is defined by convex combination that signifies total bandwidth and delay constraints. We provide two bounds of O(d) and O(d + l) time for maintaining the centdian using local updates, where l is the hop count between the new center and the new centdian and d is the diameter. We also show a O(n log n) time solution for finding centdian in the Euclidian complete network using interesting observations. Finally a simulation is presented.
AB - Wireless Ad hoc sensor networks are characterized by several constraints, such as bandwidth, delay, power, etc. These networks are examined by constructing a tree network. A core node usually chosen to be the median or center of the multicast tree network with a tend to minimize a performance metric, such as delay or bandwidth. In this paper, we present new efficient strategy for constructing and maintaining a core node in multicast tree for wireless ad hoc sensor networks that undergo dynamic changes based on local information. The new core (centdian) function is defined by convex combination that signifies total bandwidth and delay constraints. We provide two bounds of O(d) and O(d + l) time for maintaining the centdian using local updates, where l is the hop count between the new center and the new centdian and d is the diameter. We also show a O(n log n) time solution for finding centdian in the Euclidian complete network using interesting observations. Finally a simulation is presented.
KW - Core node
KW - Multicast tree
KW - Sensor networks
KW - Wireless ad hoc networks
UR - https://www.scopus.com/pages/publications/37249088947
U2 - 10.1007/978-3-540-72606-7_2
DO - 10.1007/978-3-540-72606-7_2
M3 - Conference contribution
AN - SCOPUS:37249088947
SN - 9783540726050
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 13
EP - 24
BT - NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet - 6th International IFIP-TC6 Networking Conference, Proceedings
A2 - Akyildiz, Ian F.
A2 - Sivakumar, Raghupathy
A2 - Ekici, Eylem
A2 - de Oliveira, Jaudelice Cavalcante
A2 - McNair, Janise
PB - Springer Verlag
T2 - 6th International IFIP-TC6 Networking Conference - NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet
Y2 - 14 May 2007 through 18 May 2007
ER -