Computers and Operations Research
Randomized Initialization Protocols for Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
On the power assignment problem in radio networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
A distributed protocol for the bounded-hops converge-cast in ad-hoc networks
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Initialization for ad hoc radio networks with carrier sensing and collision detection
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Divide and conquer is almost optimal for the bounded-hop MST problem on random euclidean instances
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Adaptive initialization algorithm for ad hoc radio networks with carrier sensing
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
On alarm protocol in wireless sensor networks
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
| Hi-index | 0.00 |
We consider the problem of bounded hops converge cast in ad-hoc networks. Let us assume that stations are located on the d- dimensional Euclidean space and there is one distinguished station called a base station. This problem, called the d-Dim h-HOPS CONVERGECAST, is defined as finding a minimal energy-cost range assignment, which allows each station to communicate with a base station in at most h hops. Clementi et al. [2] proposed a distributed protocol h-PROT for d = 2 and proved that in case of h = 2 the expected approximation ratio of this protocol is O(1) on random instances. However, for h = 3, ..., 8 they provided only an experimental study showing that the protocol has good performances. In this paper, we introduce the protocol (d, h)- PROT which extends the protocol h-PROT on the d-dimensional space. We address the probabilistic analysis and show formally that the protocol (d, h)-PROT achieves an approximation ratio of O(1) in expectation on random instances for any d, h ≥ 2.