Sciweavers

1222 search results - page 71 / 245
» Routing in the frequency domain
Sort
View
INFOCOM
2006
IEEE
14 years 3 months ago
Evaluating Mobility Pattern Space Routing for DTNs
— Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerni...
Jeremie Leguay, Timur Friedman, Vania Conan
CCCG
2007
13 years 10 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
INFOCOM
2007
IEEE
14 years 3 months ago
An Optimal Algorithm for Minimizing Energy Consumption while Limiting Maximum Delay in a Mesh Sensor Network
— This paper presents an algorithm for maximizing the lifetime of a sensor network while guaranteeing an upper bound on the end-to-end delay. We prove that the proposed algorithm...
Reuven Cohen, Boris Kapchits
MOBIHOC
2006
ACM
14 years 9 months ago
Message ferry route design for sparse ad hoc networks with mobile nodes
Message ferrying is a networking paradigm where a special node, called a message ferry, facilitates the connectivity in a mobile ad hoc network where the nodes are sparsely deploy...
Muhammad Mukarram Bin Tariq, Mostafa H. Ammar, Ell...
ATAL
2009
Springer
14 years 3 months ago
Context-aware multi-stage routing
In context-aware route planning, a set of agents has to plan routes on a common infrastructure and each agent has to plan a conflict-free route from a source to a destination wit...
Adriaan ter Mors, Jeroen van Belle, Cees Witteveen