Year-end Sale % OFF 
Abstract
In 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.
Highlights
Wireless ad hoc networks (WANETs) are an emerging networking technology, which are widely used in environmental monitoring, emergency communication, and military applications, etc
The question remained: what is the throughput capacity of the network if the node exposed selfishness and the node density is general? In this work, we study the throughput of wireless ad hoc networks with selfish nodes under general node density. We denote these networks as SWANETs, which were widely researched in connectivity [20]
If the node density ζ > p(1n), there is no impact on the throughput, while for the case of ζ > p(1n), the throughput loss caused by node density is ζ α
Summary
Wireless ad hoc networks (WANETs) are an emerging networking technology, which are widely used in environmental monitoring, emergency communication, and military applications, etc. Since mobility plays an important role in wireless networks, Grossglauser et al [6] found that mobility can increase the throughput of networks They demonstrated that a per-node rate of Θ(1) can be achieved while the transmission. We study the throughput of wireless ad hoc networks with selfish nodes under general node density. We denote these networks as SWANETs, which were widely researched in connectivity [20]. We derive the asymptotic throughput capacity of the network combining selfish feature and general node density, which is different from the previous works of dense or extended p networks.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
