Distributed algorithms for finding centers and medians in networks
ACM Transactions on Programming Languages and Systems (TOPLAS)
Approximation algorithms for geometric median problems
Information Processing Letters
How to allocate network centers
Journal of Algorithms
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Self-stabilizing algorithms for finding centers and medians of trees
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Steiner trees and beyond: approximation algorithms for network design
Steiner trees and beyond: approximation algorithms for network design
The PIM architecture for wide-area multicast routing
IEEE/ACM Transactions on Networking (TON)
Reliable broadcast in mobile multihop packet networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Discrete Applied Mathematics
Algorithms for path medi-centers of a tree
Computers and Operations Research - location science
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Locating tree-shaped facilities using the ordered median objective
Mathematical Programming: Series A and B
An efficient core migration protocol for QoS in mobile ad hoc networks
PCC '02 Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International
On the hop count statistics for randomly deployed wireless sensor networks
International Journal of Sensor Networks
An O(pn2) algorithm for the p -median and related problems on tree graphs
Operations Research Letters
Algorithmic results for ordered median problems
Operations Research Letters
Efficient path planning and data gathering protocols for the wireless sensor network
Computer Communications
Hi-index | 0.00 |
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.