In this paper, we propose an adaptive medium access control (MAC) protocol for full-duplex (FD) cognitive radio networks in which FD secondary users (SUs) perform channel contention followed by concurrent spectrum sensing and transmission, and transmission only with maximum power in two different stages (called the FD sensing and transmission stages, respectively) in each contention and access cycle. The proposed FD cognitive MAC (FDC-MAC) protocol does not require synchronization among SUs, and it efficiently utilizes the spectrum and mitigates the self-interference in the FD transceiver. We develop a mathematical model to analyze the throughput performance of the FDC-MAC protocol, where both half-duplex (HD) transmission and FD transmission modes are considered in the transmission stage. Then, we study the FDC-MAC configuration optimization through adaptively controlling the spectrum sensing duration and transmit power level in the FD sensing stage. We prove that there exists optimal sensing time and transmit power to achieve the maximum throughput, and we develop an algorithm to configure the proposed FDC-MAC protocol. Extensive numerical results are presented to illustrate the optimal FDC-MAC configuration and the impacts of protocol parameters and the self-interference cancellation quality on the throughput performance. Moreover, we demonstrate the significant throughput gains of the FDC-MAC protocol with respect to the existing HD MAC and single-stage FD MAC protocols.
In our previous work @cite_14 , we propose the FD MAC protocol by using the standard backoff mechanism as in the 802.11 MAC protocol where we employ concurrent FD sensing and access during data transmission as well as frame fragmentation. Moreover, engineering of a cognitive FD relaying network is considered in @cite_4 @cite_17 , where various resource allocation algorithms to improve the outage probability are proposed. In addition, the authors in @cite_28 develop the joint routing and distributed resource allocation for FD wireless networks. In @cite_8 , study the distributed power allocation for a hybrid FD HD system where all network nodes operate in the HD mode but the access point (AP) communicates by using the FD mode. In practice, it would be desirable to design an adaptable MAC protocol, which can be configured to operate in an optimal fashion depending on specific channel and network conditions. This design will be pursued in our current work.
@cite_14 @cite_4 @cite_8 @cite_28 @cite_17
2963732248 2024516306 2035894106 2021126584
In this paper, we consider the Medium Access Control (MAC) protocol design for full-duplex cognitive radio networks (FDCRNs). Our design exploits the fact that full-duplex (FD) secondary users (SUs) can perform spectrum sensing and access simultaneously, which enable them to detect the primary users' (PUs) activity during transmission. The developed FD MAC protocol employs the standard backoff mechanism as in the 802.11 MAC protocol. However, we propose to adopt the frame fragmentation during the data transmission phase for timely detection of active PUs where each data packet is divided into multiple fragments and the active SU makes sensing detection at the end of each data fragment. Then, we develop a mathematical model to analyze the throughput performance of the proposed FD MAC protocol. Furthermore, we propose an algorithm to configure the MAC protocol so that efficient self-interference management and sensing overhead control can be achieved. Finally, numerical results are presented to evaluate the performance of our design and demonstrate the throughput enhancement compared to the existing half-duplex (HD) cognitive MAC protocol. In this paper, we present an experiment- and simulation-based study to evaluate the use of full duplex (FD) as a potential mode in practical IEEE 802.11 networks. To enable the study, we designed a 20-MHz multiantenna orthogonal frequency-division-multiplexing (OFDM) FD physical layer and an FD media access control (MAC) protocol, which is backward compatible with current 802.11. Our extensive over-the-air experiments, simulations, and analysis demonstrate the following two results. First, the use of multiple antennas at the physical layer leads to a higher ergodic throughput than its hardware-equivalent multiantenna half-duplex (HD) counterparts for SNRs above the median SNR encountered in practical WiFi deployments. Second, the proposed MAC translates the physical layer rate gain into near doubling of throughput for multinode single-AP networks. The two results allow us to conclude that there are potentially significant benefits gained from including an FD mode in future WiFi standards. This paper studies the cooperation between a primary system and a cognitive system in a cellular network where the cognitive base station (CBS) relays the primary signal using amplify-and-forward or decode-and-forward protocols, and in return it can transmit its own cognitive signal. While the commonly used half-duplex (HD) assumption may render the cooperation less efficient due to the two orthogonal channel phases employed, we propose that the CBS can work in a full-duplex (FD) mode to improve the system rate region. The problem of interest is to find the achievable primary-cognitive rate region by studying the cognitive rate maximization problem. For both modes, we explicitly consider the CBS transmit imperfections, which lead to the residual self-interference associated with the FD operation mode. We propose closed-form solutions or efficient algorithms to solve the problem when the related residual interference power is non-scalable or scalable with the transmit power. Furthermore, we propose a simple hybrid scheme to select the HD or FD mode based on zero-forcing criterion, and provide insights on the impact of system parameters. Numerical results illustrate significant performance improvement by using the FD mode and the hybrid scheme. Because of the asynchronization between primary and secondary wireless networks, the synchronization between primary users (PUs) and secondary users (SUs) can be hardly guaranteed in nontime-slotted cognitive radio networks (CRNs). In this paper, we propose a novel framework for multichannel nontime-slotted CRNs, where the PUs randomly access and leave the licensed channels. Since the PUs cannot distinguish between primary and secondary signals, the PUs may sense a busy channel when the PUs start to reactivate during the SUs' transmission, thus generating a collision or entering the backoff stage. To guarantee the high-throughput transmission of the PUs and increase the channel utilization of the SUs, in this paper, we propose the wireless full-duplex spectrum sensing (FD-SS) scheme for SUs in multichannel nontime-slotted CRNs. Using our developed FD-SS scheme, the SUs can timely sense the PUs' reactivation during the same time when the SUs are transmitting their signals. Then, based on our proposed wireless FD-SS scheme, we further develop and analyze the wireless full-duplex cognitive medium access control (FDC-MAC) protocol for multichannel nontime-slotted CRNs. We conduct extensive numerical analyses, showing that our developed FD-SS scheme and FDC-MAC protocol can efficiently guarantee the high-throughput transmission of the PUs and increase the channel utilization of the SUs without requiring the synchronization between the PUs and the SUs over the multichannel nontime-slotted CRNs. The performance analysis of optimal decode-and-forward (DF) relay selection for the full-duplex (FD) mode in underlay cognitive radio (CR) networks is studied, with the impact of critical parameters such as the residual self-interference, the distributions of the received signal-to-noise ratio (SNR), and the outage probability, being analyzed. Different from the conventional relay selection schemes with half-duplex (HD) mode, the FD relay suffers from the impact of residual self-interference due to its simultaneous transmission and reception using the same channel. Furthermore, the exact closed-form expressions for the outage probabilities of the proposed FD relay-selection scheme over both independent Nakagami- @math and Rayleigh fading channels are derived, with the validity of the proposed analysis being proven by using simulation. Numerical results show that, in the presence of multiple candidate relays, an optimum relay-selection solution in terms of outage probability can always be achievable within the SNR range of (10 dB, 15 dB). Half duplex radios use two separate frequency bands to enable simultaneous transmission and reception. Recently, full duplex radio that allows a wireless node to transmit and receive simultaneously in one frequency band was proposed. We propose a MAC protocol for full duplex radio networks, FDMAC, which is a simple and efficient protocol compatible with IEEE 802.11 MAC protocol. We analyze the performance of full duplex wireless networks with FD-MAC considering both the physical layer and the MAC layer. Full-duplex (FD) cellular networks are considered in which a FD base station (BS) simultaneously supports a set of half-duplex (HD) downlink (DL) users and a set of HD uplink (UL) users. The transmitter and the receiver of the BS are equipped with reconfigurable antennas, each of which can choose its transmit or receive mode from several preset modes. Under the no self-interference assumption arisen from FD operation at the BS, the sum degrees of freedom (DoF) of FD cellular networks is investigated for both no channel state information at the transmit side (CSIT) and partial CSIT. In particular, the sum DoF is completely characterized for the no CSIT model and an achievable sum DoF is established for the partial CSIT model, which improves the sum DoF of the conventional HD cellular networks. For both the no CSIT and partial CSIT models, the results show that the FD BS with reconfigurable antennas can double the sum DoF even in the presence of user-to-user interference as both the numbers of DL and UL users and preset modes increase. It is further demonstrated that such DoF improvement indeed yields the sum rate improvement at the finite and operational signal-to-noise ratio regime. We consider a three-node relay network comprised of a source, a relay, and a destination, and compare the throughputs of ideal full-duplex (FD) and half-duplex (HD) relaying. For FD relaying, we assume that the relay uses half of its antennas for reception and the other half for transmission. In contrast, for HD relaying, the relay uses all of its antennas for either reception or transmission and a buffer for data storage. Our results show that if the numbers of antennas at source and destination are equal to or larger than the number of antennas at the relay, HD relaying may achieve a similar, and in some cases even higher, throughput compared to ideal FD relaying. Full-duplex (FD) technology has been regarded as a promising solution to improve the spectral efficiency of the 5th generation (5G) wireless communication system. In this paper, we focus on a small-area radio system, where a FD base-station serves two half-duplex users simultaneously with one in the uplink and the other one in downlink direction. However, the self-interference (SI) and the inter-user interference (IUI) may largely degrade the system performance. Therefore we propose a simple but effective inter-user interference cancellation (IIC) strategy to cope with the IUI. This method is based on the fact that the downlink user observes a multiple access channel (MAC) of two user, the BS and the uplink user, respectively. Hence, the downlink user has an opportunity to remove the IUI according to the transmission rates and its received powers. Therefore, we call this method as multi-access channel IIC (MIIC). Then, we analyze the achievable rate region of the FD system with and without MIIC when taking the SI into consideration. To obtain the rate region, analytic power allocation strategies are derived. Simulation results show that, by applying the proposed power allocation strategies, the performance of FD system with MIIC is as good as the system without IUI under the 3GPP assumptions. Supporting real-time and interactive traffic in addition to traditional data traffic with a best-effort nature represents a constantly rising need in any kind of telecommunications environment. The IEEE 802.11 based WLAN (Wireless Local Area Network) environment does not represent an exception. This is why at different protocol layers, and primarily at the MAC layer, many efforts are being put by both the research community and the standardization bodies to design effective mechanisms for user QoS (Quality of Service) differentiation. Although early results are coming into sight, such as, for example, the IEEE 802.11e standard release, still a thorough research activity is required. Aim of the present paper is to contribute to the cited research issue by proposing an improvement to the "static" traffic prioritisation mechanism foreseen by the IEEE 802.11e MAC (Medium Access Control) protocol. This latter shows a twofold drawback. First, there is no certainty that QoS requirements relevant to a given application are always fulfilled by the "statically" associated priority. Second, resource requests of the applications are not adapted to the (usually highly) variable traffic conditions of a distributed WLAN environment. The algorithm we propose is specifically tailored to "dynamically" assign 802.11e MAC priorities, depending on both application QoS requirements and observed network congestion conditions. It is carefully designed, implemented into a system simulation tool, and its highly effective behaviour assessed under variable traffic and system conditions. We study the degrees of freedom (DoF) of cellular networks in which a full duplex (FD) base station (BS) equipped with multiple transmit and receive antennas communicates with multiple mobile users. We consider two different scenarios. In the first scenario, we study the case when half duplex (HD) users, partitioned to either the uplink (UL) set or the downlink (DL) set, simultaneously communicate with the FD BS. In the second scenario, we study the case when FD users simultaneously communicate UL and DL data with the FD BS. For both network models, we completely characterize the sum DoFs by developing achievable schemes and obtaining matching upper bounds. The key idea of the proposed scheme is to carefully allocate UL and DL information streams using interference alignment and beamforming techniques. As a consequence of the result, we show that the DoF can approach the two-fold gain over the HD systems when the number of users becomes large enough as compared to the number of antennas at the BS. In recent years the idea of access network has changed radically, and the diffusion of wireless technologies, and especially IEEE 802.11 compliant devices, has made wireless connections increasing popular. Despite the great success of the IEEE 802.11 standard, several problems concerning security, power consumption and quality of service of wireless LANs remain partially unsolved. The QoS issue is especially relevant for multimedia communications, generally needing performance guarantees from the network infrastructure to fulfill application requirements. In this paper we analyze the behavior of the Frame Dropping (FD) mechanism, a QoS mechanism for multimedia communications using simulations, and compare it with that of another well assessed mechanism: Distributed Fair Scheduling (DFS). Simulation results show that, though DFS achieve a better channel utilization, FD behavior is comparable with that of DFS under all the main performance indices, and it exhibits effective traffic differentiation capabilities. Cognitive radios (CRs) have a great potential to improve spectrum utilization by enabling users to access the spectrum dynamically without disturbing licensed primary radios (PRs). A key challenge in operating these radios as a network is how to implement an efficient medium access control (MAC) mechanism that can adaptively and efficiently allocate transmission powers and spectrum among CRs according to the surrounding environment. Most existing works address this issue via suboptimal heuristic approaches or centralized solutions. In this paper, we propose a novel joint power channel allocation scheme that improves the performance through a distributed pricing approach. In this scheme, the spectrum allocation problem is modeled as a noncooperative game, with each CR pair acting as a player. A price-based iterative water-filling (PIWF) algorithm is proposed, which enables CR users to reach a good Nash equilibrium (NE). This PIWF algorithm can be implemented distributively with CRs repeatedly negotiating their best transmission powers and spectrum. Simulation results show that the social optimality of the NE solution is dramatically improved through pricing. Depending on the different orders according to which CRs take actions, we study sequential and parallel versions of the PIWF algorithm. We show that the parallel version converges faster than the sequential version. We then propose a corresponding MAC protocol to implement our resource management schemes. The proposed MAC allows multiple CR pairs to be first involved in an admission phase, then iteratively negotiate their transmission powers and spectrum via control-packet exchanges. Following the negotiation phase, CRs proceed concurrently with their data transmissions. Simulations are used to study the performance of our protocol and demonstrate its effectiveness in terms of improving the overall network throughput and reducing the average power consumption. The Point Coordination Function (PCF) of the IEEE 802.11 standard represents a well-known Medium Access Control (MAC) protocol providing Quality-of Service guarantees in Wireless Local Area Networks (WLANs). However, with the currently employed polling mechanism WLANs consume a significant amount of the energy resources from battery-powered user devices. To provide energy saving, an improved MAC protocol is presented in this paper, where bidirectional transmissions of fixed duration are incorporated into PCF in order to enable dynamic scheduling of real-time traffic. Based on this new strategy, wireless access points (APs) can estimate the proper duration of the Contention Free Period (CFP), in order to allow mobile stations to acknowledge any received data packet with a data packet equal to the received packet in size. Having this information, a mobile station, following the data exchange with the AP, can determine its wake-up timer and activate the sleep mode for the rest of the CFP interval. Comprehensive computer-based simulations demonstrate the feasibility of the proposed MAC improvements to achieve energy efficiency with negligible impact on packet delivery delay. In WLAN the medium access control (MAC) protocol is the main element for determining the efficiency in sharing the limited communication bandwidth of the wireless channel. This paper focuses on the efficiency of the IEEE 802.11 standard for wireless LANs. Specifically, we derive an analytical formula for the protocol capacity. From this analysis we found (i) the theoretical upper bound of the IEEE 802.11 protocol capacity; (ii) that the standard can operate very far from the theoretical limits depending on the network configuration; (iii) that an appropriate tuning of the backoff algorithm can drive the IEEE 802.11 protocol close to its theoretical limits. Hence we propose a distributed algorithm which enables each station to tune its backoff algorithm at run-time. The performances of the IEEE 802.11 protocol, enhanced with our algorithm, are investigated via simulation. The results indicate that the enhanced protocol is very close to the maximum theoretical efficiency. The widespread availability of 802.11-based hardware has made it the premier choice of both researchers and practitioners for developing new wireless networks and applications. However, the ever increasing set of demands posed by these applications is stretching the 802.11 MAC protocol beyond its intended capabilities. For example, 802.11 provides no control over allocation of resources, and the default allocation policy is ill-suited for heterogeneous environments and multi-hop networks. Fairness problems are further exacerbated in multi-hop networks due to link asymmetry and hidden terminals. In this paper, we take a first step towards addressing these problems without replacing the MAC layer by presenting the design and the implementation of an Overlay MAC Layer (OML), that works on top of the 802.11 MAC layer. OML uses loosely-synchronized clocks to divide the time in to equal size slots, and employs a distributed algorithm to allocate these slots among competing nodes. We have implemented OML in both a simulator and on a wireless testbed using the Click modular router. Our evaluation shows that OML can not only provide better flexibility but also improve the fairness, throughput and predictability of 802.11 networks. This paper studies a new design of a wireless-powered relay network to improve its throughput performance by opportunistic energy harvesting (EH) and information relaying (IR) at the relay node. To enable the relay to implement opportunistic EH and IR, a new protocol, namely, the adaptive harvest-store-forward (AHSF) protocol, is proposed. In the AHSF protocol, the relay is allowed to adaptively switch between an EH mode and a power-splitting (PS)-based IR mode at the beginning of each time frame; moreover, the relay can adaptively determine the amount of energy for IR based on the wireless channel conditions over one finite time horizon, which consists of multiple consecutive time frames. Then, under the proposed protocol, a throughput maximization problem is formulated to optimize the relay operation mode (i.e., EH mode or IR mode) and resource allocation (i.e., time slot, PS ratio, and power allocation) in the IR mode in a finite time horizon. The formulated problem is coupled over time and, thus, is intractable. To address the intractability, dynamic programming is employed to transform the problem into a series of Bellman equations. Based on the Bellman equations, the optimal decision criteria for the relay operation mode is derived, and a time-coupled optimization problem for the resource allocation in the IR mode is addressed by decoupling into two subproblems for two adjacent time frames. By solving the subproblems via convex programming, an optimization policy with causal channel-state information (CSI), which can be implemented online in real time, and an optimization policy with full CSI, which is used to reveal the upper bound of the achieved throughput, are achieved. The simulation results verify that the proposed design can yield significant throughput gains over the existing wireless-powered relaying schemes. Recent advances in antenna and circuit design enable radios that operate in full duplex mode on a single channel with very low residual self-interference. In this paper, the use of such full duplex radios in a wireless local area network (WLAN) is explored. Different scenarios in which the full duplex transmission can be exploited are studied. A distributed full duplex MAC design based on IEEE 802.11 DCF that adopts to the traffic conditions is proposed. The proposed MAC design works for both ad hoc and infrastructure modes of WLAN and takes into consideration new interference and contention during full duplex transmissions. OPNET simulations comparing the performance of the proposed MAC with traditional half duplex based IEEE 802.11 DCF show that the new MAC protocol provides up to 88 throughput gain in a heavily loaded network. A number of algorithmic and protocol assumptions taken for granted in the design of existing wireless communication technologies need to be revisited in extending their scope to the new cognitive radio (CR) paradigm. The fact that channel availability can rapidly change over time and the need for coordinated quiet periods in order to quickly and robustly detect the presence of incumbents, are just some of the examples of the unique challenges in protocol and algorithm design for CR networks and, in particular, in the medium access control (MAC) layer. With this in mind, in this paper we introduce a novel cognitive MAC (C-MAC) protocol for distributed multi-channel wireless networks. C-MAC operates over multiple channels, and hence is able to effectively deal with, among other things, the dynamics of resource availability due to primary users and mitigate the effects of distributed quiet periods utilized for primary user signal detection. In C-MAC, each channel is logically divided into recurring superframes which, in turn, include a slotted beaconing period (BP) where nodes exchange information and negotiate channel usage. Each node transmits a beacon in a designated beacon slot during the BP, which helps in dealing with hidden nodes, medium reservations, and mobility. For coordination amongst nodes in different channels, a rendezvous channel (RC) is employed that is decided dynamically and in a totally distributed fashion. Among other things, the RC is used to support network-wide multicast and broadcast which are often neglected in existing multi-channel MAC protocols. We present promising performance results of C- MAC. We also describe our efforts to implement features of C- MAC in a real CR prototype with Atheros chipset, which currently includes the spectrum sensing module and preliminary features of C-MAC. Physical-layer network coding (PNC) is a promising approach for wireless networks. It allows nodes to transmit simultaneously. Due to the difficulties of scheduling simultaneous transmissions, existing works on PNC are based on simplified medium access control (MAC) protocols, which are not applicable to general multihop wireless networks, to the best of our knowledge. In this paper, we propose a distributed MAC protocol that supports PNC in multihop wireless networks. The proposed MAC protocol is based on the carrier sense multiple access (CSMA) strategy and can be regarded as an extension to the IEEE 802.11 MAC protocol. In the proposed protocol, each node collects information on the queue status of its neighboring nodes. When a node finds that there is an opportunity for some of its neighbors to perform PNC, it notifies its corresponding neighboring nodes and initiates the process of packet exchange using PNC, with the node itself as a relay. During the packet exchange process, the relay also works as a coordinator which coordinates the transmission of source nodes. Meanwhile, the proposed protocol is compatible with conventional network coding and conventional transmission schemes. Simulation results show that the proposed protocol is advantageous in various scenarios of wireless applications.