Sciweavers

Share
6 search results - page 1 / 2
» Transfer Time Complexity of Conflict-free Vehicle Routing wi...
Sort
View
IJRR
2007
67views more  IJRR 2007»
10 years 2 months ago
Transfer Time Complexity of Conflict-free Vehicle Routing with no Communications
jr.sagepub.com/cgi/content/abstract/26/3/255 The online version of this article can be found at: Published by: http://www.sagepublications.com On behalf of: Multimedia Archives can...
Vikrant Sharma, Michael A. Savchenko, Emilio Frazz...
NETWORK
2010
158views more  NETWORK 2010»
9 years 9 months ago
Broadcasting safety information in vehicular networks: issues and approaches
A primary goal of intelligent transportation systems is to improve road safety. The ability of vehicles to communicate is a promising way to alleviate traffic accidents by reducin...
R. Chen, Wen-Long Jin, A. Regan
MOBICOM
2003
ACM
10 years 8 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
ICC
2007
IEEE
203views Communications» more  ICC 2007»
10 years 9 months ago
Distributed Cooperative Routing for UWB Ad-Hoc Networks
— Ultra wide band (UWB) ad-hoc networks have attracted much research attention in recent years. This paper proposes and investigates a new distributed cooperative routing strateg...
Shouhong Zhu, Kin K. Leung
DEBS
2008
ACM
10 years 4 months ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
books