• DocumentCode
    2935681
  • Title

    Energy-aware, delay-constrained routing in wireless sensor networks through genetic algorithm

  • Author

    Pourkabirian, Azadeh ; Haghighat, Abolfazl Toroghi

  • Author_Institution
    Qazvin Univ., Qazvin
  • fYear
    2007
  • fDate
    27-29 Sept. 2007
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    In this paper, we propose an energy-aware QoS routing protocol for wireless sensor networks. The protocol finds energy-efficient paths for delay-constrained data in realtime traffic. The described QoS routing problem is very similar to typical path constrained path optimization (PCPO) problems, which are proved to be NP-complete. Hence we present a heuristic solution for the aforesaid problem. We use a genetic algorithm (GA) to create energy efficient QoS routing. Our algorithm generates a sequence of routing paths that maximizes the system lifetime.Network lifetime can be defined as the time it takes for the first node or a fraction of all the nodes in the network to be depleted of their energies, we want to maximize network lifetime, instead of the average time over all scenarios. Simulation results have demonstrated the effectiveness of our approach for different metrics.
  • Keywords
    genetic algorithms; quality of service; routing protocols; telecommunication network routing; wireless sensor networks; QoS; delay-constrained routing; energy-aware routing; genetic algorithm; network lifetime; path constrained path optimization problems; routing protocol; system lifetime; wireless sensor networks; Computer networks; Delay; Energy consumption; Energy efficiency; Genetic algorithms; Image sensors; Quality of service; Routing protocols; Telecommunication traffic; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Software, Telecommunications and Computer Networks, 2007. SoftCOM 2007. 15th International Conference on
  • Conference_Location
    Split-Dubrovnik
  • Print_ISBN
    978-953-6114-93-1
  • Electronic_ISBN
    978-953-6114-95-5
  • Type

    conf

  • DOI
    10.1109/SOFTCOM.2007.4446058
  • Filename
    4446058