Wireless Network Compression Via Memory-Enabled Overhearing Helpers

被引:10
作者
Beirami, Ahmad [1 ,2 ,3 ]
Sardari, Mohsen [1 ,4 ]
Fekri, Faramarz [5 ]
机构
[1] Georgia Inst Technol, Atlanta, GA 30332 USA
[2] Duke Univ, Dept Elect & Comp Engn, Durham, NC 27708 USA
[3] MIT, Elect Res Lab, Cambridge, MA 02139 USA
[4] Elect Arts Inc, Redwood City, CA 94065 USA
[5] Georgia Inst Technol, Sch Elect & Comp Engn, Atlanta, GA 30332 USA
关键词
Cooperative communication; network compression; overhearing helper nodes; redundancy elimination; two-part codes; wireless network; UNIVERSAL COMPRESSION; INFORMATION; REDUNDANCY;
D O I
10.1109/TWC.2015.2468729
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Traces derived from real-world traffic show that significant redundancy exists at the packet level in mobile network traffic. This has inspired new solutions to suppress the redundancy present in the packet data to manage the explosive traffic. In this paper, we propose a novel approach to performing redundancy elimination by employing universal compression using memory-enabled overhearing helpers without backhaul connectivity, referred to as wireless network compression. The helpers overhear the data packets previously sent by the wireless gateway to various mobile clients within their coverage and use them as side information to reduce the overall communication cost. We study wireless network compression via overhearing helpers from an information-theoretic point of view and conclude that this approach potentially offers a threefold benefit: 1) offloading the wireless gateway and hence increasing the maximum number of mobile nodes the gateway can reliably serve; 2) reducing the average packet delay; and 3) improving the overall throughput in the network.
引用
收藏
页码:176 / 190
页数:15
相关论文
共 37 条
[1]   Packet caches on routers: The implications of universal redundant traffic elimination [J].
Anand, Ashok ;
Gupta, Archit ;
Akella, Aditya ;
Seshan, Srinivasan ;
Shenker, Scott .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2008, 38 (04) :219-230
[2]   SmartRE: An Architecture for Coordinated Network-wide Redundancy Elimination [J].
Anand, Ashok ;
Sekar, Vyas ;
Akella, Aditya .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2009, 39 (04) :87-98
[3]  
Anand A, 2009, PERF E R SI, V37, P37
[4]  
[Anonymous], P 10 ACM SIGCOMM C I
[5]   The asymptotic redundancy of Bayes rules for Markov chains [J].
Atteson, K .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (06) :2104-2109
[6]  
Baron D., 2003, THESIS U ILLINOIS UR
[7]   The minimum description length principle in coding and modeling [J].
Barron, A ;
Rissanen, J ;
Yu, B .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2743-2760
[8]   MINIMUM COMPLEXITY DENSITY-ESTIMATION [J].
BARRON, AR ;
COVER, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (04) :1034-1054
[9]  
Beirami A., 2015, IEEE ACM T NETWORK, P1
[10]  
Beirami A., 2014, ARXIV14117607