Provably good routing in graphs: regular arrays
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Better bounds for online scheduling
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A survey of routing techniques for mobile communications networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Online computation and competitive analysis
Online computation and competitive analysis
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Online power-aware routing in wireless Ad-hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Position-aware ad hoc wireless networks for inter-vehicle communications: the Fleetnet project
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-Aware On-Demand Routing for Mobile Ad Hoc Networks
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Developments from a June 1996 seminar on Online algorithms: the state of the art
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Distributed proximity maintenance in ad hoc mobile networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
Balancing traffic load in wireless networks with curveball routing
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Steady and fair rate allocation for rechargeable sensors in perpetual sensor networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
FDAR: a load-balanced routing scheme for mobile ad-hoc networks
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
A distributed algorithm for load-balanced routing in multihop wireless sensor networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Exploring load balancing in heterogeneous networks by rate distribution
International Journal of Autonomous and Adaptive Communications Systems
A scheduling and call admission control algorithm for WiMax mesh network with strict QoS guarantee
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
An interference-aware routing metric for Wireless Mesh Networks
International Journal of Mobile Communications
Hi-index | 0.00 |
We study routing algorithms on wireless networks that use only short paths, for minimizing latency, and achieve good load balance, for balancing the energy use. We consider the special case when all the nodes are located in a narrow strip with width at most {\sqrt3}/2\approx 0.86 times the communication radius. We present algorithms that achieve good performance in terms of both measures simultaneously. In particular, the routing path is at most four times the shortest path length and the maximum load on any node is at most three times that of the most load-balanced algorithm without path-length constraint. In addition, our routing algorithms make routing decisions by only local information and, as as a consequence, are more adaptive to topology changes due to dynamic node insertions/deletions or due to mobility.