Maximizing End-to-End Throughput of Interference-Limited Multihop Networks

被引:4
|
作者
Hu, Dali [1 ,2 ]
wu, Jingxian [3 ]
Fan, Pingzhi [1 ]
机构
[1] Southwest Jiaotong Univ, Key Lab Informat Coding & Transmiss, Chengdu 611756, Sichuan, Peoples R China
[2] Nanyang Normal Univ, Sch Math & Stat, Nanyang 473061, Peoples R China
[3] Univ Arkansas, Dept Elect Engn, Fayetteville, AR 72701 USA
基金
美国国家科学基金会;
关键词
Multi-hop network; throughput; signal-to-interference ratio (SIR); Poisson point process (PPP); TRANSMISSION; CAPACITY; OUTAGE;
D O I
10.1109/TVT.2017.2772856
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The optimum designs of multihop networks operating in an interference-limited environment are studied in this paper. The objective is to identify the optimum operation parameters that can maximize the end-to-end throughput of a multihop link in the network. The optimum designs are performed with respect to two parameters, the number of hops, and the signal-to-interference ratio (SIR) threshold for successful transmission. Under a fixed total transmission power, more hops means shorter distance for each hop, but also less power per hop and longer delays. A higher SIR threshold can achieve a higher throughput by employing high-order modulations, but at the cost of a higher outage probability. We capture these tradeoff relationships by deriving the throughput, which is expressed as an explicit function of a number of system parameters. It is shown through theoretical analysis that the throughput is quasi-concave in the number of hops or the SIR threshold, and the optimum design parameters that can maximize the throughput are obtained analytically and verified through simulations.
引用
收藏
页码:5465 / 5469
页数:5
相关论文
共 50 条
  • [41] End-to-end batch transmission in a multihop and multirate wireless network: Latency, reliability, and throughput analysis
    Issariyakul, Teerawat
    Hossain, Ekram
    Alfa, Attahiru Sule
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2006, 5 (09) : 1143 - 1155
  • [42] Weighted-DESYNC and Its Application to End-to-End Throughput Fairness in Wireless Multihop Network
    Yu, Ui-Seong
    Jung, Ji-Young
    Kong, Eutteum
    Choi, HyungSeok
    Lee, Jung-Ryun
    MOBILE INFORMATION SYSTEMS, 2017, 2017
  • [43] Scheduling for End-to-End Deadline-Constrained Traffic With Reliability Requirements in Multihop Networks
    Li, Ruogu
    Eryilmaz, Atilla
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2012, 20 (05) : 1649 - 1662
  • [44] Availability and End-to-end Reliability in Low Duty Cycle Multihop Wireless Sensor Networks
    Suhonen, Jukka
    Hamalainen, Timo D.
    Hannikainen, Marko
    SENSORS, 2009, 9 (03) : 2088 - 2116
  • [45] Near-Optimal Packet Scheduling in Multihop Networks with End-to-End Deadline Constraints
    Tsanikidis, Christos
    Ghaderi, Javad
    PROCEEDINGS OF THE ACM ON MEASUREMENT AND ANALYSIS OF COMPUTING SYSTEMS, 2023, 7 (03)
  • [46] Link Activity Scheduling for Minimum End-to-End Latency in Multihop Wireless Sensor Networks
    Cheng, Maggie X.
    Gong, Xuan
    Xu, Yibo
    Cai, Lin
    2011 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE (GLOBECOM 2011), 2011,
  • [47] Game Theoretic Approach for End-to-End Resource Allocation in Multihop Cognitive Radio Networks
    Canales, Maria
    Ortin, Jorge
    Ramon Gallego, Jose
    IEEE COMMUNICATIONS LETTERS, 2012, 16 (05) : 654 - 657
  • [48] Performance Evaluation of Fully Homomorphic Encryption for End-to-End Cryptographic Communication in Multihop Networks
    Shim, Hye-Yeon
    Park, Tae-Rim
    Lee, Il-Gu
    2022 24TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY (ICACT): ARITIFLCIAL INTELLIGENCE TECHNOLOGIES TOWARD CYBERSECURITY, 2022, : 431 - 434
  • [49] Near-Optimal Packet Scheduling in Multihop Networks with End-to-End Deadline Constraints
    Tsanikidis C.
    Ghaderi J.
    Performance Evaluation Review, 2024, 52 (01): : 33 - 34
  • [50] Adaptive per hop differentiation for end-to-end delay assurance in multihop wireless networks
    Li, Jian
    Li, Zhi
    Mohapatra, Prasant
    AD HOC NETWORKS, 2009, 7 (06) : 1169 - 1182