• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1301-1318
• /
• 2017

In order to utilize the licensed channel of cognitive radio (CR) when the primary user (PU) is detected busy, a benefit-exchange access mode based on cooperative communication is proposed to allow secondary user (SU) to access the busy channel through giving assistance to PU's communication in exchange for some transmission bandwidth. A holistic joint optimization problem is formulated to maximize the total throughput of CR system through jointly optimizing the parameters of cooperative spectrum sensing (CSS), including the local sensing time, the pre-configured sensing decision threshold, the forward power of cooperative communication, and the bandwidth and transmission power allocated to SUs in benefit-exchange access mode and traditional access mode, respectively. To solve this complex problem, a combination of bi-level optimization, interior-point optimization and exhaustive optimization is proposed. Simulation results show that, compared with the tradition throughput maximizing model (TTMM), the proposed holistic joint optimization model (HJOM) can make use of the channel effectively even if PU is busy, and the total throughput of CR obtains a considerable improvement by HJOM.

• ETRI Journal
• /
• 제42권6호
• /
• pp.846-858
• /
• 2020

The non-orthogonal multiple access (NOMA) technique offers throughput improvement to meet the demands of the future generation of wireless communication networks. The objective of this work is to further improve the throughput by including an underlay cognitive radio network with an existing multi-carrier NOMA network, using cooperative communication. The throughput is maximized by optimal resource allocation, namely, power allocation, subcarrier assignment, relay selection, user pairing, and subcarrier pairing. Optimal power allocation to the primary and secondary users is accomplished in a way that target rate constraints of the primary users are not affected. The throughput maximization is a combinatorial optimization problem, and the computational complexity increases as the number of users and/or subcarriers in the network increases. To this end, to reduce the computational complexity, a dynamic network resource allocation algorithm is proposed for combinatorial optimization. The simulation results show that the proposed network improves the throughput.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.402-407
• /
• 2007

The network throughput is an important performance criteria for the packet ring networks. Since maximizing the network throughput can lead to severe bias in bandwidth allocation among all flows, fairness should be imposed to prevent bandwidth starvation. The challenge here, therefore, is the joint optimization of the network throughput and fairness. In this paper, we present the optimal bandwidth assignment scheme to decompose this optimization problem into two tasks, one for finding fair bandwidth assignment and the other for finding the optimal routing. The network throughput is maximized under the fairness constraints when these tasks are performed iteratively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1319-1335
• /
• 2017

This paper proposes an opportunistic reporting-based sensing-reporting-throughput optimization scheme that maximizes the spectral efficiency of secondary users (SUs) in cooperative cognitive radio networks with a soft combining rule. The performance of cooperative spectrum sensing depends on the sensing time, the reporting time of transmitting sensing results, and the fusion scheme. While longer sensing time and reporting time improve the sensing performance, this shortens the allowable data transmission time, which in turn degrades the spectral efficiency of SUs. The proposed scheme adopts an opportunistic reporting scheme to restrain the reporting overhead and it jointly controls the sensing-reporting overhead in order to increase the spectral efficiency of SUs. We show that there is a trade-off between the spectral efficiency of SUs and the overheads of cooperative spectrum sensing. The numerical results demonstrate that the proposed scheme significantly outperforms the conventional sensing-throughput optimization schemes when there are many SUs. Moreover, the numerical results show that the sensing-reporting time should be jointly optimized in order to maximize the spectral efficiency of SUs.

• Journal of information and communication convergence engineering
• /
• 제9권1호
• /
• pp.27-31
• /
• 2011

This paper describes the optimization of spectrum sensing in terms of the throughput of a cognitive radio (CR) system. Dealing with the optimization problem of spectrum sensing, this paper evaluates the throughput of a CR system by considering such situations as the penalty time of a channel search and incumbent user (IU) detection delay caused by a missed detection of an incumbent signal. Also, this paper suggests a serial channel search scheme as the search method for a vacant channel, and derives its mean channel search time by considering the penalty time due to the false alarm of a vacant channel search. The numerical results suggest the optimum sensing time of the channel search process using the derived mean channel search time of a serial channel search in the case of a sensing hardware structure with single radio frequency (RF) path. It also demonstrates that the average throughput is improved by two separate RF paths in spite of the hardware complexity of an RF receiver.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권10호
• /
• pp.5013-5034
• /
• 2019

