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

Trajectory Optimization of Packet Ferries in Opportunistic Social-Based Machine-to-Machine Networks

Author

Listed:
  • Xin Guan

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

Abstract

Machine-to-machine (M2M) communication is an emerging paradigm to connect a large number of devices through wireless technologies. In recent application scenarios, devices are normally carried by people in social contexts. Like the behavior of people, the moving activity of devices always happens in a specific area, which corresponds to some specific communities. How to guarantee the higher packet delivery ratio while reducing forwarding delay in such M2M networks is a challenging issue and has not been well addressed yet. In this paper, we put some special mobile devices (called postmen) in the opportunistic social-based M2M networks and their main responsibility is to carry packets for normal devices which belong to specific communities. Our work focuses on the optimization of the moving trajectory by considering the minimum transmission delay. We formulate the optimal issue into semi-Markov Decision Process model. The decision process includes two parts: packets-choosing strategy and trajectory of packet-ferrying determination strategy. By maximizing the individual reward of a postman, its optimal trajectory will be found. Furthermore, the proposed solution guarantees the packet delivery ratio and delay for isolated communities. Simulation results show that the proposed packet-ferrying solution outperforms the two existing ferrying solutions in terms of packet delivery ratio.

Suggested Citation

  • Xin Guan, 2013. "Trajectory Optimization of Packet Ferries in Opportunistic Social-Based Machine-to-Machine Networks," International Journal of Distributed Sensor Networks, , vol. 9(12), pages 895078-8950, December.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:12:p:895078
    DOI: 10.1155/2013/895078
    as

    Download full text from publisher

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