Sciweavers

625 search results - page 3 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 4 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
13 years 9 months ago
Kernel regression for travel time estimation via convex optimization
—We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimization framework. Sampled travel time from probe vehicles are assumed ...
Sebastien Blandin, Laurent El Ghaoui, Alexandre M....
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
13 years 10 months ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq
GIS
2008
ACM
14 years 5 months ago
Dynamic travel time provision for road networks
The application domain of intelligent transportation is plagued by a shortage of data sources that adequately assess traffic situations. Typically, to provide routing and navigati...
Dieter Pfoser, Sotiris Brakatsoulas, Petra Brosch,...
GLOBECOM
2007
IEEE
13 years 11 months ago
Performance Analysis of a Wireless Network with Opportunistic Spectrum Sharing
— We analyze the performance of a wireless system that allows opportunistic spectrum sharing. The system consists of a set of primary users sharing a set of channels over a cover...
Shensheng Tang, Brian L. Mark