A Throughput Fairness-based Grouping Strategy for Dense IEEE 802.11ah Networks

Mosavat-Jahromi, Hamed; Li, Yue; Cai, Lin

doi:10.1109/pimrc.2019.8904310

Cited by 14 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the grouping algorithms of [4][5][6][7][8][9], only the hidden node problem is considered. In our work, the load balance is synchronously considered.…”

Section: Resultsmentioning

confidence: 99%

“…In [6], the authors propose a hidden node grouping algorithm based on IEEE 802.11ah Restricted Access Window, in which the hidden node information is collected by the association process. Utilizing the integer programming optimization method, the authors of [7] propose a grouping scheme of hidden terminal avoidance. In [8], the intercluster grouping method is proposed to eliminate the hidden node problem.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Grouping Algorithm for Random Access Networks and Supermartingale Evaluation

Sun

Chi

2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Wireless communications play a critical role in the applications of Internet of Things (IoT). The Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) is a well-proven wireless random access protocol. A crucial factor affecting the performance of random access networks is “hidden node collision,” which incurs performance degradation and lower resource utilization. Grouping is an efficient strategy for hidden node avoidance. In current IoT networks, the terminals usually have different traffic load, so load balance should be considered when grouping algorithm is designed. To mitigate hidden nodes and achieve load balance simultaneously, we propose a grouping algorithm based on the game theory. By introducing the supermartingale theory, the delay performance of the completed groups is analyzed. Simulations prove that the proposed algorithm alleviates collision, balances traffic, and promotes the efficient guarantee for Quality of Service (QoS).

show abstract

“…In the grouping algorithms of [4][5][6][7][8][9], only the hidden node problem is considered. In our work, the load balance is synchronously considered.…”

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Grouping Algorithm for Random Access Networks and Supermartingale Evaluation

Sun

Chi

2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…Neighboring UEs listen to this information at CP time and allocate resources other than the informed resources. CSMA/CA is used to transmit RR and RG, but CSMA/CA is not suitable in an environment with a high density of UEs [26], [27], where the competition window is not easily adjusted, and a long competition window lowers the channel efficiency. Besides, the authors did not consider the error rates of RR and RG.…”

Section: Related Workmentioning

confidence: 99%

Evolved Wireless ad Hoc Network: Design and Operating Principle for Wireless Resource Management of Mobile Terminals

Hwang

Ahn

2022

IEEE Access

View full text Add to dashboard Cite

This paper proposes an evolved wireless ad hoc network (WANET) in which user equipment (UE) can manage radio resources by itself without the control by infrastructure. There are two independent channels in the proposed WANET, one is a data channel, the other is a tone channel for resource management. UEs allocate, occupy, and return resources by using tones in the tone channel. Although UEs do not exchange channel information with each other, they are able to occupy a clear one-hop area without a hidden node problem by setting the data communication area and the tone communication area differently. A UE occupying a resource performs a real time collision check on the occupied resource, and if a collision is detected, it is able to re-occupy a resource without collision. In this paper, we present the operating principle of the proposed WANET, and design its communication area, and analyze the average resource occupation time. Since the proposed WANET operates in a general communication environment that is not limited to special assumptions, it supports periodic and aperiodic communication and broadcast links and unicast links without hidden node problem, and could be utilized to various communication fields such as drones, vehicles, ships, and smartphones.INDEX TERMS Ad hoc networks, hidden node, medium access control, packet collision resolution.

show abstract

“…Integer programming is used to optimize the performance of IEEE 802.11ah in terms of energy efficiency [25], [26], throughput [27], [28], channel utilization [29] and hidden node mitigation [30], [31]. An integer nonlinear programming approach is employed for optimizing energy efficiency by taking into account traffic demands with even distribution of all RAW groups [25].…”

Section: Related Workmentioning

confidence: 99%

“…Another study optimizes activation/sleep scheduling to maximize network lifetime in environmental monitoring applications, while satisfying both report-accuracy and timely update requirements [26]. Throughput is optimized via non-convex integer programming optimization which avoids hidden terminals opportunistically [27]. A multi-objective optimization problem that addresses throughput maximization while minimizing unfairness across RAWs (i.e.…”

Section: Related Workmentioning

confidence: 99%

Enabling Wireless Closed Loop Communication: Optimal Scheduling Over IEEE 802.11ah Networks

2021

View full text Add to dashboard Cite

Industry 4.0 is being enabled by a number of new wireless technologies that emerged in the last decade, aiming to ultimately alleviate the need for wires in industrial use cases. However, wireless solutions are still neither as reliable nor as fast as their wired counterparts. Closed loop communication, a representative industrial communication scenario, requires high reliability (over 99%) and hard real-time operation, having very little tolerance for delays. Additionally, connectivity must be provided over an entire industrial side extending across hundreds of meters. IEEE 802.11ah fits this puzzle in terms of data rates and range, but it does not guarantee deterministic communication by default. Its Restricted Access Window (RAW), a new configurable medium access feature, enables flexible scheduling in dense, large-scale networks. However, the standard does not define how to configure RAW. The existing RAW configuration strategies assume uplink traffic only and are dedicated exclusively to sensors nodes. In this article, we present an integer nonlinear programming problem formulation for optimizing RAW configuration in terms of latency in closed loop communication between sensors and actuators, taking into account both uplink and downlink traffic. The model results in less than 1% of missed deadlines without any prior knowledge of the network parameters in heterogeneous time-changing networks.INDEX TERMS IEEE 802.11ah, industrial Internet of Things (IIoT), optimization, restricted access window (RAW), Wi-Fi HaLow, wireless automation.

show abstract

A Throughput Fairness-based Grouping Strategy for Dense IEEE 802.11ah Networks

Cited by 14 publications

References 18 publications

A Grouping Algorithm for Random Access Networks and Supermartingale Evaluation

A Grouping Algorithm for Random Access Networks and Supermartingale Evaluation

Evolved Wireless ad Hoc Network: Design and Operating Principle for Wireless Resource Management of Mobile Terminals

Enabling Wireless Closed Loop Communication: Optimal Scheduling Over IEEE 802.11ah Networks

Contact Info

Product

Resources

About