The Community for Technology Leaders
Intelligent Systems Design and Applications, International Conference on (2005)
Wroclaw, Poland
Sept. 8, 2005 to Sept. 10, 2005
ISBN: 0-7695-2286-6
pp: 375-380
Shruti Patil , University of Nevada Las Vegas, USA
Ajith Abraham , Chung Ang University, Korea
V. Muthukumar , University of Nevada Las Vegas, USA
Ashwini Raina , S.P.C.E, India
ABSTRACT
<p>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</p> <p>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.</p>
INDEX TERMS
null
CITATION
Shruti Patil, Ajith Abraham, V. Muthukumar, Ashwini Raina, "HAUNT-24: 24-bit Hierarchical, Application-Confined Unique Naming Technique", Intelligent Systems Design and Applications, International Conference on, vol. 00, no. , pp. 375-380, 2005, doi:10.1109/ISDA.2005.49
80 ms
(Ver 3.3 (11022016))