Browsing by Author "Wang, Chung-Wei"

Now showing 1 - 14 of 14

A concurrent transmission MAC protocol for enhancing throughout and avoiding spectrum sensing in cognitive radio
(2007)
Wang, Li-Chun
;
Wang, Chung-Wei
;
Lu, Yin-Chih
;
Liu, Chuan-Ming
;
交大名義發表
For the cognitive radio (CR) network, a fundamental issue is how to identify the spectrum opportunities. First, each CR node determines whether there exists transmission opportunities on unlicensed bands. If not, this node will find other opportunity on licensed bands. Thus, increasing the opportunities of concurrent transmissions in unlicensed bands can reduce the overhead of wide-band sensing. In this paper, based on the carrier sensing multiple access protocol, we propose a novel concurrent transmissions MAC (CT-MAC) protocol to identify the possibility of establishing the second link in the presence of the first link in the unlicensed band. In addition to reducing the overhead of wide-band sensing, the proposed CT-MAC scheme can enhance overall throughput and is backward compatible with the IEEE 802.11 standard.
A QUEUEING-THEORETICAL FRAMEWORK FOR QOS-ENHANCED SPECTRUM MANAGEMENT IN COGNITIVE RADIO NETWORKS
(2011-12-01)
Wang, Li-Chun
;
Wang, Chung-Wei
;
Feng, Kai-Ten
;
電機工程學系
;
電信工程研究所
This article outlines the fundamental modeling issues of opportunistic spectrum access in cognitive radio networks. In particular, we identify the effects of connection-based channel usage on the QoS performance of spectrum management techniques. During the transmission period of a secondary user's connection, the phenomenon of multiple spectrum handoffs due to interruptions of primary users arises quite often. In addition to multiple interruptions, the connection-based channel usage behaviors are also affected by spectrum sensing time, switching between different channels, generally distributed service time, and channel contention between multiple secondary users. An analytical framework based on the preemptive resumption priority M/G/1 queueing theory is introduced to characterize the effects of the above factors simultaneously. The proposed generalized analytical framework can incorporate various system parameters into the design of very broad spectrum management techniques, including spectrum sensing, spectrum decision, spectrum sharing, and spectrum mobility. The applications of this analytical framework on spectrum decision as well as spectrum mobility are discussed, and some open issues using this framework are suggested in this article.
Analysis of Reactive Spectrum Handoff in Cognitive Radio Networks
(2012-11-01)
Wang, Chung-Wei
;
Wang, Li-Chun
;
電機工程學系
;
電信工程研究所
;
Department of Electrical and Computer Engineering
In this paper, we present an analytical framework to evaluate the effects of multiple spectrum handoffs on channel utilization and latency performances in cognitive radio (CR) networks. During the transmission period of a secondary connection, multiple interruptions from the primary users result in multiple spectrum handoffs. In order to decide the target channel for each spectrum handoff and resume the unfinished transmission, wideband sensing is performed in an on-demand reactive manner. Although spectrum handoff procedure can enhance channel utilization, transmission latency of the secondary users is prolonged due to multiple handoffs. Thus, two fundamental issues in CR networks with multiple spectrum handoffs arise: (1) to what extent the channel utilization can be improved; and (2) how long the transmission latency will be extended for the secondary users. To solve the first problem, we introduce the preemptive resume priority (PRP) M/G/1 queueing network to characterize the channel usage behaviors of CR networks. Based on this queueing network, channel utilization under various traffic arrival rates and service time distributions can be evaluated. Furthermore, on top of the proposed queueing network, a state diagram is developed to characterize the effects of multiple handoff delay on the transmission latency of the secondary users. The analytical results can provide a helpful insight to study the effects of traffic arrival rates and service time on channel utilization and transmission latency and then facilitate the designs of admission control rules for the secondary users subject to their performance requirements.
Apparatus And Method For Neighbor-Aware Concurrent Transmission Media Access Control Protocol
(2011-02-17)
Wang, Li-Chun
;
Wang, Chung-Wei
An apparatus and method for neighbor-aware concurrent transmission media access control (MAC) protocol is provided, which determines whether a plurality of communication connections may be established concurrently in a wireless network, where each node in the network obtains the topology information of its multi-hop neighbors via a neighbor discover module. A cross-layer observation module integrates the physical and virtual carrier sensing, observes the address field of a control frame of a MAC layer in the wireless network, and compares the address field information of the control frame against the topology information obtained by the neighbor discover module to determine whether a plurality of connections may be established for concurrent transmission.
Latency analysis for dynamic spectrum access in cognitive radio: Dedicated or embedded control channel?
(2007)
Wang, Li-Chun
;
Lu, Yin-Chih
;
Wang, Chung-Wei
;
Wei, David S. L.
;
交大名義發表
Dynamic spectrum access (DSA) is the key feature of cognitive radio (CR) networks, but it also poses many new challenges on the medium access control (MAC) design. One of key challenges is the fact that the secondary CR users can only borrow the licensed spectrum from the primary users for a short period of time. Hence, unlike many available multi-channel MAC protocols for ad hoc networks where throughput is the main performance issue, the DSA protocols in CR networks shall place more emphases on the access latency. Hence, one fundamental issue arises: how can the spectrum be dimensioned for control channels in order to minimize the access delay of DSA protocol in CR networks? In this paper, we provide a comparative study in an analytical manner on the latency performance of two DSA protocols: 1) dedicated control channel, and 2) embedded dedicated control channel approaches. Our results show that an optimal ratio of the control channel bandwidth over the total channel bandwidth can be found to minimize the latency of DSA with dedicated control channels. However, the delay performance of DSA with dedicated control channels is more sensitive to the variations of the data lengths than that of DSA with embedded control channels. Hence, we conclude that the way of dimensioning the spectrum for control frames for DSA in CR networks should be adaptive to the variations of the traffic characteristics and the number of users.
Load-Balancing Spectrum Decision for Cognitive Radio Networks
(2011-04-01)
Wang, Li-Chun
;
Wang, Chung-Wei
;
Adachi, Fumiyuki
;
電機工程學系
;
電信工程研究所
In this paper, we present an analytical framework to design system parameters for load-balancing multiuser spectrum decision schemes in cognitive radio (CR) networks. Unlike the non-load-balancing methods that multiple secondary users may contend for the same channel, the considered load-balancing schemes can distribute the traffic loads of secondary users to multiple channels. Based on the preemptive resume priority (PRP) M/G/1 queueing theory, a spectrum decision analytical model is proposed to evaluate the effects of multiple interruptions from the primary user during each link connection, the sensing errors (i.e., missed detection and false alarm) of the secondary users, and the heterogeneous channel capacity. With the objective of minimizing the overall system time of the secondary users, we derive the optimal number of candidate channels and the optimal channel selection probability for the sensing-based and the probability-based spectrum decision schemes, respectively. We find that the probability-based scheme can yield a shorter overall system time compared to the sensing-based scheme when the traffic loads of the secondary users is light, whereas the sensing-based scheme performs better in the condition of heavy traffic loads. If the secondary users can intelligently adopt the best spectrum decision scheme according to sensing time and traffic conditions, the overall system time can be improved by 50% compared to the existing methods.
Modeling and Analysis for Proactive-decision Spectrum Handoff in Cognitive Radio Networks
(2009)
Wang, Chung-Wei
;
Wang, Li-Chun
;
交大名義發表
;
National Chiao Tung University
Spectrum handoff occurs when the primary users appear in the licensed band occupied by the secondary users. Spectrum handoff procedures aim to help the secondary users to vacate the occupied licensed spectrum and find suitable target channel to resume the unfinished transmission. In this paper, we discuss how to select the target channels to minimize the total service time with multiple spectrum handoffs. We propose a preemptive resume priority (PRP) M/G/1 queueing network model to evaluate total service time for various target channels selections. Then, we suggest a low-complexity greedy algorithm to select target channels. Numerical results show that a spectrum handoff scheme based on greedy selection strategy can reduce total service time compared to the randomly selection scheme.
Modeling and Analysis for Reactive-decision Spectrum Handoff in Cognitive Radio Networks
(2010)
Wang, Chung-Wei
;
Wang, Li-Chun
;
Adachi, Fumiyuki
;
電信工程研究所
;
Institute of Communications Engineering
This paper investigates how to characterize the effect of multiple spectrum handoff delay on the extended data delivery time of the secondary users' connections in cognitive radio (CR) networks. Whenever a primary user appears, the spectrum handoff procedures are initiated for the interrupted secondary users. Through spectrum sensing, the secondary user can reactively decide the target channel for spectrum handoff to resume its unfinished transmission. Clearly, many interruptions from the primary users will result in multiple handoffs, thereby increase the extended data delivery time of a secondary connection. In this paper, we develop a Markov transition model integrating with the preemptive resume priority (PRP) M/G/1 queueing network to characterize the multiple handoff delay, resulting from the sensing time, the handshaking time, the channel switching time, and the waiting time. The analytical results can facilitate the designs of admission control rules for the secondary users subject to their latency requirements and provide a framework to determine whether the spectrum sensing technology can effectively shorten the extended data delivery time under various traffic arrival rates and service time as well as sensing time(1).
Modeling and Analysis for Spectrum Handoffs in Cognitive Radio Networks
(2012-09-01)
Wang, Li-Chun
;
Wang, Chung-Wei
;
Chang, Chung-Ju
;
電機學院
;
電機工程學系
"In this paper, we present an analytical framework to evaluate the latency performance of connection-based spectrum handoffs in cognitive radio (CR) networks. During the transmission period of a secondary connection, multiple interruptions from the primary users result in multiple spectrum handoffs and the need of predetermining a set of target channels for spectrum handoffs. To quantify the effects of channel obsolete issue on the target channel predetermination, we should consider the three key design features: 1) general service time distribution of the primary and secondary connections; 2) different operating channels in multiple handoffs; and 3) queuing delay due to channel contention from multiple secondary connections. To this end, we propose the preemptive resume priority (PRP) M/G/1 queuing network model to characterize the spectrum usage behaviors with all the three design features. This model aims to analyze the extended data delivery time of the secondary connections with proactively designed target channel sequences under various traffic arrival rates and service time distributions. These analytical results are applied to evaluate the latency performance of the connection-based spectrum handoff based on the target channel sequences mentioned in the IEEE 802.22 wireless regional area networks standard. Then, to reduce the extended data delivery time, a traffic-adaptive spectrum handoff is proposed, which changes the target channel sequence of spectrum handoffs based on traffic conditions. Compared to the existing target channel selection methods, this traffic-adaptive target channel selection approach can reduce the extended data transmission time by 35 percent, especially for the heavy traffic loads of the primary users."
Modeling and Analysis of Multi-User Spectrum Selection Schemes in Cognitive Radio Networks
(2009)
Wang, Chung-Wei
;
Wang, Li-Chun
;
Adachi, Fumiyuki
;
電信工程研究所
;
Institute of Communications Engineering
In this paper, we study the spectrum selection problem in cognitive radio network with emphasis on resolving the channel contention and the spectrum sharing issues of multiple secondary users. For the traditional channel selection methods, the secondary users select their operating channels based on various criteria. However, these methods neglect the effect that multiple secondary users may content for the same channel if they have the same consensus on one particular good channel. Compared to the existing spectrum selection methods, we consider the sensing-based and the probability-based spectrum selection schemes which can prevent too many secondary users from contending the same channel. An analytical model integrated with the preemptive resume priority M/G/1 queuing network theory is developed to evaluate the overall transmission time of the both schemes. Based on this model, we discuss how to find the optimal selection probability for the probability-based scheme. Furthermore, we also analyze in which condition dependent of sensing time and traffic parameters that the sensing-or the probability-based scheme should be used. Based on the analytical results, we provide a principle to guide system operators which scheme should be used in CR networks. Then, we conclude that channel selection scheme should be adaptive to the variations of the traffic characteristics.
Optimal Number of Clusters in Dense Wireless Sensor Networks: A Cross-Layer Approach
(2009-02-01)
Wang, Li-Chun
;
Wang, Chung-Wei
;
Liu, Chuan-Ming
;
電信工程研究所
;
Institute of Communications Engineering
Cluster-based sensor networks have the advantages of reducing energy consumption and link-maintenance cost. One fundamental issue in cluster-based sensor networks is determining the optimal number of clusters. In this paper, we suggest a physical (PRY)/medium access control (MAC)/network (NET) cross-layer analytical approach for determining the optimal number of clusters, with the objective of minimizing energy consumption in a high-density sensor network. Our cross-layer design can incorporate many effects, including lognormal shadowing and a two-slope path loss model in the PRY layer, various MAC scheduling, and multihop routing schemes. Compared with the base-line case with one cluster per observation area (OA), a sensor network with the proposed optimal number of clusters can reduce the energy consumption by more than 80% in some cases. We also verify by simulations that the analytical optimal cluster number can still effectively function, regardless of the different densities of sensors in various OAs.
Optimal Target Channel Sequence Design for Multiple Spectrum Handoffs in Cognitive Radio Networks
(2012-09-01)
Wang, Li-Chun
;
Wang, Chung-Wei
;
Chang, Chung-Ju
;
電機工程學系
;
Department of Electrical and Computer Engineering
In this paper, we investigate how to determine an optimal target channel sequence with the minimum cumulative handoff delay in cognitive radio networks. When the secondary user encounters multiple spectrum handoffs during its transmission period, the effects of multiple interruptions from the high-priority primary users and the traffic statistics of both the primary and the secondary users should be incorporated in the design of the optimal target sequence. The optimal target channel sequence can guild the secondary user to change its operating channel when the primary user's interruptions occur. With M candidate channels and L elements in the target channel sequence for spectrum handoffs, the exhaustive search (ES) requires time complexity of O(M-L). In this paper, we propose a dynamic programming (DP) algorithm with time complexity of O(LM2) to determine an optimal target channel sequence. Furthermore, we propose a greedy algorithm with time complexity of O(M) and prove that the greedy algorithm only requires comparing six target channel sequences. Numerical results show that the low-complexity greedy algorithm can yield similar cumulative handoff delay performance as the optimal DP-based or ES-based algorithms in most cases except when the primary users' service time distributions at their operating channels are different.
Spectrum Decision for Cognitive Radio Networks With Various-Bandwidth Channels
(2016)
Talat, Samer T.
;
Wang, Chung-Wei
;
Wang, Li-Chun
;
電機工程學系
;
Department of Electrical and Computer Engineering
Cognitive radio (CR) systems can enhance the licensed spectrum efficiency by finding and allocating the under-utilized channels of the primary users to the secondary users. After scanning a wide range of spectrum. A general CR system needs to utilize all the available channels of various bandwidths. Whenever the active primary users appear, the secondary users shall return the borrowed channels, causing interruption even during a transmission period. The behavior of changing the operating channels is called hopping mode in this paper. In this paper we propose an improved preemptive resume priority (PRP) M/G/1 queueing network model for such a general CR system, aiming to characterize the impacts of hopping-mode behaviors and various bandwidth on the delay performance of the secondary users. We further propose a probability-based various-bandwidth channel selection scheme to reduce the overall system time for the hopping-mode secondary users with multiple interruptions, where the overall system time is defined as the sum of transmission time and waiting time. Our analytical results, validated by simulations, show that the proposed probability-based various-bandwidth channel selection scheme can improve the overall system time by 20% compared to the existing methods.
Spectrum Handoff for Cognitive Radio Networks: Reactive-Sensing or Proactive-Sensing?
(2008)
Wang, Li-Chun
;
Wang, Chung-Wei
;
交大名義發表
;
National Chiao Tung University
In this paper, we will investigate the spectrum handoff schemes for the cognitive radio networks. Spectrum handoff occurs when the primary users appear and the secondary users are using this particular primary user's licensed channel. We compare two major types of spectrum handoff schemes. One is the reactive-sensing spectrum handoff, where the target channel for spectrum handoff is selected or sensed only after the spectrum handoff request is made. The other one is the proactive-sensing spectrum handoff, for which the target channel is predetermined. The advantage of the reactive spectrum handoff is the accuracy of the selected target channel, but pay the cost of sensing time. By contrast, the proactive spectrum handoff avoid the sensing time, but the pre-determined target channel may not be available. We will provide a preemptive resume priority M/G/1 queueing network model to analyze in which condition that the reactive- or proactive-sensing spectrum handoff should be used dependent of sensing time.