• DocumentCode
    2403291
  • Title

    Dynamic Huffman addressing in wireless sensor networks based on the energy map

  • Author

    Kronewitter, F. Dell

  • Author_Institution
    ArgonST Network Syst., San Diego, CA
  • fYear
    2008
  • fDate
    16-19 Nov. 2008
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    This paper introduces a new dynamic addressing technique for prolonging the operational duration of duty cycled wake-up radios found in wireless sensor networks. A wireless sensor network (WSN) consists of a field of spatially distributed wireless nodes which operate on minimal battery power for extremely long times. A WSN typically uses a multi-hop architecture where messages containing sensed data at the point of origin move through the network eventually finding a gateway node. To minimize energy consumption nodes in a WSN employ novel techniques such as powering down as many components as possible as often as possible. One such MAC technique used is to power down the entire radio, waking up to listen for data addressed to the node at a well known time. This listen time is referred to as the check period. If the nodes can maintain sufficient time synchronization the time between check periods can be extended, reducing the duty cycle and increasing the operational life of the WSN at the expense of data latency. Traditionally, the size of the addresses used throughout such a WSN is static and uniform. Our proposed system is neither. As is typical in the WSN space we take a systems level perspective and seek to optimize global objectives. Specifically we consider a WSN field of nodes and maximize the useful life of the network. We assume that when any node has insufficient power to be useful, events can no longer be propagated through the WSN and the WSN is no longer operative. Our approach lengthens the life of the WSN by being especially conservative with nodes having low battery power. We investigate prefix-free (Huffman) encoding of the node addresses based on the energy map. That is, nodes with little battery life left will have the advantage of a short address, and therefore check period, so they are able to power down more quickly, while nodes with more battery life left will get longer addresses and require a longer check period. We will review techniques wi- - th a similar objective, offer a formal description of our algorithm and demonstrate that this approach prolongs the usefulness of certain sensor networks via Matlab simulation. Our simulation results show that our dynamic addressing technique can lengthen the operational life of a WSN by more than 10% over traditional fixed length addressing.
  • Keywords
    Huffman codes; tree codes; wireless sensor networks; Matlab simulation; WSN; check period; dynamic Huffman addressing technique; energy map; multihop architecture; prefix-free encoding; wireless sensor networks; Access protocols; Batteries; Broadcasting; Delay; Encoding; Energy consumption; Huffman coding; Sensor phenomena and characterization; Spread spectrum communication; Wireless sensor networks; Energy map; Huffman coding; Sensor Networks; Wake-up radio;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Military Communications Conference, 2008. MILCOM 2008. IEEE
  • Conference_Location
    San Diego, CA
  • Print_ISBN
    978-1-4244-2676-8
  • Electronic_ISBN
    978-1-4244-2677-5
  • Type

    conf

  • DOI
    10.1109/MILCOM.2008.4753639
  • Filename
    4753639