By Topic

SIDA: Self-organized ID Assignment in Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jialiu Lin ; Carnegie Mellon University, ; Yunhuai Liu ; Lionel M. Ni

Having an ID being unique within the application domain for each sensor node is the basic assumption in many WSN applications. In traditional assignments, fixed-length ID schemes, which are severely limited by scalability, flexibility and energy efficiency, are adopted. To solve these problems, we propose a novel variable-length ID scheme that allows different nodes to have different ID lengths. To realize this idea, we propose a fully localized ID assignment algorithm called emphself-organized ID assignment (SIDA). SIDA presents great potential on scalability, flexibility and energy efficiency by enabling online ID assignment and various optimizations according to different communication paradigms. Analytical and simulation results show that SIDA has a comparable static ID length while the accumulated communication overhead for multi-hop transmissions can be saved by 20%; the control overhead of the new deployment assignment can be reduced to about 30% compared with fixed-length schemes.

Published in:

2007 IEEE International Conference on Mobile Adhoc and Sensor Systems

Date of Conference:

8-11 Oct. 2007