The Costly Path from Percolation to Full Connectivity
作者： Olivier Dousse , Patrick Thiran , Massimo Franceschetti
DOI:
关键词:
摘要: Requiring all nodes of a wireless multihop network to be connected is expensive and results in poor scalability properties such as transport capacity. We show however that it no longer the case if we only slightly loosen connectivity requirement, by just imposing most each other (so ``percolates``). This feature found models neglecting interferences, taking interferences noise or more information theoretic approach.
参考文章(9)
Piyush Gupta, P. R. Kumar, Critical Power for Asymptotic Connectivity in Wireless Networks Birkhäuser, Boston, MA. pp. 547- 566 ,(1999) , 10.1007/978-1-4612-1784-8_33
Mathew D. Penrose, Agoston Pisztora, Large deviations for discrete and continuous percolation Advances in Applied Probability. ,vol. 28, pp. 29- 52 ,(1996) , 10.2307/1427912
O. Dousse, M. Franceschetti, P. Thiran, Information theoretic bounds on the throughput scaling of wireless relay networks international conference on computer communications. ,vol. 4, pp. 2670- 2678 ,(2005) , 10.1109/INFCOM.2005.1498550
M. Franceschetti, O. Dousse, D.N.C. Tse, P. Tiran, Closing the gap in the capacity of random wireless networks international symposium on information theory. pp. 438- ,(2004) , 10.1109/ISIT.2004.1365476
S.R. Kulkarni, P. Viswanath, A deterministic approach to throughput scaling in wireless networks international symposium on information theory. ,vol. 50, pp. 1041- 1049 ,(2002) , 10.1109/TIT.2004.828055
P. Gupta, P.R. Kumar, The capacity of wireless networks IEEE Transactions on Information Theory. ,vol. 46, pp. 388- 404 ,(2000) , 10.1109/18.825799
O. Dousse, F. Baccelli, P. Thiran, Impact of interferences on connectivity in ad hoc networks IEEE ACM Transactions on Networking. ,vol. 13, pp. 425- 436 ,(2005) , 10.1109/TNET.2005.845546
Xin Liu, R. Srikant, An information-theoretic view of connectivity in wireless sensor networks sensor, mesh and ad hoc communications and networks. pp. 508- 516 ,(2004) , 10.1109/SAHCN.2004.1381953
Mathew D. Penrose, The longest edge of the random minimal spanning tree Annals of Applied Probability. ,vol. 7, pp. 340- 361 ,(1997) , 10.1214/AOAP/1034625335