In this paper, we consider the channel assignment problem for cognitive radio networks with hardware-constrained secondary users (SUs). In particular, we assume that SUs exploit spectrum holes on a set of channels where each SU can use at most one available channel for communication. We present the optimal brute-force search algorithm to solve the corresponding nonlinear integer optimization problem and analyze its complexity. Because the optimal solution has exponential complexity with the numbers of channels and SUs, we develop two low-complexity channel assignment algorithms that can efficiently utilize the spectrum holes. In the first algorithm, SUs are assigned distinct sets of channels. We show that this algorithm achieves the maximum throughput limit if the number of channels is sufficiently large. In addition, we propose an overlapping channel assignment algorithm that can improve the throughput performance compared with its nonoverlapping channel assignment counterpart. Moreover, we design a distributed medium access control (MAC) protocol for access contention resolution and integrate it into the overlapping channel assignment algorithm. We then analyze the saturation throughput and the complexity of the proposed channel assignment algorithms. We also present several potential extensions, including the development of greedy channel assignment algorithms under the max-min fairness criterion and throughput analysis, considering sensing errors. Finally, numerical results are presented to validate the developed theoretical results and illustrate the performance gains due to the proposed channel assignment algorithms.
Distributed MAC Protocol for Cognitive Radio Networks: Design, Analysis, and ...Polytechnique Montreal
In this paper, we investigate the joint optimal sensing and distributed Medium Access Control (MAC) protocol design problem for cognitive radio (CR) networks. We consider both scenarios with single and multiple channels. For each scenario, we design a synchronized MAC protocol for dynamic spectrum sharing among multiple secondary users (SUs), which incorporates spectrum sensing for protecting active primary users (PUs). We perform saturation throughput analysis for the corresponding proposed MAC protocols that explicitly capture the spectrum-sensing performance. Then, we find their optimal configuration by formulating throughput maximization problems subject to detection probability constraints for PUs. In particular, the optimal solution of the optimization problem returns the required sensing time for PUs' protection and optimal contention window to maximize the total throughput of the secondary network. Finally, numerical results are presented to illustrate developed theoretical findings in this paper and significant performance gains of the optimal sensing and protocol configuration.
Joint Cooperative Spectrum Sensing and MAC Protocol Design for Multi-channel ...Polytechnique Montreal
In this paper, we propose a semi-distributed cooperative spectrum sen
sing (SDCSS) and channel access framework
for multi-channel cognitive radio networks (CRNs). In particular, we c
onsider a SDCSS scheme where secondary
users (SUs) perform sensing and exchange sensing outcomes with ea
ch other to locate spectrum holes. In addition,
we devise the
p
-persistent CSMA-based cognitive MAC protocol integrating the SDCSS to
enable efficient spectrum
sharing among SUs. We then perform throughput analysis and develop
an algorithm to determine the spectrum
sensing and access parameters to maximize the throughput for a given
allocation of channel sensing sets. Moreover,
we consider the spectrum sensing set optimization problem for SUs to maxim
ize the overall system throughput. We
present both exhaustive search and low-complexity greedy algorithms
to determine the sensing sets for SUs and
analyze their complexity. We also show how our design and analysis can be
extended to consider reporting errors.
Finally, extensive numerical results are presented to demonstrate the sig
nificant performance gain of our optimized
design framework with respect to non-optimized designs as well as the imp
acts of different protocol parameters on
the throughput performance.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
The document proposes a new clustering and routing algorithm for wireless sensor networks that aims to extend network lifetime. Key points:
- The algorithm divides nodes into sensing nodes and relay nodes, with relay nodes responsible for forwarding data to reduce cluster head burden.
- It selects cluster heads and relay nodes based on residual energy to distribute load and avoid early node death.
- A routing tree is constructed among relay nodes to transmit data to the base station in a multi-hop manner, selecting next hops based on residual energy and number of child nodes to balance energy usage.
- The goal is to improve energy efficiency, extend network lifetime, and increase data accuracy through mechanisms like clustering, load balancing, and fault detection
This document summarizes a research paper that proposes a novel cross-layer routing technique for mobile ad hoc networks. The technique calculates both signal strength and node mobility to select the most efficient and stable path for data transmission. It aims to improve on traditional ad hoc routing protocols like AODV by considering both link quality metrics from the physical layer (signal strength) and node mobility. The proposed method selects routes based on signal strength if mobility is high, and on traditional hop count if mobility is low, in order to find paths that reduce link failure and improve throughput.
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...IJCNCJournal
We consider models of telecommunication systems that incorporate probability, dense real-time and data.
We present a new formal abstraction method for computing minimum and maximum reachability
probabilities for such models. Our approach uses strictly local formal abstract steps to reduce both the size
of abstract specifications generated and the complexity of operations needed, in comparison to previous
approaches of this kind. A selection of large case studies are implemented the techniques and evaluate,
which include some infinite-state probabilistic real time models, demonstrating improvements over existing
tools in several cases. The capacity of metro and access networks are extended the reach and split ratio of
the conventional Long - Reach Passive Optical Networks (LR-PONs). The efficient solutions of LR-PONs
are appeared in feeder distances around 100km and high split ratios up to 1000-way . Among many
existing approaches, one of the most effective options to improve network performance in LR-PONs are the
multi-thread based dynamic bandwidth allocation (DBA) scheme where several bandwidth allocation
processes are performed in parallel is considered. Without proper intercommunication between the
overlapped threads, multi-thread DBA may lose efficiency and even perform worse than the conventional
single thread algorithm. Real Time Probabilistic Systems are used to evaluate a typical PON systems
performance. This approach is more convenient, flexible, and lower cost than the former simulation method,
which do not need develop special hardware and software tools. Moreover, how changes in performance
depend on changes in the particular modes can be easily analysis by supplying ranges for parameter values.
The proposed algorithm with traditional DBA is compared, and shows its advantage on average packet
delay. The key parameters of the algorithm are analysed and optimized, such as initiating and tuning
multiple threads, inter -thread scheduling, and fairness among users. The algorithms advantage in
numerical results are decreased the average packet delay and improve network throughput under varying
offered loads.
Distributed MAC Protocol for Cognitive Radio Networks: Design, Analysis, and ...Polytechnique Montreal
In this paper, we investigate the joint optimal sensing and distributed Medium Access Control (MAC) protocol design problem for cognitive radio (CR) networks. We consider both scenarios with single and multiple channels. For each scenario, we design a synchronized MAC protocol for dynamic spectrum sharing among multiple secondary users (SUs), which incorporates spectrum sensing for protecting active primary users (PUs). We perform saturation throughput analysis for the corresponding proposed MAC protocols that explicitly capture the spectrum-sensing performance. Then, we find their optimal configuration by formulating throughput maximization problems subject to detection probability constraints for PUs. In particular, the optimal solution of the optimization problem returns the required sensing time for PUs' protection and optimal contention window to maximize the total throughput of the secondary network. Finally, numerical results are presented to illustrate developed theoretical findings in this paper and significant performance gains of the optimal sensing and protocol configuration.
Joint Cooperative Spectrum Sensing and MAC Protocol Design for Multi-channel ...Polytechnique Montreal
In this paper, we propose a semi-distributed cooperative spectrum sen
sing (SDCSS) and channel access framework
for multi-channel cognitive radio networks (CRNs). In particular, we c
onsider a SDCSS scheme where secondary
users (SUs) perform sensing and exchange sensing outcomes with ea
ch other to locate spectrum holes. In addition,
we devise the
p
-persistent CSMA-based cognitive MAC protocol integrating the SDCSS to
enable efficient spectrum
sharing among SUs. We then perform throughput analysis and develop
an algorithm to determine the spectrum
sensing and access parameters to maximize the throughput for a given
allocation of channel sensing sets. Moreover,
we consider the spectrum sensing set optimization problem for SUs to maxim
ize the overall system throughput. We
present both exhaustive search and low-complexity greedy algorithms
to determine the sensing sets for SUs and
analyze their complexity. We also show how our design and analysis can be
extended to consider reporting errors.
Finally, extensive numerical results are presented to demonstrate the sig
nificant performance gain of our optimized
design framework with respect to non-optimized designs as well as the imp
acts of different protocol parameters on
the throughput performance.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
The document proposes a new clustering and routing algorithm for wireless sensor networks that aims to extend network lifetime. Key points:
- The algorithm divides nodes into sensing nodes and relay nodes, with relay nodes responsible for forwarding data to reduce cluster head burden.
- It selects cluster heads and relay nodes based on residual energy to distribute load and avoid early node death.
- A routing tree is constructed among relay nodes to transmit data to the base station in a multi-hop manner, selecting next hops based on residual energy and number of child nodes to balance energy usage.
- The goal is to improve energy efficiency, extend network lifetime, and increase data accuracy through mechanisms like clustering, load balancing, and fault detection
This document summarizes a research paper that proposes a novel cross-layer routing technique for mobile ad hoc networks. The technique calculates both signal strength and node mobility to select the most efficient and stable path for data transmission. It aims to improve on traditional ad hoc routing protocols like AODV by considering both link quality metrics from the physical layer (signal strength) and node mobility. The proposed method selects routes based on signal strength if mobility is high, and on traditional hop count if mobility is low, in order to find paths that reduce link failure and improve throughput.
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...IJCNCJournal
We consider models of telecommunication systems that incorporate probability, dense real-time and data.
We present a new formal abstraction method for computing minimum and maximum reachability
probabilities for such models. Our approach uses strictly local formal abstract steps to reduce both the size
of abstract specifications generated and the complexity of operations needed, in comparison to previous
approaches of this kind. A selection of large case studies are implemented the techniques and evaluate,
which include some infinite-state probabilistic real time models, demonstrating improvements over existing
tools in several cases. The capacity of metro and access networks are extended the reach and split ratio of
the conventional Long - Reach Passive Optical Networks (LR-PONs). The efficient solutions of LR-PONs
are appeared in feeder distances around 100km and high split ratios up to 1000-way . Among many
existing approaches, one of the most effective options to improve network performance in LR-PONs are the
multi-thread based dynamic bandwidth allocation (DBA) scheme where several bandwidth allocation
processes are performed in parallel is considered. Without proper intercommunication between the
overlapped threads, multi-thread DBA may lose efficiency and even perform worse than the conventional
single thread algorithm. Real Time Probabilistic Systems are used to evaluate a typical PON systems
performance. This approach is more convenient, flexible, and lower cost than the former simulation method,
which do not need develop special hardware and software tools. Moreover, how changes in performance
depend on changes in the particular modes can be easily analysis by supplying ranges for parameter values.
The proposed algorithm with traditional DBA is compared, and shows its advantage on average packet
delay. The key parameters of the algorithm are analysed and optimized, such as initiating and tuning
multiple threads, inter -thread scheduling, and fairness among users. The algorithms advantage in
numerical results are decreased the average packet delay and improve network throughput under varying
offered loads.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
This document summarizes a research paper that proposes a new Position Based Opportunistic Routing Protocol (POR) to improve reliable data delivery in mobile ad hoc networks. Existing geographic routing protocols have issues with route failures and delays in discovering new routes when nodes move. The proposed POR protocol selects multiple forwarding candidate nodes to opportunistically forward packets. If the primary forwarder fails, backup candidates can forward packets to avoid transmission interruptions. Simulation results show the POR protocol has lower delay and higher packet delivery ratio compared to existing protocols.
Bio-inspired route estimation in cognitive radio networks IJECEIAES
Cognitive radio is a technique that was originally created for the proper use of the radio electric spectrum due its underuse. A few methods were used to predict the network traffic to determine the occupancy of the spectrum and then use the ‘holes’ between the transmissions of primary users. The goal is to guarantee a complete transmission for the second user while not interrupting the trans-mission of primary users. This study seeks the multifractal generation of traffic for a specific radio electric spectrum as well as a bio-inspired route estimation for secondary users. It uses the MFHW algorithm to generate multifractal traces and two bio-inspired algo-rithms: Ant Colony Optimization and Max Feeding to calculate the secondary user’s path. Multifractal characteristics offer a predic-tion, which is 10% lower in comparison with the original traffic values and a complete transmission for secondary users. In fact, a hybrid strategy combining both bio-inspired algorithms promise a reduction in handoff. The purpose of this research consists on deriving future investigation in the generation of multifractal traffic and a mobility spectrum using bio-inspired algorithms.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
General analytical framework for cooperative sensing and access trade-off opt...Polytechnique Montreal
In this paper, we investigate the joint cooperative spectrum sensing and access design problem for multi-channel cognitive radio networks. A general heterogeneous setting is considered where the probabilities that different channels are available, SNRs of the signals received at secondary users (SUs) due to transmissions from primary users (PUs) for different users and channels can be different. We assume a cooperative sensing strategy with a general a-out-of-b aggregation rule and design a synchronized MAC protocol so that SUs can exploit available channels. We analyze the sensing performance and the throughput achieved by the joint sensing and access design. Based on this analysis, we develop algorithms to find optimal parameters for the sensing and access protocols and to determine channel assignment for SUs to maximize the system throughput. Finally, numerical results are presented to verify the effectiveness of our design and demonstrate the relative performance of our proposed algorithms and the optimal ones.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
Performance improvement of vehicular delay tolerant networks using public tra...ijmnct
In some networks, communications are sometimes interrupted and packet sending encounters many delays
due to lack of permanent connection between the nodes. Inter-vehicular and inter-satellite networks, which
are the so-called delay-tolerant networks, are an example to this type. This paper proposed a new routing
algorithm, which could increase efficiency of this kind of networks using predictability feature of bus
movement in a vehicular network. In this paper, bus routes were considered the backbone for vehicular
network and, knowing route of bus and destination of packets, the proposed algorithm, which was able to
use this information, was introduced. In addition, the proposed algorithm was simulated to prove its
efficiency and then it was compared with other algorithms in different conditions. The obtained results
indicated acceptable efficiency of the proposed algorithm.
M-EPAR to Improve the Quality of the MANETsIJERA Editor
In MANET, power aware is important challenge issue to improve the communication energy efficiency at individual nodes. We propose modified efficient power aware routing (M-EPAR), a new power aware routing protocol that increases the network lifetime of MANET. Designing a power aware routing algorithm or technique is one of the most important point considered in Mobile Ad Hoc Networks. These nodes are driven by reactive protocols where broadcasting is mandatory to form a path between two nodes. So in case of death of the node resulting out of less battery calls for re-routing. Since many existing techniques focuses on energy aware routing this paper presents combination of energy aware routing merged with link quality determined by packet drop rate. The proposed scheme has outperformed the existing technique in terms of packet delivery ratio, throughput and energy consumption.
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
Q-LEARNING BASED ROUTING PROTOCOL TO ENHANCE NETWORK LIFETIME IN WSNSIJCNCJournal
In resource constraint Wireless Sensor Networks (WSNs), enhancement of network lifetime has been one of the significantly challenging issues for the researchers. Researchers have been exploiting machine learning techniques, in particular reinforcement learning, to achieve efficient solutions in the domain of WSN. The objective of this paper is to apply Q-learning, a reinforcement learning technique, to enhance the lifetime of the network, by developing distributed routing protocols. Q-learning is an attractive choice for routing due to its low computational requirements and additional memory demands. To facilitate an agent running at each node to take an optimal action, the approach considers node’s residual energy, hop length to sink and transmission power. The parameters, residual energy and hop length, are used to calculate the Q-value, which in turn is used to decide the optimal next-hop for routing. The proposed protocols’ performance is evaluated through NS3 simulations, and compared with AODV protocol in terms of network lifetime, throughput and end-to-end delay.
Performance analysis of multilayer multicast MANET CRN based on steiner minim...TELKOMNIKA JOURNAL
In this study, the multicast mobile ad hoc (MANET) CRN has been developed, which involves multi-hop and multilayer consideration and Steiner minimal tree (SMT) algorithm is employed as the router protocol. To enhance the network performance with regards to throughput and packet delivery rate (PDR), as channel assignment scheme, the probability of success (POS) is employed that accounts for the channel availability and the time needed for transmission when selecting the best channel from the numerous available channels for data transmission from the source to all destinations nodes effectively. Within Rayleigh fading channels under various network parameters, a comparison is done for the performance of SMT multicast (MANET) CRN with POS scheme versus maximum data rate (MDR), maximum average spectrum availability (MASA) and random channel assignment schemes. Based on the simulation results, the SMT multicast (MANET) CRN with POS scheme was seen to demonstrate the best performance versus other schemes. Also, the results proved that the throughput and PDR performance are improved as the number the primary channels and the channel’s bandwidth increased while dropped as the value of packet size D increased. The network’s performance grew with rise in the value of idle probability (푃퐼) since the primary user’s (PU) traffic load is low when the value of 푃퐼 is high.
Multicast Routing Protocol with Group-Level Congestion Prediction and Perman...IOSR Journals
This document proposes a cross-layered model for congestion prediction and management in mobile ad hoc networks that aims to efficiently distribute network resources. The model incorporates two algorithms: Group-level Congestion Prediction (GCP) that predicts congestion levels at relay nodes with high accuracy, and Group-level Egress Permanence (GEP) that works sequentially with GCP for congestion detection and management. The document discusses related work on multicast routing protocols and energy-efficient multicasting. It then describes the proposed congestion control mechanism under constrained energy utilization and outlines the proposed model with relevant notations before focusing on the GCP and GEP algorithms.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new
challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of
MIMO communication in such type of network is enhancing the packet transmission capabilities. There
are different techniques for cooperative transmission and broadcasting packet in MIMO equipped
Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a
new scheduling algorithm based on investigating the different broadcasting algorithm. The new
broadcasting algorithm improves the packet transmission rate of the network based on energy
performance of the network and minimizes the BER for different transmission mode which is illustrated
in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result
for the packet transmission rate are collected and shown in the tabular form. Also simulate the network
for generating a comparative statement for each mobile node. And performance analysis is also done for
the model network. The main focus is to minimize BER and improve information efficiency of the
network.
Shared Spectrum Throughput for Secondary UsersCSCJournals
The throughput performance of secondary users sharing radio spectrum with a licensed primary user is analyzed in this work. An asynchronous transmission, sensing and backoff protocol is proposed for the secondary user and modeled as a six state Markov process. The model parameters are derived as a function of the duty cycle and average duration that the channel is unoccupied by the primary user. The secondary user parameters include its continuous transmission duration or packet size and its backoff window size. The model results show that the probabilities of the secondary user being in the transmit state are relatively invariant to the duty cycle compared to the probability of being in the backoff state, particularly at low to moderate secondary packet sizes. The secondary user throughput is expressed as a function of the aforementioned parameters and shown to change significantly with duty cycle and secondary packet sizes. It is found that at very low duty cycles, the throughput variation is insensitive to backoff duration being random or fixed. The proposed transmission and sensing method is also shown to outperform a periodic sensing protocol. The regions of the parameter space wherein the backoff and retransmit probabilities of the secondary user are bounded by specified performance metrics are derived. The sensitivity of the throughput in the presence of a cooperative and non- cooperative secondary user is also investigated.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Optimal multicast capacity and delay...IEEEGLOBALSOFTTECHNOLOGIES
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
El resumen propone construir un Cuadro de Mando Integral para el área de Bienestar Institucional de una universidad, con el objetivo de mejorar la satisfacción de los estudiantes y empleados. Se validan la misión y visión de Bienestar, se realiza un análisis DOFA, se construye un mapa estratégico y se definen objetivos e indicadores. Finalmente, se propone un cuadro con metas cuantificadas y responsables para cada objetivo, con el fin de mejorar la calidad de vida de la comunidad universitaria.
Este documento presenta el diagnóstico de la gestión educativa a través de la construcción de un cuadro de mando integral para el área de Bienestar Institucional de la Corporación de Estudios Tecnológicos del Norte del Valle. Se describe el proceso metodológico que incluyó la validación de la misión y visión, una matriz DOFA, la construcción de un mapa estratégico y una matriz de objetivos e indicadores, culminando con el cuadro de mando integral propuesto para el área de Bienestar.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
This document summarizes a research paper that proposes a new Position Based Opportunistic Routing Protocol (POR) to improve reliable data delivery in mobile ad hoc networks. Existing geographic routing protocols have issues with route failures and delays in discovering new routes when nodes move. The proposed POR protocol selects multiple forwarding candidate nodes to opportunistically forward packets. If the primary forwarder fails, backup candidates can forward packets to avoid transmission interruptions. Simulation results show the POR protocol has lower delay and higher packet delivery ratio compared to existing protocols.
Bio-inspired route estimation in cognitive radio networks IJECEIAES
Cognitive radio is a technique that was originally created for the proper use of the radio electric spectrum due its underuse. A few methods were used to predict the network traffic to determine the occupancy of the spectrum and then use the ‘holes’ between the transmissions of primary users. The goal is to guarantee a complete transmission for the second user while not interrupting the trans-mission of primary users. This study seeks the multifractal generation of traffic for a specific radio electric spectrum as well as a bio-inspired route estimation for secondary users. It uses the MFHW algorithm to generate multifractal traces and two bio-inspired algo-rithms: Ant Colony Optimization and Max Feeding to calculate the secondary user’s path. Multifractal characteristics offer a predic-tion, which is 10% lower in comparison with the original traffic values and a complete transmission for secondary users. In fact, a hybrid strategy combining both bio-inspired algorithms promise a reduction in handoff. The purpose of this research consists on deriving future investigation in the generation of multifractal traffic and a mobility spectrum using bio-inspired algorithms.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
General analytical framework for cooperative sensing and access trade-off opt...Polytechnique Montreal
In this paper, we investigate the joint cooperative spectrum sensing and access design problem for multi-channel cognitive radio networks. A general heterogeneous setting is considered where the probabilities that different channels are available, SNRs of the signals received at secondary users (SUs) due to transmissions from primary users (PUs) for different users and channels can be different. We assume a cooperative sensing strategy with a general a-out-of-b aggregation rule and design a synchronized MAC protocol so that SUs can exploit available channels. We analyze the sensing performance and the throughput achieved by the joint sensing and access design. Based on this analysis, we develop algorithms to find optimal parameters for the sensing and access protocols and to determine channel assignment for SUs to maximize the system throughput. Finally, numerical results are presented to verify the effectiveness of our design and demonstrate the relative performance of our proposed algorithms and the optimal ones.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
Performance improvement of vehicular delay tolerant networks using public tra...ijmnct
In some networks, communications are sometimes interrupted and packet sending encounters many delays
due to lack of permanent connection between the nodes. Inter-vehicular and inter-satellite networks, which
are the so-called delay-tolerant networks, are an example to this type. This paper proposed a new routing
algorithm, which could increase efficiency of this kind of networks using predictability feature of bus
movement in a vehicular network. In this paper, bus routes were considered the backbone for vehicular
network and, knowing route of bus and destination of packets, the proposed algorithm, which was able to
use this information, was introduced. In addition, the proposed algorithm was simulated to prove its
efficiency and then it was compared with other algorithms in different conditions. The obtained results
indicated acceptable efficiency of the proposed algorithm.
M-EPAR to Improve the Quality of the MANETsIJERA Editor
In MANET, power aware is important challenge issue to improve the communication energy efficiency at individual nodes. We propose modified efficient power aware routing (M-EPAR), a new power aware routing protocol that increases the network lifetime of MANET. Designing a power aware routing algorithm or technique is one of the most important point considered in Mobile Ad Hoc Networks. These nodes are driven by reactive protocols where broadcasting is mandatory to form a path between two nodes. So in case of death of the node resulting out of less battery calls for re-routing. Since many existing techniques focuses on energy aware routing this paper presents combination of energy aware routing merged with link quality determined by packet drop rate. The proposed scheme has outperformed the existing technique in terms of packet delivery ratio, throughput and energy consumption.
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
Q-LEARNING BASED ROUTING PROTOCOL TO ENHANCE NETWORK LIFETIME IN WSNSIJCNCJournal
In resource constraint Wireless Sensor Networks (WSNs), enhancement of network lifetime has been one of the significantly challenging issues for the researchers. Researchers have been exploiting machine learning techniques, in particular reinforcement learning, to achieve efficient solutions in the domain of WSN. The objective of this paper is to apply Q-learning, a reinforcement learning technique, to enhance the lifetime of the network, by developing distributed routing protocols. Q-learning is an attractive choice for routing due to its low computational requirements and additional memory demands. To facilitate an agent running at each node to take an optimal action, the approach considers node’s residual energy, hop length to sink and transmission power. The parameters, residual energy and hop length, are used to calculate the Q-value, which in turn is used to decide the optimal next-hop for routing. The proposed protocols’ performance is evaluated through NS3 simulations, and compared with AODV protocol in terms of network lifetime, throughput and end-to-end delay.
Performance analysis of multilayer multicast MANET CRN based on steiner minim...TELKOMNIKA JOURNAL
In this study, the multicast mobile ad hoc (MANET) CRN has been developed, which involves multi-hop and multilayer consideration and Steiner minimal tree (SMT) algorithm is employed as the router protocol. To enhance the network performance with regards to throughput and packet delivery rate (PDR), as channel assignment scheme, the probability of success (POS) is employed that accounts for the channel availability and the time needed for transmission when selecting the best channel from the numerous available channels for data transmission from the source to all destinations nodes effectively. Within Rayleigh fading channels under various network parameters, a comparison is done for the performance of SMT multicast (MANET) CRN with POS scheme versus maximum data rate (MDR), maximum average spectrum availability (MASA) and random channel assignment schemes. Based on the simulation results, the SMT multicast (MANET) CRN with POS scheme was seen to demonstrate the best performance versus other schemes. Also, the results proved that the throughput and PDR performance are improved as the number the primary channels and the channel’s bandwidth increased while dropped as the value of packet size D increased. The network’s performance grew with rise in the value of idle probability (푃퐼) since the primary user’s (PU) traffic load is low when the value of 푃퐼 is high.
Multicast Routing Protocol with Group-Level Congestion Prediction and Perman...IOSR Journals
This document proposes a cross-layered model for congestion prediction and management in mobile ad hoc networks that aims to efficiently distribute network resources. The model incorporates two algorithms: Group-level Congestion Prediction (GCP) that predicts congestion levels at relay nodes with high accuracy, and Group-level Egress Permanence (GEP) that works sequentially with GCP for congestion detection and management. The document discusses related work on multicast routing protocols and energy-efficient multicasting. It then describes the proposed congestion control mechanism under constrained energy utilization and outlines the proposed model with relevant notations before focusing on the GCP and GEP algorithms.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new
challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of
MIMO communication in such type of network is enhancing the packet transmission capabilities. There
are different techniques for cooperative transmission and broadcasting packet in MIMO equipped
Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a
new scheduling algorithm based on investigating the different broadcasting algorithm. The new
broadcasting algorithm improves the packet transmission rate of the network based on energy
performance of the network and minimizes the BER for different transmission mode which is illustrated
in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result
for the packet transmission rate are collected and shown in the tabular form. Also simulate the network
for generating a comparative statement for each mobile node. And performance analysis is also done for
the model network. The main focus is to minimize BER and improve information efficiency of the
network.
Shared Spectrum Throughput for Secondary UsersCSCJournals
The throughput performance of secondary users sharing radio spectrum with a licensed primary user is analyzed in this work. An asynchronous transmission, sensing and backoff protocol is proposed for the secondary user and modeled as a six state Markov process. The model parameters are derived as a function of the duty cycle and average duration that the channel is unoccupied by the primary user. The secondary user parameters include its continuous transmission duration or packet size and its backoff window size. The model results show that the probabilities of the secondary user being in the transmit state are relatively invariant to the duty cycle compared to the probability of being in the backoff state, particularly at low to moderate secondary packet sizes. The secondary user throughput is expressed as a function of the aforementioned parameters and shown to change significantly with duty cycle and secondary packet sizes. It is found that at very low duty cycles, the throughput variation is insensitive to backoff duration being random or fixed. The proposed transmission and sensing method is also shown to outperform a periodic sensing protocol. The regions of the parameter space wherein the backoff and retransmit probabilities of the secondary user are bounded by specified performance metrics are derived. The sensitivity of the throughput in the presence of a cooperative and non- cooperative secondary user is also investigated.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Optimal multicast capacity and delay...IEEEGLOBALSOFTTECHNOLOGIES
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
El resumen propone construir un Cuadro de Mando Integral para el área de Bienestar Institucional de una universidad, con el objetivo de mejorar la satisfacción de los estudiantes y empleados. Se validan la misión y visión de Bienestar, se realiza un análisis DOFA, se construye un mapa estratégico y se definen objetivos e indicadores. Finalmente, se propone un cuadro con metas cuantificadas y responsables para cada objetivo, con el fin de mejorar la calidad de vida de la comunidad universitaria.
Este documento presenta el diagnóstico de la gestión educativa a través de la construcción de un cuadro de mando integral para el área de Bienestar Institucional de la Corporación de Estudios Tecnológicos del Norte del Valle. Se describe el proceso metodológico que incluyó la validación de la misión y visión, una matriz DOFA, la construcción de un mapa estratégico y una matriz de objetivos e indicadores, culminando con el cuadro de mando integral propuesto para el área de Bienestar.
El documento habla sobre la definición estratégica de una empresa dedicada al diseño, fabricación e implementación de equipos para la industria alimenticia. Su mercado objetivo son establecimientos de comidas rápidas en la zona de San Rafael, Sangolquí y Amaguaña, donde ofrecen máquinas a bajo precio debido a su ventaja competitiva. Su visión es expandirse a otros sectores como panaderías y restaurantes, manteniendo valores como la eficiencia, respeto y responsabilidad con sus clientes.
Este documento presenta el cuadro de mando del Colegio Carmelitano de Bello para 2013. Describe tres niveles (administrativo, pedagógico y directivo) que permiten alcanzar la formación integral de los estudiantes a través de valores cristianos. Cada nivel se identifica con un color, símbolo y valor carmelitano y es responsable de áreas académicas específicas con el objetivo de promover la investigación, formación y desarrollo humano.
Herramientas en la gestión de una institución educativaSol Hernández
El documento describe las herramientas utilizadas en la gestión de una institución educativa. Explica que la gestión implica dirigir el funcionamiento y desarrollo de la escuela para alcanzar sus objetivos basados en la normativa legal y pedagógica. Luego detalla algunas técnicas cuantitativas y cualitativas que apoyan al director en el diagnóstico, planificación, control y evaluación de la escuela, incluyendo encuestas, investigación-acción, flujogramas y diagramas de Gantt.
El documento presenta el Sistema Integral de Planificación Estratégica (SIPE), que consiste en tres módulos: Diagnóstico, Estrategia y Comercial. El módulo de Diagnóstico ayuda a analizar las fortalezas, debilidades, oportunidades y amenazas de una empresa. El módulo de Estrategia provee herramientas para definir la visión, misión y estrategia general de una empresa. El módulo Comercial contiene herramientas para administrar canales de venta, el portafolio de productos y
PRESENTACIÓN DISEÑO DE UN MODELO DE CUADRO DE MANDO INTEGRAL WILSON VELASTEGUI
La investigación se realizó en la Empresa Municipal Mercado Mayorista Ambato, se identificó que su principal problema es la ausencia de indicadores financieros y no financieros, esto imposibilita tener una buena gestión administrativa, por lo que se propuso realizar el Diseño de un Cuadro de Mando Integral
Este documento presenta una guía para la aplicación del enfoque ambiental en instituciones educativas. Explica que el enfoque ambiental conceptualiza la relación entre la sociedad, su entorno y la cultura. Describe los componentes clave de la aplicación del enfoque, incluyendo la gestión institucional, la pedagogía, la educación en ecoeficiencia, salud y gestión de riesgos. También cubre el marco normativo y el proceso de supervisión, evaluación y reconocimiento de logros. El objetivo final es contribuir a mejorar
APLICACIONES DE LAS HERRAMIENTAS EN LA GESTIÓN DE UNA INSTITUCIÓN EDUCATIVARuth Mujica
El documento describe los conceptos clave de la gestión educativa, incluyendo la gerencia de la institución educativa, el cual es el proceso a través del cual el director guía la labor docente y administrativa de la escuela para lograr sus objetivos mediante el trabajo en equipo. También presenta varias herramientas para la gestión como el Cuadro de Mando Integral, Benchmarking, PEST y FODA que ayudan a los directores a diagnosticar, planificar, controlar y evaluar el desempeño de la institución.
Implementation of Vacate on Demand Algorithm in Various Spectrum Sensing Netw...IJERA Editor
In present days the wireless communications are widely increases because of this reason spectrum utilization can be rapidly increased.For efficient usage of spectrum we can implement the Vacate on demand algorithm in different networks. CR users also need to sense the spectrum and vacate the channel upon the detection of the PU‟s presence to protectPUs from harmful interference. To achieve these fundamental CR functions, CR users usually coordinate with each other by using a common medium for control message exchange ensuring a priority of PUs over CR users. This paper presents the Vacate on Demand (VD) algorithm which enables dynamic spectrum access and ensures to vacate the assigned channel in case of PU activity and move the CR user to some other vacant channel to make spectrum available to PUs as well as to CR users. The basic idea is to use a ranking table of the available channels based on the PU activity detected on each channel. To improve the spectrum efficiency we can implement the Vacate on demand algorithm in MANET Network.
enhanced cognitive radio network in dynamic spectrum sensingDinokongkham
The document discusses enhancing cognitive radio networks through dynamic spectrum sensing over fading channels. It proposes a methodology that uses a hidden Markov model for primary user detection along with signal strength and location information. This is combined with analyzing spectrum availability and channel estimation to optimize sensing time and maximize throughput while protecting primary users. Simulation results show the proposed approach improves performance metrics like throughput, loss rate, latency and delay compared to existing methods.
Channel assignment for throughput maximization in cognitive radio networks Polytechnique Montreal
In this paper, we consider the channel allocation problem for throughput maximization in cognitive radio networks with hardware-constrained secondary users. Specifically, we assume that secondary users exploit spectrum holes on a set of channels where each secondary user can use at most one available channel for communication. We develop two channel assignment algorithms that can efficiently utilize spectrum opportunities on these channels. In the first algorithm, secondary users are assigned distinct sets of channels. We show that this algorithm achieves the maximum throughput limit if the number of channels is sufficiently large. In addition, we propose an overlapping channel assignment algorithm, that can improve the throughput performance compared to the non-overlapping channel assignment algorithm. In addition, we design a distributed MAC protocol for access contention resolution and integrate the derived MAC protocol overhead into the second channel assignment algorithm. Finally, numerical results are presented to validate the theoretical results and illustrate the performance gain due to the overlapping channel assignment algorithm.
EFFICIENT ANALYSIS OF THE ERGODIC CAPACITY OF COOPERATIVE NON-REGENERATIVE RE...ijwmn
This paper proposes a novel efficient method to analyze the ergodic channel capacity of cooperative amplify-and-forward relay systems. This is accomplished by employing a very tight approximate moment generating function of the end-to-end signal-to-noise ratio that is applicable to various fading environments, including mixed and composite fading channels. Three adaptive source transmission policies are considered: constant power with optimal rate adaptation, optimal joint power and rate adaptation, and fixed rate with truncated channel inversion. Closed-form expressions for ergodic capacity under these policies are derived for Nakagami-m fading with independent but not identically distributed statistics. The accuracy of the proposed approximate method is validated through existing results and Monte Carlo simulations.
EFFICIENT ANALYSIS OF THE ERGODIC CAPACITY OF COOPERATIVE NON-REGENERATIVE RE...ijwmn
In this paper, we proposed a novel efficient method of analyzing the ergodic channel capacity of the
cooperative amplify-and-forward (CAF) relay system. This is accomplished by employing a very tight
approximate moment generating function (MGF) of end-to-end signal-to-noise ratio of 2-hop multi-relay
system, which is In this paper, we proposed a novel efficient method of analyzing the ergodic channel
capacity of the cooperative amplify-and-forward (CAF) relay system. This is accomplished by employing a
very tight approximate moment applicable to myriad of fading environments including mixed and
composite fading channels. Three distinct adaptive source transmission policies were considered in our
analysis namely: (i) constant power with optimal rate adaptation (ORA); (ii) optimal joint power and rate
adaptation (OPRA); and (iii) fixed rate with truncated channel inversion (TCIFR). The proposed frame
work based on the novel approximate MGF method is sufficiently general to encapsulate all types of fading
environments (especially for the analysis of the mixed fading case)and provides significant advantage to
model wireless system for mixed and composite fading channel. In addition to simplifying computation
complexity of ergodic capacity for CAF relaying schemes treated in literature, we also derive closed form
expressions for the above three adaptive source transmission policies under Nakagami-m fading with i.n.d
statistics. The accuracy of our proposed method has been validated with existing MGF expressions that are
readily available for specific fading environments in terms of bounds, and via Monte Carlo simulations.
The document proposes a multi-channel MAC protocol called MMDQS-MAC for wireless sensor networks. It aims to improve network performance by selecting the best channel for each sensor node and supporting dynamic channel assignment. MMDQS-MAC is designed to decrease collision probability, interference, and improve throughput, energy efficiency, packet delivery ratio, and end-to-end delay. It analyzes the performance of MMDQS-MAC through mathematical modeling and simulation.
Multihop Multi-Channel Distributed QOS Scheduling MAC Scheme for Wireless Sen...IOSR Journals
This document proposes a Multihop Multi-Channel Distributed QoS Scheduling MAC scheme (MMDQS-MAC) to improve the performance of wireless sensor networks. MMDQS-MAC supports dynamic channel assignment where each sensor node is equipped with a directional antenna. It aims to decrease collisions and interference, improve overall network performance, and is suitable for low traffic networks. Simulation results show that MMDQS-MAC improves aggregate throughput, transmission success rate, packet delivery ratio, energy efficiency, and end-to-end delay.
Ieee transactions 2018 topics on wireless communications for final year stude...tsysglobalsolutions
This document contains summaries of several academic papers related to wireless communications and signal processing. The summaries are 3 sentences or less and provide the high level purpose and key findings of each paper. The papers cover topics like content placement in cache-enabled small cell networks, joint beamformer design for wireless fronthaul and access links, long-term power procurement scheduling for smart grids, and frequency-domain compressive channel estimation for hybrid mmWave MIMO systems among others.
Ieee transactions 2018 on wireless communications Title and Abstracttsysglobalsolutions
Final year BE, B.Tech, ME, M.Tech projects along with our professionals for developing Real Time Applications in Emerging Technologies.
We can support to your final year projects in all domains with latest technologies and simulation tool like NS2, NS3, Glomosim, Opnet, Matlab, IDL, Sumo, Gridsim, Bonita tool & Cloud deployments (Cloudsim, Google App Engine, Amazon Deployment, and Real time Cloud Deployment)also we are support for JOURNAL and CONFERENCE Preparation.
?
TSYS Research and Development.
20/9 Sardar Patel Road, Janaki Complex,
4th Floor, Adyar, Chennai - 20?
Tel : 91 44 42607879, 98411 03123.
Website : http://www.tsysglobalsolutions.com/
http://tsysphdsupport.com/
Network Lifespan Maximization For Wireless Sensor Networks Using Nature-Inspi...IOSR Journals
This document proposes an Elephant Based Swarm Optimization (EBSO) approach to maximize the lifespan of wireless sensor networks. It models the wireless sensor network and describes elephants' social behavior that is inspiring the approach. Elephants exhibit unselfish behavior, strong memory, and ability to communicate and survive in large groups. The EBSO approach aims to adopt these behaviors through a cross-layer optimization of routing, MAC scheduling, and radio link parameters. It compares EBSO to LEACH and PSO protocols, showing EBSO extends network lifetime by balancing energy usage across nodes.
PERFORMANCE ANALYSIS OF CHANNEL ACCESS MODEL FOR MAC IN RANDOMLY DISTRIBUTED ...IJCNCJournal
Medium Access control (MAC) is one of the fundamental problems in wireless sensor networks. The performance of wireless sensor network depends on it. The main objective of a medium access control method is to provide high throughput, minimize the delay, and conservers the energy consumption by avoiding the collisions. In this paper, a general model for MAC protocol to reduce the delay, maximize throughput and conserve the energy consumption in channel accessing in high density randomly distributed wireless sensor network is presented. The proposed model is simulated using MATLAB. The simulation results show that the average delay for sensors with sufficient memory is lower than sensors without
memory. Further, the throughput of the channel access method with memory is better than without memory.
JOINT-DESIGN OF LINK-ADAPTIVE MODULATION AND CODING WITH ADAPTIVE ARQ FOR COO...IJCNCJournal
This paper analyzes the efficiency of a joint-design of an adaptive modulation and coding (AMC) at the
physical (PHY) layer with an adaptive Rmax-truncated selective-repeat automatic repeat request (ARQ)
protocol at the medium access control (MAC) layer to maximize the throughput of cooperative nonregenerative
relay networks under prescribed delay and/or error performance constraints. Particularly, we
generalize the existing design model/results for cross-layer combining of AMC along with truncated ARQ
in non-cooperative diversity networks in three-folds: (i) extension of the cross-layer PHY/MAC design or
optimization to cooperative diversity systems; (ii) generalization/unification of analytical expressions for
various network performance metrics to generalized block fading channels with independent but nonidentically
distributed (i.n.d) fading statistics among the spatially distributed nodes; (iii) analysis of the
effectiveness of joint-adaptation of the maximum retransmission limit Rmax of ARQ protocol and
cooperative diversity order N for delay-insensitive applications. Our insightful numerical results reveal
that the average throughput can be increased significantly by judiciously combining two additional degrees
of freedom (N and Rmax) that are available in cooperative amplify-and-forward (CAF) relay networks
besides employing AMC at the PHY layer, especially in the most challenging low signal-to-noise ratio
(SNR) regime.
In this paper, we consider the joint optimal sensing
and distributed MAC protocol design for cognitive radio
networks. Specifically, we design a synchronized MAC protocol
for dynamic spectrum sharing among multiple secondary
users, which incorporates spectrum sensing for protecting active
primary users. We perform saturation throughput analysis for
the proposed MAC protocol that explicitly captures spectrum
sensing performance. Then, we find its optimal configuration
by formulating a throughput maximization problem subject to
detection probability constraints for primary users. In particular,
the optimal solution of this optimization problem returns the
required sensing time for primary users’ protection and optimal
contention window for maximizing total throughput of the
secondary network. Finally, numerical results are presented to
illustrate a significant performance gain of the optimal sensing
and protocol configuration.
A comparative study in wireless sensor networksijwmn
This document summarizes and compares several routing algorithms proposed for wireless sensor networks. It discusses algorithms that aim to improve reliability, power efficiency, lifetime, and fault tolerance. The evaluation section compares how each algorithm addresses challenges like reliability, energy conservation, and adapting to topology changes. While various algorithms achieve improvements in areas like power efficiency and lifetime, most still have limitations and do not fully address all the key challenges for wireless sensor networks.
ENERGY EFFICIENCY OF MIMO COOPERATIVE NETWORKS WITH ENERGY HARVESTING SENSOR ...ijasuc
This paper addresses the maximizing network lifetime problem in wireless sensor networks (WSNs) taking
into account the total Symbol Error rate (SER) at destination. Therefore, efficient power management is
needed for extend network lifetime. Our approach consists to provide the optimal transmission power
using the orthogonal multiple access channels between each sensor. In order to deeply study the
properties of our approach, firstly, the simple case is considered; the information sensed by the source
node passes by a single relay before reaching the destination node. Secondly, global case is studied; the
information passes by several relays. We consider, in the previous both cases, that the batteries are nonrechargeable. Thirdly, we spread our work the case where the batteries are rechargeable with unlimited
storage capacity. In all three cases, we suppose that Maximum Ratio Combining (MRC) is used as a
detector, and Amplify and Forward (AF) as a relaying strategy. Simulation results show the viability of
our approach which the network lifetime is extended of more than 70.72%when the batteries are non
rechargeable and 100.51% when the batteries are rechargeable in comparison with other traditional
method.
ENERGY EFFICIENCY OF MIMO COOPERATIVE NETWORKS WITH ENERGY HARVESTING SENSOR ...ijasuc
This paper addresses the maximizing network lifetime problem in wireless sensor networks (WSNs) taking
into account the total Symbol Error rate (SER) at destination. Therefore, efficient power management is
needed for extend network lifetime. Our approach consists to provide the optimal transmission power
using the orthogonal multiple access channels between each sensor. In order to deeply study the
properties of our approach, firstly, the simple case is considered; the information sensed by the source
node passes by a single relay before reaching the destination node. Secondly, global case is studied; the
information passes by several relays. We consider, in the previous both cases, that the batteries are nonrechargeable. Thirdly, we spread our work the case where the batteries are rechargeable with unlimited
storage capacity. In all three cases, we suppose that Maximum Ratio Combining (MRC) is used as a
detector, and Amplify and Forward (AF) as a relaying strategy. Simulation results show the viability of
our approach which the network lifetime is extended of more than 70.72%when the batteries are non
rechargeable and 100.51% when the batteries are rechargeable in comparison with other traditional
method.
Channel Estimation in MIMO OFDM Systems with Tapped Delay Line ModelIJCNCJournal
The continuous increase in the user demands fornew-generation communication systems, is making the wireless channel more complex and challenging for estimation, developing a simulation model for the channel,and evaluating the performance of different MIMO systems. In this work, a simulation model for multipath fading channels in wireless communication is performed. The model includes a selection of typical Tapped-Delay-Line channel models that can be implemented to reproduce the effects of representative channel distortion and interference. Based on the simulation results, the proposed method exhibits accurate channel estimation performance for frequency-selective fading channels. The proposed work employed LS, MMSE, and ML methods for channel estimation, using 16 and 32 pilots and fixed pilot locations in each frame. Results are obtained for 4x4, 8x8, 16x16, 16x8, and 16x4 MIMO systems and tapped delay line systems.
Channel Estimation in MIMO OFDM Systems with Tapped Delay Line ModelIJCNCJournal
The continuous increase in the user demands fornew-generation communication systems, is making the wireless channel more complex and challenging for estimation, developing a simulation model for the channel,and evaluating the performance of different MIMO systems. In this work, a simulation model for multipath fading channels in wireless communication is performed. The model includes a selection of typical Tapped-Delay-Line channel models that can be implemented to reproduce the effects of representative channel distortion and interference. Based on the simulation results, the proposed method exhibits accurate channel estimation performance for frequency-selective fading channels. The proposed work employed LS, MMSE, and ML methods for channel estimation, using 16 and 32 pilots and fixed pilot locations in each frame. Results are obtained for 4x4, 8x8, 16x16, 16x8, and 16x4 MIMO systems and tapped delay line systems.
Resource Allocation in MIMO – OFDM Communication System under Signal Strength...Kumar Goud
Abstract: - Multiple Inputs and Multiple Output (MIMO) and Orthogonal Frequency Division Multiplexing (OFDM) system have the potential to attain high capability on the propagation setting. The aim of this paper is that the adaptive resource allocation in MIMO-OFDM system uses the water filling formula. Water filling answer is enforced for allocating the ability so as to extend the data rate. The overall system capability is maximised subject to the constraints on total power, signal to noise quantitative relation, and proportionality. Channel is assumed as a flat attenuation channel and therefore the comparison is created for various 2×2, 2×3, 3×2 and 4×4 MIMO-OFDM systems and water filling formula with allotted power. Supported the capability contribution from the relaying terminal, a brand new parameter referred to as cooperation constant is introduced as an operate of the relaying sub channel. This parameter is employed to switch the target parameter of the subcarrier allocation procedure. Fairness-oriented [Fading Channel] and throughput-oriented [Near finish Channel] algorithms square measure elite from the literature to check the planned technique. Each algorithms square measure changed to use the mean of cooperation constant within the objective parameter of the subcarrier allocation procedure and shown to own a much better total turnout with none sacrifice.
Keywords - MIMO-OFDM; Water filling Algorithm; Subcarrier Resource Allocation
JCWAEED: JOINT CHANNEL ASSIGNMENT AND WEIGHTED AVERAGE EXPECTED END-TO-END DE...csandit
In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, selforganization,self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint channel assignment and weighted average expected end-to-end delay routing protocol which considers both interference suppression with factor IF and end-toend delay. Additionally, we give the exact calculation formula of transmission delay and queuing delay. Simulations results demonstrate that JCWAEED outperforms other joint design routing protocols in terms of throughput, end-to-end delay and packet loss rate.
Similar to Channel Assignment With Access Contention Resolution for Cognitive Radio Networks (20)
This document discusses the joint design of data compression and medium access control (MAC) protocol for smart grids with renewable energy sources. It proposes using compressed sensing (CS) techniques to compress reported power injection data from multiple nodes in both space and time, and adapting the 802.15.4 MAC protocol to enable efficient data transmission and reliable data reconstruction. An analytical model is developed to determine optimal MAC parameter configurations that minimize reporting delay while achieving reliable data recovery. Numerical results are presented to demonstrate performance gains over existing solutions in terms of reporting delay, energy consumption, and bandwidth usage.
Design and Optimal Configuration of Full-Duplex MAC Protocol for Cognitive Ra...Polytechnique Montreal
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 efciently 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 conguration 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 congure
the proposed FDC-MAC protocol. Extensive numerical results are presented to illustrate the optimal
FDC-MAC conguration and the impacts of protocol parameters and the self-interference cancellation
quality on the throughput performance. Moreover, we demonstrate the signicant throughput gains of the
FDC-MAC protocol with respect to the existing HD MAC and single-stage FD MAC protocols
This dissertation investigates design and optimization issues for cognitive medium access control (CMAC) protocols in cognitive radio networks. It presents four main contributions:
1) A CMAC protocol for parallel spectrum sensing that maximizes throughput for single-channel and multi-channel scenarios.
2) A CMAC protocol and channel assignment algorithm for sequential sensing that maximizes network throughput in hardware-constrained networks.
3) A distributed CMAC protocol integrated with cooperative sensing to improve spectrum utilization for multi-channel heterogeneous networks. Impacts of reporting errors are also considered.
4) An asynchronous full-duplex CMAC protocol that enables simultaneous sensing and access to maximize throughput by adapting sensing time and transmit powers based on detected primary user activity
The document proposes a full-duplex cognitive MAC (FDC-MAC) protocol for cognitive radio networks. The protocol consists of two stages: (1) a FD sensing stage where secondary users perform concurrent spectrum sensing and transmission at a controlled power level to mitigate self-interference, and (2) a transmission stage where secondary users transmit at maximum power if the sensing stage indicated an available channel. The document develops a mathematical model to analyze the throughput performance of the FDC-MAC protocol and proves that there exists an optimal sensing time and transmit power configuration to maximize throughput. Extensive simulation results demonstrate significant throughput gains of the FDC-MAC protocol over half-duplex and single-stage full-duplex MAC protocols.
The document discusses four MAC protocol designs for cognitive radio networks:
1) CMAC protocol with parallel spectrum sensing.
2) CMAC protocol with sequential sensing.
3) CMAC protocol with cooperative sensing.
4) Asynchronous full-duplex CMAC protocol.
For each design, the document analyzes throughput and optimizes sensing and access parameters to maximize throughput while protecting primary users. Numerical results demonstrate throughput improvements from the different MAC protocol designs.
The document summarizes the research scope and contributions of the author's PhD dissertation on medium access control (MAC) protocols for cognitive radio networks (CRNs). It discusses four past research areas: (1) CMAC protocol design with parallel spectrum sensing, (2) CMAC protocol with sequential sensing, (3) CMAC protocol with cooperative sensing, and (4) asynchronous full-duplex CMAC protocol. It also outlines three potential future research directions: (1) multi-channel MAC protocol design for full-duplex CRNs, (2) cross-layer CMAC and routing design for multi-hop CRNs, and (3) joint cognitive protocol and data processing design for smart grid applications.
This document proposes a joint design of data compression and MAC protocol for smart grids using compressed sensing. It aims to minimize reporting time while reliably reconstructing power injection data from multiple nodes. Specifically, it employs two-dimensional compressed sensing to compress correlated power data in space and time. It also adapts the 802.15.4 MAC protocol frame structure to enable efficient data transmission for reconstruction. An analytical model is developed to optimize MAC parameters and guarantee reliable data reconstruction with minimum reporting delay.
This document summarizes a research paper on fair channel allocation in cognitive radio ad hoc networks. It discusses:
1) A channel allocation problem where each node is assigned a subset of channels to access periodically using a MAC protocol, with the goal of maximizing fair sharing of spectrum among network flows.
2) An optimal brute-force search algorithm for solving this NP-hard problem and its exponential complexity.
3) The development of low-complexity channel allocation algorithms and an analytical throughput model to evaluate performance.
This document proposes and analyzes a distributed medium access control (MAC) protocol for full-duplex cognitive radio networks. The key aspects of the proposed protocol are:
1) It employs frame fragmentation, dividing each data packet into multiple fragments, to enable secondary users to perform spectrum sensing during data transmission and detect primary user activity in a timely manner.
2) Secondary users use a backoff mechanism similar to 802.11 to contend for channel access. The winning secondary user then transmits data fragments while sensing for primary users between fragments.
3) The document develops a mathematical model to analyze the throughput performance of the protocol and proposes an algorithm to optimize protocol parameters like fragment time and transmit power to maximize throughput
In order to improve sensing performance when the noise variance is not known, this paper considers a so-called
blind spectrum sensing technique that is based on eigenvalue models. In this paper, we employed the spiked population
models in order to identify the miss detection probability. At first, we try to estimate the unknown noise variance
based on the blind measurements at a secondary location. We then investigate the performance of detection, in terms
of both theoretical and empirical aspects, after applying this estimated noise variance result. In addition, we study the
effects of the number of SUs and the number of samples on the spectrum sensing performance.
Using Subspace Pursuit Algorithm to Improve Performance of the Distributed Co...Polytechnique Montreal
This paper applies a compressed algorithm to improve the spectrum sensing performance of cognitive radio technology.
At the fusion center, the recovery error in the analog to information converter (AIC) when reconstructing the
transmit signal from the received time-discrete signal causes degradation of the detection performance. Therefore, we
propose a subspace pursuit (SP) algorithm to reduce the recovery error and thereby enhance the detection performance.
In this study, we employ a wide-band, low SNR, distributed compressed sensing regime to analyze and evaluate the
proposed approach. Simulations are provided to demonstrate the performance of the proposed algorithm.
The document discusses the benefits of exercise for mental health. Regular physical activity can help reduce anxiety and depression and improve mood and cognitive functioning. Exercise causes chemical changes in the brain that may help protect against mental illness and improve symptoms.
Capacity Performance Analysis for Decode-and-Forward OFDMDual-Hop SystemPolytechnique Montreal
In this paper, we propose an exact analytical technique to evaluate the average capacity of a dual-hop OFDM relay system with decode-and-forward protocol in an independent and identical distribution (i.i.d.) Rayleigh fading channel. Four schemes, (no) matching “and” or “or” (no) power allocation, will be considered. First, the probability density function (pdf) for the end-to-end power channel gain for each scheme is described. Then, based on these pdf functions, we will give the expressions of the average capacity. Monte Carlo simulation results will be shown to confirm the analytical results for both the pdf functions and average capacities.
Tech report: Fair Channel Allocation and Access Design for Cognitive Ad Hoc N...Polytechnique Montreal
supplement to Globecom paper: L. T. Tan and L. B. Le, ``Fair Channel Allocation and Access Design for Cognitive Ad Hoc Networks,'' in 2012 IEEE Global Communications Conference (IEEE GLOBECOM 2012), Anaheim, California, USA, pp. 1162-1167, December, 2012.
Performance of cognitive radio networks with maximal ratio combining over cor...Polytechnique Montreal
This document analyzes the performance of cognitive radio networks using maximal ratio combining over correlated Rayleigh fading channels. It presents a simple analytical method to derive closed-form expressions for the probabilities of detection and false alarm. The key findings are:
1) The detection probability is a monotonically increasing function of the number of antennas, as more antennas provides more diversity gain.
2) Antenna correlation degrades the sensing performance compared to independent antennas. Higher correlation results in lower detection probability.
3) Complementary receiver operating characteristic curves illustrate that both higher signal-to-noise ratio and lower antenna correlation improve detection performance by increasing the detection probability and decreasing the probability of miss at a given false alarm probability.
A novel and efficient mixed-signal compressed sensing for wide-band cognitive...Polytechnique Montreal
In cognitive radio (CR) networks, unlicensed (cognitive) users can exploit the licensed frequency bands by using spectrum sensing techniques to identify spectrum holes. This paper proposes a distributed compressive spectrum sensing scheme, in which the modulated wide-band converter can apply compressed sensing (CS) directly to analog signals at the sub-Nyquist rate and the central fusion receives signals from multiple CRs and exploits the multiple-measurements-vectors (MMV) subspace pursuit (M-SP) algorithm to jointly reconstruct the spectral support of the wide-band signal. This support is then used to detect whether the licensed bands are occupy or not. Finally, extensive simulation results show the advantages of the proposed scheme. Besides, we also compare the performance of M-SP with M-orthogonal matching pursuit (M-OMP) algorithms.
Projected Barzilai-Borwein Methods Applied to Distributed Compressive Spectru...Polytechnique Montreal
Cognitive radio allows unlicensed (cognitive) users to use licensed frequency bands by exploiting spectrum sensing techniques to detect whether or not the licensed (primary) users are present. In this paper, we present a compressed sensing applied to spectrum-occupancy detection in wide-band applications. The collected analog signals from each cognitive radio (CR) receiver at a fusion center are transformed to discrete-time signals by using analog-to-information converter (AIC) and then employed to calculate the autocorrelation. For signal reconstruction, we exploit a novel approach to solve the optimization problem consisting of minimizing both a quadratic (l2) error term and an l1-regularization term. In specific, we propose the Basic gradient projection (GP) and projected Barzilai-Borwein (PBB) algorithm to offer a better performance in terms of the mean squared error of the power spectrum density estimate and the detection probability of licensed signal occupancy.
Fair channel allocation and access design for cognitive ad hoc networksPolytechnique Montreal
The document discusses fair channel allocation and access design for cognitive radio ad hoc networks. It considers a scenario where network nodes can access at most one channel at a time. It analyzes the complexity of the optimal brute-force search algorithm for this NP-hard channel allocation problem. It then develops low-complexity algorithms and a throughput model to analyze their performance in achieving fair spectrum sharing. Specifically, it proposes a non-overlapping channel assignment algorithm and an overlapping channel assignment algorithm combined with a MAC protocol to resolve channel access contention.
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AIVladimir Iglovikov, Ph.D.
Presented by Vladimir Iglovikov:
- https://www.linkedin.com/in/iglovikov/
- https://x.com/viglovikov
- https://www.instagram.com/ternaus/
This presentation delves into the journey of Albumentations.ai, a highly successful open-source library for data augmentation.
Created out of a necessity for superior performance in Kaggle competitions, Albumentations has grown to become a widely used tool among data scientists and machine learning practitioners.
This case study covers various aspects, including:
People: The contributors and community that have supported Albumentations.
Metrics: The success indicators such as downloads, daily active users, GitHub stars, and financial contributions.
Challenges: The hurdles in monetizing open-source projects and measuring user engagement.
Development Practices: Best practices for creating, maintaining, and scaling open-source libraries, including code hygiene, CI/CD, and fast iteration.
Community Building: Strategies for making adoption easy, iterating quickly, and fostering a vibrant, engaged community.
Marketing: Both online and offline marketing tactics, focusing on real, impactful interactions and collaborations.
Mental Health: Maintaining balance and not feeling pressured by user demands.
Key insights include the importance of automation, making the adoption process seamless, and leveraging offline interactions for marketing. The presentation also emphasizes the need for continuous small improvements and building a friendly, inclusive community that contributes to the project's growth.
Vladimir Iglovikov brings his extensive experience as a Kaggle Grandmaster, ex-Staff ML Engineer at Lyft, sharing valuable lessons and practical advice for anyone looking to enhance the adoption of their open-source projects.
Explore more about Albumentations and join the community at:
GitHub: https://github.com/albumentations-team/albumentations
Website: https://albumentations.ai/
LinkedIn: https://www.linkedin.com/company/100504475
Twitter: https://x.com/albumentations
TrustArc Webinar - 2024 Global Privacy SurveyTrustArc
How does your privacy program stack up against your peers? What challenges are privacy teams tackling and prioritizing in 2024?
In the fifth annual Global Privacy Benchmarks Survey, we asked over 1,800 global privacy professionals and business executives to share their perspectives on the current state of privacy inside and outside of their organizations. This year’s report focused on emerging areas of importance for privacy and compliance professionals, including considerations and implications of Artificial Intelligence (AI) technologies, building brand trust, and different approaches for achieving higher privacy competence scores.
See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe.
This webinar will review:
- The top 10 privacy insights from the fifth annual Global Privacy Benchmarks Survey
- The top challenges for privacy leaders, practitioners, and organizations in 2024
- Key themes to consider in developing and maintaining your privacy program
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slackshyamraj55
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/building-and-scaling-ai-applications-with-the-nx-ai-manager-a-presentation-from-network-optix/
Robin van Emden, Senior Director of Data Science at Network Optix, presents the “Building and Scaling AI Applications with the Nx AI Manager,” tutorial at the May 2024 Embedded Vision Summit.
In this presentation, van Emden covers the basics of scaling edge AI solutions using the Nx tool kit. He emphasizes the process of developing AI models and deploying them globally. He also showcases the conversion of AI models and the creation of effective edge AI pipelines, with a focus on pre-processing, model conversion, selecting the appropriate inference engine for the target hardware and post-processing.
van Emden shows how Nx can simplify the developer’s life and facilitate a rapid transition from concept to production-ready applications.He provides valuable insights into developing scalable and efficient edge AI solutions, with a strong focus on practical implementation.
20 Comprehensive Checklist of Designing and Developing a WebsitePixlogix Infotech
Dive into the world of Website Designing and Developing with Pixlogix! Looking to create a stunning online presence? Look no further! Our comprehensive checklist covers everything you need to know to craft a website that stands out. From user-friendly design to seamless functionality, we've got you covered. Don't miss out on this invaluable resource! Check out our checklist now at Pixlogix and start your journey towards a captivating online presence today.
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
2. TAN AND LE: CHANNEL ASSIGNMENT WITH ACCESS CONTENTION RESOLUTION FOR COGNITIVE RADIO NETWORKS 2809
• We show how we can extend the proposed channel as-
signment algorithms when the max–min fairness is con-
sidered. We also extend the throughput analytical model
to consider sensing errors and propose an alternative MAC
protocol that can relieve congestion on the control channel.
• We demonstrate through numerical studies the interactions
among various MAC protocol parameters and suggest
its configuration. We show that the overlapping channel
assignment algorithm can achieve noticeable network
throughput improvement compared to its nonoverlapping
counterpart. In addition, we present the throughput gains
due to both proposed channel assignment algorithms
compared with the round-robin algorithms, which do
not exploit the heterogeneity in the channel availability
probabilities.
The remainder of this paper is organized as follows. In
Section II, we discuss important related works on spectrum-
sharing algorithms and MAC protocols. Section III describes
the system model and problem formulation. We present the
nonoverlapping channel assignment algorithm and describe its
performance in Section IV. The overlapping channel assign-
ment and the corresponding MAC protocol design are presented
in Section V. The performance analysis of the overlapping
channel assignment algorithm and the MAC protocol is given
in Section VI. Several potential extensions are discussed in
Section VII. Section VIII demonstrates the numerical results,
followed by the concluding remarks in Section IX. For brevity,
we sometimes express different quantities in vector form
(e.g., x describes the channel assignment variables whose el-
ements are xij).
II. RELATED WORK
Developing efficient spectrum-sensing and access mecha-
nisms for cognitive radio networks has been a very active
research topic over the past several years [3], [6]–[19]. A great
survey of recent works on MAC protocol design and analysis
is given in [6]. In [3], it was shown that, by optimizing the
sensing time, a significant throughput gain can be achieved
for an SU. In [7], we extended the result in [3] to the multi-
user setting, where we design, analyze, and optimize a MAC
protocol to achieve optimal tradeoff between sensing time and
contention overhead. In fact, in [7], we assumed that each SU
can simultaneously use all available channels. Therefore, the
channel assignment problem and the exploitation of multiuser
diversity do not exist in this setting, which is the topic of this
paper. Another related effort along this line was conducted in
[8], where sensing-period optimization and optimal channel-
sequencing algorithms were proposed to efficiently discover
spectrum holes and to minimize the exploration delay.
In [9], a control-channel-based MAC protocol was proposed
for SUs to exploit white spaces in the cognitive ad hoc net-
work setting. In particular, the authors of this paper developed
both random- and negotiation-based spectrum-sensing schemes
and performed throughput analysis for both saturation and
nonsaturation scenarios. There exist several other synchronous
cognitive MAC protocols that rely on a control channel for
spectrum negotiation and access, including the approaches in
[10]–[14]. A synchronous MAC protocol without using a con-
trol channel was proposed and studied in [15]. In [16], a MAC-
layer framework was developed to dynamically reconfigure
MAC- and physical-layer protocols. Here, by monitoring the
current network metrics, the proposed framework can achieve
great performance by selecting the best MAC protocol and its
corresponding configuration.
In [17], a power-controlled MAC protocol was developed
to efficiently exploit spectrum access opportunities while satis-
factorily protecting PUs by respecting interference constraints.
Another power control framework was described in [18], which
aims at meeting the rate requirements of SUs and interference
constraints of PUs. A novel clustering algorithm was devised in
[19] for network formation, topology control, and exploitation
of spectrum holes in a cognitive mesh network. It was shown
that the proposed clustering mechanism can efficiently adapt to
the changes in the network and radio transmission environment.
Optimal sensing and access design for cognitive radio net-
works were designed by using the optimal stopping theory in
[21]. In [22], a multichannel medium access control (McMAC)
protocol was proposed, taking into account the distance among
users so that white spaces can efficiently be exploited while
satisfactorily protecting PUs. Different power and spectrum
allocation algorithms were devised to maximize the secondary
network throughput in [23]–[25]. Optimization of spectrum
sensing and access, in which either cellular or TV bands can
be employed, was performed in [26].
In [27], cooperative sequential spectrum sensing and packet
scheduling were designed for cognitive radios that are equipped
with multiple spectrum sensors. An energy-efficient MAC
protocol was proposed for cognitive radio networks in [28].
Spectrum-sensing, access, and power control algorithms were
developed, considering quality-of-service (QoS) protection for
PUs and QoS provisioning for SUs, in [29] and [30]. Finally,
a channel-hopping-based MAC protocol was proposed in [31]
for cognitive radio networks to alleviate the congestion problem
in the fixed control channel design. All these existing works,
however, did not consider the scenario where cognitive radios
have hardware constraints, which allows them to access at most
one channel at any time. Moreover, exploiting the multichannel
diversity through efficient channel assignment is very critical to
optimize the throughput performance of the secondary network
for this problem. We will investigate this problem, considering
its unique design issues, in this paper.
III. SYSTEM MODEL AND PROBLEM FORMULATION
A. System Model
We consider a collocated cognitive radio network in which
M SUs exploit spectrum opportunities in N channels. We
assume that any SU can hear the transmissions of other SUs.
In addition, each SU can use at most one channel for its
data transmission. In addition, time is divided into a fixed-size
cycle, where SUs perform sensing on assigned channels at the
beginning of each cycle to explore available channels for com-
munication. We assume that perfect sensing can be achieved
with no sensing error. Extension to the imperfect spectrum
3. 2810 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 61, NO. 6, JULY 2012
sensing will be discussed in Section VII-B. It is assumed that
SUs transmit at a constant rate with a normalized value of one.
B. Problem Formulation
We are interested in performing channel assignment to max-
imize the system throughput. Let Ti denote the throughput
achieved by SU i. Let xij describe the channel assignment
decision where xij = 1 if channel j is assigned to SU i;
otherwise, xij = 0. The throughput maximization problem can
formally be written as follows:
max
x
M
i=1
Ti. (1)
For nonoverlapping channel assignments, we have the follow-
ing constraints:
M
i=1
xij = 1 for all j. (2)
We can derive the throughput that was achieved by SU i for
nonoverlapping channel assignment as follows. Let Si be the set
of channels solely assigned to SU i. Let pij be the probability
that channel j is available at SU i. For simplicity, we assume
that pij are independent of one another. This assumption holds
when each SU impacts different set of PUs on each channel.
This can, indeed, be the case, because spectrum holes depend
on space. Note, however, that this assumption can be relaxed
if the dependence structure of these probabilities is available.
Under this assumption, Ti can be calculated as
Ti = 1 −
j∈Si
pij = 1 −
N
j=1
(¯pij)xij
(3)
where pij = 1 − pij is the probability that channel j is not
available for SU i. In fact, 1 − j∈Si
pij is the probability that
at least one channel is available for SU i. Because each SU
can use at most one available channel, its maximum through-
put is 1. In the overlapping channel assignment scheme, the
constraints in (2) are not needed. Based on this calculation,
it can be observed that the optimization problem (1) and (2)
is a nonlinear integer program, which is an NP-hard problem
(interested readers can refer to [35, pt. VIII] for a detailed
treatment of this hardness result).
C. Optimal Algorithm and Its Complexity
Due to the nonlinear and combinatorial structure of the for-
mulated channel assignment problem, it would be impossible
to obtain its closed-form optimal solution. However, we can
employ the brute-force search (i.e., exhaustive search) to deter-
mine the best channel assignment that results in the maximum
total throughput. In particular, we can enumerate all possible
channel assignment solutions and then determine the best so-
lution by comparing their achieved throughput. This solution
method requires a throughput analytical model to calculate the
throughput for any particular channel assignment solution. We
will develop such a model in Section VI-A.
We now quantify the complexity of the optimal brute-force
search algorithm. Let us consider SU i (i.e., i ∈ {1, . . . , M}).
Suppose that we assign k channels to this SU i, where k ∈
{1, . . . , N}. Then, there are Ck
N ways of doing so. Because
k can take any values in k ∈ {1, . . . , N}, the total number of
ways of assigning channels to SU i is
N
k=1
Ck
N ≈ 2N
. Hence,
the total number of ways of assigning channels to all SUs is
asymptotically equal to (2N
)M
= 2NM
. Recall that we need
to calculate the throughput that was achieved by M SUs for
each potential assignment to determine the best one. Therefore,
the complexity of the optimal brute-force search algorithm is
O(2NM
). Given the exponentially large complexity required
to find the optimal channel assignment solution, we will
develop suboptimal and low-complexity channel assignment
algorithms in the following sections. In particular, we con-
sider the following two different channel assignment schemes:
1) nonoverlapping channel assignment and 2) overlapping
channel assignment.
IV. NONOVERLAPPING CHANNEL
ASSIGNMENT ALGORITHM
We develop a low-complexity algorithm for nonoverlapping
channel assignment in this section. Recall that Si is the set of
channels solely assigned for SU i (i.e., Si ∩ Sj = ∅, i = j).
The greedy channel assignment algorithm iteratively allocates
channels to SUs that achieve the maximum increase in the
throughput. A detailed description of the proposed algorithm is
presented in Algorithm 1. In each channel allocation iteration,
each SU i calculates its increase in throughput if the best avail-
able channel (i.e., channel j∗
i = arg maxj∈Sa
pij) is allocated.
This increase in throughput can be calculated as follows:
ΔTi = Ta
i − Tb
i
=
⎡
⎣1 − (1 − pij∗
i
)
j∈Si
(1 − pij)
⎤
⎦ −
⎡
⎣1 −
j∈Si
(1 − pij)
⎤
⎦
= pij∗
i
j∈Si
(1 − pij). (4)
Based on (4), it can be observed that ΔTi will quickly decrease
over allocation iterations, because j∈Si
(1 − pij) tends to zero
as the set Si is expanded. We have the following property for
the resulting channel assignment due to Algorithm 1.
Algorithm 1: Nonoverlapping channel assignment.
1: Initialize the set of available channels Sa := {1, 2, . . . , N}
and Si := ∅ for i = 1, 2, . . . , M.
2: for i = 1 to M do
3: j∗
i = arg maxj∈Sa
pij.
4: if Si = 0 then
5: Find ΔTi = Ta
i − Tb
i , where Ta
i and Tb
i are the
throughputs after and before assigning channel j∗
i .
6: else
7: Find ΔTi = pij∗
i
.
4. TAN AND LE: CHANNEL ASSIGNMENT WITH ACCESS CONTENTION RESOLUTION FOR COGNITIVE RADIO NETWORKS 2811
8: end if
9: end for
10: i∗
= arg maxi ΔTi.
11: Assign channel j∗
i∗ to user i∗
.
12: Update Sa = Sa j∗
i∗ .
13: If Sa is empty, terminate the algorithm. Otherwise, return
to step 2.
Proposition 1: If we have N M, then the throughput
achieved by any SU i due to Algorithm 1 is very close to the
maximum value of 1.
Proof: This proposition can be proved by showing that, if
the number of channels is much larger than the number of SUs
(i.e., N M), then each SU will be assigned a large number
of channels. Recall that Algorithm 1 assigns channels to a
particular SU i based on the increase-in-throughput metric ΔTi.
This property can be proved by observing that, if a particular SU
i has been assigned a large number of channels, its ΔTi is very
close to zero. Therefore, other SUs who have been assigned a
small number of channels will have a good chance of receiving
more channels. As a result, all SUs are assigned a large number
of channels if N M. According to (3), the throughput that
is achieved by SU i will reach its maximum value of 1 if its
number of assigned channels is sufficiently large. Hence, we
have proved the proposition.
In practice, we do not need a very large number of channels
to achieve the close-to-maximum throughput. In particular, if
each channel is available for secondary spectrum access with a
probability of at least 0.8, then the throughput that is achieved
by an SU that was assigned three channels is not smaller
than 1 − (1 − 0.8)3
= 0.992, which is less than 1% below the
maximum throughput. Note that, after running Algorithm 1, we
can establish the set of channels allocated to each SU, from
which we calculate its throughput by using (3).
V. OVERLAPPING CHANNEL ASSIGNMENT
Overlapping channel assignments can improve the network
throughput by exploiting the multiuser diversity gain. However,
a MAC protocol is needed to resolve the access contention
under the overlapping channel assignments. The MAC protocol
incurs overhead that offsets the throughput gain due to the
multiuser diversity. Hence, a sophisticated channel assignment
algorithm is needed to balance the protocol overhead and
throughput gain.
A. MAC Protocol
Let Si be the set of channels solely assigned for SU i
and Scom
i be the set of channels assigned for SU i and some
other SUs. Let denote Stot
i = Si ∪ Scom
i , which is the set of all
channels assigned to SU i. Assume that one control channel
is always available and used for access contention resolution.
We consider the following MAC protocol run by any particular
SU i, which belongs to the class of synchronized MAC pro-
tocols [20]. The MAC protocol is illustrated in Fig. 1, where
the synchronization and sensing phases are employed before
Fig. 1. Timing diagram for the proposed McMAC protocol.
the channel contention and transmission phase in each cycle.
A synchronization message is exchanged among SUs during the
synchronization phase to establish the same starting epoch of
each cycle. After sensing the assigned channels in the sensing
phase, each SU i proceeds as follows. If there is at least one
channel in Si available, then SU i randomly chooses one of
these available channels for communication. If this is not the
case, SU i will randomly choose one available channel in
Scom
i if there is any channel in this set available. (For brevity,
we will simply use users instead of SUs when there is no
confusion.) Then, it chooses a random backoff value that is
uniformly distributed in the interval [0, W − 1] (i.e., W is the
contention window) and starts decreasing its backoff counter
while listening on the control channel.
If it overhears transmissions of request to send/clear to send
(RTS/CTS) from any other users, it will freeze from decreasing
its backoff counter until the control channel is again free. As
soon as a user’s backoff counter reaches zero, its transmitter
sends an RTS message that contains a chosen channel to its
receiver. If the receiver successfully receives the RTS, it will
reply with a CTS, and user i starts its communication on the
chosen channel for the remainder of the cycle. If the RTS/CTS
message exchange fails due to collisions, the corresponding
user will quit the contention and wait until the next cycle. In
addition, by overhearing the RTS/CTS messages of neighboring
users, which convey information about the channels that were
chosen for communication, other users will compare these
channels with their chosen ones.
Any user whose chosen channel coincides with the overheard
channels quits the contention and waits until the next cycle.
Otherwise, it will continue to decrease its backoff counter be-
fore exchanging RTS/CTS messages. The standard short inter-
frame space (SIFS) is assumed to be used between the backoff
interval, RTS/CTS, and DATA messages. Note that the funda-
mental aspect that makes this MAC protocol different from the
approach proposed in [7] is that, in [7], we assumed that each
winning user can use all available channels for communication,
whereas at most one available channel can be exploited by
hardware-constrained SUs in this paper. Therefore, the channel
assignment problem does not exist for the setting considered in
[7]. One example of overlapping channel assignment for three
users and six channels is illustrated in Table I, where channel
assignments are indicated by an “x.”
5. 2812 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 61, NO. 6, JULY 2012
TABLE I
CHANNEL ASSIGNMENT EXAMPLE (M = 3, N = 6)
Remark 1: We focus on the saturation buffer scenario in
this paper. In practice, cognitive radios may have low backlog
or, sometimes, even empty buffers. In addition, because the
data transmission phase is quite large compared to a typical
packet size, we should allow users to transmit several packets
to completely fill the transmission phase in our MAC design.
This condition can be realized by allowing only sufficiently
backlogged users to participate in the sensing and access
contention processes.
B. Overlapping Channel Assignment Algorithm
We develop an overlapping channel assignment algorithm
that possesses two phases as follows. We run Algorithm 1 to
obtain the nonoverlapping channel assignment solution in the
first phase. Then, we perform overlapping channel assignment
by allocating channels that have been assigned to some users to
other users in the second phase. We devise a greedy overlapping
channel assignment algorithm using the increase-of-throughput
metric similar to the metric employed in Algorithm 1.
However, the calculation of this metric exactly turns out to
be a complicated task. Hence, we employ an estimate of the
increase-of-throughput, which is derived as follows to perform
channel assignment, assuming that the MAC protocol overhead
is δ < 1. In fact, δ depends on the outcome of the channel
assignment algorithm (i.e., sets of channels assigned to different
users). We will show how we can calculate δ and integrate it into
this channel assignment algorithm later.
Consider the case where channel j is the common channel
of users i1, i2, . . . , iMS. Here, MS is the number of users who
share this channel. We are interested in estimating the increase
in throughput for a particular user i if channel j is assigned to
this user. Indeed, this increase of throughput can be achieved,
because user i may exploit channel j if this channel is not
available or not used by other users i1, i2, . . . , iMS. To estimate
the increase of throughput, in the remainder of this paper, we
are interested only in a practical scenario where all pij are close
to 1 (e.g., at least 0.8). This assumption would be reasonable,
given several recent measurements that reveal that the spectrum
utilization of useful frequency bands is very low (e.g., less that
15%). Under this assumption, we will show that the increase of
throughput for user i and channel j can be estimated as
ΔTMS,est
i (j)
=(1 − 1/MS)(1−δ)pij
h∈Si
pih
×
⎛
⎝1 −
h∈Scom
pih
⎞
⎠
MS
k=1
⎡
⎣pikj
⎛
⎝
MS
q=1,q=k
piqj
⎞
⎠
⎤
⎦ (5)
+ (1 − δ)pij
h∈Si
pih
h∈Scom
i
pih
MS
q=1
piqj
×
MS
q=1
⎛
⎝1 −
h∈Siq
piqh
⎞
⎠ (6)
+ (1 − 1/MS)(1 − δ)pij
h∈Si
pih
×
⎛
⎝1−
h∈Scom
pih
⎞
⎠
MS
q=1
piqj
MS
q=1
⎛
⎝1−
h∈Siq
piqh
⎞
⎠ . (7)
Algorithm 2: Overlapping channel assignment.
1: Initialize the sets of allocated channels for all users Si :=
∅ for i = 1, 2, . . . , M and δ0
2: Run Algorithm 1 to obtain a nonoverlapping channel as-
signment solution.
3: Let the group of channels that are shared by l users be Gl
and Uj be the set of users who share channel j and set
Utemp
j := Uj ∀j = 1, 2, . . . , N.
4: continue := 1; h = 1; updoverhead := 0.
5: while continue = 1 do
6: Find the group of channels shared by h users, Gh.
7: for j = 1 to |Gh| do
8: for l = 1 to M do
9: if l ∈ Uj then
10: ΔTh,est
l (j) = 0.
11: else
12: User l calculates ΔTh,est
l (j), assuming that
channel j is allocated to user l.
13: end if
14: end for
15: l∗
j = arg maxl ΔTh,est
l (j).
16: end for
17: j∗
l∗ = arg maxj ΔTh,est
l∗
j
(j).
18: if ΔTh,est
l∗ (j∗
l∗ ) ≤ and updoverhead = 1 then
19: Set: continue := 0.
20: Go to step 35.
21: end if
22: if ΔTh,est
l∗ (j∗
l∗ ) > then
23: Temporarily assign channel j∗
l∗ to user l∗
, i.e., update
Utemp
j∗
l∗
= Uj∗
l∗
∪ {l∗
}.
24: Calculate W and δ with Utemp
j∗
l∗
by using the methods
in Sections V-C and V-D, respectively.
25: if |δ − δ0| > δ then
26: Set: updoverhead := 1;
27: Return to step 7 using the updated δ0 = δ.
28: else
29: Update Uj∗
l∗
:= Utemp
j∗
l∗
(i.e., assign channel j∗
l∗ to
userl∗
), calculateW and δ0 with Uj∗
l∗
, and update Gh.
30: Update: updoverhead := 0.
31: end if
32: end if
33: Return to step 7.
34: h = h + 1.
35: end while
6. TAN AND LE: CHANNEL ASSIGNMENT WITH ACCESS CONTENTION RESOLUTION FOR COGNITIVE RADIO NETWORKS 2813
This estimation is obtained by listing all possible scenarios/
events in which user i can exploit channel j to increase its
throughput. Because the user throughput is bounded by 1, we
only count events that occur with nonnegligible probabilities.
In particular, assuming that pij are high (or pij are small), we
only count events whose probabilities have at most two such
elements pij in the product. In addition, we can determine the
increase of throughput for user i by comparing its achievable
throughput before and after channel j is assigned to it. It can be
verified that we have the following events for which the average
increases of throughput are significant.
• Channel j is available for all users i and iq, q =
1, 2, . . . , MS, except for ik, where k = 1, 2, . . . , MS.
In addition, all channels in Si are not available, and at
least one channel in Scom
i is available for user i. User
i can achieve a maximum average throughput of 1 − δ
by exploiting channel j, whereas its minimum average
throughput before being assigned channel i is at least
(1 − δ)/MS (when user i needs to share the available
channel in Scom
i with MS other users). The increase of
throughput for this case is at most (1 − 1/MS)(1 − δ),
and the upper bound for the increase of throughput of user
i is written in (5).
• Channel j is available for user i and all users iq, q =
1, 2, . . . , MS, but each user iq uses other available chan-
nels in Siq
for transmission. Moreover, no channel in Stot
i
is available. In this case, the increase of throughput for user
i is 1 − δ, and the average increase of throughput of user i
is written in (6).
• Channel j is available for user i and all users iq, q =
1, 2, . . . , MS, but each user iq uses other available chan-
nels in Siq
for transmission. Moreover, at least one channel
in Scom
i is available. In this case, the increase of through-
put for user i is upper bounded by (1 − 1/MS)(1 − δ),
and the average increase of throughput of user i is written
in (7).
The detailed description of the algorithm is given in
Algorithm 2. This algorithm has outer and inner loops, where
the outer loop increases the parameter h, which represents the
maximum number of users allowed to share any particular
channel (i.e., MS in the aforementioned estimation of the
increase of throughput), and the inner loop performs channel
allocation for one particular value of h = MS. In each
assignment iteration of the inner loop, we assign one “best”
channel j to user i that achieves maximum ΔTh,est
i (j). This
assignment continues until the maximum ΔTh,est
i (j) is less
than a predetermined number > 0. As will be clear in the
throughput analysis, it is beneficial to maintain at least one
channel in each set Si. This case is because the throughput
contributed by channels in Si constitutes a significant fraction
of the total throughput. Therefore, we will maintain this
constraint when running Algorithm 2.
C. Calculation of Contention Window
We show how we can calculate the contention window
W so that collision probabilities among contending SUs are
sufficiently small. In fact, there is a tradeoff between collision
probabilities and the average overhead of the MAC protocol,
which depends on W. In particular, larger values of W reduce
collision probabilities, at the cost of higher protocol overhead,
and vice versa, because there can be several collisions during
the contention phase, each of which occurs if two or more users
randomly choose the same value of backoff time. In addition,
the probability of the first collision is largest, because the
number of contending users decreases for successive potential
collisions.
Let Pc be the probability of the first collision. In the fol-
lowing discussion, we determine contention window W by
imposing a constraint Pc ≤ P , where P controls the collision
probability and overhead tradeoff. Let us calculate Pc as a
function of W, assuming that there are m SUs in the contention
phase. Without loss of generality, assume that the random
backoff times of m users are ordered as r1 ≤ r2 ≤ . . . ≤ rm.
The conditional probability of the first collision if there are m
users in the contention stage can be written as
P(m)
c =
m
j=2
Pr(j users collide)
=
m
j=2
W −2
i=0
Cj
m
1
W
j
W − i − 1
W
m−j
(8)
where each term in the double sum represents the probability
that j users collide when they choose the same backoff value
equal to i. Hence, the probability of the first collision can be
calculated as
Pc =
M
m=2
P(m)
c × Pr {m users contend} (9)
where P
(m)
c is given in (8), and Pr{m users contend} is the
probability that m users join the contention phase. To compute
Pc, we now derive Pr{m users contend}. It can be verified that
user i joins the contention if all channels in Si are busy and at
least one channel in Scom
i is available. The probability of this
event can be written as
P(i)
con = Pr {all channels in Si are busy and
∃! some channels in Scom
i are available}
=
⎛
⎝
j∈Si
pij
⎞
⎠
⎛
⎝1 −
j∈Scom
i
pij
⎞
⎠ . (10)
The probability of the event that m users join the contention
phase is
Pr {m users contend} =
Cm
M
n=1 i∈Λn
P(i)
con
j∈ΛM Λn
P
(j)
con (11)
where Λn is one particular set of m users, and ΛM is the set of
all M users ({1, 2, . . . , M}). Substituting the result in (11) into
(9), we can calculate Pc. Finally, we can determine W as
W = min {W such that Pc(W) ≤ P } (12)
7. 2814 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 61, NO. 6, JULY 2012
where, for clarity, we denote Pc(W), which is given in (9) as a
function of W.
D. Calculation of the MAC Protocol Overhead
Using the contention window calculated in (12), we can
quantify the average overhead of the proposed MAC protocol.
Toward this end, let r be the average value of the backoff value
chosen by any SU. Then, we have r = (W − 1)/2, because
the backoff counter value is uniformly chosen in the interval
[0, W − 1]. As a result, the average overhead can be calculated
as follows:
δ(W)=
[W −1]θ/2+tRTS +tCTS +3tSIFS +tSEN +tSYN
Tcycle
(13)
where θ is the time that corresponds to one backoff unit; tRTS,
tCTS, and tSIFS are the corresponding time of RTS, CTS, and
SIFS messages; tSEN is the sensing time; tSYN is the length of
the synchronization message; and Tcycle is the cycle time.
E. Update δ Inside Algorithm 2
The overhead δ that was calculated in (13) depends on the
channel assignment outcome, which is not known when we run
Algorithm 2. Therefore, in each allocation step in Algorithm 2,
we update δ based on the current channel assignment outcome.
Because δ does not change much in two consecutive allocation
decisions, Algorithm 2 smoothly runs in practice.
F. Practical Implementation Issues
To perform channel assignments, we need to know pij for
all users and channels. Fortunately, we only need to per-
form the estimation of pij once these values change, which
would be infrequent in practice. These estimation and channel
assignment tasks can be performed by one secondary node or
collaboratively be performed by several of them. For example,
for the secondary network that support communication between
M secondary nodes and a single secondary base station (BS),
the BS can take the responsibility of estimating pij and per-
forming channel assignments. Once the channel assignment
solution has been determined and forwarded to all SUs, each
SU will perform spectrum sensing and run the underlying MAC
protocol to access the spectrum in each cycle.
It is again emphasized that, although sensing and the MAC
protocol are performed and run in every cycle, estimating pij
and performing channel assignment (given the values of pij)
are performed only if the values of pij change, which should
be infrequent. Therefore, it would be affordable to accurately
estimate pij by employing sufficiently long sensing time. This
is because, for most spectrum-sensing schemes, including an
energy detection scheme, misdetection and false-alarm proba-
bilities tend to zero when the sensing time increases for a given
sampling frequency [3], [4].
VI. PERFORMANCE ANALYSIS
Suppose that we have run Algorithm 2 and obtained the set
of users Uj associated with each allocated channel j. Based on
this condition, we have the corresponding sets Si and Scom
i
for each user i. Given this channel assignment outcome, we
derive the throughput as follows, assuming that there is no
collision due to MAC protocol access contention. We will show
that, by appropriately choosing contention parameters for the
MAC protocol, the throughput analysis under this assumption
achieves accurate results.
A. Throughput Analysis
Because the total throughput is the sum of throughput of all
users, it is sufficient to analyze the throughput of one particular
user i. We will perform the throughput analysis by considering
all possible sensing outcomes performed by the considered user
i for its assigned channels. We will have the following cases,
which correspond to nonzero throughput for the considered
user.
• Case 1: If at least one channel in Si is available, then
user i will exploit this available channel and achieve a
throughput of one. Here, we have
Ti {Case 1} = Pr {Case 1} = 1 −
j∈Si
¯pij. (14)
• Case 2: In this case, we consider scenarios where all chan-
nels in Si are not available, at least one channel in Scom
i
is available, and user i chooses the available channel j for
transmission. Suppose that channel j is shared by MSj
SUs, including user i (i.e., MSj = |Uj|). The following
four possible groups of users ik, k = 1, . . . , MSj, share
channel j.
– Group 1: Channel j is available for user ik, and user
ik has at least 1 channel in Sik
available.
– Group 2: Channel j is not available for user ik.
– Group 3: Channel j is available for user ik, all chan-
nels in Sik
are not available, and another channel j
in Scom
ik
is available for user ik. In addition, user ik
chooses channel j for transmission in the contention
stage.
– Group 4: Channel j is available for user ik, and all
channels in Sik
are not available. In addition, user
ik chooses channel j for transmission in the con-
tention stage. Hence, user ik competes with user i for
channel j.
The throughput that was achieved by user i in this case
can be written as
Ti {Case 2} = (1 − δ)Θi
MSj
A1=0
MSj −A1
A2=0
MSj −A1−A2
A3=0
Φ1(A1)Φ2(A2)Φ3(A3)Φ4(A4) (15)
where the following conditions hold.
8. TAN AND LE: CHANNEL ASSIGNMENT WITH ACCESS CONTENTION RESOLUTION FOR COGNITIVE RADIO NETWORKS 2815
– Θi is the probability that all channels in Si are not
available and user i chooses some available channel
j in Scom
i for transmission.
– Φ1(A1) denotes the probability that A1 users belong
to group 1 among MSj users who share channel j.
– Φ2(A2) represents the probability that A2 users belong
to group 2 among MSj users who share channel j.
– Φ3(A3) describes the probability that A3 users belong
to group 3 among MSj users who share channel j.
– Φ4(A4) denotes the probability that A4 = MSj −
A1 − A2 − A3 remaining users belong to group 4
scaled by 1/(1 + A4), where A4 is the number of
users, excluding user i, who compete with user i for
channel j.
We now proceed to calculate these quantities. We have
Θi =
k∈Si
pik.
Hi
Bi=1
C
Bi
Hi
h=1 j∈Ψh
i
1
Bi
j1∈Ψh
i
pij1
j2∈Scom
i
Ψh
i
pij2
(16)
where Hi denotes the number of channels in Scom
i . The
first product term in (16) represents the probability that
all channels in Si are not available for user i. The second
term in (16) describes the probability that user i chooses an
available channel j among Bi available channels in Scom
i
for transmission. Here, we consider all possible subsets
of Bi available channels, and for one such particular
case, Ψh
i describes the corresponding set of Bi available
channels, i.e.,
Φ1(A1) =
C
A1
MSj
c1=1 m1∈Ω
(1)
c1
pm1j
⎛
⎝1 −
l∈Sm1
pm1l
⎞
⎠ . (17)
In (17), we consider all possible subsets of size A1 that
belong to group 1 (there are CA1
MSj
such subsets). Each
term inside the sum represents the probability for the
corresponding event whose set of A1 users is denoted by
Ω
(1)
c1 , i.e.,
Φ2(A2) =
C
A2
MSj −A1
c2=1 m2∈Ω
(2)
c2
pm2j. (18)
In (18), we capture the probability that channel j is not
available for A2 users in group 2 whose possible sets are
denoted by Ω
(2)
c2 , i.e.,
Φ3(A3) =
C
A2
MSj −A1−A2
c3=1 m3∈Ω
(3)
c3
pm3j
l3∈Sm3
pm3l3
(19)
β
n=0
Cn
β
q=1 h1∈Scom,q
j,m3
pm3h1
h2∈S
com,q
j,m3
pm3h2
1−
1
n+1
. (20)
For each term in (19), we consider different possible
subsets of A3 users, which are denoted by Ω
(3)
c3 . Then,
each term in (19) represents the probability that channel
j is available for each user m3 ∈ Ω
(3)
c3 whereas all chan-
nels in Sm3
for the user m3 are not available. In (20),
we consider all possible sensing outcomes for channels
in Scom
m3
performed by user m3 ∈ Ω
(3)
c3 . In addition, let
Scom
j,m3
= Scom
m3
{j} and β = |Scom
j,m3
|. Then, in (20), we
consider all possible scenarios in which n channels in
Scom
j,m3
are available and user m3 chooses a channel dif-
ferent from channel j for transmission [with probability
(1 − (1/n + 1))], where Scom
j,m3
= Scom,q
j,m3
∪ S
com,q
j,m3
, and
Scom,q
j,m3
∩ S
com,q
j,m3
= ∅. We have
Φ4(A4) =
1
1 + A4
m4∈Ω(4)
⎛
⎝pm4j
l4∈Sm4
pm4l4
⎞
⎠ (21)
γ
m=0
Cm
γ
q=1 h1∈Scom,q
j,m4
pm4h1
h2∈Scom,q
j,m4
pm4h2
1
m + 1
. (22)
The sensing outcomes captured in (21) and (22) are similar
to the outcomes in (19) and (20). However, given three
sets of A1, A2, and A3 users, the set Ω(4)
whose size is
|Ω(4)
| = A4 can be determined. Here, γ denotes the cardi-
nality of the set Scom
j,m4
= Scom
m4
{j}. Other sets are similar
to the sets in (19) and (20). However, all users in Ω(4)
choose channel j for transmission in this case. Therefore,
user i wins the contention with probability 1/(1 + A4),
and its achievable throughput is (1 − δ)/(1 + A4).
Summarizing all the cases considered, the throughput
achieved by user i is given as
Ti = Ti{Case 1} + Ti{Case 2}. (23)
In addition, the total throughput of the secondary network
T is the sum of throughput achieved by all SUs.
B. Impacts of Contention Collision
We have presented the saturation throughput analysis, as-
suming that there is no contention collision. Intuitively, if the
MAC protocol is designed such that the collision probability is
sufficiently small, then the impact of collision on the throughput
performance would be negligible. For our MAC protocol, users
perform contention resolution in case 2 considered in the previ-
ous throughput analysis, which occurs with a small probability.
Therefore, if the contention window in (12) is chosen for a
sufficiently small P , then contention collisions would have
negligible impacts on the network throughput. We formally
state this intuitive result in the following proposition.
Proposition 2: The throughput T that was derived in the
previous section has an error, which can be upper bounded as
Et ≤ P
M
i=1 j∈Si
¯pij
⎛
⎝1 −
j∈Scom
i
¯pij
⎞
⎠ (24)
9. 2816 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 61, NO. 6, JULY 2012
where P is the target collision probability that is used to
determine the contention window in (12).
Proof: As aforementioned, contention collision can occur
only in case 3 of the aforementioned throughput analysis. The
probability that covers all possible events for user i in this
case is j∈Si
¯pij(1 − j∈Scom
i
¯pij). In addition, the maximum
average throughput that a particular user i can achieve is
1 − δ < 1 (because no other users contend with user i to exploit
a chosen channel). In addition, if contention collision happens,
then user i will quit the contention and may experience a
maximum average throughput loss of 1 − δ compared to the
ideal case with no contention collision. In addition, the collision
probabilities of all potential collisions is bounded above by P .
Therefore, the average error due to the proposed throughput
analysis can be upper bounded as in (24).
To illustrate the throughput error bound presented in this
proposition, let us consider an example where ¯pij ≤ 0.2 and
P ≤ 0.03. Because the sets Si returned by Algorithm 2
contain at least one channel, the throughput error can be
bounded by M × 0.2 × 0.03 = 0.006M. In addition, the total
throughput will be at least M
i=1(1 − j∈Si
¯pij) ≥ 0.8M if
we consider only the throughput contribution from case 1.
Therefore, the relative throughput error can be upper bounded
by 0.006M/0.8M ≈ 0.75%, which is quite negligible. This
example shows that the proposed throughput analytical model
is very accurate in most practical settings.
C. Complexity Analysis
We analyze the complexity of Algorithms 1 and 2 in this
section. Let us proceed by analyzing the steps taken in each
iteration of Algorithm 1. To determine the best assignment
for the first channel, we have to search over M SUs and N
channels, which involves MN cases. Similarly, to assign the
second channel, we need to perform searching over all SUs and
N − 1 channels (one channel is already assigned in the first
iteration). Hence, the second assignment involves M(N − 1)
cases. Similar analysis can be applied for other assignments in
later iterations. In summary, the total number of cases involved
in assigning all channels to M SUs is M(N + · · · + 2 + 1) =
MN(N + 1)/2, which is O(MN2
). In Algorithm 1, the in-
crease of throughput used in the search is calculated using (4).
In Algorithm 2, we run Algorithm 1 in the first phase and
then perform further overlapping channel assignments using
Algorithm 2 in the second phase. Hence, we need to analyze
the complexity of the second phase (i.e., Algorithm 2). In
Algorithm 2, we increase the value of h from 1 to M − 1
over iterations of the while loop (to increase the number of
users who share one channel). For a particular value of h, we
search over the channels that have been shared by h users and
over all M users. Therefore, we have NM cases to consider
in the worst case for each value of h, each of which requires
calculating the corresponding increase of throughput by using
(5). Therefore, the worst case complexity of the second phase is
NM(M − 1), which is O(NM2
). Considering the complexity
of both phases, the complexity of Algorithm 2 is O(MN2
+
NM2
) = O(MN(M + N)), which is much lower than the
optimal brute-force search algorithm (O(2NM
)).
VII. FURTHER EXTENSIONS AND DESIGN ISSUES
A. Fair Channel Assignment
We extend the channel assignment problem to consider the
max–min fairness objective, which maximizes the minimum
throughput achieved by all SUs [36]. In particular, the max–min
channel assignment problem can be stated as follows:
max
x
min
i
Ti. (25)
Intuitively, the max–min fairness criterion tends to allocate
more radio resources for “weak” users to balance the through-
put performance among all users. Due to the exact through-
put analytical model developed in Section VI-A, the optimal
solution of the optimization problem (1) can be found by
the exhaustive search, which, however, has an extremely high
computational complexity.
To resolve this complexity issue, we devise greedy fair
nonoverlapping and overlapping channel assignment algo-
rithms, which are described in Algorithms 3 and 4, respec-
tively. In Section VIII, we compare the performance of these
algorithms with the optimal exhaustive search algorithm. These
algorithms are different from Algorithms 1 and 2 mainly in
the way we choose the user to allocate one “best” channel in
each iteration. In Algorithm 3, we find the set of users who
achieve a minimum throughput in each iteration. For each user
in this set, we find one available channel that results in the
highest increase of throughput. Then, we assign the “best”
channel that achieves the maximum increase of throughput,
considering all minimum-throughput users. Therefore, this as-
signment attempts to increase the throughput of a weak user
while exploiting the multiuser diversity.
Algorithm 3: Fair nonoverlapping channel assignment.
1: Initialize SU i’s set of available channels, Sa
i :=
{1, 2, . . . , N} and Si := ∅, for i = 1, 2, . . . , M, where
Si denotes the set of channels assigned for SU i.
2: continue := 1.
3: while continue = 1 do
4: Find the set of users who currently have minimum
throughput, Smin
= arg mini Tb
i
where Smin
= {i1, . . . , im} ⊂ {1, . . . , M} is the set
of minimum-throughput SUs.
5: if ORil∈Smin (Sa
il
= ∅) then
6: For each SU il ∈ Smin
and channel jil
∈ Sa
il
, find
ΔTil
(jil
) = Ta
il
− Tb
il
where Ta
il
and Tb
il
are the throughput after and
before assigning channel jil
; set ΔTil
=0 if Sa
il
=∅.
7: {i∗
l , j∗
i∗
l
} = arg maxil∈Smin,jil
∈Sa
il
ΔTil
(jil
).
8: Assign channel j∗
i∗
l
to SU i∗
l .
9: Update Si∗
l
= Si∗
l
∪ j∗
i∗
l
and Sa
k = Sa
k j∗
i∗
l
for all
k ∈ {1, . . . , M}.
10: else
11: Set continue := 0.
12: end if
13: end while
10. TAN AND LE: CHANNEL ASSIGNMENT WITH ACCESS CONTENTION RESOLUTION FOR COGNITIVE RADIO NETWORKS 2817
Algorithm 4: Fair overlapping channel assignment.
1: Run Algorithm 3 and obtain the sets Si for all SU i.
Initialize Scom
i = ∅ for i.
2: continue := 1.
3: while continue = 1 do
4: Find i∗
= arg mini∈{1,...,M} Tb
i and Tmin = Tb
i∗ , where
ties are randomly broken.
5: SSep
i∗ = ∪i,i=i∗ Si, SUni
i∗ = ∪iScom
i Scom
i∗ .
6: Run Algorithm 5.
7: if ORiScom,temp
i = ∅ then
8: Assign Scom
i = Scom,temp
i and Si = Stemp
i .
9: else
10: Set continue := 0.
11: end if
12: end while
Algorithm 5: Searching for potential channel assignment.
1: (∗
Search channel assignment from separate sets ∗
)
2: for j ∈ SSep
i∗ do
3: Find SU i , where j ∈ Si . Let nc = M − 2.
4: for l = 0 to nc do
5: for k = 1 to Cl
nc
do
6: Find Ta
i∗ , Ta
i , and Ta
m|m∈Ul
j
, where Ul
j is the set
of l new SUs who share channel j.
7: if min(Ta
i∗ , Ta
m|m∈Ul
j
, Ta
i ) > Tmin then
8: Temporarily assign channel j to SUs i∗
, i and
all SUs m: Scom,temp
i∗ = Scom
i∗ ∪ j, Scom,temp
i =
Scom
i ∪j, Stemp
i =Si j and Scom,temp
m =Scom
m ∪j.
9: Update Tmin = min(Ta
i∗ , Ta
m|m∈Ul
j
, Ta
i ).
10: Reset all temporary sets of other SUs to be empty.
11: end if
12: end for
13: end for
14: end for
15: (∗
Search channel assignment from common sets ∗
)
16: for j ∈ SUni
i∗ do
17: Find the subset of SUs, except for SU i∗
, SUse
who use
channel j as an overlapping channel.
18: for l = 0 to M − 1 − |SUse
| do
19: for k = 1 to Cl
M−1−|SUse| do
20: Find Ta
i∗ , Ta
i |i ∈SUse , Ta
m|m∈Ul
j
, where Ul
j is the
set of l new SUs who share channel j.
21: if min(Ta
i∗ , Ta
i |i ∈SUse , Ta
m|m∈Ul
j
) > Tmin then
22: Temporarily assign channel j to SU i∗
, all
SUs i , and all SUs m:Scom,temp
i∗ =Scom
i∗ ∪ j,
Scom,temp
m = Scom
m ∪ j.
23: Update Tmin=min(Ta
i∗ , Ta
i |i ∈SUse , Ta
m|m∈Ul
j
).
24: ResetalltemporarysetsofotherSUstobeempty.
25: end if
26: end for
27: end for
28: end for
In Algorithm 4, we first run Algorithm 3 to obtain nonover-
lapping sets of channels for all users. Then, we seek to improve
the minimum throughput by performing overlapping channel
assignments. In particular, we find the minimum-throughput
user and an overlapping channel assignment that results in the
largest increase in its throughput. The algorithm terminates
when there is no such overlapping channel assignment. The
search of an overlapping channel assignment in each iteration
of Algorithm 4 is performed in Algorithm 5. In particular, we
sequentially search over channels that have been allocated for a
single user or shared by several users (i.e., channels in separate
and common sets, respectively). Then, we update the current
temporary assignment with a better one (if any) during the
search. This search requires throughput calculations for which
we use the analytical model developed in Section VI-A with
the MAC protocol overhead δ < 1 derived in Section V-D. It
can be observed that the proposed throughput analysis is very
useful, because it can be used to evaluate the performance
of any channel assignment solution and to perform channel
assignments in greedy algorithms.
B. Throughput Analysis Under Imperfect Sensing
We extend the throughput analysis by considering imperfect
sensing. The following two important performance measures
are used to quantify the sensing performance: 1) detection
probabilities and 2) false-alarm probabilities. Let Pij
d and Pij
f
be the detection and false-alarm probabilities, respectively, of
SU i on channel j. In particular, a detection event occurs when
a secondary link successfully senses a busy channel, and a false
alarm represents the situation when a spectrum sensor returns a
busy state for an idle channel (i.e., a transmission opportunity
is overlooked). In addition, let us define P
ij
d = 1 − Pij
d and
P
ij
f = 1 − Pij
f . Under imperfect sensing, the following four
scenarios are possible for channel j and SU i.
• Scenario 1: A spectrum sensor indicates that channel j is
available and the nearby PU is not using channel j (i.e.,
correct sensing). This scenario occurs with the probability
P
ij
f pij.
• Scenario 2: A spectrum sensor indicates that channel j is
available and the nearby PU uses channel j (i.e., misde-
tection). This scenario occurs with the probability P
ij
d pij.
In this case, the potential transmission of SU i will collide
with the nearby PU. We assume that both transmissions
from SU i and the nearby PU fail.
• Scenario 3: A spectrum sensor indicates that channel j is
not available and the nearby PU uses channel j (i.e., cor-
rect detection). This scenario occurs with the probability
Pij
d pij.
• Scenario 4: A spectrum sensor indicates that channel j is
not available and the nearby PU is not using channel j
(i.e., false alarm). This scenario occurs with the probability
Pij
f pij, and the channel opportunity is overlooked.
Because SUs make channel access decisions based on their
sensing outcomes, the first two scenarios can result in spectrum
access on channel j by SU i. Moreover, spectrum access in
scenario 1 leads to successful data transmission. Let us define
11. 2818 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 61, NO. 6, JULY 2012
Pij
idle = P
ij
f pij + P
ij
d pij and Pij
busy = 1 − Pij
idle as the proba-
bilities under which SU i may and may not access channel j,
respectively. The same synchronized MAC protocol described
in Section V-A is assumed here. In addition, the MAC proto-
col overhead can be calculated as presented in Section V-D,
where the contention window W is determined as described in
Section V-C. However, pij and pij are substituted by Pij
idle and
Pij
busy, respectively, in the calculation of contention window
in Section V-C for this case, because Pij
idle and Pij
busy capture
the probabilities that channel j is available and busy for user
i as indicated by sensing, respectively, considering potential
sensing errors. Because the total throughput is the sum of
throughput of all users, it is sufficient to analyze the throughput
of one particular user i. To analyze the throughput of user i, we
consider the following cases.
Case 1: At least one channel in Si is available, and user i
chooses one of these available channels for its transmis-
sion. User i can achieve a throughput of one in such
a successful access, which occurs with the following
probability:
Pr {Case 1} =
|Si|
k1=1
C
k1
|SI |
l1=1 j1∈S
l1
i
pij1
j2∈SiS
l1
i
pij2
(26)
k1
k2=1
C
k2
k1
l2=1 j3∈S
l2
i
P
ij3
f
j4∈SiS
l2
i
Pij4
f (27)
|Si|−k1
k3=0
C
k3
|Si|−k1
l3=1
k2
k2 + k3
j5∈Sl
i
3
P
ij5
d
j6∈SiS
l1
i
S
l3
i
Pij6
d (28)
where we have Ti{Case 1} = Pr{Case 1}. The quantity
(26) represents the probability that there are k1 available
channels in Si (which may or may not correctly be sensed
by SU i). Here, Sl1
i denotes a particular set of k1 avail-
able channels whose index is l1. In addition, the quantity
(27) describes the probability that there are k2 available
channels as indicated by sensing (the remaining available
channels are overlooked due to sensing errors), where Sl2
i
denotes the l2th set with k2 available channels. For the
quantity in (28), k3 denotes the number of channels that
are not available but the sensing outcomes indicate that
they are available (i.e., due to misdetection). Moreover,
k2/(k2 + k3) represents the probability that SU i chooses
the available channel for transmission, given that its sens-
ing outcomes indicate k2 + k3 available channels. The
remaining quantity in (28) describes the probability that
the sensing outcomes due to SU i incorrectly indicates k3
available channels.
Case 2: All channels in Si are indicated as not available by sens-
ing; at least one channel in Scom
i is indicated as available
by sensing, and user i chooses an available channel j for
transmission. Suppose that channel j is shared by MSj
SUs, including user i (i.e., MSj = |Uj|). The following
four possible groups of users ik, k = 1, . . . , MSj share
channel j.
– Group 1: Channel j is available for user ik, and
user ik has at least one channel in Sik
available as
indicated by sensing.
– Group 2: Channel j is indicated as not available for
user ik by sensing.
– Group 3: Channel j is available for user ik, all chan-
nels in Sik
are not available, and another channel
j in Scom
ik
is available for user ik as indicated by
sensing. In addition, user ik chooses channel j for
transmission in the contention stage.
– Group 4: Channel j is available for user ik, and
all channels in Sik
are not available as indicated by
sensing. In addition, user ik chooses channel j for
transmission in the contention stage. Hence, user ik
competes with user i for channel j.
The throughput that was achieved by user i in this case can
be written as
Ti{Case 2} = (1 − δ)Θi
MSj
A1=0
MSj−A1
A2=0
MSj−A1−A2
A3=0
Φ1(A1)Φ2(A2)Φ3(A3)Φ4(A4). (29)
Here, we use the same notations as in the perfect sensing
scenario investigated in Section VI-A, where the following
conditions hold.
– Θi is the probability that all channels in Si are indicated
as not available by sensing and user i chooses some
available channel j in Scom
i as indicated by sensing for
transmission.
– Φ1(A1) denotes the probability that A1 users belong to
group 1 among MSj users who share channel j.
– Φ2(A2) represents the probability that A2 users belong
to group 2 among MSj users who share channel j.
– Φ3(A3) describes the probability that A3 users belong to
group 3 among MSj users who share channel j.
– Φ4(A4) denotes the probability that A4 = MSj − A1 −
A2 − A3 remaining users belong to group 4 scaled by
1/(1 + A4), where A4 is the number of users, excluding
user i, who compete with user i for channel j.
We now proceed to calculate these quantities. We have
Θi =
|Si|
k1=0
C
k1
|Si|
l1=1 j1∈S
l1
i
Pij1
d pij1
j2∈SiS
l1
i
pij2
(30)
H1
k2=1
C
k2
H1
l2=1 j3Ψ
l2
i
pij3
j4∈Scom
i
Ψ
l2
i
pij4
(31)
k2
k3=1
C
k3
k2
l3 j5∈Γ
l3
1 j5∈Γ
l3
1
P
ij5
f
j6∈Ψ
l2
i
Γ
l3
1
Pij6
f (32)
Hi−k2
k4=0
C
k4
Hi−k2
l4=1
1
k3 + k4
j7∈Γ
l3
2
P
ij7
d
j8∈Scom
i
Ψ
l2
i
Γ
l4
2
pij8
d (33)
12. TAN AND LE: CHANNEL ASSIGNMENT WITH ACCESS CONTENTION RESOLUTION FOR COGNITIVE RADIO NETWORKS 2819
where Hi denotes the number of channels in Scom
i . The quantity
in (30) is the probability that all available channels in Si (if
any) are overlooked by user i due to false alarms. Therefore,
user i does not access any channels in Si. The quantity in (31)
describes the probability that there are k2 available channels in
Scom
i , and Ψl2
i denotes such a typical set with k2 available chan-
nels. The quantity in (32) describes the probability that user i
correctly detects k3 channels out of k2 available channels. The
last quantity in (33), excluding the factor 1/(k3 + k4), denotes
the probability that user i misdetects k4 channels among the
remaining Hi − k2 busy channels in Scom
i . Finally, the factor
1/(k3 + k4) is the probability that user i correctly chooses
one available channel in Scom
i for transmission out of k3 + k4
channels, which are indicated as available by sensing, i.e.,
Φ1(A1) =
C
A1
MSj
c1=1 m1∈Ω
(1)
c1
Pm1j
idle
⎛
⎝1 −
l∈Smi
pm1l
busy
⎞
⎠ . (34)
In (34), we consider all possible subsets of users of size A1 that
belong to group 1 (there are CA1
MSj
such subsets). Each term
inside the sum represents the probability of the corresponding
event whose set of A1 users is denoted by Ω
(1)
c1 , i.e.,
Φ2(A1) =
C
A2
MSj −A1
c2=1 m2∈Ω
(2)
c2
Pm2j
busy. (35)
In (35), we capture the probability that channel j is indicated
as not available by sensing for A2 users in group 2. Possible
sets of these users are denoted by Ω
(2)
c2 , i.e.,
Φ3(A3)=
C
A3
MSj−A1−A2
c3=1 m3∈Ω
(3)
c3
Pm3j
idle
l3∈Sm3
Pm3l3
busy (36)
β
n=0
Cn
β
q=1h1∈Scom,q
j,m3
Pm3h1
idle
h2∈S
com,q
j,m3
Pm3h2
busy 1−
1
n+1
. (37)
For each term in (36), we consider different possible subsets
of A3 users, which are denoted by Ω
(3)
c3 . Then, each term
in (36) represents the probability that channel j is indicated
as available by sensing for each user m3 ∈ Ω
(3)
c3 whereas all
channels in Sm3
are indicated as not available by sensing.
In (37), we consider all possible sensing outcomes for
channels in Scom
m3
performed by user m3 ∈ Ω
(3)
c3 . In addition,
let Scom
j,m3
= Scom
m3
{j} and β = |Scom
j,m3
|. Then, in (37), we
consider all possible scenarios in which n channels in Scom
j,m3
are indicated as available by sensing and user m3 chooses a
channel that is different from channel j for transmission [with
probability (1 − (1/n + 1))], where Scom
j,m3
= Scom,q
j,m3
∪ S
com,q
j,m3
,
and Scom,q
j,m3
∩ S
com,q
j,m3
= ∅. We have
Φ4(A4) =
1
1 + A4
m4∈Ω(4)
Pm4j
idle
l4∈Sm4
Pm4l4
busy (38)
γ
m=0
Cm
γ
q=1 h1∈Scom,q
j,m4
Pm4h1
idle
h2∈S
com,q
j,m4
Pm4h2
busy
1
m+1
. (39)
The sensing outcomes captured in (38) and (39) are similar to
the outcomes in (36) and (37). However, given three sets of A1,
A2, and A3 users, the set Ω(4)
whose size is |Ω(4)
| = A4 can be
determined. Here, γ denotes the cardinality of the set Scom
j,m4
=
Scom
m4
{j}. Other sets are similar to the sets in (36) and (37).
However, all users in Ω(4)
choose channel j for transmission in
this case. Therefore, user i wins the contention with probability
1/(1 + A4), and its achievable throughput is (1 − δ)/(1 + A4).
Summarizing all the cases considered, the throughput that
was achieved by user i is written as
Ti = Ti {Case 1} + Ti {Case 2} . (40)
In addition, the total throughput T can be calculated by sum-
ming the throughput of all SUs.
C. Congestion of the Control Channel
Under our design, contention on the control channel is mild
if the number of channels N is relatively large compared to the
number of SUs M. In particular, there is no need to employ
a MAC protocol if we have N M, because distinct sets of
channels can be allocated for SUs by using Algorithm 1. In
contrast, if the number of channels N is small compared to the
number of SUs M, then the control channel may experience
congestion due to excessive control message exchanges. The
congestion of the control channel in such scenarios can be
alleviated if we allow RTS/CTS messages to be exchanged in
parallel on several channels (i.e., multiple rendezvous [32]).
We describe a potential design of a multiple-rendezvous
MAC protocol as follows using similar ideas of the McMAC
protocol in [31] and [32]. We assume that each SU hops through
all channels by following a particular hopping pattern, which
corresponds to a unique seed [32]. In addition, each SU puts
its seed in every packet so that neighboring SUs can learn
its hopping pattern. The same cycle structure as described in
Section V-A is employed here. Suppose that SU A wishes to
transmit data to SU B in a particular cycle. Then, SU A turns to
the current channel of B and senses this channel and its assigned
channels in Stot
AB, which is the set of allocated channels for link
AB. If SU A’s sensing outcomes indicate that the current chan-
nel of SU B is available, then SU A sends RTS/CTS messages,
with SU B containing a chosen available communication chan-
nel. Otherwise, SU A waits until the next cycle to again perform
sensing and contention. If the handshake is successful, SU A
transmits data to SU B on the chosen channel in the data phase.
Upon completing data transmission, both SUs A and B return to
their home hopping patterns. In general, collisions among SUs
are less frequent under a multiple-rendezvous MAC protocol,
because contentions can occur in parallel on different channels.
VIII. NUMERICAL RESULTS
We present numerical results to illustrate the throughput per-
formance of the proposed channel assignment algorithms. To
obtain the results, the probabilities pi,j are randomly realized
in the interval [0.7, 0.9], unless stated otherwise. We choose
the length of control packets as follows. An RTS, including
the PHY header, is 288 b, whereas a CTS, including the PHY
13. 2820 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 61, NO. 6, JULY 2012
Fig. 2. Collision probability versus the contention window (for M = 15).
header, is 240 b, which correspond to tRTS = 48 μs and tCTS =
40 μs for a transmission rate of 6 Mb/s, which is the basic
rate of 802.11a/g standards [37]. Other parameters are chosen
as follows. The cycle time is Tcycle = 3 ms, θ = 20 μs, and
tSIFS = 28 μs. The target collision probability is P = 0.03, and
tSEN and tSYN are assumed to be negligible, and therefore, they
are ignored. Note that these values of θ and tSIFS are typical
(interested readers can refer to [33] for related information).
The value of cycle time Tcycle is relatively small, given that
practical cognitive systems such as systems that operate on the
television bands standardized in the 802.22 standard requires
the spectrum evacuation time of a few seconds [34]. We will
present the total throughput under the throughput maximization
design and the minimum throughput under max–min fairness
design in all numerical results. All throughput curves are ob-
tained by averaging over 30 random realizations of pi,j.
A. MAC Protocol Configuration
We first investigate interactions between MAC protocol
parameters and the achievable throughput performance. In
particular, we plot the average probability of the first collision,
which is derived in Section V-C, versus the contention window
in Fig. 2 when Algorithm 2 is used for channel assignment. This
figure shows that the collision probability first increases and
then decreases with N. This case can be interpreted as follows.
When N is relatively small, Algorithm 2 tends to allow more
overlapping channel assignments for increasing the number
of channels. However, more overlapping channel assignments
increase the contention level, because more users may want
to exploit same channels, which results in a larger collision
probability. Because N is sufficiently large, a few overlapping
channel assignments are needed to achieve the maximum
throughput.Therefore,thecollisionprobabilitydecreaseswithN.
We now consider the impact of target collision probabil-
ity P on the total network throughput, which is derived in
Section VI-A. Recall that, in this analysis, the collision prob-
ability is not taken into account, which is shown to have
negligible errors in Proposition 2. In particular, we plot the
total network throughput versus P for M = 10 and different
values of N in Fig. 3. This figure shows that the total through-
put slightly increases with P . However, the increase is quite
Fig. 3. Total throughput versus target collision probability under the through-
put maximization design for M = 10.
Fig. 4. Total throughput versus the number of channels under the throughput
maximization design for M = 2 (Theo: Theory; Sim: Simulation; Over: Over-
lapping; Non: Nonoverlapping; Opt: Optimal assignment).
marginal as P ≥ 0.03. In fact, the required contention window
W given in (12) decreases with increasing P (as observed in
Fig. 2), which leads to decreasing the MAC protocol overhead
δ(W), as confirmed by (13), and, therefore, the increase in the
total network throughput. Moreover, the total throughput may
degrade with increasing P because of the increasing number
of collisions. Therefore, we will choose P = 0.03 to present
the following results, which would be reasonable to balance be-
tween throughput gain due to moderate MAC protocol overhead
and throughput loss due to contention collision.
B. Proposed Algorithms Versus Optimal Algorithms
We demonstrate the efficacy of the proposed algorithms by
comparing their throughput performances with those obtained
by the optimal brute-force search algorithms for small values of
M and N. Numerical results are presented for both throughput-
maximization and max–min fair objectives. In Figs. 4 and 5, we
compare the throughput of the proposed and optimal algorithms
for M = 2 and M = 3 under the throughput-maximization
objective. These figures confirm that Algorithm 2 achieves
throughput very close to the throughput attained by the optimal
solution for both values of M.
14. TAN AND LE: CHANNEL ASSIGNMENT WITH ACCESS CONTENTION RESOLUTION FOR COGNITIVE RADIO NETWORKS 2821
Fig. 5. Total throughput versus the number of channels under the throughput
maximization design for M = 3 (Theo: Theory; Sim: Simulation; Over: Over-
lapping; Non: Nonoverlapping; Opt: Optimal assignment).
Fig. 6. Minimum throughput versus the number of channels under max–min
fairness for M = 2 (Theo: Theory; Sim: Simulation; Over: Overlapping; Non:
Nonoverlapping; Opt: Optimal assignment).
In Figs. 6 and 7, we plot the throughput achieved by our
proposed algorithms and the optimal algorithm for M = 2 and
M = 3 under the max–min fair design. Again, Algorithm 4
achieves throughput very close to the optimal throughput under
this design. In addition, analytical results match the simula-
tion results very well, and nonoverlapping channel assignment
algorithms achieve noticeably lower throughput than the
throughput attained by their overlapping counterparts if the
number of channels is small. It can also be observed that
the average throughput per user under the throughput maxi-
mization design is higher than the minimum throughput that
was attained under the max–min fair design. This result is quite
expected, because the max–min fairness trades throughput for
fairness.
C. Throughput Performance of the Proposed Algorithms
We illustrate the total throughput T versus the number of
channels obtained by both Algorithms 1 and 2, where each
point is obtained by averaging the throughput over 30 differ-
ent realizations of pi,j in Fig. 8. Throughput curves due to
Algorithms 1 and 2 are indicated by “P-ware” in this figure. In
addition, for comparison, we show the throughput performance
Fig. 7. Minimum throughput versus the number of channels under max–min
fairness for M = 3 (Theo: Theory; Sim: Simulation; Over: Overlapping; Non:
Nonoverlapping; Opt: Optimal assignment).
Fig. 8. Total throughput versus the number of channels under the throughput
maximization design for M = 15 (Theo: Theory; Sim: Simulation; Over:
Overlapping; Non: Nonoverlapping; 5-Over: Five-user sharing overlapping).
achieved by the “P-blind” algorithms, which simply allocate
channels to users in a round-robin manner without exploiting
the heterogeneity of pi,j (i.e., multiuser diversity gain). For the
P-blind algorithms, we show the performance of both nonover-
lapping and overlapping channel assignment algorithms. Here,
the overlapping P-blind algorithm allows at most five users
to share one particular channel. We have observed through
numerical studies that allowing more users to share one channel
cannot achieve better throughput performance because of the
excessive MAC protocol overhead.
As shown in Fig. 8, the analytical and simulation results
achieved by both proposed algorithms match each other very
well. This result validates the accuracy of our throughput ana-
lytical model developed in Section VI-A. It also indicates that
the total throughput reaches the maximum value, which is equal
to M = 15 as the number of channels becomes sufficiently
large for both Algorithms 1 and 2. This case confirms the
result stated in Proposition 1. In addition, Algorithm 2 achieves
significantly larger throughput than Algorithm 1 for low or
moderate values of N. This performance gain comes from
the multiuser diversity gain, which arises due to the spatial
dependence of white spaces. For large N (i.e., more than
twice the number of users M), the negative impact of the
15. 2822 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 61, NO. 6, JULY 2012
Fig. 9. Throughput gain between Algorithms 2 and 1 versus the number of
channels.
Fig. 10. Throughput gain between Algorithm 2 and P-blind five-user sharing
versus the number of channels.
MAC protocol overhead prevents Algorithm 2 from performing
overlapped channel assignments. Therefore, both Algorithms 1
and 2 achieve similar throughput performance.
Fig. 8 also indicates that both proposed algorithms outper-
form their round-robin channel assignment counterparts. In par-
ticular, Algorithm 1 significantly improves the total throughput
compared to the round-robin algorithm under nonoverlapping
channel assignments. For the overlapping channel assignment
schemes, we show the throughput performance of the round-
robin assignment algorithms when five users are allowed to
share one channel (denoted as five-user sharing in the fig-
ure). Although this approach achieves larger throughput for
the round-robin algorithm, it still performs worse compared
to the proposed algorithms. Moreover, we demonstrate the
throughput gain due to Algorithm 2 compared with Algorithm 1
for different values of N and M in Fig. 9. This figure shows
that performance gains up to 5% can be achieved when the
number of channels is small or moderate. In addition, Fig. 10
presents the throughput gain due to Algorithm 2 versus the
P-blind algorithm with five-user sharing. It can be observed that
a significant throughput gain of up to 10% can be achieved for
these investigated scenarios.
Fig. 11 illustrates the throughput of Algorithms 3 and 4,
where pij are chosen in the range of [0.5, 0.9]. It can be
observed that the overlapping channel algorithm also signifi-
Fig. 11. Minimum throughput versus the number of channels under max–min
fairness for M = 5 (Theo: Theory; Sim: Simulation; Over: Overlapping; Non:
Nonoverlapping).
Fig. 12. Total throughput versus the number of channels under the throughput
maximization design for M = 5, Pij
f
∈ [0.1, 0.15], and Pij
d
= 0.9 (Theo:
Theory; Sim: Simulation; Over: Overlapping; Non: Nonoverlapping; Per: Per-
fect sensing; Imp: Imperfect sensing).
cantly improves the minimum throughput performance com-
pared to its nonoverlapping counterpart. Finally, we plot the
throughput achieved by Algorithms 1 and 2 under perfect and
imperfect spectrum sensing for M = 5 in Fig. 12, where the
detection probabilities are set as Pij
d = 0.9, whereas false-
alarm probabilities are randomly realized as Pij
f ∈ [0.1, 0.15].
This figure shows that sensing errors can significantly degrade
the throughput performance of SUs. In addition, the presented
results validate the throughput analytical model described in
Section VII-B.
IX. CONCLUSION
We have investigated the channel assignment problem for
cognitive radio networks with hardware-constrained SUs. We
have first presented the optimal brute-force search algorithm
and analyzed its complexity. Then, we have developed the
following two channel assignment algorithms for throughput
maximization: 1) the nonoverlapping overlapping channel as-
signment algorithm and 2) the overlapping channel assignment
algorithm. In addition, we have developed an analytical model
to analyze the saturation throughput that was achieved by
the overlapping channel assignment algorithm. We have also
16. TAN AND LE: CHANNEL ASSIGNMENT WITH ACCESS CONTENTION RESOLUTION FOR COGNITIVE RADIO NETWORKS 2823
presented several potential extensions, including the design of
max–min fair channel assignment algorithms and throughput
analysis, considering imperfect spectrum sensing. We have val-
idated our results through numerical studies and demonstrated
significant throughput gains of the overlapping channel assign-
ment algorithm compared with its nonoverlapping and round-
robin channel assignment counterparts in different network
settings.
REFERENCES
[1] Q. Zhao and B. M. Sadler, “A survey of dynamic spectrum access,” IEEE
Signal Process. Mag., vol. 24, no. 3, pp. 79–89, May 2007.
[2] L. B. Le and E. Hossain, “Resource allocation for spectrum underlay in
cognitive radio networks,” IEEE Trans. Wireless Commun., vol. 7, no. 12,
pp. 5306–5315, Dec. 2008.
[3] Y.-C. Liang, Y. Zeng, E. C. Y. Peh, and A. T. Hoang, “Sensing-throughput
tradeoff for cognitive radio networks,” IEEE Trans. Wireless Commun.,
vol. 7, no. 4, pp. 1326–1337, Apr. 2008.
[4] T. Yucek and H. Arslan, “A survey of spectrum sensing algorithms for
cognitive radio applications,” IEEE Commun. Surveys Tuts., vol. 11, no. 1,
pp. 116–130, 1st Quarter, 2009.
[5] J. So and N. H. Vaidya, “Multichannel MAC for ad hoc networks:
Handling multichannel hidden terminals using a single transceiver,” in
Proc. ACM MobiHoc, 2004, pp. 222–233.
[6] C. Cormio and K. R. Chowdhury, “A survey on MAC protocols for cogni-
tive radio networks,” Elsevier Ad Hoc Netw., vol. 7, no. 7, pp. 1315–1329,
Sep. 2009.
[7] L. T. Tan and L. B. Le, “Distributed MAC protocol for cognitive radio
networks: Design, analysis, and optimization,” IEEE Trans. Veh. Technol.,
vol. 60, no. 8, pp. 3990–4003, Oct. 2011.
[8] H. Kim and K. G. Shin, “Efficient discovery of spectrum opportunities
with MAC-layer sensing in cognitive radio networks,” IEEE Trans. Mo-
bile Comput., vol. 7, no. 5, pp. 533–545, May 2008.
[9] H. Su and X. Zhang, “Cross-layer-based opportunistic MAC protocols for
QoS provisionings over cognitive radio wireless networks,” IEEE J. Sel.
Areas Commun., vol. 26, no. 1, pp. 118–129, Jan. 2008.
[10] H. Su and X. Zhang, “Opportunistic MAC protocols for cognitive-radio-
based wireless networks,” in Proc. CISS, 2007, pp. 363–368.
[11] H. Nan, T.-I. Hyon, and S.-J. Yoo, “Distributed coordinated spectrum
sharing MAC protocol for cognitive radio,” in Proc. IEEE DySPAN, 2007,
pp. 240–249.
[12] L. Le and E. Hossain, “OSA-MAC: A MAC protocol for opportunistic
spectrum access in cognitive radio networks,” in Proc. IEEE WCNC,
2008, pp. 1426–1430.
[13] C. Cordeiro and K. Challapali, “C-MAC: A cognitive MAC protocol
for multichannel wireless networks,” in Proc. IEEE DySPAN, 2007,
pp. 147–157.
[14] A. C.-C. Hsu, D. S. L. Weit, and C.-C. J. Kuo, “A cognitive MAC protocol
using statistical channel allocation for wireless ad hoc networks,” in Proc.
IEEE WCNC, 2007, pp. 105–110.
[15] Y. R. Kondareddy and P. Agrawal, “Synchronized MAC protocol
for multihop cognitive radio networks,” in Proc. IEEE ICC, 2008,
pp. 3198–3202.
[16] C. Doerr, M. Neufeld, J. Fifield, T. Weingart, D. C. Sicker, and
D. Grunwald, “MultiMAC: An adaptive MAC framework for dynamic
radio networking,” in Proc. IEEE DySPAN, 2005, pp. 548–555.
[17] H. Salameh, M. M. Krunz, and O. Younis, “MAC protocol for opportunis-
tic cognitive radio networks with soft guarantees,” IEEE Trans. Mobile
Comput., vol. 8, no. 10, pp. 1339–1352, Oct. 2009.
[18] T. Shu, S. Cui, and M. Krunz, “Medium access control for multichannel
parallel transmission in cognitive radio networks,” in Proc. IEEE GLOBE-
COM, 2006, pp. 1–5.
[19] T. Chen, H. Zhang, G. M. Maggio, and I. Chlamtac, “CogMesh: A
cluster-based cognitive radio network,” in Proc. IEEE DySPAN, 2007,
pp. 168–178.
[20] J. Shi, E. Aryafar, T. Salonidis, and E. W. Knightly, “Synchronized CSMA
contention: Model, implementation and evaluation,” in Proc. IEEE INFO-
COM, 2009, pp. 2052–2060.
[21] J. Jia, Q. Zhang, and X. Shen, “HC-MAC: A hardware-constrained cog-
nitive MAC for efficient spectrum management,” IEEE J. Sel. Areas
Commun., vol. 26, no. 1, pp. 106–117, Jan. 2008.
[22] H. B. Salameh, M. Krunz, and O. Younis, “Cooperative adaptive spectrum
sharing in cognitive radio networks,” IEEE/ACM Trans. Netw., vol. 18,
no. 4, pp. 1181–1194, Aug. 2010.
[23] T. Shu and M. Krunz, “Exploiting microscopic spectrum opportunities in
cognitive radio networks via coordinated channel access,” IEEE Trans.
Mobile Comput., vol. 9, no. 11, pp. 1522–1534, Nov. 2010.
[24] W. Wang, K. G. Shin, and W. Wang, “Joint spectrum allocation and power
control for multihop cognitive radio networks,” IEEE Trans. Mobile Com-
put., vol. 10, no. 7, pp. 1042–1055, Jul. 2011.
[25] X. Zhang and H. Su, “Opportunistic spectrum sharing schemes for
CDMA-based uplink MAC in cognitive radio networks,” IEEE J. Sel.
Areas Commun., vol. 29, no. 4, pp. 716–730, Apr. 2011.
[26] Y.-J. Choi and K. G. Shin, “Opportunistic access of TV spectrum using
cognitive-radio-enabled cellular networks,” IEEE Trans. Veh. Technol.,
vol. 60, no. 8, pp. 3853–3864, Oct. 2011.
[27] X. Zhang and H. Su, “CREAM-MAC: Cognitive radio-enabled multi-
channel MAC protocol over dynamic spectrum access networks,” IEEE
J. Sel. Topics Signal Process., vol. 5, no. 1, pp. 110–123, Feb. 2011.
[28] M. Timmers, S. Pollin, A. Dejonghe, L. Van der Perre, and F. Catthoor,
“A distributed multichannel MAC protocol for multihop cognitive
radio networks,” IEEE Trans. Veh. Technol., vol. 59, no. 1, pp. 446–459,
Jan. 2010.
[29] W. Jeon, J. Han, and D. Jeong, “A novel MAC scheme for multichannel
cognitive radio ad hoc networks,” IEEE Trans. Mobile Comput., vol. 11,
no. 6, pp. 922–934, Jun. 2012.
[30] S. C. Jha, U. Phuyal, M. M. Rashid, and V. K. Bhargava, “Design of
OMC-MAC: An opportunistic multichannel MAC with QoS provisioning
for distributed cognitive radio networks,” IEEE Trans. Wireless Commun.,
vol. 10, no. 10, pp. 3414–3425, Oct. 2011.
[31] H. Su and X. Zhang, “Channel-hopping-based single-transceiver MAC for
cognitive radio networks,” in Proc. CISS, 2008, pp. 197–202.
[32] J. Mo, H. So, and J. Walrand, “Comparison of multichannel MAC proto-
cols,” IEEE Trans. Mobile Comput., vol. 7, no. 1, pp. 50–65, Jan. 2008.
[33] G. Bianchi, “Performance analysis of the IEEE 802.11 distributed coordi-
nation function,” IEEE J. Sel. Areas Commun., vol. 18, no. 3, pp. 535–547,
Mar. 2000.
[34] G. Ko, A. Franklin, S.-J. You, J.-S. Pak, M.-S. Song, and C.-J. Kim,
“Channel management in IEEE 802.22 WRAN systems,” IEEE Commun.
Mag., vol. 48, no. 9, pp. 88–94, Sep. 2010.
[35] J. Lee and S. Leyffer, Eds., “Mixed Integer Nonlinear Programming,”
in The IMA Volumes in Mathematics and Its Applications, vol. 154.
New York: Springer, 2012.
[36] L. Tassiulas and S. Sarkar, “Max–min fair scheduling in wireless ad hoc
networks,” IEEE J. Sel. Areas Commun., vol. 23, no. 1, pp. 163–173,
Jan. 2005.
[37] Wireless Local Area Networks, IEEE Std. 802.11.
Le Thanh Tan (S’11) received the B.Eng. and
M.Eng. degrees from Ho Chi Minh City Univer-
sity of Technology, Ho Chi Minh City, Vietnam, in
2002 and 2004, respectively. He is currently working
toward the Ph.D. degree with the Institut National
de la Recherche Scientifique–Énergie, Matériaux
et Télécommunications, Université du Québec,
Montréal, QC, Canada.
From 2002 to 2010, he was a Lecturer with Ho
Chi Minh City University of Technical Education.
His research activities include wireless communi-
cations and networking, cognitive radios (protocol design, spectrum sensing,
detection, and estimation), statistical signal processing, random matrix theory,
compressed sensing, and compressed sampling.
Long Bao Le (S’04–M’07) received the B.Eng. de-
gree from Ho Chi Minh City University of Tech-
nology, Ho Chi Minh City, Vietnam, in 1999, the
M.Eng. degree from the Asian Institute of Tech-
nology, Pathumthani, Thailand, in 2002, and the
Ph.D. degree from the University of Manitoba,
Winnipeg, MB, Canada, in 2007.
He was a Postdoctoral Researcher with
Massachusetts Institute of Technology, Cambridge.
He is currently an Assistant Professor with the Institut
National de la Recherche Scientifique–Énergie,
Matériaux et Télécommunications, Université du Québec, Montréal, QC,
Canada. His research interests include cognitive radio, radio resource
management for heterogeneous wireless networks, cooperative diversity,
stochastic control, and cross-layer design for communication networks.