• DocumentCode
    2556683
  • Title

    A fair routing protocol using generic utility based approach in Wireless Sensor Networks

  • Author

    Mohajerzadeh, Amir Ilossein ; Yaghmaee, Mohammad Ilossein ; Yazdi, Iladi Sadoghi ; Rezaee, Abbas Ali

  • Author_Institution
    Dept. of Comput. Eng., Ferdowsi Univ. of Mashhad, Mashhad, Iran
  • fYear
    2009
  • fDate
    12-14 Oct. 2009
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    Wireless sensor networks (WSN) have been noticed and researched nowadays. These new type of networks have unique characteristics. These characteristics make them different rather than other networks. WSNs composed of set of nodes that collect and transmit information about their environment. They have different constraints such as computational power, storage capacity, energy and etc. Of course the main constraint in wireless sensor networks is energy. Nodes energy source is limited and in most cases not rechargeable. Fairness in node´s energy consumption can increase network lifetime. In this paper problem of data transport in WSN as an optimization problem is formulated. Objective function is to maximize performing fairness in network nodes subject to flow and energy constraints. Out put of optimization problem is a vector which consists of all links portion. Output is investigated via Opnet simulator.
  • Keywords
    optimisation; routing protocols; wireless sensor networks; Opnet simulator; generic utility; nodes energy source; optimization problem; routing protocol; wireless sensor networks; Ad hoc networks; Bandwidth; Computer networks; Constraint optimization; Energy consumption; Energy storage; Network topology; Routing protocols; Telecommunication traffic; Wireless sensor networks; Fairness; Routing Protocol; Utility Based; Wireless Sensor Networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Ultra Modern Telecommunications & Workshops, 2009. ICUMT '09. International Conference on
  • Conference_Location
    St. Petersburg
  • Print_ISBN
    978-1-4244-3942-3
  • Electronic_ISBN
    978-1-4244-3941-6
  • Type

    conf

  • DOI
    10.1109/ICUMT.2009.5345348
  • Filename
    5345348