This Article 
 Bibliographic References 
 Add to: 
Distributed On-Demand Address Assignment in Wireless Sensor Networks
October 2002 (vol. 13 no. 10)
pp. 1056-1065

Abstract—Sensor networks consist of autonomous wireless sensor nodes that are networked together in an ad hoc fashion. The tiny nodes are equipped with substantial processing capabilities, enabling them to combine and compress their sensor data. The aim is to limit the amount of network traffic, and as such conserve the nodes' limited battery energy. However, due to the small packet payload, the MAC header is a significant, and energy-costly, overhead. To remedy this, we propose a novel scheme for a MAC address assignment. The two key features which make our approach unique are the exploitation of spatial address reuse and an encoded representation of the addresses in data packets. To assign the addresses, we develop a purely distributed algorithm that relies solely on local messsage exchanges. Other salient features of our approach are the ability to handle unidirectional links and the excellent scalability of both the assignment algorithm and address representation. In typical scenarios, the MAC overhead is reduced by a factor of three compared to existing approaches.

[1] K. Sohrabi, J. Gao, V. Ailawadhi, and G. Pottie, “Protocols for Self-Organization of a Wireless Sensor Network,” IEEE Personal Comm. Magazine, vol. 7, no. 5, pp. 16-27, Oct. 2000.
[2] P. Saffo, “Sensors: The Next Wave of Innovation,” Comm. ACM, vol. 40, no. 2, pp. 92-97 Feb. 1997.
[3] G. Pottie, “Hierarchical Information Processing in Distributed Sensor Networks,” Proc. Int'l Symp. Information Theory Conf. (ISIT '98), p. 163, Aug. 1998.
[4] W.R. Heinzelman, J. Kulik, and H. Balakrishnan, “Adaptive Protocols for Information Dissemination in Wireless Sensor Networks,” Proc. Conf. Mobile Computing MOBICOM, pp. 174-185, 1999.
[5] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, “Next Century Challenges: Scalable Coordination in Sensor Networks,” Proc. Mobile Computing MOBICOM, pp. 263-270, 1999.
[6] J.M. Kahn, R.H. Katz, and K.S.J. Pister, “Next Century Challenges: Mobile Networking for 'Smart Dust',” Proc. Conf. Mobile Computing MOBICOM, pp. 271-278, 1999.
[7] Rockwell Science Center, “Wireless Integrated Network Systems,” http:/, 2002.
[8] J. Elson and D. Estrin, “Random, Ephemeral Transaction Identifiers in Dynamic Sensor Networks,” Int'l Conf. Distributed Computing Systems (ICDCS '01), Apr. 2001.
[9] W. Adjie-Winoto et al., "The Design and Implementation of an Intentional Naming System," Proc. 17th ACM Symp. Operating System Principles (SOSP 99), ACM Press, New York, 1999, pp. 186-201.
[10] J. Navas and T. Imielinski, “GeoCast-Geographic Addressing and Routing,” Proc. ACM/IEEE Conf. MobiCom '97, pp. 66-76, Sept. 1997.
[11] S. Kumar Defense Advanced Research Project Agency (DARPA) Sensor Information Technology (SensIT) Project, , 2002.
[12] MIT,“μAMPS Project,” uamps/, 2002.
[13] R. Bagrodia, R. Meyer, M. Takai, Y.A. Chan, X. Zeng, J. Marting, and H.Y. Song, “Parsec: A Parallel Simulation Environment for Complex Systems,” Computer, vol. 31, no. 10, pp. 77-85, Oct. 1998.
[14] T.M. Cover and J.A. Thomas, Elements of Information Theory. John Wiley&Sons, 1991.
[15] UC Berkeley, Smart Dust Project, /, 2002.
[16] ASH Transceiver Designer's Guide,http:/, 2002.
[17] Intel®StrongARM SA-1100 Microprocessor for Portable Applications Data Sheet,http// 1110_brf.htm, 2002.
[18] AVR 8-bit RISC—Data Sheets,http:/, 2002.
[19] V. Bharghavan, “A Dynamic Addressing Scheme for Wireless Media Access,” Proc. IEEE ICC '95, pp. 756-760, June 1995.
[20] S. Ramanathan, “A Unified Framework and Algorithm for (T/F/C)DMA Channel Assignment in Wireless Networks,” Proc. IEEE INFOCOM '97, pp. 900-907, Apr. 1997.
[21] A. Ephremides and T. Truong, “Distributed Algorithm for Efficient and Interference-Free Broadcasting in Radio Networks,” Proc. IEEE INFOCOM '88, pp. 1119-1124, Mar. 1988.
[22] I. Cidon and M. Sidi, “Distributed Assignment Algorithms for Multihop Packet Radio Networks,” IEEE Trans. Computers, vol. 38, no. 10, pp. 1353-1361, Oct. 1989.
[23] L. Hu, Distributed Code Assignments for CDMA Packet Radio Network IEEE/ACM Trans. Networking, vol. 1, pp. 668-677, 1993.
[24] A.A. Bertossi and M.A. Bonuccelli, “Code Assignment for Hidden Terminal Interference Avoidance in Multihop Packet Radio Networks,” IEEE INFOCOM '92, pp. 701-709, May 1992.
[25] A. Giovanardi, G. Mazzini, M. Rossi, and M. Zorzi, “Improved Header Compression for TCP/IP over Wireless Links,” Electronic Letters, vol. 36, no. 23, Nov. 2000.
[26] M. McGlynn and S. Borbash, “Birthday Protocols for Low Energy Deployment and Flexible Neighbor Discovery in Ad Hoc Wireless Networks,” Proc. MobiHoc 2001, pp. 137-145, Oct. 2001.
[27] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, Energy-Efficient Communication Protocols for Wireless Microsensor Networks Proc. Hawaiian Int'l Conf. Systems Science, Jan. 2000.
[28] J.-H. Chang and L. Tassiulas, “Energy Conserving Routing in Wireless Ad-Hoc Networks,” Proc. INFOCOM 2000, pp. 22-31, Mar. 2000.
[29] J. Rabaey, J. Ammer, J.L. da Silva, and D. Patel, “PicoRadio: Ad-Hoc Wireless Networking of Ubiquitous Low-Energy Sensor/Monitor Nodes,” Proc. IEEE CS Workshop VLSI 2000, pp. 9-12, Apr. 2000.
[30] A.S. Tanenbaum, Computer Networks, third ed. Prentice Hall, 1996.

Index Terms:
Sensor networks, dynamic address assignment, distributed algorithm.
Curt Schurgers, Gautam Kulkarni, Mani B. Srivastava, "Distributed On-Demand Address Assignment in Wireless Sensor Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 10, pp. 1056-1065, Oct. 2002, doi:10.1109/TPDS.2002.1041881
Usage of this product signifies your acceptance of the Terms of Use.