Sciweavers

410 search results - page 75 / 82
» Upgrading Shortest Paths in Networks
Sort
View
VLDB
2004
ACM
187views Database» more  VLDB 2004»
15 years 5 months ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi
INFOCOM
2002
IEEE
15 years 4 months ago
Energy Efficient Communications in Ad Hoc Networks Using Directional Antennas
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...
Akis Spyropoulos, Cauligi S. Raghavendra
INFOCOM
2010
IEEE
14 years 9 months ago
Green Wave: Latency and Capacity-Efficient Sleep Scheduling for Wireless Networks
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
Saikat Guha, Chi-Kin Chau, Prithwish Basu
INFOCOM
2009
IEEE
15 years 6 months ago
Noncooperative Load Balancing in the Continuum Limit of a Dense Network
Abstract—In transportation network research, the main approach for predicting traffic distribution due to noncooperative vehicle choices has been through fluid type models. The...
Eitan Altman, Ishai Menache, Asuman E. Ozdaglar
LCN
2000
IEEE
15 years 4 months ago
Tree-Based Reliable Multicast in Combined Fixed/Mobile IP Networks
This paper proposes a solution to delivering multicast data reliably not only to/from fixed hosts but also to/from mobile hosts in combined fixed/mobile IP networks, particularl...
Wonyong Yoon, Dongman Lee, Chansu Yu, Myungchul Ki...