Throughput-Delay Tradeoffs in Large-Scale MANETs with Network Coding

被引：17
作者：
Zhang, Chi [1 ]
Fang, Yuguang [1 ,2 ]
Zhu, Xiaoyan [2 ]
机构：
[1] Univ Florida, Dept Elect & Comp Engn, Gainesville, FL 32611 USA
[2] Xidian Univ, Natl Key Lab Integrated Serv Networks, Xian, Peoples R China
来源：
IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5 | 2009年
基金：
美国国家科学基金会;
关键词：
CAPACITY; RUMOR;
D O I：
10.1109/INFCOM.2009.5061922
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper characterizes the throughput-delay tradeoffs in mobile ad hoc networks (MANETs) with network coding, and compares results in the situation where only replication and forwarding are allowed in each node. The schemes/protocols achieving those tradeoffs in an effective and decentralized way are proposed and the optimality of those tradeoffs is established. The scenarios in which network coding can provide significant improvement on network performance are identified under different node mobility patterns (fast and slow mobility). The insights on when and how information mixing is beneficial for MANETs with multiple unicast and multicast sessions are provided. As far as we know, this is the first work characterizing scaling laws of throughput and delay of MANETs with network coding.
引用
收藏
页码：199 / +
页数：2
相关论文
共 45 条
[1]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[2]  
AHMED E, 2007, P MILCOM 2007 ORL FL
[3]  
[Anonymous], 2004, P 3 ANN MED AD HOC N
[4]  
[Anonymous], REVERSIBLE MAR UNPUB
[5]  
[Anonymous], 2003, P ANN ALL C COMM CON
[6]  
[Anonymous], 0708 U MASS AMH COMP
[7]  
[Anonymous], 2003, P INT S INF THEOR IS
[8]  
[Anonymous], 1 INT WORKSH INF THE
[9]  
BANSAL N, 2003, P IEEE INFOCOM 2003
[10]   Algebraic gossip:: A network coding approach to optimal multiple rumor mongering [J].
Deb, Supratim ;
Medard, Muriel ;
Choute, Clifford .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2486-2507
12345