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.