Placing and maintaining a core node in wireless ad hoc sensor networks

Abstract

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. © IFIP International Federation for Information Processing 2007.