Polling-based media access protocols for use with smart adaptive array antennas

Since cognitive wireless network (CRN) has the characteristic of secondary use, it can enable the device to dynamically access available spectrum without interference to primary users (PUs), which can effectively alleviate contradiction between the lack of spectrum resources and the growing demand for wireless access. However, Medium Access Control (MAC) protocol as CRN core components, can achieve competition access of the licensed spectrum and coordination control, which will maximize spectrum utilization efficiency and network throughput. The contribution of this survey is threefold. First, we analyze the characteristics of the existed multi- channel MAC protocol in CRN; Second, according to the different ways of spectrum access in CRNs, the multi-channel MAC protocols are classified into time-slotted based MAC protocol, control channel based MAC protocol and hybrid MAC protocol, and the paper emphatically analyzed the advantages and disadvantages of these multi-channel MAC protocols; Finally, the paper explores the difficulties and the challenges of multi-channel MAC protocols design in cognitive wireless network.

Power efficient ultra-wideband based wireless communication for wireless body area network applications

In this paper we propose a simple relay enabled medium access (SRMAC) protocol that enables cooperative relay transmissions. Due to the wireless signal power attenuation with distance, using a relay in a wireless network can make wireless networking more bandwidth efficient at the expense of requiring multiple transmissions for a single packet. Standard MAC protocols such as the IEEE 802.11 MAC protocol, while useable with relaying, however are not designed explicitly for relay communication. When IEEE 802.11 MAC protocol is used for cooperative communication such a relaying, each packet transmission would need to separately contend for the channel via a channel access procedure which can use significant resources (both energy and bandwidth). Because using a single relay requires two transmissions, an efficient medium access control (MAC) protocol that supports two hop transmission is needed. We introduce a protocol, SRMAC, which is a simple cooperative MAC protocol that utilizes information from the physical layer for the MAC operation of relay networks. We consider the bandwidth efficiency of SRMAC protocol considering both the physical layer and MAC layer. The SRMAC protocol includes the possibility of both cooperative transmission and direct transmission. With SRMAC, cooperative transmission (relaying) can be dynamically chosen when it is more beneficial than direct transmission. The SRMAC protocol can improve the throughput by up to 20% compared to conventional MAC protocols.

Cognitive Radio (CR) exploits underutilized licensed spectrums to improve its bandwidth availability. Using CR technology, a node is able to adapt its transmission and reception radio parameters including channel frequency dynamically according to local spectrum availability. For channel access between wireless nodes, a cognitive Medium Access Control (MAC) protocol is necessary to coordinate the CRs. Multi-channel MAC protocol extensions have been proposed in IEEE802.11 to enable a node to operate in multiple channels in order to improve network-wide throughput. These multi-channel MAC protocols have several functions that can be leveraged by cognitive MAC protocols due to their similarities in certain aspects, though the CR has an additional requirement to cope with the existence of licensed users that have higher authority over the channels. Current research in cognitive MAC protocols assumes the availability of a common control channel at all times, which is an approach in the multi-channel MAC protocols. This approach has certain hardware requirements that may not be readily available at CR nodes. Hence, other approached may be necessary. In this paper, various types of multi-channel MAC protocols are reviewed, followed by discussion of their merits and demerits in multi-channel environments. The purpose is to show the additional functionalities and challenges that each multi-channel MAC protocol has to offer and address in order to operate in multihop CR networks. By providing discussion on possible technology leverage from multi-channel to cognitive MAC protocols, we aim to establish a foundation for further research and discussion.

Two important criteria of wireless body area networks (WBANs) are low power consumption and delay. These criteria can be met by designing efficient medium access control (MAC) protocols. In this paper, two TDMA-based MAC protocols are proposed. The first protocol, TM–MAC makes use of only a main radio. The second proposed protocol, TWM–MAC makes use of a WUR alongside the main radio. The two proposed protocols are compared with different categories of standard MAC protocols and it is shown that they outperform the standard ones by improving the power consumption and delay. The TWM–MAC consumes 55% less power consumption than the Scheduled Channel Polling MAC (SCP–MAC) protocol for a high traffic scenario on the high-rate platform while the TM-MAC consumes 85% less power consumption than the SCP–MAC. For a low traffic scenario, the TWM–MAC performs 53.5% better than the SCP–MAC protocol and 77.5% better than the very low power MAC (VLPM) protocol on the high and low-rate platforms respectively. An improvement in delay was observed with the TWM–MAC protocol for high traffic situations. The TWM–MAC protocol surpasses the VLPM protocol by 81.1% in terms of latency for a high traffic scenario and 3.2% for a low traffic scenario.

