Name
Abstract | ||
|---|---|---|
This paper studies delay-bounded service discovery in urban Vehicular Ad-hoc Networks (VANETs), which refers to locating resources and services (e.g., local sensor data and multimedia content) distributed on individual vehicles in the network within a certain delay bound. To facilitate the discovery process, a set of vehicles, called service directories (SDs), can be selected to store the index information of all the resources in the network. Selecting an optimal SD set with minimal size while satisfying the users' requirement of a bounded query response delay is very difficult due to the disruptive nature of VANETs. In this paper, we formulate the Delay Bounded Service Directory Selection (DB-Sel) problem as an optimization problem that minimizes the number of SDs under the delay bound constraint. We prove theoretically that the DB-Sel problem is NP-Complete even when the future positions of vehicles are known a priori. We observe and prove that the number of vehicles encountered by arbitrarily selected SDs within a given delay follows a normal distribution. We also find the contact probabilities among the vehicles exhibit strong temporal correlation. With these observations, we develop a heuristic algorithm which iteratively selects the best candidate according to the normal distribution property and the historical contact probability. We prove that our algorithms have a guaranteed performance approximation ratio compared to the optimal solution. Extensive trace-driven simulation results demonstrate that our algorithm can guarantee the required query delay and select SD sets 20% smaller than those selected by alternative algorithms. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/WCNC.2013.6555331 | WCNC |
Keywords | Field | DocType |
normal distribution,vanet,optimisation,performance approximation ratio,trace-driven simulation,db-sel problem,bounded query response delay,urban vehicular ad-hoc network,approximation theory,delay bound constraint,communication complexity,heuristic algorithm,optimization problem,vehicular ad hoc networks,debut,temporal correlation,delay bounded service discovery,historical contact probability,np-complete,delay bounded service directory selection problem,probability,discovery process,correlation,approximation algorithms,ad hoc networks,gaussian distribution,np complete,algorithm design and analysis | Mathematical optimization,Computer science,Heuristic (computer science),Computer network,Approximation theory,Communication complexity,Theoretical computer science,Wireless ad hoc network,Business process discovery,Service discovery,Optimization problem,Bounded function | Conference |
Volume | Issue | ISSN |
null | null | 1525-3511 E-ISBN : 978-1-4673-5937-5 |
ISBN | Citations | PageRank |
978-1-4673-5937-5 | 0 | 0.34 |
References | Authors | |
7 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fenggang Wu | 1 | 16 | 4.08 |
| Hongzi Zhu | 2 | 653 | 43.37 |
| Jia-Liang Lu | 3 | 121 | 16.62 |
| Min-you Wu | 4 | 1600 | 140.81 |