Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Minimizing Congestion in General Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Towards Sensor Database Systems
MDM '01 Proceedings of the Second International Conference on Mobile Data Management
A scalable approach for reliable downstream data delivery in wireless sensor networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Oblivious routing in directed graphs with random demands
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Efficient gathering of correlated data in sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Oblivious routing on node-capacitated and directed graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed online call control on general networks
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Communications Magazine
TOLB: a traffic-oblivious load-balancing protocol for next-generation sensornets
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
| Hi-index | 0.00 |
The concept of Oblivious Routing for general undirected networks was introduced by Räcke [12] when he showed that there exists an oblivious routing algorithm with polylogarithmic competitive ratio (w.r.t. edge congestion) for any undirected graph. In a following result, Räcke and Rosén [13] presented admission control algorithms achieving a polylogarithmic fraction (in the size of the network) of the optimal number of accepted messages. Both these results assume that the network incurs a cost only after it is accepted and the message is routed. Admission control and routing algorithms for sensor networks under energy constraints, however, need to account for the energy spent in checking for feasible routes prior to the acceptance of a message and hence, it is unclear if these algorithms achieve polylogarithmic bounds under this condition. In this paper, we address this problem and prove that such algorithms do not exist when messages are generated by an adversary. Furthermore, we show that an oblivious routing algorithm cannot have a polylogarithmic competitive ratio without a packet-admission protocol. We present a deterministic O(ρlogn)-competitive algorithm for tree networks where the capacity of any node is in [k,ρk]. For grids, we present an O(logn)-competitive algorithm when nodes have capacities in Θ(logn) under the assumption that each message is drawn uniformly at random from all pairs of nodes in the grid.