• DocumentCode
    3360402
  • Title

    Algorithm for routing data used in unorganized wireless sensor networks

  • Author

    Petrescu, Ionel ; Surugiu, Maria Claudia ; Barna, Oana Vasilica

  • Author_Institution
    Fac. of Eng. in Foreign Languages, Polytech. Univ. of Bucharest, Bucharest, Romania
  • fYear
    2010
  • fDate
    23-26 Sept. 2010
  • Firstpage
    59
  • Lastpage
    64
  • Abstract
    This technique can be used in wireless sensor networks which do not have a specific layer or function for routing. It is not necessary to know all the nodes that make up the route, only the neighbor node that provides the shortest route, the one that is delivering the message to the gateway with as few hops as possible. The algorithm can be easy implemented in the CPU of each node using C or Assembler programming language.
  • Keywords
    internetworking; telecommunication network routing; wireless sensor networks; C programming language; CPU; assembler programming language; gateway; routing data algorithm; unorganized wireless sensor networks; Algorithm design and analysis; Electronics packaging; Logic gates; Routing; Transmitters; Transportation; Wireless sensor networks; Algorithm; Routing; Wireless Sensor Networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design and Technology in Electronic Packaging (SIITME), 2010 IEEE 16th International Symposium for
  • Conference_Location
    Pitesti
  • Print_ISBN
    978-1-4244-8123-1
  • Type

    conf

  • DOI
    10.1109/SIITME.2010.5653132
  • Filename
    5653132
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3360402