Carrier Sense Random Packet CDMA Protocol in Dual-Channel Networks

Code resource wastage is caused by the reason that many hopping frequency (FH) sequences are unused, which occurs under the condition that the number of the actual subnets needed for the tactical network is far smaller than the networking capacity of code division net¬working. Dual-channel network (DCN), consisting of one single control channel and multiple data channels, can solve the code resource wastage effectively. To improve the anti-jamming capability of the control channel of DCN, code division multiple access (CDMA) technology was introduced, and a carrier sense random packet (CSRP) CDMA protocol based on random packet CDMA (RP-CDMA) was proposed. In CSRP-CDMA, we provide a carrier sensing random packet mechanism and a packet-segment acknowledgement policy. Furthermore, an analytical model was developed to evaluate the performance of CSRP-CDMA networks. In this model, the impacts of multi-access interference from both inter-clusters and intra-clusters were analyzed, and the mathematical expressions of packet transmission success probability, normalized network throughput and signal interference to noise ratio, were also derived. Analytical and simulation results demonstrate that the normalized network throughput of CSRP-CDMA outperforms traditional RP-CDMA by 10%, which can guarantee the resource utilization efficiency of the control channel in DCNs

Energy Aware Multipath Routing Protocol for Cognitive Radio Ad Hoc Networks

Cognitive radio networks (CRNs) emerged as a paradigm to solve the problem of limited spectrum availability and the spectrum underutilization in wireless networks by opportunistically exploiting portions of the spectrum temporarily vacated by licensed primary users (PUs). Routing in CRNs is a challenging problem due to the PU activities and mobility. On the other hand, energy aware routing is very important in energy-constraint CRNs. In addition, it is crucial that CR users efficiently exchange data with each other before the appearance of PUs. To design a robust routing scheme for mobile CR ad hoc networks (CRANs), the constraints on residual energy of each CR user, reliability, and the protection of PUs must additionally be taken into account. Moreover, multipath routing has great potential for improving the end-to-end performance of ad hoc networks. Considering all these evidences, in this paper, we propose an energy aware on-demand multipath routing (EOMR) protocol for mobile CRANs to ensure the robustness and to improve the throughput. The proposed routing scheme involves energy efficient multipath route selection and spectrum allocation jointly. The simulation results show that our approach improves the overall performance of the network

An Energy Efficient Multichannel MAC Protocol for Cognitive Radio Ad Hoc Networks

This paper presents a TDMA based energy efficient cognitive radio multichannel medium access control (MAC) protocol called ECR-MAC for wireless Ad Hoc Networks. ECR-MAC requires only a single half-duplex radio transceiver on each node that integrates the spectrum sensing at physical (PHY) layer and the packet scheduling at MAC layer. In addition to explicit frequency negotiation which is adopted by conventional multichannel MAC protocols, ECR-MAC introduces lightweight explicit time negotiation. This two-dimensional negotiation enables ECR-MAC to exploit the advantage of both multiple channels and TDMA, and achieve aggressive power savings by allowing nodes that are not involved in communication to go into doze mode. The IEEE 802.11 standard allows for the use of multiple channels available at the PHY layer, but its MAC protocol is designed only for a single channel. A single channel MAC protocol does not work well in a multichannel environment, because of the multichannel hidden terminal problem. The proposed energy efficient ECR-MAC protocol allows SUs to identify and use the unused frequency spectrum in a way that constrains the level of interference to the primary users (PUs). Extensive simulation results show that our proposed ECR-MAC protocol successfully exploits multiple channels and significantly improves network performance by using the licensed spectrum band opportunistically and protects QoS provisioning over cognitive radio ad hoc networks.Comment: 8 Pages, International Journa

CR-MAC: A multichannel MAC protocol for cognitive radio ad hoc networks

This paper proposes a cross-layer based cognitive radio multichannel medium access control (MAC) protocol with TDMA, which integrate the spectrum sensing at physical (PHY) layer and the packet scheduling at MAC layer, for the ad hoc wireless networks. The IEEE 802.11 standard allows for the use of multiple channels available at the PHY layer, but its MAC protocol is designed only for a single channel. A single channel MAC protocol does not work well in a multichannel environment, because of the multichannel hidden terminal problem. Our proposed protocol enables secondary users (SUs) to utilize multiple channels by switching channels dynamically, thus increasing network throughput. In our proposed protocol, each SU is equipped with only one spectrum agile transceiver, but solves the multichannel hidden terminal problem using temporal synchronization. The proposed cognitive radio MAC (CR-MAC) protocol allows SUs to identify and use the unused frequency spectrum in a way that constrains the level of interference to the primary users (PUs). Our scheme improves network throughput significantly, especially when the network is highly congested. The simulation results show that our proposed CR-MAC protocol successfully exploits multiple channels and significantly improves network performance by using the licensed spectrum band opportunistically and protects PUs from interference, even in hidden terminal situations.Comment: 14 Pages, International Journa

An Energy Efficient MAC Protocol for QoS Provisioning in Cognitive Radio Ad Hoc Networks

The explosive growth in the use of real-time applications on mobile devices has resulted in new challenges to the design of medium access control (MAC) protocols for ad hoc networks. In this paper, we propose an energy efficient cognitive radio (CR) MAC protocol for QoS provisioning called ECRQ-MAC, which integrate the spectrum sensing at physical (PHY) layer and the channel-timeslots allocation at MAC layer. We consider the problem of providing QoS guarantee to CR users as well as to maintain the most efficient use of scarce bandwidth resources. The ECRQ-MAC protocol exploits the advantage of both multiple channels and TDMA, and achieves aggressive power savings by allowing CR users that are not involved in communication to go into sleep mode. The proposed ECRQ-MAC protocol allows CR users to identify and use the unused frequency spectrum of licensed band in a way that constrains the level of interference to the primary users (PUs). Our scheme improves network throughput significantly, especially when the network is highly congested. The simulation results show that our proposed protocol successfully exploits multiple channels and significantly improves network performance by using the licensed spectrum opportunistically and protects QoS provisioning over cognitive radio ad hoc networks

Latency Optimal Broadcasting in Noisy Wireless Mesh Networks

In this paper, we adopt a new noisy wireless network model introduced very recently by Censor-Hillel et al. in [ACM PODC 2017, CHHZ17]. More specifically, for a given noise parameter $p\in [0,1],$ any sender has a probability of $p$ of transmitting noise or any receiver of a single transmission in its neighborhood has a probability $p$ of receiving noise. In this paper, we first propose a new asymptotically latency-optimal approximation algorithm (under faultless model) that can complete single-message broadcasting task in $D+O(\log^2 n)$ time units/rounds in any WMN of size $n,$ and diameter $D$. We then show this diameter-linear broadcasting algorithm remains robust under the noisy wireless network model and also improves the currently best known result in CHHZ17 by a $\Theta(\log\log n)$ factor. In this paper, we also further extend our robust single-message broadcasting algorithm to $k$ multi-message broadcasting scenario and show it can broadcast $k$ messages in $O(D+k\log n+\log^2 n)$ time rounds. This new robust multi-message broadcasting scheme is not only asymptotically optimal but also answers affirmatively the problem left open in CHHZ17 on the existence of an algorithm that is robust to sender and receiver faults and can broadcast $k$ messages in $O(D+k\log n + polylog(n))$ time rounds.Comment: arXiv admin note: text overlap with arXiv:1705.07369 by other author