Placing and maintaining a core node in wirelessad hocnetworks
Amit Z. Dvir, Michael Segal · Wireless Communications and Mobile Computing · 2009
Abstract Wirelessad hocnetworks are characterized by several performance metrics, such asbandwidth, transport, delay, power, etc. These networks are examined by constructing a tree network. A core node is usually chosen to be themedianorcenterof the multicast tree network with a tendency to minimize a performance metric, such as delay or transport. In this paper, we present a new efficient strategy for constructing and maintaining a core node in a multicast tree for wirelessad hocnetworks undergoing dynamic changes, based on local information. The new core (centdian) function is defined by a convex combination signifying total transport and delay metrics. We provide two bounds ofO(d) andO(d+l) time for maintaining the centdian using local updates, wherelis the hop count between the new center and the new centdian, anddis the diameter of the tree network. We also show anO(n log n) time solution for finding the centdian in the Euclidian complete network. Finally, an extensive simulation for the construction algorithm and the maintenance algorithm is presented along with an interesting observation. Copyright © 2009 John Wiley & Sons, Ltd.