• DocumentCode
    3440236
  • Title

    A Preemptive Distributed Address Assignment Mechanism for Wireless Sensor Networks

  • Author

    Fang, Miaoqi ; Wan, Jian ; Xu, Xianghua

  • Author_Institution
    Grid & Services Comput. Lab., Hangzhou Dianzi Univ., Hangzhou
  • fYear
    2008
  • fDate
    12-14 Oct. 2008
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Dynamic address assignment is a desirable feature for deploying wireless sensor network. Typically, a distributed address assignment mechanism is accomplished by ZigBee alliance, whereas, sensors join a network is unpredictable, it may engender uneven node density, so it is possible that one node exhausts its list of addresses while another node has addresses go unused. Therefore, a preemptive approach is needed for ZigBee addressing mechanism. This paper presents a preemptive distributed address assignment to provide a preemptive scheme for ZigBee addressing mechanism. In addition, we give an autorouting algorithm. Simulation results show that nodes can acquire an address even in high node density area, and the scheme increases the total number of nodes in a sensor network.
  • Keywords
    personal area networks; telecommunication network routing; wireless sensor networks; ZigBee addressing mechanism; ZigBee alliance; autorouting algorithm; preemptive distributed address assignment mechanism; wireless sensor networks; Computer networks; Computer science; Distributed computing; Grid computing; Lighting control; Protocols; Routing; Wireless communication; Wireless sensor networks; ZigBee;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on
  • Conference_Location
    Dalian
  • Print_ISBN
    978-1-4244-2107-7
  • Electronic_ISBN
    978-1-4244-2108-4
  • Type

    conf

  • DOI
    10.1109/WiCom.2008.827
  • Filename
    4678735