The key contributions of this paper are the proposed Pure Collective Aloha (PCA) medium access control (MAC) protocol with multilevel powers and its closed-form theoretical analysis. The PCA MAC protocol collects a batch of packets before transmitting these packets sequentially in the channel. The key idea in the design of this PCA MAC protocol with multilevel powers is to spread out the arrivals of each batch of packets in a channel and the multilevel powers of the packets received at the receiver allow capture for the case of the strongest signal power packet among the overlapping lower signal power packets to be successfully received at the receiver. If it is the only received packet, it is successfully received, regardless of its received power level. The PCA MAC protocol with multilevel powers is analyzed theoretically. The explicit closed-form expressions for the optimal offered loads and the maximum throughputs of the Pure Aloha, the Slotted Aloha and the PCA MAC protocols with multilevel powers are presented. The numerical results show that the throughput of the asynchronous PCA MAC protocol with multilevel powers is about 90.5% better than that of the asynchronous Pure Aloha MAC protocol with multilevel powers and can approach the maximum throughput bound of the synchronous Slotted Aloha MAC protocol with multilevel powers, without the need of any synchronization mechanism to slot boundaries.

High throughput and fair resource sharing are two of the most important objectives in designing a medium access control (MAC) protocol. Currently, most MAC protocols including IEEE 802.11 DCF adopt a random access based approach in a distributed manner in order to coordinate the wireless channel accesses among competing stations. In this paper, we first identify that a random access–based MAC protocol may suffer from MAC protocol overhead such as a random backoff for data transmission and a collision among simultaneously transmitting stations. Then, we propose a new MAC protocol, called sequential coordination function (SCF), which coordinates every station to send a data frame sequentially one after another in a distributed manner. By defining a service period and a joining period, the SCF eliminates unnecessary contentions during the service period, and by explicitly determining the sequence of frame transmission for each stations, it reduces collision occurrences and ensures fairness among stations in the service period. The performance of SCF is investigated through intensive simulations, which show that the SCF achieves higher throughput and fairness performances than other existing MAC protocols in a wide range of the traffic load and the number of stations.

Over the past few years, mobile networks have emerged as a promising approach for future mobile IP applications. With limited frequency resources, designing an effective MAC (Medium Access Control) protocol is a hot challenge. IEEE 802.11b/g/a/n networks are currently the most popular wireless LAN products on the market [1]. The conventional IEEE 802.11b and 802.11g/a specification provide up to 11 and 54 Mbps data rates, respectively. However, the MAC protocol that they are based upon is the same and employs a CSMA/CA (Carrier Sense Multiple Access/Collision Avoidance) protocol with binary exponential back-off. IEEE 802.11 DCF (Distributed Coordination Function) is the de facto MAC protocol for wireless LAN because of its simplicity and robustness [2,3]. Therefore, considerable research efforts have been put on the investigation of the DCF performance over wireless LAN [2]. With the successful deployment of IEEE 802.11a/b/g wireless LAN and the increasing demand for real-time applications over wireless, the IEEE 802.11n Working Group standardized a new MAC and PHY (Physical) layer specification to increase the bit rate to be up to 600 Mbps [3]. The throughput performance at the MAC layer can be improved by aggregating several frames before transmission [3]. Frame aggregation not only reduces the transmission time for preamble and frame headers, but also reduces the waiting time during CSMA/CA random backoff period for successive frame transmissions. The frame aggregation can be performed within different sub-layers. In 802.11n, frame aggregation can be performed either by A-MPDU (MAC Protocol Data Unit Aggregation) or A-MSDU (MAC Service Data Unit Aggregation). Although frame aggregation can increase the throughput at the MAC layer under ideal channel conditions, a larger aggregated frame will cause each station to wait longer before its next chance for channel access. Under errorprone channels, corrupting a large aggregated frame may waste a long period of channel time and lead to a lower MAC efficiency [4]. On the other hand, wireless LAN mobile stations that are defined as the stations that access the LAN while in motion are considered in this chapter. The previous paper analyzed the IEEE 802.11b/g/n MAC performance for wireless LAN with fixed stations, not for wireless LAN with mobile stations [5, 6, 7, 8, 9, 10]. On the contrary, Xi Yong [11] and Ha Cheol Lee [12] analyzed the MAC performance for IEEE 802.11 wireless LAN with mobile stations, but considered only IEEE 802.11 and 802.11g/a wireless LAN specification. So, this chapter summarizes all the reference papers and analyzes the IEEE 802.11b/g/a/n MAC performance for wireless LAN with fixed and mobile stations. In other words, we will present the analytical evaluation of saturation

