{"title":"Capacity and delay analysis of multi-hop wireless networks","authors":"Jan Laarhuis , Alessandro Chiumento","doi":"10.1016/j.adhoc.2024.103750","DOIUrl":null,"url":null,"abstract":"<div><div>The capacity and delay of wireless multi-hop networks are key performance indicators. They are needed in the design of such networks, and are also useful to assess how well applications can run over such networks. However, finding analytical expressions for capacity and delay for a wireless multi-hop network with an arbitrary topology is hard. In this work, a two-step approach is followed to derive expressions for the maximum achievable capacity and the minimum achievable delay in wireless multi-hop networks. These expressions are valid for fixed, conflict-free time-slot scheduling among the nodes, and when each nodes of the network has always packets to send to each of its neighbours. In the first step, expressions for the capacity and delay of the elementary topologies ’string’ and ’star’ are derived, and in the second step, these results are combined to derive the capacity and delay values for a network with an arbitrary topology. This two-step approach is applied to two types of wireless multi-hop networks: those whose nodes have an omni-directional antenna, and those whose nodes have an electronically steerable directional (beam-steering) antenna. Using this approach, we find that the capacity of a path on the network is not a decreasing function of the total number of nodes in the network, as mostly found in literature, but rather a decreasing function of the number of neighbours of the nodes on the path. The results show that the derived maximum value for the capacity (and minimum value for the delay) in networks with beam-steering antennas is larger (lower) than that for networks with omni-directional antennas as more efficient scheduling is possible for the former. The derived analytic expressions for capacity and delay are valuable for the relative comparison of the performance of wireless multi-hop networks.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103750"},"PeriodicalIF":4.4000,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870524003615","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
The capacity and delay of wireless multi-hop networks are key performance indicators. They are needed in the design of such networks, and are also useful to assess how well applications can run over such networks. However, finding analytical expressions for capacity and delay for a wireless multi-hop network with an arbitrary topology is hard. In this work, a two-step approach is followed to derive expressions for the maximum achievable capacity and the minimum achievable delay in wireless multi-hop networks. These expressions are valid for fixed, conflict-free time-slot scheduling among the nodes, and when each nodes of the network has always packets to send to each of its neighbours. In the first step, expressions for the capacity and delay of the elementary topologies ’string’ and ’star’ are derived, and in the second step, these results are combined to derive the capacity and delay values for a network with an arbitrary topology. This two-step approach is applied to two types of wireless multi-hop networks: those whose nodes have an omni-directional antenna, and those whose nodes have an electronically steerable directional (beam-steering) antenna. Using this approach, we find that the capacity of a path on the network is not a decreasing function of the total number of nodes in the network, as mostly found in literature, but rather a decreasing function of the number of neighbours of the nodes on the path. The results show that the derived maximum value for the capacity (and minimum value for the delay) in networks with beam-steering antennas is larger (lower) than that for networks with omni-directional antennas as more efficient scheduling is possible for the former. The derived analytic expressions for capacity and delay are valuable for the relative comparison of the performance of wireless multi-hop networks.
期刊介绍:
The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to:
Mobile and Wireless Ad Hoc Networks
Sensor Networks
Wireless Local and Personal Area Networks
Home Networks
Ad Hoc Networks of Autonomous Intelligent Systems
Novel Architectures for Ad Hoc and Sensor Networks
Self-organizing Network Architectures and Protocols
Transport Layer Protocols
Routing protocols (unicast, multicast, geocast, etc.)
Media Access Control Techniques
Error Control Schemes
Power-Aware, Low-Power and Energy-Efficient Designs
Synchronization and Scheduling Issues
Mobility Management
Mobility-Tolerant Communication Protocols
Location Tracking and Location-based Services
Resource and Information Management
Security and Fault-Tolerance Issues
Hardware and Software Platforms, Systems, and Testbeds
Experimental and Prototype Results
Quality-of-Service Issues
Cross-Layer Interactions
Scalability Issues
Performance Analysis and Simulation of Protocols.