Global ID Assignment in Wireless Sensor Network by Using Huffman Algorithm

A sensor network consists of a set of battery-powered nodes, which collaborate to perform sensing tasks in given environment. It may contain node or more base stations to collect sensed data and possibly relay it a central processing and storage system. These networks are characterized by scarcity of resources, in particular the available energy. We present a Huffman algorithm to solve the unique ID assignment problem. The propos is based on Huffman codes as unique and short ID for nodes. As we know codes generated using this algorithm has some characteristics that makes it a good choice for addressing ( prefix free, compressed) and some characteristics that makes it not to be considered as perfect choice (the length of these codes are not fixed). In this paper we have program c++ to simulate an area with a large number of sensors and put our desired way of addressing in it (using Huffman codes). And organizing nodes in a tree structure. This tree structure is used to compute the size of the network. Then we make a Huffman tree for unique Ids are assigned using the minimum number of bites. And evaluate its performance and compare results by tree cast method.The oure result show weak signal makes the network’s tree deeper and the Huffman method is less bits needed for ID assignment rather the Tree Cast method and the depth of tree doesn’t have a big influence on the length of IDs in the Huffman method.Globally unique IDs are useful in providing many network functions, e.g. configuration, monitoring or individual nodes, and various security mechanisms.

[1]  David A. Wagner,et al.  Secure routing in wireless sensor networks: attacks and countermeasures , 2003, Ad Hoc Networks.

[2]  Mani B. Srivastava,et al.  Distributed On-Demand Address Assignment in Wireless Sensor Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[3]  M. Ali,et al.  An energy-efficient node address naming scheme for wireless sensor networks , 2004, 2004 International Networking and Communication Conference.

[4]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[5]  Kiyohito Yoshihara,et al.  Implementation and evaluation of on-demand address allocation for event-driven sensor network , 2005, The 2005 Symposium on Applications and the Internet.

[6]  Douglas M. Blough,et al.  Distributed Global Identification for Sensor Networks , 2005 .

[7]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[8]  Shu Du,et al.  TreeCast: a stateless addressing and routing architecture for sensor networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[9]  Lionel M. Ni,et al.  Reactive ID Assignment for Wireless Sensor Networks , 2006, Int. J. Wirel. Inf. Networks.

[10]  Adam Dunkels,et al.  Making TCP/IP Viable for Wireless Sensor Networks , 2004 .

[11]  Sandeep K. S. Gupta,et al.  Role-based hierarchical self organization for wireless ad hoc sensor networks , 2003, WSNA '03.

[12]  Deborah Estrin,et al.  Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks , 2002 .

[13]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[14]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[15]  Roger Wattenhofer,et al.  Initializing newly deployed ad hoc and sensor networks , 2004, MobiCom '04.