ISCAS OpenIR
On Geocasting over Urban Bus-Based Networks by Mining Trajectories
Zhang, FS; Jin, BH; Wang, ZY; Liu, H; Hu, JF; Zhang, LF
2016
发表期刊IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS
ISSN1524-9050
卷号17期号:6页码:1734-1747
摘要Bus networks in cities have distinctive features such as wide coverage and fixed bus routes so that they show the potential of forming the communication backbone in vehicular ad hoc networks (VANETs). This paper focuses on the geocast in bus-based VANETs and presents a geocast routing mechanism named Vela. Specifically, Vela analyzes and mines historical bus trajectories and characterizes spatial-temporal patterns (i. e., bus travel-time patterns and bus spatial encounter patterns) in a moderate granularity of road segments, which makes the mined patterns both accurate and steady. Furthermore, Vela exploits these acquired patterns to build a probabilistic spatial-temporal graph model and provides the available routing paths with the best possible quality-of-service levels for data delivery requests. Moreover, Vela also employs a two-hop aware strategy that utilizes the real-time spatial-temporal relationships between buses to increase the chances of forwarding the data. The results of the experiments on the real and synthetic trajectories show that Vela performs much better in terms of delivery ratio and delay and has stronger scalability than the other solutions.; Bus networks in cities have distinctive features such as wide coverage and fixed bus routes so that they show the potential of forming the communication backbone in vehicular ad hoc networks (VANETs). This paper focuses on the geocast in bus-based VANETs and presents a geocast routing mechanism named Vela. Specifically, Vela analyzes and mines historical bus trajectories and characterizes spatial-temporal patterns (i. e., bus travel-time patterns and bus spatial encounter patterns) in a moderate granularity of road segments, which makes the mined patterns both accurate and steady. Furthermore, Vela exploits these acquired patterns to build a probabilistic spatial-temporal graph model and provides the available routing paths with the best possible quality-of-service levels for data delivery requests. Moreover, Vela also employs a two-hop aware strategy that utilizes the real-time spatial-temporal relationships between buses to increase the chances of forwarding the data. The results of the experiments on the real and synthetic trajectories show that Vela performs much better in terms of delivery ratio and delay and has stronger scalability than the other solutions.
收录类别SCI
关键词Vehicular Ad Hoc Networks Bus-based Routing Trajectory Mining Time Series Analysis
部门归属Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China. Univ Chinese Acad Sci, Beijing 101408, Peoples R China. Hong Kong Baptist Univ, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China. Univ Hong Kong, Dept Comp Sci, Pokfulam, Hong Kong, Peoples R China. Ludong Univ, Sch Informat & Elect Engn, Yantai 264025, Peoples R China.
语种英语
WOS记录号WOS:000377457200022
引用统计
被引频次:49[WOS]   [WOS记录]     [WOS相关记录]
内容类型期刊论文
URI标识http://ir.iscas.ac.cn/handle/311060/17332
专题中国科学院软件研究所
推荐引用方式
GB/T 7714
Zhang, FS,Jin, BH,Wang, ZY,et al. On Geocasting over Urban Bus-Based Networks by Mining Trajectories[J]. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS,2016,17(6):1734-1747.
APA Zhang, FS,Jin, BH,Wang, ZY,Liu, H,Hu, JF,&Zhang, LF.(2016).On Geocasting over Urban Bus-Based Networks by Mining Trajectories.IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS,17(6),1734-1747.
MLA Zhang, FS,et al."On Geocasting over Urban Bus-Based Networks by Mining Trajectories".IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 17.6(2016):1734-1747.
条目包含的文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
07422067.pdf(3020KB) 开放获取使用许可请求全文
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Zhang, FS]的文章
[Jin, BH]的文章
[Wang, ZY]的文章
百度学术
百度学术中相似的文章
[Zhang, FS]的文章
[Jin, BH]的文章
[Wang, ZY]的文章
必应学术
必应学术中相似的文章
[Zhang, FS]的文章
[Jin, BH]的文章
[Wang, ZY]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。