The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2013 vol.24)
pp: 754-766
Xinbing Wang , Dept. of Electron. Eng., Shanghai Jiao Tong Univ., Shanghai, China
Tuo Yu , Dept. of Electron. Eng., Shanghai Jiao Tong Univ., Shanghai, China
Yuanzhong Xu , Dept. of Electron. Eng., Shanghai Jiao Tong Univ., Shanghai, China
ABSTRACT
We study the fundamental lower bound for node buffer size in intermittently connected wireless networks. The intermittent connectivity is caused by the possibility of node inactivity due to some external constraints. We find even with infinite channel capacity and node processing speed, buffer occupation in each node does not approach zero in a static random network where each node keeps a constant message generation rate. Given the condition that each node has the same probability p of being inactive during each time slot, there exists a critical value pc(λ) for this probability from a percolation-based perspective. When p <; pc(λ), the network is in the supercritical case, and there is an achievable lower bound (In our paper, “achievable” means that node buffer size in networks can achieve the same order as the lower bound by applying some transmission scheme) for the occupied buffer size of each node, which is asymptotically independent of the size of the network. If p > pc(λ), the network is in the subcritical case, and there is a tight lower bound Θ(√n) for buffer occupation, where n is the number of nodes in the network.
INDEX TERMS
random processes, channel capacity, probability, radio networks, buffer occupation, fundamental lower bound, node buffer size, intermittently connected wireless networks, intermittent connectivity, node inactivity, infinite channel capacity, node processing speed, static random network, constant message generation rate, percolation-based perspective, supercritical case, transmission scheme, Wireless networks, Routing, Delay, Wireless sensor networks, Channel capacity, Transmitters, Throughput, wireless networks, Buffer size
CITATION
Xinbing Wang, Tuo Yu, Yuanzhong Xu, "Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 4, pp. 754-766, April 2013, doi:10.1109/TPDS.2012.119
REFERENCES
[1] P. Gupta and P.R. Kumar, "The Capacity of Wireless Networks," IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
[2] K. Fall, "A Delay-Tolerant Network Architecture for Challenged Internets," Proc. ACM SIGCOMM, pp. 27-34, 2003.
[3] A. Balasubramanian, B.N. Levine, and A. Venkataramani, "DTN Routing as a Resource Allocation Problem," ACM SIGCOMM, pp. 373-384, 2007.
[4] U. Lee, S.Y. Oh, K.-W. Lee, and M. Gerla, "Scaling Properties of Delay Tolerant Networks with Correlated Motion Patterns," ACM MobiCom, Sept. 2009.
[5] W. Zhao, Y. Chen, M. Ammar, M. Corner, B. Levine, and E. Zegura, "Capacity Enhancement Using Throwboxes in DTNs," Proc. IEEE Int'l Conf. Mobile Adhoc and Sensor Systems (MASS), 2006.
[6] T. Spyropoulos, K. Psounis, and C. Raghavendra, "Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case," IEEE/ACM Trans. Networking, vol. 16, no. 1, pp. 63-76, Feb. 2008.
[7] T. Spyropoulos, K. Psounis, and C. Raghavendra, "Efficient Routing in Intermittently Connected Mobile Networks: The Multi-Copy Case," IEEE/ACM Trans. Networking, vol. 16, no. 1, pp. 77-90, Feb. 2008.
[8] O. Dousse, P. Mannersalo, and P. Thiran, "Latency of Wireless Sensor Networks with Uncoordinated Power Saing Mechanisms," Proc. ACM MobiHoc '04, May 2004.
[9] W. Ren, Q. Zhao, and A. Swami, "On the Connectivity and Multihop Delay of Ad Hoc Cognitive Radio Networks," Proc. IEEE Int'l Conf. Comm. (ICC), May 2010.
[10] Z. Kong and E.M. Yeh, "On the Latency for Information Dissemination in Mobile Wireless Networks," Proc. ACM MobiHoc '08, May. 2008.
[11] J.D. Herdtner and E. Chong, "Throughput-Storage Tradeoff in Ad Hoc Networks," IEEE INFOCOM, 2005.
[12] S. Bodas, S. Shakkottai, L. Ying, and R. Srikant, "Scheduling in Multi-Channel Wireless Networks: Rate Function Optimality in the Small-Buffer Regime," Proc. 11th Int'l Joint Conf. Measurement and Modeling of Computer Systems (SIGMETRICS), June 2009.
[13] G.R. Grimmett, Percolaiton. Springer, 1999.
[14] R. Meester and R. Roy, Continuum Percolation. Cambridge Univ. Press, 1996.
[15] M. Penrose, Random Geometric Graphs. Oxford Univ. Press, 2003.
[16] T.M. Liggett, "An Improved Subadditive Ergodic Theorem," The Annals of Probability, vol. 13, no. 4, pp. 1279-1285, 1985.
[17] M. Franceschetti, O. Dousse, D. Tse, and P. Thiran, "Closing the Gap in the Capacity of Wireless Networks via Percolation Theory," IEEE Trans. Information Theory, vol. 53, no. 3, pp. 1009-1018, Mar. 2007.
[18] C. Hu, X. Wang, D. Nie, and J. Zhao, "Multicast Scaling Laws with Hierarchical Cooperation," Proc. IEEE INFOCOM '10, 2010.
[19] C. Hu, X. Wang, and F. Wu, "MotionCast: On the Capacity and Delay Tradeoffs," ACM MobiHoc '09, May 2009.
[20] Y. Liu, K. Liu, and M. Li, "Passive Diagnosis for Wireless Sensor Networks," IEEE/ACM Trans. Networking (TON), vol. 18, no. 4, pp. 1132-1144, Aug. 2010.
[21] Y. Liu, Y. He, M. Li, et al., "Does Wireless Sensor Network Scale? A Measurement Study on GreenOrbs," Proc. IEEE INFOCOM, Apr. 2011.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool