Distributed assignment of encoded MAC addresses in sensor networks

In wireless sensor networks, the vast majority of wide-scale traffic consists of only a few bytes, including all network and application layer IDs. Therefore, MAC addresses, which are vital in a shared medium, present major overhead, particularly because they are traditionally chosen network-wide unique. To tackle this overhead, we propose a dynamic MAC addressing scheme based on a distributed algorithm. The assigned addresses are reused spatially and represented by variable length codewords. Our scheme scales very well with the network size, rendering it well suited for sensor networks with thousands or millions of nodes

[1]  Tomasz Imielinski,et al.  GeoCast—geographic addressing and routing , 1997, MobiCom '97.

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

[3]  Mineo Takai,et al.  Parssec: A Parallel Simulation Environment for Complex Systems , 1998, Computer.

[4]  S. Ramanathan,et al.  A unified framework and algorithm for (T/F/C)DMA channel assignment in wireless networks , 1997, Proceedings of INFOCOM '97.

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

[6]  V. Bharghavan A dynamic addressing scheme for wireless media access , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[7]  Deborah Estrin,et al.  Random, Ephemeral Transaction Identifiers in dynamic sensor networks , 2001, Proceedings 21st International Conference on Distributed Computing Systems.