Subscribe
Issue No.06 - June (2012 vol.11)
pp: 970-982
Luoyi Fu , Shanghai Jiaotong University, Shanghai
Xiaohua Tian , Shanghai Jiaotong University, Shanghai
Yuanzhe Bei , Shanghai Jiaotong University, Shanghai
Qiuyu Peng , Shanghai Jiaotong University, Shanghai
Xiaoying Gan , Shanghai Jiaotong University, Shanghai
Hui Yu , Shanghai Jiaotong University, Shanghai
Jing Liu , Shanghai Jiaotong University, Shanghai
ABSTRACT
In this paper, we define an ad hoc network where multiple sources transmit packets to one destination as Converge-Cast network. We will study the capacity delay tradeoffs assuming that n wireless nodes are deployed in a unit square. For each session (the session is a dataflow from k different source nodes to 1 destination node), k nodes are randomly selected as active sources and each transmits one packet to a particular destination node, which is also randomly selected. We first consider the stationary case, where capacity is mainly discussed and delay is entirely dependent on the average number of hops. We find that the per-node capacity is \Theta (1/\sqrt{n\log n}) (given nonnegative functions f(n) and g(n){:} f(n) = O(g(n)) means there exist positive constants c and m such that f(n) \le cg(n) for all n \ge m; f(n)=\Omega (g(n)) means there exist positive constants c and m such that f(n)\ge cg(n) for all n \ge m; f(n) = \Theta (g(n)) means that both f(n) =\Omega (g(n)) and f(n) = O(g(n)) hold), which is the same as that of unicast, presented in [CHECK END OF SENTENCE]. Then, node mobility is introduced to increase network capacity, for which our study is performed in two steps. The first step is to establish the delay in single-session transmission. We find that the delay is \Theta (n\log k) under 1-hop strategy, and \Theta (n\log k/m) under 2-hop redundant strategy, where m denotes the number of replicas for each packet. The second step is to find delay and capacity in multisession transmission. We reveal that the per-node capacity and delay for 2-hop nonredundancy strategy are \Theta (1) and \Theta (n\log k), respectively. The optimal delay is \Theta (\sqrt{n\log k}+k) with redundancy, corresponding to a capacity of \Theta (\scriptstyle \sqrt{{1\over n\log k} }+{k\over n\log k} ). Therefore, we obtain that the capacity delay tradeoff satisfies delay/rate \ge \Theta (n\log k) for both strategies.
INDEX TERMS
Converge cast, capacity, delay.
CITATION
Luoyi Fu, Xiaohua Tian, Yuanzhe Bei, Qiuyu Peng, Xiaoying Gan, Hui Yu, Jing Liu, "Converge Cast: On the Capacity and Delay Tradeoffs", IEEE Transactions on Mobile Computing, vol.11, no. 6, pp. 970-982, June 2012, doi:10.1109/TMC.2011.110
REFERENCES