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

Damping Based Traffic Allocation in Wireless Machine-to-Machine Communications Networks

Author

Listed:
  • Ruiguo Yu
  • Zhenxia Yuan
  • Mankun Zhao
  • Mei Yu
  • Xu Lu

Abstract

Machine-to-machine (M2M) technology that allows machine devices to communicate directly with each other without human intervention has emerged as a cutting-edge technology for next-generation communication. As its applications become more and more popular, the number of users grows quickly and the quality of service needs to be improved. The traffic allocation problem may lead to many other problems such as low utilization ratio of the bandwidth and the jitter. When we tried to analyze the load on different paths using the simplest multipath routing algorithms, we found that the load changes just like simple harmonic motion, which inspires us to use physic and mathematic methods and tools to analyze the loading balance problems. And then, we designed a new traffic allocation algorithm. Compared with other algorithms, the algorithm proposed in this paper has much wider applicability. And the performance comparison experiment shows that DBTAs can really achieve improvement in decreasing the packet delay variance.

Suggested Citation

  • Ruiguo Yu & Zhenxia Yuan & Mankun Zhao & Mei Yu & Xu Lu, 2013. "Damping Based Traffic Allocation in Wireless Machine-to-Machine Communications Networks," International Journal of Distributed Sensor Networks, , vol. 9(11), pages 814267-8142, November.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:11:p:814267
    DOI: 10.1155/2013/814267
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/814267
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/814267?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:11:p:814267. 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.