Spectrum Utilization and Congestion of IEEE 802.11 Networks in the 2.4 GHz ISM Band

Wi-Fi technology, plays a major role in society thanks to its widespread availability, ease of use and low cost. To assure its long term viability in terms of capacity and ability to share the spectrum efficiently, it is of paramount to study the spectrum utilization and congestion mechanisms in live environments. In this paper the service level in the 2.4 GHz ISM band is investigated with focus on todays IEEE 802.11 WLAN systems with support for the 802.11e extension. Here service level means the overall Quality of Service (QoS), i.e. can all devices fulfill their communication needs? A crosslayer approach is used, since the service level can be measured at several levels of the protocol stack. The focus is on monitoring at both the Physical (PHY) and the Medium Access Control (MAC) link layer simultaneously by performing respectively power measurements with a spectrum analyzer to assess spectrum utilization and packet sniffing to measure the congestion. Compared to traditional QoS analysis in 802.11 networks, packet sniffing allows to study the occurring congestion mechanisms more thoroughly. The monitoring is applied for the following two cases. First the influence of interference between WLAN networks sharing the same radio channel is investigated in a controlled environment. It turns out that retry rate, Clear-ToSend (CTS), Request-To-Send (RTS) and (Block) Acknowledgment (ACK) frames can be used to identify congestion, whereas the spectrum analyzer is employed to identify the source of interference. Secondly, live measurements are performed at three locations to identify this type of interference in real-live situations. Results show inefficient use of the wireless medium in certain scenarios, due to a large portion of management and control frames compared to data content frames (i.e. only 21% of the frames is identified as data frames)

Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

Multi-Round Contention in Wireless LANs with Multipacket Reception

Multi-packet reception (MPR) has been recognized as a powerful capacity-enhancement technique for random-access wireless local area networks (WLANs). As is common with all random access protocols, the wireless channel is often under-utilized in MPR WLANs. In this paper, we propose a novel multi-round contention random-access protocol to address this problem. This work complements the existing random-access methods that are based on single-round contention. In the proposed scheme, stations are given multiple chances to contend for the channel until there are a sufficient number of ``winning" stations that can share the MPR channel for data packet transmission. The key issue here is the identification of the optimal time to stop the contention process and start data transmission. The solution corresponds to finding a desired tradeoff between channel utilization and contention overhead. In this paper, we conduct a rigorous analysis to characterize the optimal strategy using the theory of optimal stopping. An interesting result is that the optimal stopping strategy is a simple threshold-based rule, which stops the contention process as soon as the total number of winning stations exceeds a certain threshold. Compared with the conventional single-round contention protocol, the multi-round contention scheme significantly enhances channel utilization when the MPR capability of the channel is small to medium. Meanwhile, the scheme automatically falls back to single-round contention when the MPR capability is very large, in which case the throughput penalty due to random access is already small even with single-round contention

Servicing Delay Sensitive Pervasive Communication Through Adaptable Width Channelization for Supporting Mobile Edge Computing

Over the last fifteen years, wireless local area networks (WLANs) have been populated by large variety of pervasive devices hosting heterogeneous applications. Pervasive Edge computing encouraged more distributed network applications for these devices, eliminating the round-trip to help in achieving zero latency dream. However, These applications require significantly variable data rates for effective functioning, especially in pervasive computing. The static bandwidth of frequency channelization in current WLANs strictly restricts the maximum achievable data rate by a network station. This static behavior spawns two major drawbacks: under-utilization of scarce spectrum resources and less support to delay sensitive applications such as voice and video.To this point, if the computing is moved to the edge of the network WLANs to reduce the frequency of communication, the pervasive devices can be provided with better services during the communication and networking. Thus, we aim to distribute spectrum resources among pervasive resources based upon delay sensitivity of applications while simultaneously maintaining the fair channel access semantics of medium access control (MAC) layer of WLANs. Henceforth, ultra-low latency, efficiency and reliability of spectrum resources can be assured. In this paper, two novel algorithms have been proposed for adaptive channelization to offer rational distribution of spectrum resources among pervasive Edge nodes based on their bandwidth requirement and assorted ambient conditions. The proposed algorithms have been implemented on a real test bed of commercially available universal software radio peripheral (USRP) devices. Thorough investigations have been carried out to enumerate the effect of dynamic bandwidth channelization on parameters such as medium utilization, achievable throughput, service delay, channel access fairness and bit error rates. The achieved empirical results demonstrate that we can optimally enhance the network-wide throughput by almost 30% using channels of adaptable bandwidths