DocumentCode
2035629
Title
Load Balanced and Efficient Hierarchical Data-Centric Storage in Sensor Networks
Author
Zhao, Yao ; Chen, Yan ; Ratnasamy, Sylvia
Author_Institution
Northwestern Univ., Evanston, IL
fYear
2008
fDate
16-20 June 2008
Firstpage
560
Lastpage
568
Abstract
Several new sensor network applications build on scalable, energy-aware data-centric storage. Data-centric storage is typically achieved by hashing a high-level data name to a well-known routable node address. Despite significant work on any-to-any routing for sensor networks, most schemes do not provide a node address space that is amenable to the needs of data-centric storage. Our work focuses on the problem of designing a routing primitive suitable for data-centric storage that also meets typical sensor network goals of scalability, energy-efficiency and load-balance. In this paper, we present a new hierarchical Voronoi graph based routing algorithm (HVGR) that simultaneously achieves good scalability, efficiency in routing, and load balance in both routing and data storage. The region oriented routing scheme avoids overloading cluster headers by "short-cutting" routes before they actually hit cluster headers. The storage load balancing algorithm achieves uniform distribution of storage load.
Keywords
graph theory; telecommunication network routing; wireless sensor networks; data-centric storage; hierarchical Voronoi graph based routing; load balancing; node address space; routable node address; sensor networks; Clustering algorithms; Distributed control; Energy efficiency; Energy storage; Global Positioning System; Load management; Memory; Routing; Scalability; Sensor systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Sensor, Mesh and Ad Hoc Communications and Networks, 2008. SECON '08. 5th Annual IEEE Communications Society Conference on
Conference_Location
San Francisco, CA
Print_ISBN
978-1-4244-1777-3
Electronic_ISBN
978-1-4244-1776-6
Type
conf
DOI
10.1109/SAHCN.2008.73
Filename
4557796
Link To Document