An On-demand Address Allocation Scheme for Query based Sensor Networks

  • Authors:
  • Weiwei Fang;Yi Liu;Jin Wu;Depei Qian

  • Affiliations:
  • Beihang University, Beijing, P.R.China;Beihang University, Beijing, P.R.China;Beihang University, Beijing, P.R.China;Beihang University, Beijing, P.R.China

  • Venue:
  • ISADS '07 Proceedings of the Eighth International Symposium on Autonomous Decentralized Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Current schemes for Wireless Sensor Network addressing are mainly based on static sensor node address which is determined in the process of deployment. However, with the increase of the network size, it is getting difficult to allocate the addresses manually for a large number of nodes. Moreover, the static address scheme is not able to deal with the complex situation in the real world due to dynamic death and replenishment of the sensor nodes. Although some dynamic address allocation schemes have been proposed, the frequent control messages exchange used by these schemes will lead to both excessive drain of limited power supply and increased collisions in wireless communication. In this paper, we propose a new efficient address allocation scheme for query based sensor networks. The proposed scheme allocates a temporary network-wide unique address only to the sensor node which reports data in response to an explicit query from the sink. We have evaluated our scheme performance through both analysis and extensive simulation experiments. Our evaluation results show that the proposed scheme exhibits better performance than existing schemes.