Sciweavers

866 search results - page 119 / 174
» On Dynamic Shortest Paths Problems
Sort
View
INFOCOM
2011
IEEE
14 years 1 months ago
Finite-horizon energy allocation and routing scheme in rechargeable sensor networks
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
Shengbo Chen, Prasun Sinha, Ness B. Shroff, Changh...
SIGCOMM
2005
ACM
15 years 3 months ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...
IPCCC
2007
IEEE
15 years 4 months ago
Streaming in MANET: Proactive Link Protection and Receiver-Oriented Adaptation
Multimedia streaming applications can significantly boost the value of mobile ad hoc networks (MANET). Live streaming, however, means continuous data delivery, which is a major c...
Toby Xu, Ymg Cai
IJRR
2007
80views more  IJRR 2007»
14 years 9 months ago
Combined Path-following and Obstacle Avoidance Control of a Wheeled Robot
This paper proposes an algorithm that drives a unicycle type robot to a desired path, including obstacle avoidance capabilities. The path-following control design relies on Lyapun...
Lionel Lapierre, René Zapata, Pascal L&eacu...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 4 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos