IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i12p234728.html
   My bibliography  Save this article

Multicast Capacity Analysis for High Mobility Social Proximity Machine-to-Machine Networks

Author

Listed:
  • Xin Guan

    (School of Information Science and Technology, Heilongjiang University, Harbin 150080, China)

Abstract

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.

Suggested Citation

  • Xin Guan, 2013. "Multicast Capacity Analysis for High Mobility Social Proximity Machine-to-Machine Networks," International Journal of Distributed Sensor Networks, , vol. 9(12), pages 234728-2347, December.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:12:p:234728
    DOI: 10.1155/2013/234728
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/234728
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/234728?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:12:p:234728. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.