With the onset of multimedia applications, Quality of Service (QoS) in 802.11-based wireless ad hoc networks has been an essential area to look into. Standard wireless protocols such as IEEE 802.11b and IEEE 802.11e have been deemed unsuitable for multimedia traffic transmission in an ad hoc (multihop) network environment due to the unique network characteristics. As an ad hoc network is infrastructureless and distributed in nature, it gives rise to several challenges in QoS provisioning. In this thesis, we focus on the research of three key areas on QoS in ad hoc networks namely, buffer management in the medium access control (MAC) layer, cross-layer design and flow admission control. Firstly, we study MAC layer buffer management in the IEEE 802.11e protocol. The IEEE 802.11e MAC protocol provides QoS for multimedia traffic by probabilistic priority queueing. Ad hoc networks tend to generate a large volume of network control packets for route maintenance and these control packets are typically queued in the highest priority queue. As a result, higher priority control traffic is always being served, consuming most of the bandwidth and results in poor network performance for data traffic. We examine this problem and propose a dynamic buffer management scheme to mitigate it. By setting different threshold levels in different priority queues, we allow lower priority data traffic to be served when the higher priority control traffic is deemed to be excessive. Simulation of our proposed scheme has shown that our approach yielded better network performance compared to the standard protocol in terms of packet delivery ratio and average delay. Secondly, we study the cross-layer interaction between the MAC and Network layers to identify its impact on QoS. We select the IEEE 802.11e MAC protocol and Ad-hoc On Demand Distance Vector (AODV) routing protocol in our study since they are standardized protocols for wireless networks. In IEEE 802.11e MAC protocol, lower priority traffic has a higher probability of being blocked. Hence, the MAC layer will inform the Network layer of a broken link through the link notification function. In this case, AODV will re-route the paths that traverse this link. As a result, higher priority traffic which shares the same link as the lower priority traffic will undergo the same re-routing procedures. We termed this phenomenon path correlation effect. Under high traffic load, the path correlation effect will be more intense and hence degrade the QoS of higher priority traffic. To break the path correlation effect, we propose a cross-layer design called the Bundled Virtual Circuit (BVC). Our proposed BVC scheme not only addresses the path correlation issues, but also provides priority treatment from the Network layer to the MAC layer. Through our simulations, our proposed cross-layer design approach is proven to provide better network performance than the 802.11e/AODV protocols in terms of packet delivery ratio and delay. Finally, we examine flow admission control at the routing layer in ad hoc networks. Standard routing protocols such as AODV performs routing on a shortest path basis. In the presence of multiple routes, hotspots are likely to form among the intermediate nodes and thus lead to network congestion. In addition, existing routes are not well-protected from the introduction of new routes. We propose a flow admission control algorithm to be used with AODV. Our algorithm allows routes to be created through available bandwidth and congestion estimation. During the route discovery phase, each node will be gauged on its estimated available bandwidth and its backlog of packets in the MAC buffer. If a node does not have sufficient bandwidth, or has too many backlogged packets compared to the requested flow rate, it will not participate in the route discovery process. From simulations, our new scheme is able to provide better network performance than the standard AODV protocol in terms of delay. Our work in this thesis focuses on QoS provisioning in ad hoc networks from the MAC and network layer perspectives. By studying the network characteristics and protocols’ behavior, we investigate the various problems of providing QoS in an ad hoc network environment and propose three different schemes to improve the QoS provisioning at the MAC and network layers. We believe that our work is able to provide some insights to the research area on QoS in ad hoc networks.

Medium Access Control (MAC) protocol is one of the key network protocols that ensure Wireless Sensor Networks (WSNs) maintain high performance during communication. MAC protocol design plays an important role in improving the performances of the whole network. First, Wireless Passive Sensor Networks (WPSNs) and MAC protocols are introduced in this paper. Second, some existing MAC protocols are introduced. Sensor MAC (S-MAC) protocol is analyzed and existing improved backoff algorithms are introduced. A new MAC protocol called Improved Sensor MAC (IS-MAC) is then proposed to solve the problem that the contention window (CW) during carrier sense is fixed in S-MAC protocol. IS-MAC protocol is able to adjust CW in terms of network load, so energy consumption can be decreased. Finally, according to the simulation results on NS2, the proposed protocol has better performance in terms of throughput and energy consumption.

A joint MIMO-OFDM transceiver and MAC design for mobile ad hoc networking