In the Peer-to-Peer (P2P) streaming systems, peers randomly form a network overlay to share video resources with a data scheduling scheme. A data scheduling scheme can have a great impact on system performance, which should achieve two optimal objectives at the same time ideally. The two optimization objectives are to improve the perceived video quality and maximize the network throughput, respectively. Maximizing network throughput means improving the utilization of peer's upload bandwidth. However, maximizing network throughput will result in a reduction in the perceived video quality, and vice versa. Therefore, to achieve the above two objects simultaneously, we proposed a new data scheduling scheme based on multi-objective particle swarm optimization data scheduling scheme, called MOPSO-DS scheme. To design the MOPSO-DS scheme, we first formulated the data scheduling optimization problem as a multi-objective optimization problem. Then, a multi-objective particle swarm optimization algorithm is proposed by encoding the neighbors of peers as the position vector of the particles. Through extensive simulations, we demonstrated the MOPSO-DS scheme could improve the system performance effectively.

• Journal of Communications and Networks
• /
• 제12권2호
• /
• pp.150-157
• /
• 2010

Understanding and optimizing the energy consumption of wireless devices is critical to maximize the network lifetime and to provide guidelines for the design of new protocols and interfaces. In this work, we first provide an accurate analysis of the energy performance of an IEEE 802.11 WLAN, and then we derive the configuration to optimize it. We further analyze the impact of the energy configuration of the stations on the throughput performance, and we discuss under which circumstances throughput and energy efficiency can be both jointly maximized and where they constitute different challenges. Our findings are that, although an energy-optimized configuration typically yields gains in terms of throughput as compared against the default configuration, it comes with a reduction in performance as compared against the maximum-bandwidth configuration, a reduction that depends on the energy parameters of the wireless interface.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권1호
• /
• pp.216-239
• /
• 2021

The present work addresses the challenging problem of coordinating power allocation with interference management in multi-robot networks by applying the promising expansion capabilities of multiple-input multiple-output (MIMO) and full duplex systems, which achieves it for maximizing the throughput of networks under the impacts of Doppler frequency shifts and external jamming. The proposed power allocation with interference coordination formulation accounts for three types of the interference, including cross-tier, co-tier, and mixed-tier interference signals with cluster head nodes operating in different full-duplex modes, and their signal-to-noise-ratios are respectively derived under the impacts of Doppler frequency shifts and external jamming. In addition, various optimization algorithms, including two centralized iterative optimization algorithms and three decentralized optimization algorithms, are applied for solving the complex and non-convex combinatorial optimization problem associated with the power allocation and interference coordination. Simulation results demonstrate that the overall network throughput increases gradually to some degree with increasing numbers of MIMO antennas. In addition, increasing the number of clusters to a certain extent increases the overall network throughput, although internal interference becomes a severe problem for further increases in the number of clusters. Accordingly, applications of multi-robot networks require that a balance should be preserved between robot deployment density and communication capacity.

• Journal of Communications and Networks
• /
• 제18권3호
• /
• pp.502-512
• /
• 2016

The wireless carrier sense multiple access with collision detection (WCSMA/CD) and carrier sense multiple access with collision resolution (CSMA/CR) protocols are considered representative distributed collision detection protocols for fully connected dense wireless local area networks. These protocols identify collisions through additional short-sensing within a collision detection (CD) period after the start of data transmission. In this study, we analyze their throughput numerically and show that the throughput has a trade-off that accords with the length of the CD period. Consequently, we obtain the optimal length of the CD period that maximizes the throughput as a closed-form solution. Analysis and simulation results show that the throughput of distributed collision detection protocols is considerably improved when the optimal CD period is allocated according to the number of stations and the length of the transmitted packet.

• Journal of Communications and Networks
• /
• 제15권5호
• /
• pp.527-537
• /
• 2013

Improving resource utilization has been a hot issue in heterogeneous wireless networks (HWNs). This paper proposes a radio resource management (RRM) method based on access proportion optimization. By considering two or more wireless networks in overlapping regions, users in these regions must select one of the networks to access when they engage in calls. Hence, the proportion of service arrival rate that accesses each network in the overlapping region can be treated as an optimized factor for the performance analysis of HWNs. Moreover, this study considers user mobility as an important factor that affects the performance of HWNs, and it is reflected by the handoff rate. The objective of this study is to maximize the total throughput of HWNs by choosing the most appropriate factors. The total throughput of HWNs can be derived on the basis of a Markov model, which is determined by the handoff rate analysis and distribution of service arrival rate in each network. The objective problem can actually be expressed as an optimization problem. Considering the convexity of the objective function, the optimization problem can be solved using the subgradient approach. Finally, an RRM optimization scheme for HWNs is proposed. The simulation results show that the proposed scheme can effectively enhance the throughput of HWNs, i.e., improve the radio resource utilization.