Sciweavers

625 search results - page 9 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
JACIII
2008
148views more  JACIII 2008»
14 years 9 months ago
Optimal Route Based on Dynamic Programming for Road Networks
Abstract. One of the main functions of the traffic navigation systems is to find the optimal route to the destination. In this paper, we propose an iterative Q value updating algor...
Manoj Kanta Mainali, Kaoru Shimada, Shingo Mabu, K...
ANTSW
2010
Springer
14 years 7 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...
ICASSP
2009
IEEE
15 years 1 months ago
Optimized opportunistic multicast scheduling (OMS) over heterogeneous cellular networks
Optimized opportunistic multicast scheduling (OMS) has been studied previously by the authors for homogeneous cellular networks, where the problem of efficiently transmitting a co...
Tze-Ping Low, Man-On Pun, Yao-Win Peter Hong, C.-C...
INFOCOM
2008
IEEE
15 years 3 months ago
An Optimization Framework for Opportunistic Multipath Routing in Wireless Mesh Networks
—We consider wireless mesh networks, and exploit the inherent broadcast nature of wireless by making use of multipath routing. We present an optimization framework that enables u...
Bozidar Radunovic, Christos Gkantsidis, Peter B. K...
DCOSS
2010
Springer
15 years 2 months ago
Halo: Managing Node Rendezvous in Opportunistic Sensor Networks
One vision of an opportunistic sensor network (OSN) uses sensor access points (SAPs) to assign mobile sensors with sensing tasks submitted by applications that could be running any...
Shane B. Eisenman, Hong Lu, Andrew T. Campbell