Sciweavers

203 search results - page 35 / 41
» On greedy geographic routing algorithms in sensing-covered n...
Sort
View
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
13 years 7 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram
SIGCOMM
2004
ACM
14 years 29 days ago
Locating internet bottlenecks: algorithms, measurements, and implications
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottlen...
Ningning Hu, Erran L. Li, Zhuoqing Morley Mao, Pet...
ICNP
2005
IEEE
14 years 1 months ago
Landmark Guided Forwarding
In this paper we focus on the problems of maintaining Ad Hoc network connectivity in the presence of node mobility whilst providing globally efficient and robust routing. The com...
Menghow Lim, Adam Chesterfield, Jon Crowcroft, Jul...
IPCCC
2005
IEEE
14 years 1 months ago
Dynamic localization control for mobile sensor networks
Localization is a fundamental operation in mobile and self-configuring networks such as sensor networks and mobile ad hoc networks. For example, sensor location is often critical...
Sameer Tilak, Vinay Kolar, Nael B. Abu-Ghazaleh, K...
IWCMC
2006
ACM
14 years 1 months ago
A novel broadcast technique for high-density ad hoc networks
Broadcasting in ad hoc networks is required for many routing and other network-layer protocols to request information like routes or locations about destination nodes. Most of the...
Ai Hua Ho, Alexander J. Aved, Kien A. Hua