Skip to main content
Springer Nature Link
Log in

Reactive ID Assignment for Wireless Sensor Networks

  • Published:
International Journal of Wireless Information Networks Aims and scope Submit manuscript

Abstract

Globally unique ID allocation is usually not applicable in a sensor network due to the massive production of cheap sensor nodes, the limited bandwidth, and the size of the payload. However, locally unique IDs are still necessary for nodes to implement unicast communications to save power consumption. Several solutions have been proposed for locally unique ID assignment in sensor networks. However, they bring much communication overhead, which is not desirable due to the limited power supply in a sensor node. Combined with a directed diffusion communication paradigm, a reactive ID assignment scheme with security mechanisms is proposed in this paper. It defers ID conflict resolution until data communications are initiated and thus saves communication overhead.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.
Fig. 9.
Fig. 10.
Fig. 11.
Fig. 12.

Similar content being viewed by others

Notes

  1. Although it is possible to customize the network layer protocol to send the packet with the destination address equal to its own, it is contrary to most traditional network layer protocols that intend to provide an IPC mechanism.

  2. They will not change to node A’s address since they are aware that the address of a1 is already occupied.

  3. When all the sensor nodes are deployed in a grid with the interval of 200 m, the sensor network has nearly the lowest density. The density is n 2/[40000(n−1)2], which is 1/40,000 when n approaches infinity.

  4. To be more exact, it should be a unicast message received by more than one recipient. However, during the simulation, we use broadcast instead.

  5. Because nodes 3 and 8 broadcast almost simultaneously, they both change their IDs. If there is an interval between their broadcasts, only one needs to change.

  6. We use the number of received packet as the metric for communication overhead because each received packet consumes receiver’s power.

  7. The Hello message is not used in the reactive ID assignment scheme. It is only used in the simulation for the purpose of analysis.

References

  1. Kumagai J. (2004) Life of birds. IEEE Spectrum 41(4):42–49, April

    Article  Google Scholar 

  2. C. Intanagonwiwat, R. Govindan, and D. Estrin, Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks, Proceedings of MobiCom 2000, Boston, MA, August 2000.

  3. S. Thomson and T. Narten, IPv6 stateless address autoconfiguration, Network Working Group RFC 2462, December 1998.

  4. C. Perkins, J. Malinen, R. Wakikawa, E. M. Belding-Royer, and Y. Sun, IP address autoconfiguration for ad hoc networks, draft-ietf-manet-autoconf-01.txt, November 2001 (work in progress).

  5. K. Weniger and M. Zitterbart, IPv6 autoconfiguration in large scale mobile ad-hoc networks, Proceedings of European Wireless 2002, Florence, Italy, February 2002.

  6. N. Vaidya, Duplicate address detection in mobile ad hoc networks, Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC’02), Lausanne, Switzerland, June 2002.

  7. Misra A., Das S., McAuley A., Das S. K. (2001) Autoconfiguration, registration, and mobility management for pervasive computing. IEEE Personal Communication System Magazine 8:24–31, August

    Article  Google Scholar 

  8. M. Mohsin and R. Prakash, “IP address assignment in a mobile ad hoc network”, In Proceedings of MILCOM 2002, Anaheim, CA, October 2002.

  9. S. Nesargi and R. Prakash, MANETconf: configuration of hosts in a mobile ad hoc network, Proceedings of the 21st Annual Joint Conference of IEEE Computer and Communication Societies (INFOCOM 2002), New York, NY, June 2002.

  10. H. Zhou, L. M. Ni, and M. W. Mutka, Prophet address allocation for large scale MANETs, Proceedings of the 22nd Annual Joint Conference of IEEE Computer and Communication Societies (INFOCOM 2003), San Francisco, CA, April 2003.

  11. Zhou H., Ni L. M. and Mutka M. W. (2003) Prophet address allocation for large scale MANETs. Ad Hoc Networks Journal 1(4):423–434, November

    Article  Google Scholar 

  12. C. Schurgers, G. Kulkarni, and M. B. Srivastava, Distributed Assignment of Encoded MAC Addresses in Sensor Networks, Proceedings of MobiHOC 2001, Long Beach, CA, October 2001.

  13. Schurgers C., Kulkarni G., Srivastava M. B. (2002). Distributed On-demand Address Assignment in Wireless Sensor Networks. IEEE Transactions on Parallel and Distributed Systems 13(10):1056–1065, October

    Article  Google Scholar 

  14. CC 1000. Chipcon corporation. CC1000 low power FSK transceiver. http://www.chipcon.com, March 2005

  15. Charles E. Perkins, Elizabeth M. Belding-Royer, and Samir R. Das, IP Flooding in Ad hoc Mobile Networks, draft-ietf-manet-bcast-00.txt, November 2001 (expired).

  16. H. Zhou, M. W. Mutka, and L. M. Ni, IP Address Handoff in the MANET, Proceedings of the 23rd Conference of IEEE Communication Society (INFOCOM 2004), Hong Kong, China, March 2004.

  17. K. Fall and K. Varadhan (eds.), The ns Manual – the VINT Project, http://www.isi.edu/nsnam/ns/ns-documentation.html, December 2003

  18. J. Broch, D. Maltz, D. Johnson, Y. Hu, and J. Jetcheva, A Performance comparison of multi-hop wireless ad hoc routing protocols, Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp. 85–97, October 1998

Download references

Acknowledgments

This research is supported in part by NSF Grant no. 0334035, Hong Kong RGC Grants HKUST6183/05E and AoE/E-01/99, and the Key Project of China NSFC Grant 60533110.

Author information

Authors and Affiliations

  1. Department of Computer Science, Slippery Rock University, 106 Maltby Center, Slippery Rock, PA, 16057, USA

    Hongbo Zhou

  2. Department of Computer Science & Engineering, Michigan State University, East Lansing, MI, USA

    Matt W. Mutka

  3. Department of Computer Science, Hong Kong University of Science & Technology, Kowloon, Hong Kong

    Lionel M. Ni

Authors
  1. Hongbo Zhou
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Matt W. Mutka
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Lionel M. Ni
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Hongbo Zhou.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, H., Mutka, M.W. & Ni, L.M. Reactive ID Assignment for Wireless Sensor Networks. Int J Wireless Inf Networks 13, 317–328 (2006). https://doi.org/10.1007/s10776-006-0039-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10776-006-0039-9

Keywords