Radio Frequency Identification (RFID) has become widespread thanks to its important advantages over traditional identification technologies, like barcodes. Compared to this technology, RFID is, in fact, able to cover larger distance and does not require line-of-sight, that represent important improvements in the considered field of application. An RFID system is formed by a set of n tags, that represent clients in the identification process, and a tag reader, that is the identification server. Each tag is associated with an identifier (ID), that must be transmitted to the reader upon receipt of a suitable identification query. Tags can be active, i.e. provided with an independent power supply (like a battery), or passive. In the latter case, tags depend on energy provided by the tag reader through its queries (Want, 2006). For this reason, active tags can have some data processing ability, while passive tags are limited to doing only elementary operations and replying to the reader’s queries. An important issue in Radio Frequency Identification systems concerns the reading of colocated tags, that must be managed through suitable Medium Access Control (MAC) protocols, specifically designed for low power devices. Efficiency of MAC protocols for RFID systems directly influences the time needed by the tag reader for completely identifying a set of co-located tags, so it has great impact on the whole system performance. A deep analysis of the MAC technologies adopted in RFID is the aim of this chapter. We denote by Ttot(n) the time needed by the tag reader for completely identifying a set of n tags. Under ideal conditions, it should be Ttot(n) = nTpkt, where Tpkt is the time needed to transmit one identification packet. However, in order to ensure collision-free transmission to each tag, a MAC protocol is needed that, inevitably, produces a time waste with respect to the ideal condition. The time actually needed for identification depends on several factors, like the technology adopted, the working frequency, etc. So, RFID systems can exhibit very different reading rates, typically ranging between 100 Tag/s and 1000 Tag/s. The most common MAC protocols used in RFID systems can be grouped into two classes: deterministic protocols and stochastic protocols. Deterministic protocols basically coincide with tree traversal algorithms: all RFID tags form a binary tree on the basis of their identifiers, and the reader explores the tree in a systematic way, by repeating queries based on bit masks. Randomness is only in the tree structure (due to the choice of the co-located tag set), while the algorithm execution is pre-determined. Stochastic MAC protocols are instead based on the framed slotted Aloha (FSA) algorithm, that requires each tag to make a constrained pseudo-random choice of an integer number in order to reduce the probability of collisions.

In this work, we propose an automated wireless medium access control (MAC) protocol design based on multi-agent reinforcement learning (MARL), in which multiple wireless devices (WDs) and a base station (BS) exchange control messages without prior knowledge of their meanings to coordinate data delivery across the network. In current approaches, the BS acts as a MAC expert, while the WDs are the only learning entities. As a result, the learned MAC protocols are constrained by the BS’s predefined knowledge. In contrast, our approach enables both WDs and the BS to act as learning agents, fostering the collaborative development of new ad hoc communication protocols. However, this approach introduces additional challenges in managing heterogeneous agents that learn simultaneously, alongside conventional issues such as the learned protocols being overfitted to training parameters, including the number of transmitted packets and the number of WDs managed by the BS. To overcome these limitations, we propose a novel learning framework that facilitates the emergence of MAC protocols with robust generalization capabilities. This framework incorporates innovative features such as a novel BS policy model, two distinct reward functions for the WDs and the BS, and different update routines for the agents’ policies. Moreover, we leverage the concepts of parameter sharing and state abstraction to enhance generalization in the WDs’ policies. The MAC protocols generated using the proposed framework are evaluated against state-of-the-art approaches. Simulation results show that the proposed solution significantly outperforms the benchmarks in terms of generalization capabilities.

Fast reservation list-to-send (FRLS) medium access control (MAC) protocol is proposed to apply to wireless networks with long propagation delay. In the protocol, a central control node (CCN) is applied to allocate the channel resources of two channels, and all the nodes transmit packets over the two

Bandwidth of the subnets will influence the performance of heterogeneous ad hoc networks, in which various medium access control (MAC) protocols are adopted by various subnets. Jointly considering the bandwidth and MAC protocols of subnets can improve the performance of whole ad hoc networks. However, it is difficult for application to know what MAC protocols are adopted by the subnets on the path. Cross-layer technique can get the knowledge of MAC protocol, but it need modify the structure of network protocol stack. In this paper, we propose a novel MAC policy detection method based on packet pair technique which is widely used in network bandwidth measurement. Depending on the various measurement patterns, the various MAC policies can be distinguished, so the knowledge of bandwidth and MAC policy can be obtained simultaneously with only bandwidth measurement overhead. We analyze the method theoretically and evaluate its performance in simulations. The results show that the method is effective. Our method can be particularly useful for rate-adaption protocol design and analysis.