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

Node Placement Analysis for Overlay Networks in IoT Applications

Author

Listed:
  • Yuxin Wan
  • Junwei Cao
  • Kang He
  • Huaying Zhang
  • Peng Yu
  • Senjing Yao
  • Keqin Li

Abstract

The Internet of Things (IoT), which combines identification, sensing, computing, and communication technologies, is considered one of the major trends in information and communication technologies. Communication performance is critical for IoT applications. According to previous research, an internet-based overlay model is feasible for the implementation of the IoT. One important issue in the overlay routing model is the overlay node placement problem (ONPP). Once the size of overlay node set is fixed to a particular number k , the ONPP changes to k -ONPP. In this work, the IoT-based overlay node placement problem is formulized and analyzed. The major contributions of the paper include providing the time complexity of multi hop k -ONPP and its theoretical limit boundary of approximation ratio and proposing a local search algorithm. Furthermore, the time complexity and approximation ratio boundary of the local search algorithm are given. The proposed local search algorithm is evaluated by both time and efficiency where efficiency refers to the degree of approximation of algorithm results with optimal solutions. Another algorithm, TAG, is used for comparison. Finally, a simulation experiment based on network simulator EstiNet is provided. The experimental results show network delay benefits from the proposed method.

Suggested Citation

  • Yuxin Wan & Junwei Cao & Kang He & Huaying Zhang & Peng Yu & Senjing Yao & Keqin Li, 2014. "Node Placement Analysis for Overlay Networks in IoT Applications," International Journal of Distributed Sensor Networks, , vol. 10(3), pages 427496-4274, March.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:3:p:427496
    DOI: 10.1155/2014/427496
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/427496
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/427496?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:10:y:2014:i:3:p:427496. 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.