TY - GEN
T1 - Load balanced and efficient hierarchical data-centric storage in sensor networks
AU - Zhao, Yao
AU - Chen, Yan
AU - Ratnasamy, Sylvia
N1 - Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2008
Y1 - 2008
N2 - 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-toany 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 loadbalance. In this paper, we present a new Hierarchical Voronol 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.
AB - 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-toany 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 loadbalance. In this paper, we present a new Hierarchical Voronol 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.
UR - http://www.scopus.com/inward/record.url?scp=51749116742&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51749116742&partnerID=8YFLogxK
U2 - 10.1109/SAHCN.2008.73
DO - 10.1109/SAHCN.2008.73
M3 - Conference contribution
AN - SCOPUS:51749116742
SN - 9781424417773
T3 - 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON
SP - 560
EP - 568
BT - 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON
T2 - 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2008
Y2 - 16 June 2008 through 20 June 2008
ER -
