Multicast Capacity Analysis for High Mobility Social Proximity Machine-to-Machine Networks
Wireless machine-to-machine (M2M) networks enable ubiquitous sensing and controlling via sensors, vehicles, and other types of wireless nodes. Capacity scaling law is one of the fundamental properties for high mobility M2M networks. As for high mobility M2M networks, vehicular ad hoc networks (VANET...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2013-12-01
|
Series: | International Journal of Distributed Sensor Networks |
Online Access: | https://doi.org/10.1155/2013/234728 |
id |
doaj-2c2723346ce74a5a88b9bee22ea8b66d |
---|---|
record_format |
Article |
spelling |
doaj-2c2723346ce74a5a88b9bee22ea8b66d2020-11-25T03:43:30ZengSAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772013-12-01910.1155/2013/234728234728Multicast Capacity Analysis for High Mobility Social Proximity Machine-to-Machine NetworksXin GuanWireless machine-to-machine (M2M) networks enable ubiquitous sensing and controlling via sensors, vehicles, and other types of wireless nodes. Capacity scaling law is one of the fundamental properties for high mobility M2M networks. As for high mobility M2M networks, vehicular ad hoc networks (VANETs) are a typical case. Since vehicles have social property, their moving trajectory is according to the fixed community. With the purpose of transmitting packets to different communities of VANETs and further improving the network capacity, we study the multicast capacity of bus-assisted VANETs in two scenarios: forwarding scenario and routing scenario. All the ordinary vehicles obey the restricted mobility model. Thus, the spatial stationary distribution decays as power law with the distance from the center spot of a restrict region of each vehicle. In forwarding scenario, all the buses deployed in all roads as intermediate nodes are used to forward packets for ordinary vehicles. In routing scenario, buses and ordinary cars construct a highway path supported by percolation theory to transmit urgent packets. Each ordinary vehicle randomly chooses k − 1 vehicles from the other ordinary vehicles as receivers. For the two kinds of scenarios, we derived the upper bound and lower bound, respectively.https://doi.org/10.1155/2013/234728 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Xin Guan |
spellingShingle |
Xin Guan Multicast Capacity Analysis for High Mobility Social Proximity Machine-to-Machine Networks International Journal of Distributed Sensor Networks |
author_facet |
Xin Guan |
author_sort |
Xin Guan |
title |
Multicast Capacity Analysis for High Mobility Social Proximity Machine-to-Machine Networks |
title_short |
Multicast Capacity Analysis for High Mobility Social Proximity Machine-to-Machine Networks |
title_full |
Multicast Capacity Analysis for High Mobility Social Proximity Machine-to-Machine Networks |
title_fullStr |
Multicast Capacity Analysis for High Mobility Social Proximity Machine-to-Machine Networks |
title_full_unstemmed |
Multicast Capacity Analysis for High Mobility Social Proximity Machine-to-Machine Networks |
title_sort |
multicast capacity analysis for high mobility social proximity machine-to-machine networks |
publisher |
SAGE Publishing |
series |
International Journal of Distributed Sensor Networks |
issn |
1550-1477 |
publishDate |
2013-12-01 |
description |
Wireless machine-to-machine (M2M) networks enable ubiquitous sensing and controlling via sensors, vehicles, and other types of wireless nodes. Capacity scaling law is one of the fundamental properties for high mobility M2M networks. As for high mobility M2M networks, vehicular ad hoc networks (VANETs) are a typical case. Since vehicles have social property, their moving trajectory is according to the fixed community. With the purpose of transmitting packets to different communities of VANETs and further improving the network capacity, we study the multicast capacity of bus-assisted VANETs in two scenarios: forwarding scenario and routing scenario. All the ordinary vehicles obey the restricted mobility model. Thus, the spatial stationary distribution decays as power law with the distance from the center spot of a restrict region of each vehicle. In forwarding scenario, all the buses deployed in all roads as intermediate nodes are used to forward packets for ordinary vehicles. In routing scenario, buses and ordinary cars construct a highway path supported by percolation theory to transmit urgent packets. Each ordinary vehicle randomly chooses k − 1 vehicles from the other ordinary vehicles as receivers. For the two kinds of scenarios, we derived the upper bound and lower bound, respectively. |
url |
https://doi.org/10.1155/2013/234728 |
work_keys_str_mv |
AT xinguan multicastcapacityanalysisforhighmobilitysocialproximitymachinetomachinenetworks |
_version_ |
1724519509937618944 |