{"title":"Closing the capacity gap in wireless ad hoc networks using multi-packet reception","authors":"Zheng Wang, H. Sadjadpour, J. Garcia-Luna-Aceves","doi":"10.1109/ITA.2008.4601063","DOIUrl":null,"url":null,"abstract":"In this paper, we compute the throughput capacity of random wireless ad hoc networks in which nodes are endowed with multipacket reception (MPR) capabilities. We show that lambda(n) = Theta((R(n))(1-2/alpha)/n1/alpha) bits per second constitutes a tight bound for the throughput capacity of random wireless ad hoc networks using physical model, where alpha > 2 is the path loss parameter in the physical model, n is the total number of nodes in the network, and R(n) is the MPR receiver range. Compared to the original result derived for plain routing by Gupta and Kumar, MPR closes the capacity gap and achieves a capacity gain of at least Theta((log n)alpha-2/2alpha) when R(n) = Theta(radiclog n/n).","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"13 13","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Information Theory and Applications Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2008.4601063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In this paper, we compute the throughput capacity of random wireless ad hoc networks in which nodes are endowed with multipacket reception (MPR) capabilities. We show that lambda(n) = Theta((R(n))(1-2/alpha)/n1/alpha) bits per second constitutes a tight bound for the throughput capacity of random wireless ad hoc networks using physical model, where alpha > 2 is the path loss parameter in the physical model, n is the total number of nodes in the network, and R(n) is the MPR receiver range. Compared to the original result derived for plain routing by Gupta and Kumar, MPR closes the capacity gap and achieves a capacity gain of at least Theta((log n)alpha-2/2alpha) when R(n) = Theta(radiclog n/n).