DocumentCode :
3518695
Title :
Histogram-based density discovery in establishing road connectivity
Author :
Lee, Kevin C. ; Zhu, Jiajie ; Fan, Jih-Chung ; Gerla, Mario
Author_Institution :
Dept. of Comput. Sci., Univ. of California, Los Angeles, Los Angeles, CA, USA
fYear :
2009
fDate :
28-30 Oct. 2009
Firstpage :
1
Lastpage :
7
Abstract :
The paper proposes the histogram-based density discovery scheme as an alternative complement in obtaining density to LOUVRE, a landmark-based routing in the vehicular urban environment. The histogram-based scheme does not have the scalability problem as the P2P density scheme. Furthermore, it better accurately determines the road connectivity by considering non-uniform density. The paper makes the contribution of finding the optimal segment size to guarantee density and connectivity accuracy by evaluating thousands of mobility traces from a realistic mobility generator. Results have verified the scheme´s accuracy and its scalability.
Keywords :
collision avoidance; peer-to-peer computing; probability; road traffic; LOUVRE environemnt; P2P density scheme; histogram-based density discovery; landmark overlays for urban vehicular routing environments; optimal segment size; realistic mobility generator; road connectivity environment; Computer science; Delay; Intelligent networks; Network topology; Roads; Routing; Scalability; Switches; Telecommunication traffic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Vehicular Networking Conference (VNC), 2009 IEEE
Conference_Location :
Tokyo
Print_ISBN :
978-1-4244-5685-7
Electronic_ISBN :
978-1-4244-5687-1
Type :
conf
DOI :
10.1109/VNC.2009.5416393
Filename :
5416393
Link To Document :
بازگشت