loading...
HAUNT-24: 24-bit Hierarchical, Application-Confined Unique Naming Technique
Wroclaw, Poland September 08-September 10
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISDA.2005.495th International Conference on Intel ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ashwini Raina, S.P.C.E, India
Shruti Patil, University of Nevada Las Vegas, USA
V. Muthukumar, University of Nevada Las Vegas, USA
Ajith Abraham, Chung Ang University, Korea

The advent of tiny, inexpensive, low-power, autonomously functioning wireless sensors, has paved a way for high quality research, by posing unique challenges to researchers. Energy, cost and size of such sensors limit their communication and computation capabilities and thus robust and highly energy efficient algorithms need to be incorporated at every layer of the network model, along with an efficient network aware addressing scheme

This paper proposes a 24-bit Hierarchical, Application-Confined Unique Naming Technique (HAUNT-24), which ensures mutual distinctiveness of addresses within an application, with the primary focus on in-network data aggregation. Various issues relating to the proposed addressing scheme are analyzed and its future scope is discussed. The simple aggregate queries such as MIN/MAX and AVG are applied over the proposed HAUNT-24 addressed network and it?s shown how it helps in achieving in-network data aggregation.

Citation:
Ashwini Raina, Shruti Patil, V. Muthukumar, Ajith Abraham, "HAUNT-24: 24-bit Hierarchical, Application-Confined Unique Naming Technique," isda, pp.375-380, 5th International Conference on Intelligent Systems Design and Applications (ISDA'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.