IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v67y2018i3d10.1007_s11235-017-0348-6.html
   My bibliography  Save this article

An energy-aware routing protocol for wireless sensor network based on genetic algorithm

Author

Listed:
  • Lingping Kong

    (Harbin Institute of Technology)

  • Jeng-Shyang Pan

    (Harbin Institute of Technology
    Fujian University of Technology)

  • Václav Snášel

    (VSB-Technical University of Ostrava)

  • Pei-Wei Tsai

    (Swinburne University of Technology)

  • Tien-Wen Sung

    (Fujian University of Technology)

Abstract

Energy saving and effective utilization are an essential issue for wireless sensor network. Most previous cluster based routing protocols only care the relationship of cluster heads and sensor nodes but ignore the huge difference costs between them. In this paper, we present a routing protocol based on genetic algorithm for a middle layer oriented network in which the network consists of several stations that are responsible for receiving data and forwarding the data to the sink. The amount of stations should be not too many and not too few. Both cases will cause either too much construction cost or extra transmission energy consumption. We implement five methods to compare the performance and test the stability of our presented methods. Experimental results demonstrate that our proposed scheme reduces the amount of stations by 36.8 and 20% compared with FF and HL in 100-node network. Furthermore, three methods are introduced to improve our proposed scheme for effective cope with the expansion of network scale problem.

Suggested Citation

  • Lingping Kong & Jeng-Shyang Pan & Václav Snášel & Pei-Wei Tsai & Tien-Wen Sung, 2018. "An energy-aware routing protocol for wireless sensor network based on genetic algorithm," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 67(3), pages 451-463, March.
    • Handle: RePEc:spr:telsys:v:67:y:2018:i:3:d:10.1007_s11235-017-0348-6
    DOI: 10.1007/s11235-017-0348-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-017-0348-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-017-0348-6?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sourour Elloumi & Martine Labbé & Yves Pochet, 2004. "A New Formulation and Resolution Method for the p-Center Problem," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 84-94, February.
    2. Dongyue Liang & Liquan Mei & James Willson & Wei Wang, 2016. "A simple greedy approximation algorithm for the minimum connected $$k$$ k -Center problem," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1417-1429, May.
    3. Hai Du & Yinfeng Xu & Binhai Zhu, 2015. "An incremental version of the k-center problem on boundary of a convex polygon," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1219-1227, November.
    4. Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chang Zhou & Zhenghong Gu & Yu Gao & Jin Wang, 2019. "An Improved Style Transfer Algorithm Using Feedforward Neural Network for Real-Time Image Conversion," Sustainability, MDPI, vol. 11(20), pages 1-15, October.
    2. Alma Rodríguez & Marco Pérez-Cisneros & Julio C. Rosas-Caro & Carolina Del-Valle-Soto & Jorge Gálvez & Erik Cuevas, 2021. "Robust Clustering Routing Method for Wireless Sensor Networks Considering the Locust Search Scheme," Energies, MDPI, vol. 14(11), pages 1-19, May.
    3. Alma Rodríguez & Carolina Del-Valle-Soto & Ramiro Velázquez, 2020. "Energy-Efficient Clustering Routing Protocol for Wireless Sensor Networks Based on Yellow Saddle Goatfish Algorithm," Mathematics, MDPI, vol. 8(9), pages 1-17, September.
    4. Min Zhao & Danyang Qin & Ruolin Guo & Guangchao Xu, 2019. "Multi-targets device-free localization based on sparse coding in smart city," International Journal of Distributed Sensor Networks, , vol. 15(6), pages 15501477198, June.
    5. S. Jeevanantham & B. Rebekka, 2022. "Energy-aware neuro-fuzzy routing model for WSN based-IoT," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 81(3), pages 441-459, November.

    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. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    2. Coslovich, Luca & Pesenti, Raffaele & Ukovich, Walter, 2006. "Minimizing fleet operating costs for a container transportation company," European Journal of Operational Research, Elsevier, vol. 171(3), pages 776-786, June.
    3. Marc Demange & Virginie Gabrel & Marcel A. Haddad & Cécile Murat, 2020. "A robust p-Center problem under pressure to locate shelters in wildfire context," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 103-139, June.
    4. Rita Portugal & Helena Ramalhinho-Lourenço & José P. Paixao, 2006. "Driver scheduling problem modelling," Economics Working Papers 991, Department of Economics and Business, Universitat Pompeu Fabra.
    5. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
    6. Irnich, Stefan, 2000. "A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles," European Journal of Operational Research, Elsevier, vol. 122(2), pages 310-328, April.
    7. Jans, Raf & Degraeve, Zeger, 2008. "A note on a symmetrical set covering problem: The lottery problem," European Journal of Operational Research, Elsevier, vol. 186(1), pages 104-110, April.
    8. Patricia Domínguez-Marín & Stefan Nickel & Pierre Hansen & Nenad Mladenović, 2005. "Heuristic Procedures for Solving the Discrete Ordered Median Problem," Annals of Operations Research, Springer, vol. 136(1), pages 145-173, April.
    9. Di Maio, Francesco & Baronchelli, Samuele & Zio, Enrico, 2014. "Hierarchical differential evolution for minimal cut sets identification: Application to nuclear safety systems," European Journal of Operational Research, Elsevier, vol. 238(2), pages 645-652.
    10. Mhand Hifi & Slim Sadfi & Abdelkader Sbihi, 2004. "An Exact Algorithm for the Multiple-choice Multidimensional Knapsack Problem," Post-Print halshs-03322716, HAL.
    11. Jesus Garcia-Diaz & Jairo Sanchez-Hernandez & Ricardo Menchaca-Mendez & Rolando Menchaca-Mendez, 2017. "When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem," Journal of Heuristics, Springer, vol. 23(5), pages 349-366, October.
    12. Csondes, Tibor & Kotnyek, Balazs & Zoltan Szabo, Janos, 2002. "Application of heuristic methods for conformance test selection," European Journal of Operational Research, Elsevier, vol. 142(1), pages 203-218, October.
    13. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    14. Li, Gang & Jiang, Hongxun & He, Tian, 2015. "A genetic algorithm-based decomposition approach to solve an integrated equipment-workforce-service planning problem," Omega, Elsevier, vol. 50(C), pages 1-17.
    15. Mohamed Kashkoush & Hoda ElMaraghy, 2017. "An integer programming model for discovering associations between manufacturing system capabilities and product features," Journal of Intelligent Manufacturing, Springer, vol. 28(4), pages 1031-1044, April.
    16. Marín, Alfredo & Ponce, Diego & Puerto, Justo, 2020. "A fresh view on the Discrete Ordered Median Problem based on partial monotonicity," European Journal of Operational Research, Elsevier, vol. 286(3), pages 839-848.
    17. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    18. Enrique Domínguez & Alfredo Marín, 2020. "Discrete ordered median problem with induced order," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(3), pages 793-813, October.
    19. Nickel, Stefan & Velten, Sebastian, 2017. "Optimization problems with flexible objectives: A general modeling approach and applications," European Journal of Operational Research, Elsevier, vol. 258(1), pages 79-88.
    20. Seona Lee & Sang-Ho Lee & HyungJune Lee, 2020. "Timely directional data delivery to multiple destinations through relay population control in vehicular ad hoc network," International Journal of Distributed Sensor Networks, , vol. 16(5), pages 15501477209, May.

    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:spr:telsys:v:67:y:2018:i:3:d:10.1007_s11235-017-0348-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.