Parameter Tuning of the Protocol Interference Model Using SINR for Time Slot Assignment in Wireless Mesh Networks
スポンサーリンク
概要
- 論文の詳細を見る
In time division multiple access (TDMA)-based wireless mesh networks, interference relationships should be considered when time slots are assigned to links. In graph theory-based time slot assignment algorithms, the protocol interference model is widely used to determine radio interference information, although it is an inaccurate model of actual radio interference. On the other hand, the signal-to-interference-plus-noise-ratio model (SINR model) gives more accurate interference relationships but is difficult to apply to time slot assignment algorithms since the radio interference information cannot be determined before time slot assignment. In this paper, we investigate the effect of the parameters of the protocol interference model on the accuracy of the interference relationships determined using this model. Specifically, after assigning time slots to links based on the protocol interference model with various interference ratios, which is the major parameter of the protocol interference model, we compare the interference relationship among links in the protocol interference and SINR models. Through simulation experiments, we show that accuracy of the protocol interference model is improved by up to 15% by adjusting the interference ratios of the protocol interference model.
- (社)電子情報通信学会の論文
- 2011-11-01
著者
-
Hasegawa Go
Osaka Univ. Toyonaka‐shi Jpn
-
Hasegawa Go
Cybermedia Center Osaka University
-
Nakano Hirotaka
Osaka Univ. Toyonaka‐shi Jpn
-
Nakano Hirotaka
Cybermedia Center Osaka University
-
Taniguchi Yoshiaki
Cybermedia Center Osaka University
-
KANG Gyeongyeon
Graduate School of Information Science and Technology
関連論文
- New Methods for Maintaining Fairness between Well-Behaved TCP Flows and Tampered-TCP Flows at Edge Routers
- Evaluation of Free-Riding Traffic Problem in Overlay Routing and Its Mitigation Method
- Effectiveness of Overlay Routing Based on Delay and Bandwidth Information
- Analysis Evaluation of Parallel TCP : Is It Really Effective for Long Fat Networks?(Internet)
- Survey on Fairness Issues in TCP Congestion Control Mechanisms (Special Issue on New Developments on QoS Technologies for Information Networks)
- Load-Balanced and Interference-Aware Spanning Tree Construction Algorithm for TDMA-Based Wireless Mesh Networks
- Experimental Results of Implementing High-Speed and Parallel TCP Variants for Long Fat Networks (Internet)
- Performance Analysis and Improvement of HighSpeed TCP with TailDrop/RED Routers(Internet)
- Modeling TCP Throughput over Wired/Wireless Heterogeneous Networks for Receiver-Based ACK Splitting Mechanism(Internet)
- Receiver-Based ACK Splitting Mechanism for TCP over Wired/Wireless Heterogeneous Networks(Network)
- SB-10-1 Congestion Prevention Buffer Management in TCP Proxy(SB-10. Latest Trends on Broadband Contents Delivery Technologies)
- Background TCP Data Transfer with Inline Network Measurement(Internet)
- Improving Success Ratio of Object Search in Highly-Dynamic Mobile P2P Networks
- SHOT : Scenario-Type Hypothesis Object Tracking with Indoor Sensor Networks
- Parameter Tuning of the Protocol Interference Model Using SINR for Time Slot Assignment in Wireless Mesh Networks
- An Energy-Efficient Data Gathering Mechanism using Traveling Wave and Spatial Interpolation for Wireless Sensor Networks
- An Energy-Efficient Data Gathering Mechanism using Traveling Wave and Spatial Interpolation for Wireless Sensor Networks
- Time Slot Assignment Algorithms to Upstream Links for Decreasing Transmission Latency in IEEE 802.16j Networks
- Time Slot Assignment Algorithms to Upstream Links for Decreasing Transmission Latency in IEEE 802.16j Networks
- A Routing Strategy for Multihomed ISP to Mitigate the Impact of Overlay Traffic
- A Method to Reduce Inter-ISP Transit Cost Caused by Overlay Routing Based on End-to-End Network Measurement
- An Application-Level Routing Method with Transit Cost Reduction Based on a Distributed Heuristic Algorithm
- The Implications of Overlay Routing for ISPs' Peering Strategies
- A Method to Reduce Inter-ISP Transit Cost Caused by Overlay Routing Based on End-to-End Network Measurement
- An Application-Level Routing Method with Transit Cost Reduction Based on a Distributed Heuristic Algorithm