IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v13y2017i11p1550147717744735.html

Architecture for an efficient integration of wireless sensor networks to the Internet through Internet of Things gateways

Author

Listed:
  • Patrick Olivier Kamgueu
  • Emmanuel Nataf
  • Thomas Djotio

Abstract

In recent years, Internet of Things has changed the way people work and live, thereby opening new opportunities. This article describes a framework architecture for interconnecting several wireless sensor networks to the Internet to achieve the vision of Internet of Things. Connecting things together is done through gateways that act as single points of failure to bridge the connection between wireless sensor network and the traditional wired Internet. To cope with the unreliable nature of wireless links and scale to a large number of sensors and wireless sensor networks, several gateways should be installed. Given a number of previously deployed gateways, the contribution of this article is twofold. First, it focuses on choosing the most suitable ones for connecting wireless sensor networks to the Internet in a efficient and cost-effective manner, using integer linear programming to develop the mathematical model. Second, a network topology that puts the integration of wireless sensor networks to the Internet in place is built. A three-layer architecture is used in such a way that the intermediate layer adapts dynamically to network changes and evolution. Gateway selection procedure at this layer was implemented using CPLEX linear solver, and the gateway was integrated on Raspberry Pi cheaper hardware which serves as the routing protocol for low-power and lossy network root for the wireless sensor network configuration. Experiments and real deployments have been conducted to demonstrate the effectiveness of the proposed scheme.

Suggested Citation

  • Patrick Olivier Kamgueu & Emmanuel Nataf & Thomas Djotio, 2017. "Architecture for an efficient integration of wireless sensor networks to the Internet through Internet of Things gateways," International Journal of Distributed Sensor Networks, , vol. 13(11), pages 15501477177, November.
  • Handle: RePEc:sae:intdis:v:13:y:2017:i:11:p:1550147717744735
    DOI: 10.1177/1550147717744735
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717744735
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147717744735?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
    ---><---

    References listed on IDEAS

    as
    1. Jiawei Zhang & Bo Chen & Yinyu Ye, 2005. "A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem," Mathematics of Operations Research, INFORMS, vol. 30(2), pages 389-403, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Aardal, Karen & van den Berg, Pieter L. & Gijswijt, Dion & Li, Shanfei, 2015. "Approximation algorithms for hard capacitated k-facility location problems," European Journal of Operational Research, Elsevier, vol. 242(2), pages 358-368.
    2. Dongmei Zhang & Dachuan Xu & Yishui Wang & Peng Zhang & Zhenning Zhang, 2018. "A local search approximation algorithm for a squared metric k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(4), pages 1168-1184, May.
    3. Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang, 0. "An approximation algorithm for the uniform capacitated k-means problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-12.
    4. Eric Angel & Nguyen Kim Thang & Damien Regnault, 2015. "Improved local search for universal facility location," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 237-246, January.
    5. Fengmin Wang & Dachuan Xu & Chenchen Wu, 2016. "Combinatorial approximation algorithms for the robust facility location problem with penalties," Journal of Global Optimization, Springer, vol. 64(3), pages 483-496, March.
    6. Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang, 2022. "An approximation algorithm for the uniform capacitated k-means problem," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1812-1823, October.
    7. Shuxin Cai & Wenguo Yang & Yaohua Tang, 2014. "Approximating soft-capacitated facility location problem with uncertainty," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 496-504, August.
    8. Jein-Shan Chen & Shaohua Pan & Chun-Hsu Ko, 2011. "A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation," Journal of Global Optimization, Springer, vol. 50(4), pages 713-728, August.
    9. Yanjun Jiang & Dachuan Xu & Donglei Du & Chenchen Wu & Dongmei Zhang, 2018. "An approximation algorithm for soft capacitated k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 493-511, February.
    10. Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang, 2018. "A local search approximation algorithm for the uniform capacitated k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 409-423, February.
    11. Hanyin Xiao & Jiaming Zhang & Zhikang Zhang & Weidong Li, 2025. "A Survey of Approximation Algorithms for the Universal Facility Location Problem," Mathematics, MDPI, vol. 13(7), pages 1-35, March.
    12. Ioannis Avgerinos & Ioannis Mourtos & Georgios Zois, 2022. "Multi-type facility location in printing and parcel delivery services," Annals of Operations Research, Springer, vol. 309(1), pages 365-393, February.
    13. Gao-Xi Li & Xin-Min Yang, 2025. "Cardinality objective nonlinear programs for facility capacity expansion," Computational Optimization and Applications, Springer, vol. 92(1), pages 179-214, September.
    14. Li, Gao-Xi & Ren, Yi & Yi, Peiru, 2025. "Sparse facility location and network design problems," Omega, Elsevier, vol. 136(C).
    15. Donglei Du & Xing Wang & Dachuan Xu, 2010. "An approximation algorithm for the k-level capacitated facility location problem," Journal of Combinatorial Optimization, Springer, vol. 20(4), pages 361-368, November.
    16. Yicheng Xu & Dachuan Xu & Donglei Du & Chenchen Wu, 2017. "Local search algorithm for universal facility location problem with linear penalties," Journal of Global Optimization, Springer, vol. 67(1), pages 367-378, January.
    17. Silva, Allyson & Aloise, Daniel & Coelho, Leandro C. & Rocha, Caroline, 2021. "Heuristics for the dynamic facility location problem with modular capacities," European Journal of Operational Research, Elsevier, vol. 290(2), pages 435-452.
    18. Wei Lv & Chenchen Wu, 2021. "An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 888-904, May.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:13:y:2017:i:11:p:1550147717744735. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.