Abstract
Capacity scaling laws of wireless networks have attracted a lot of attention. In this paper, we study the multicast capacity of bus-assistant VANETs (vehcular ad hoc networks) with two-hop relay scheme, which has not been addressed before. Assume that n ordinary vehicles and nb buses are deployed in a grid-like road framework while the number of roads increase linearly with n. All the ordinary vehicles obey the restricted mobility model. Thus, the spatial stationary distribution decays as power law with the distance from the centre spot (home-point) of a restrict region of each vehicle. All the buses deployed in all roads as intermediate nodes. They are used to forward packets for ordinary vehicles. Each ordinary vehicle randomly chooses k - 1 vehicles from the other ordinary vehicles as receivers. The packets could be transmitted directly from source to destination or be transmitted to an intermediate vehicle or bus, then be forwarded to the destination. We found that the social-proximity urban bus-assisted VANET has three routing methods. For each routing method, we derive the matching asymptotic upper and lower bounds of multicast capacity of bus-assisted VANET.
| Original language | English |
|---|---|
| Title of host publication | IEEE International Conference on Communications |
| Pages | 6138-6142 |
| Number of pages | 5 |
| DOIs | |
| Publication status | Published - 2013 |
| Event | 2013 IEEE International Conference on Communications, ICC 2013 - Budapest, Hungary Duration: 2013 Jun 9 → 2013 Jun 13 |
Other
| Other | 2013 IEEE International Conference on Communications, ICC 2013 |
|---|---|
| Country | Hungary |
| City | Budapest |
| Period | 13/6/9 → 13/6/13 |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Computer Networks and Communications
Cite this
Multicast capacity analysis for social-proximity urban bus-assisted VANETs. / Huang, Yan; Guan, Xin; Cai, Zhipeng; Ohtsuki, Tomoaki.
IEEE International Conference on Communications. 2013. p. 6138-6142 6655586.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Multicast capacity analysis for social-proximity urban bus-assisted VANETs
AU - Huang, Yan
AU - Guan, Xin
AU - Cai, Zhipeng
AU - Ohtsuki, Tomoaki
PY - 2013
Y1 - 2013
N2 - Capacity scaling laws of wireless networks have attracted a lot of attention. In this paper, we study the multicast capacity of bus-assistant VANETs (vehcular ad hoc networks) with two-hop relay scheme, which has not been addressed before. Assume that n ordinary vehicles and nb buses are deployed in a grid-like road framework while the number of roads increase linearly with n. All the ordinary vehicles obey the restricted mobility model. Thus, the spatial stationary distribution decays as power law with the distance from the centre spot (home-point) of a restrict region of each vehicle. All the buses deployed in all roads as intermediate nodes. They are used to forward packets for ordinary vehicles. Each ordinary vehicle randomly chooses k - 1 vehicles from the other ordinary vehicles as receivers. The packets could be transmitted directly from source to destination or be transmitted to an intermediate vehicle or bus, then be forwarded to the destination. We found that the social-proximity urban bus-assisted VANET has three routing methods. For each routing method, we derive the matching asymptotic upper and lower bounds of multicast capacity of bus-assisted VANET.
AB - Capacity scaling laws of wireless networks have attracted a lot of attention. In this paper, we study the multicast capacity of bus-assistant VANETs (vehcular ad hoc networks) with two-hop relay scheme, which has not been addressed before. Assume that n ordinary vehicles and nb buses are deployed in a grid-like road framework while the number of roads increase linearly with n. All the ordinary vehicles obey the restricted mobility model. Thus, the spatial stationary distribution decays as power law with the distance from the centre spot (home-point) of a restrict region of each vehicle. All the buses deployed in all roads as intermediate nodes. They are used to forward packets for ordinary vehicles. Each ordinary vehicle randomly chooses k - 1 vehicles from the other ordinary vehicles as receivers. The packets could be transmitted directly from source to destination or be transmitted to an intermediate vehicle or bus, then be forwarded to the destination. We found that the social-proximity urban bus-assisted VANET has three routing methods. For each routing method, we derive the matching asymptotic upper and lower bounds of multicast capacity of bus-assisted VANET.
UR - http://www.scopus.com/inward/record.url?scp=84891352925&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84891352925&partnerID=8YFLogxK
U2 - 10.1109/ICC.2013.6655586
DO - 10.1109/ICC.2013.6655586
M3 - Conference contribution
AN - SCOPUS:84891352925
SN - 9781467331227
SP - 6138
EP - 6142
BT - IEEE International Conference on Communications
ER -