Sciweavers

189 search results - page 26 / 38
» Shortest Paths Without a Map
Sort
View
ICNP
2005
IEEE
14 years 1 months ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu
INFOCOM
2005
IEEE
14 years 1 months ago
Spatial energy balancing in large-scale wireless multihop networks
— In this paper we investigate the use of proactive multipath routing to achieve energy efficient operation of ad hoc wireless networks. The focus is on optimizing trade-offs be...
Seung Jun Baek, Gustavo de Veciana
INFOCOM
2003
IEEE
14 years 1 months ago
Routing for Network Capacity Maximization in Energy-constrained Ad-hoc Networks
— We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman, L...
IJRR
2006
89views more  IJRR 2006»
13 years 7 months ago
Time-optimal Trajectories for an Omni-directional Vehicle
A common mobile robot design consists of three `omniwheels' arranged at the vertices of an equilateral triangle, with wheel axles aligned with the rays from the center of the...
Devin J. Balkcom, Paritosh A. Kavathekar, Matthew ...
JNCA
2008
123views more  JNCA 2008»
13 years 7 months ago
Edge-limited scalable QoS flow set-up
Although the Differentiated Services architecture supports scalable packet forwarding based on aggregate flows, the detailed procedure of Quality of Service (QoS) flow set-up with...
James Lembke, Byung Kyu Choi