On the Interplay Between Resource-Management Overhead and Performance in Sensor Networks: An Information Theoretic Approach

被引:0
作者
Rahnamay-Naeini, Mahshid [1 ,3 ]
Ghani, Nasir [2 ]
Hayat, Majeed M. [1 ,3 ]
机构
[1] Univ New Mexico, Dept Elect & Comp Engn, Albuquerque, NM 87131 USA
[2] Univ S Florida, Dept Elect Engn, Tampa, FL 33620 USA
[3] Univ New Mexico, Ctr High Technol Mat, Albuquerque, NM 87131 USA
来源
2013 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) | 2013年
关键词
Sensor networks; resource management; distributed computing; control overhead; information theory; distributed source coding; side information; PROTOCOL;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Resource management (RM) is a critical action in systems with limited resources such as sensor networks. Efficient RM depends heavily upon the availability of accurate information on the state of available resources. However, exchange of state information incurs an overhead on the system. In this paper, the sensing and computing resource management in sensor networks is considered. A lossless, distributed source-coding framework is presented to model the exchange of state information. The framework enables the characterization of the interplay between the performance and overhead of RM by leveraging the correlation among the state information of various nodes. Moreover, the proposed framework enables an improved estimate of the lower bound for the minimum control overhead necessary to accurately describe the state of nodes in the network. This improvement is achieved by exploiting the correlation among the state information of nodes as well as the available information on prior resource allocation actions as side information.
引用
收藏
页码:1564 / 1569
页数:6
相关论文
共 17 条
[1]  
[Anonymous], 2012, Network Information Theory
[2]  
[Anonymous], J ARTICIAL INTELLIGE
[3]  
[Anonymous], 27 C COMP COMM IEEE
[4]   The CEO problem [J].
Berger, T ;
Zhang, Z ;
Viswanathan, H .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (03) :887-902
[5]  
Bramson M, 2010, PERF E R SI, V38, P275, DOI 10.1145/1811099.1811071
[6]   Rate-distortion based link state update [J].
Cheng, Gang ;
Ansari, Nirwan .
COMPUTER NETWORKS, 2006, 50 (17) :3300-3314
[7]   PROOF OF DATA COMPRESSION THEOREM OF SLEPIAN AND WOLF FOR ERGODIC SOURCES [J].
COVER, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (02) :226-228
[8]   BASIC LIMITS ON PROTOCOL INFORMATION IN DATA COMMUNICATION NETWORKS [J].
GALLAGER, RG .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (04) :385-398
[9]  
Giordano Vincenzo, 2005, Cutting Edge Robotics, P133
[10]  
Hong J, 2009, GLOB TELECOMM CONF, P3540