DocumentCode :
623611
Title :
Cut graph based information storage and retrieval in 3D sensor networks with general topology
Author :
Yang Yang ; Miao Jin ; Yao Zhao ; Hongyi Wu
Author_Institution :
Center for Adv. Comput. Studies, Univ. of Louisiana at Lafayette, Lafayette, LA, USA
fYear :
2013
fDate :
14-19 April 2013
Firstpage :
465
Lastpage :
469
Abstract :
We address the problem of in-network information processing, storage, and retrieval in three-dimensional (3D) sensor networks in this research. We propose a geographic location free double-ruling-based scheme for large-scale 3D sensor networks. The proposed approach does not require a 3D sensor network with a regular cube shape or uniform node distribution. Without the knowledge of the geographic location and the distance bound, a data query simply travels along a simple curve with the guaranteed success to retrieve aggregated data through time and space with one or different types across the network. Simulations and comparisons show the proposed approach with low cost and a balanced traffic load.
Keywords :
distributed sensors; graph theory; information storage; query processing; balanced traffic load; cut graph-based information storage; data query; geographic location free double-ruling-based scheme; in-network information processing; information retrieval; large-scale 3D sensor networks; regular cube shape; three-dimensional sensor networks; uniform node distribution; Memory; Network topology; Routing; Shape; Tiles; Topology; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM, 2013 Proceedings IEEE
Conference_Location :
Turin
ISSN :
0743-166X
Print_ISBN :
978-1-4673-5944-3
Type :
conf
DOI :
10.1109/INFCOM.2013.6566816
Filename :
6566816
Link To Document :
بازگشت