Sciweavers

103 search results - page 9 / 21
» Oblivious routing on geometric networks
Sort
View
CCCG
2008
15 years 1 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
MOBIHOC
2010
ACM
14 years 9 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
INFOCOM
2003
IEEE
15 years 5 months ago
On-demand Power Management for Ad Hoc Networks
— Battery power is an important resource in ad hoc networks. It has been observed that in ad hoc networks, energy consumption does not reflect the communication activities in th...
Rong Zheng, Robin Kravets
ICCCN
2008
IEEE
15 years 6 months ago
A Position-Based Deployment and Routing Approach for Directional Wireless Mesh Networks
—Observing that simplicity implies efficiency and scalability, this paper proposes a position-based deployment and routing strategy, and then gives a concrete approach under this...
Weisheng Si, Selvakennedy Selvadurai
INFOCOM
2007
IEEE
15 years 6 months ago
Face Tracing Based Geographic Routing in Nonplanar Wireless Networks
— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...
Fenghui Zhang, Hao Li, Anxiao Jiang, Jianer Chen, ...