Throughput Capacity of Selfish Wireless Ad Hoc Networks with General Node Density
AbstractIn this paper, we study the throughput capacity of wireless networks considering the selfish feature of interaction between nodes. In our proposed network model, each node has a probability of cooperating to relay transmission. According to the extent of selfishness, we, by the application of percolation theory, construct a series of highways crossing the network. The transmission strategy is then divided into three consecutive phases. Comparing the rate in each phase, we find the bottleneck of rate is always in the highway phase. Finally, the result reveals that the node’s selfishness degrades the throughput with a factor of square root of the cooperative probability, whereas the node density has trivial impact on the throughput. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Liu, Q.; Luo, Y.; Ling, Y.; Zheng, J. Throughput Capacity of Selfish Wireless Ad Hoc Networks with General Node Density. Information 2016, 7, 16.
Liu Q, Luo Y, Ling Y, Zheng J. Throughput Capacity of Selfish Wireless Ad Hoc Networks with General Node Density. Information. 2016; 7(1):16.Chicago/Turabian Style
Liu, Qiuming; Luo, Yong; Ling, Yun; Zheng, Jun. 2016. "Throughput Capacity of Selfish Wireless Ad Hoc Networks with General Node Density." Information 7, no. 1: 16.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.