JOURNAL ARTICLE

On Asymptotic Capacity of Wireless Multi-hop Networks

Abstract

Multi-hop could bring advantages such as low up-front cost, easy network maintenance, robustness, reliable service coverage etc for the next generation wireless networking. However, to be more available, wireless multi-hop network confront with much more challenge. First of all, the capacity of multi-hop is an open issue, for the optimal schedule of the distributed node is still illegible. Derived from the reference, in this paper we decouple the multi-hop channel by feasible probability model, and then give analytical asymptotic capacity function for the multi-hop networking with practical parameters. By the new model we get a clear analytical capacity constraint relationship among the density of node, the number of nodes and networking, and the user sending probability.

Keywords:
Hop (telecommunications) Computer science Computer network Wireless network Wireless Robustness (evolution) Schedule Distributed computing Channel capacity Probability density function Channel (broadcasting) Telecommunications Mathematics

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
14
Refs
0.19
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Mobile Ad Hoc Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Cooperative Communication and Network Coding
Physical Sciences →  Computer Science →  Computer Networks and Communications
Wireless Networks and Protocols
Physical Sciences →  Computer Science →  Computer Networks and Communications
© 2026 ScienceGate Book Chapters — All rights reserved.