1,172 results
Search Results
252. Robust Rate-Maximization Precoder Design for VFDM System.
- Author
-
Liu, Wenliang, Feng, Qi, Pang, Jiyong, Hu, Qiyu, Yin, Rui, and Yu, Guanding
- Subjects
FREQUENCY division multiple access ,WIRELESS communications ,ALGORITHMS ,FREQUENCY spectra - Abstract
The new radio (NR) system is recently proposed to deploy alongside the long term evolution (LTE) system to improve the wireless communication capacity. The Vandermonde-subspace frequency division multiplexing (VFDM) is an efficient technique for such a two tier network, whereby the NR transmitter can reuse the frequency spectrum of LTE system meanwhile guaranteeing interference free to LTE. In this paper, we first investigate the robust rate-maximization problem in the VFDM system. In the condition of imperfect channel state information (CSI), the precoder is optimized to satisfy both non-interference to LTE system and rate-maximization in the NR system. To tackle the challenge in solving such a non-convex problem, an iterative algorithm is proposed based on the block coordinate descent (BCD) and penalty dual decomposition (PDD) methods. Finally, simulation results demonstrate the superiority of the proposed algorithm in terms of robustness and achievable rate over the conventional SVD-based VFDM technique. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
253. Joint Beamforming Design and Receive Antenna Selection for Large-Scale MIMO Wiretap Channels.
- Author
-
Tian, Maoxin, Sun, Weize, Zhang, Peichang, Huang, Lei, and Li, Quanzhong
- Subjects
RECEIVING antennas ,BEAMFORMING ,WIRETAPPING ,ALGORITHMS ,SIGNAL processing - Abstract
This paper investigates joint secure beamforming design and receive antenna selection problem for large-scale multiple-input-multiple-output (MIMO) wiretap channels. A Branch-And-Bound (BAB) based algorithm is utilized to search the optimal receive antenna subset under both perfect and imperfect channel state information (CSI) scenarios. First, for the perfect CSI scenario, we formulate the secrecy rate optimization problem, and an equivalent monotonically decreasing objective function is established to make the problem suitable for efficient BAB search. In each search, we propose using the weighted mean squared error minimization (WMMSE) method to tackle the optimization problem. Then, we generalize the framework to the imperfect CSI case, and the robust problem is designed to maximize the worst-case secrecy rate, the problem is challenging to solve due to the channel uncertainties. A cutting-set method is devised to solve this non-convex problem by updating the worst-case secrecy rate and channel uncertainties alternately. To reduce the design complexity, we also present an antenna selection based on the alternating optimization (AO) method. The validity of the proposed antenna selection algorithms is evaluated through numerical simulations. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
254. Research on Cost-Balanced Mobile Energy Replenishment Strategy for Wireless Rechargeable Sensor Networks.
- Author
-
Sha, Chao, Sun, Yang, and Malekian, Reza
- Subjects
WIRELESS sensor networks ,ENERGY consumption ,ELECTRICITY pricing ,ALGORITHMS - Abstract
In order to maximize the utilization rate of the Mobile Wireless Chargers (MWCs) and reduce the recharging delay in large-scale Rechargeable Wireless Sensor Networks (WRSNs), a type of Cost-Balanced Mobile Energy Replenishment Strategy (CBMERS) is proposed in this paper. Firstly, nodes are assigned into groups according to their remaining lifetime, which ensures that only the ones with lower residual energy are recharged in each time slot. Then, to balance energy consumption among multiple MWCs, the moving distance as well as the power cost of the MWC are taken as constraints to get the optimal trajectory allocation scheme. Moreover, by further adjusting the amount of energy being replenished to some sensor nodes, it ensures that the MWC have enough energy to fulfill the recharging task and return back to the base station. Experiment results show that, compared with the Periodic recharging strategy and the Cluster based Multiple Charges Coordination algorithm (C-MCC), the proposed method can improve the recharging efficiency of MWCs by about 48.22% and 43.35%, and the average waiting time of nodes is also reduced by about 55.72% and 30.7%, respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
255. Antenna Optimization for Decode-and-Forward Relay in Magnetic Induction Communications.
- Author
-
Ma, Honglei, Liu, Erwu, Wang, Rui, Yin, Xuefeng, Xu, Zhibing, Qu, Xinyu, and Li, Bofeng
- Subjects
ELECTROMAGNETIC induction ,TUNNELS ,ANTENNAS (Electronics) ,GEOMETRIC modeling ,ALGORITHMS - Abstract
Magnetic Induction (MI) communication is effective in underground tunnels for emergency rescue vehicle due to the small-size antenna. It can highly benefit from a cooperative decode-and-forward (DF) relay to achieve a higher data rate. However, its channel gain is extremely position-and-orientation-selective. The unreachable space increases the complexity of the antenna deployment. To find the best antenna position and orientation (PO) of the relay achieving the higher data rate, this paper formulates the optimization problem of the relay MI antenna PO with tunnel constraints. To solve the problem more quickly, we propose to use geometric modeling to eliminate the tunnel constraints and develop a random-search algorithm achieving a fast convergence and excellent global search ability. Simulations show that the proposed algorithm can quickly converge to one optimum which signifies a noticeable improvement of data rate for vehicle MI systems with weak signals. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
256. Vision-Based Race Track SLAM Based Only on Lane Curvature.
- Author
-
Suh, Jongsang, Choi, Eric Yongkeun, and Borrelli, Francesco
- Subjects
HORSE racetracks ,CURVATURE ,KALMAN filtering ,ALGORITHMS - Abstract
This paper presents a novel approach for vision-based Simultaneous Localization and Mapping (SLAM) on a high curved track without pose-based landmarks. The proposed approach combines an Iterative Closest Points (ICP) method and Stochastic Gradient Descent (SGD) optimization and comprises four main steps. First, a Kalman filter with a simple circular lane model is used to estimate the road curvature using images from a front camera. Then, the vehicle position and orientation are reconstructed by using the yaw rate and longitudinal speed from inertial sensors. Drift and misalignment of the constructed map are corrected using ICP under the assumption that the vehicle continuously travels the same track. The final map is obtained using SGD optimization, which enforces curvature matching. We evaluate the performance of the proposed algorithm with an environment of the winding track of Hyundai-Kia California Proving Ground (CPG) located in Southern California and the customized ellipsoidal track. The experimental results show the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
257. Jointly Optimized 3D Drone Mounted Base Station Deployment and User Association in Drone Assisted Mobile Access Networks.
- Author
-
Sun, Xiang, Ansari, Nirwan, and Fierro, Rafael
- Subjects
ALGORITHMS - Abstract
In drone assisted mobile networks, a drone mounted base station (DBS) is deployed over a hotspot area to help user equipments (UEs) download their traffic from the macro base station (MBS), thus improving the throughput and spectrum efficiency (SE) of the UEs. Finding the optimal 3D position of the DBS to maximize the overall SE of the UEs in the hotspot area is challenging because the 3D DBS placement and user association problems are coupled together. In this paper, we formulate the problem of jointly optimizing the 3D DBS placement and user association to maximize the overall SE in the context of drone assisted mobile networks. The spectrum efficiency aware DBS placement and user association (STAR) algorithm is designed to decompose the original problem into two subproblems, i.e., user association and DBS placement, and to iteratively solve the two subproblems until the overall SE of the hotspot area cannot be improved further. The performance of STAR is demonstrated via extensive simulations. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
258. Efficient Hardware for Generalized Turbo Signal Recovery in Compressed Sensing.
- Author
-
Zhang, Chuan, Wang, Xinyuan, Yang, Junmei, Tan, Xiaosi, Wen, Chao-Kai, Jin, Shi, Zhang, Zaichen, and You, Xiaohu
- Subjects
COMPRESSED sensing ,DISCRETE Fourier transforms ,MATRIX multiplications ,MODULAR coordination (Architecture) ,ALGORITHMS - Abstract
Compressed sensing (CS) is becoming a hot topic in recent years for its advantages such as low-power consumption, low memory requirement, and low sampling frequency. However, high-dimensional nonlinear signals will inevitably introduce notable complexity and low efficiency in signal recovery. Generalized turbo signal recovery (G-Turbo-SR) is a cutting-edge method, which efficiently reduces complexity with a partial discrete Fourier transform (DFT) sensing matrix. However, in practical applications, G-Turbo-SR still suffers from high complexity for probability computations and matrix multiplications. This article optimizes the algorithm of G-Turbo-SR in scheduling to reduce the matrix multiplications by half. High-precision numerical approximation method is proposed to replace the complex integral calculation, which efficiently reduces the hardware cost with acceptable performance degradation. Based on the data-flow graph (DFG) analysis, detailed hardware architecture is proposed with module designs. Proper quantization scheme is selected according to the mean square error (MSE) performance. Pipelining, folding, and variable precision quantization (VPQ) scheme are employed for higher hardware efficiency. FPGA implementation on Xilinx 7k325tffg900-2 shows a higher throughput and hardware efficiency compared to existing recovery methods for CS. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
259. Resource Allocation in Green Dense Cellular Networks: Complexity and Algorithms.
- Author
-
Mlika, Zoubeir, Driouch, Elmahdi, and Ajib, Wessam
- Subjects
RESOURCE allocation ,ENERGY harvesting ,APPROXIMATION algorithms ,HEURISTIC algorithms ,ALGORITHMS - Abstract
This paper studies the problem of user association, deadline scheduling and channel allocation in dense cellular networks with energy harvesting base stations. The objective is to maximize the number of associated and scheduled users while allocating the available channels to the users and respecting the energy and deadline constraints. First, the computational complexity of this problem is characterized by studying its NP-hardness in different cases. Next, efficient algorithms are proposed in each case. The case of single channel and single base station is solved by proposing polynomial-time optimal algorithms. The case of single channel and multiple base stations is solved by proposing an efficient constant-factor approximation algorithm. The case of multiple channels is solved by proposing efficient heuristic algorithms. Our theoretical analysis are supplemented by simulation results to illustrate the performance of the proposed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
260. Coalitional Games for Computation Offloading in NOMA-Enabled Multi-Access Edge Computing.
- Author
-
Pham, Quoc-Viet, Nguyen, Hoang T., Han, Zhu, and Hwang, Won-Joo
- Subjects
COOPERATIVE game theory ,RADIO access networks ,ALGORITHMS ,ENERGY consumption ,GAMES - Abstract
Multi-access edge computing (MEC) and nonorthogonal multiple access (NOMA) are two enabling technologies in the 5 G network and beyond. MEC admits user equipments (UEs) running many more compute-intensive applications by providing computing capabilities at the network edge and within radio access networks, while NOMA enables multiple UEs to share the same resource block, thus leveraging considerable advantages such as greater spectral efficiency and a larger number of supported UEs. The state-of-the-art showed that the combination of NOMA and MEC can lower the energy consumption and/or overall latency; however, they mostly focused on single-carrier NOMA. In this paper, we investigate the computation offloading problem in multi-carrier NOMA enabled MEC systems and solve it from the cooperative game theory viewpoint using coalition formation game. Particularly, UEs are considered as game players and subcarriers are regarded as coalitions that can be used for computation offloading of multiple UEs. Based on the introduced coalition formation game, we develop a low-complexity algorithm with convergence guarantee to achieve the Nash-stable solution. Numerical results are provided to validate the effectiveness of the proposed coalition game based algorithm as well as its comparison with three baseline schemes. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
261. UAV-Assisted Cooperative Communications With Time-Sharing Information and Power Transfer.
- Author
-
Yin, Sixing, Zhao, Yifei, Li, Lihua, and Yu, F. Richard
- Subjects
WIRELESS power transmission ,KNOWLEDGE transfer ,TELECOMMUNICATION systems ,ALGORITHMS - Abstract
In this paper, we focus on a UAV-assisted cooperative communication system based on simultaneous wireless information and power transfer (SWIPT), where the UAV serves as a relay and its transmission capability is partly powered by radio signal from the source via the time-sharing mechanism. We study the end-to-end cooperative throughput maximization problem by optimizing the UAV's decision profile, power profile and trajectory for both amplify-and-forward (AF) and decode-and-forward (DF) protocols. The problem is decomposed into three optimization subproblems for decision profile, power profile and trajectory, and solved through alternating optimization, by which each of the subproblems is solved with the other two fixed. A binarization algorithm is further proposed to make the decision profile feasible. We show that the proposed solution outperforms not only two SWIPT-based strategies, but also a similar solution from an existing work without consideration for SWIPT. In addition, results indicate that the proposed algorithm performs efficiently in both optimality and convergence. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
262. LOADS: Load Optimization and Anomaly Detection Scheme for Software-Defined Networks.
- Author
-
Chaudhary, Rajat and Kumar, Neeraj
- Subjects
ANOMALY detection (Computer security) ,SOFTWARE-defined networking ,IP networks ,ACCESS control ,ALGORITHMS - Abstract
The decoupling of control functionality from the forwarding devices to the control plane in Software-Defined Networks (SDN) provides a unique platform to design a programmable and reconfigurable network. A single controller due to its limited capacity and resources may not handle heavy load traffic generated from various smart devices. In order to handle this, multiple controllers need to be deployed at the control plane so as to ensure improved efficiency and scalability of the network. The data flow by the distributed controllers fluctuates frequently which results in an uneven load distribution amongst different controllers. So, to handle the aforementioned issues, in this paper, a Load Optimization and Anomaly Detection Scheme (LOADS) is proposed. Using LOADS, the probability of switch selection is determined using the following two factors (i) distance from the switch to the controller, and (ii) resource consumption ratio of the switch to its controller. Also, an IP flow-based network anomaly detection module has been designed to classify the traffic as malicious or normal. In order to address the network anomaly, the LOADS scheme uses Access Control Policies (ACPs) on the user's behavior in the network. The proposed scheme is evaluated on Mininet emulator using POX controller with datasets of Internet Topology Zoo from BTNorthAmerica zone. The performance analysis reveals that LOADS minimizes the average execution time by 6.74% and 20.64% as compared to the existing competitive schemes, Distributed Hopping Algorithm (DHA) and Elastic Distributed Controller (ElastiCon). Also, it helps in improving the overall migration cost and response time of each controller. The proposed LOADS scheme has the migration cost of 55.1 milliseconds as compared to the ElastiCon and DHA schemes alongwith the migration cost of 110 milliseconds and 140 milliseconds respectively. In addition to the migration cost, the response time of the proposed scheme is 32.8 milliseconds as compared to DHA and ElastiCon which takes almost 90 milliseconds and 78 milliseconds respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
263. Energy-Efficient D2D Communications With Dynamic Time-Resource Allocation.
- Author
-
Lin, Shijun, Ding, Haichuan, Fang, Yuguang, and Shi, Jianghong
- Subjects
TIME management ,RESOURCE allocation ,ENERGY consumption ,INTEGER programming ,ALGORITHMS - Abstract
In this paper, we investigate resource allocation schemes for Device-to-Device (D2D) communications, which aim to minimize the energy consumption of cellular users (CUs) and D2D pairs. Different from existing works where the resource allocation is performed in the premise that the sizes of orthogonal channels/resource blocks are given, we consider the case that the time resource can be dynamically adjusted according to the rate requirements of CUs and D2D pairs during the resource allocation. We first formulate the resource allocation as a mixed integer non-linear programming (MINLP). We then demonstrate that, given the selections of CUs for D2D pairs, the formulated energy minimization problem is conditionally convex, and the convexity condition is derived accordingly. If the convexity condition is not satisfied, we propose an iterative algorithm to minimize the energy consumption. Based on these results, we further develop a random-switch-based iterative (RSBI) algorithm to find the solution to the MINLP by improving the CU-selection for D2D pairs. Simulation results show that, compared with the equipotent and proportional-fair time allocation schemes, our approach can achieve an energy saving ratio of 17%–81% under various network settings. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
264. DNN-Aided Block Sparse Bayesian Learning for User Activity Detection and Channel Estimation in Grant-Free Non-Orthogonal Random Access.
- Author
-
Zhang, Zhaoji, Li, Ying, Huang, Chongwen, Guo, Qinghua, Yuen, Chau, and Guan, Yong Liang
- Subjects
CHANNEL estimation ,MACHINE learning ,ALGORITHMS ,BAYESIAN analysis ,DATA packeting - Abstract
In the upcoming Internet-of-Things (IoT) era, the communication is often featured by massive connection, sporadic transmission, and small-sized data packets, which poses new requirements on the delay expectation and resource allocation efficiency of the Random Access (RA) mechanisms of the IoT communication stack. A grant-free non-orthogonal random access (NORA) system is considered in this paper, which could simultaneously reduce the access delay and support more Machine Type Communication (MTC) devices with limited resources. In order to address the joint user activity detection (UAD) and channel estimation (CE) problem in the grant-free NORA system, we propose a deep neural network-aided message passing-based block sparse Bayesian learning (DNN-MP-BSBL) algorithm. In the DNN-MP-BSBL algorithm, the iterative message passing process is transferred from a factor graph to a deep neural network (DNN). Weights are imposed on the messages in the DNN and trained to minimize the estimation error. It is shown that the trained weights could alleviate the convergence problem of the MP-BSBL algorithm, especially on crowded RA scenarios. Simulation results show that the proposed DNN-MP-BSBL algorithm could improve the UAD and CE accuracy with a smaller number of iterations, indicating its advantages for low-latency grant-free NORA systems. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
265. Power Allocation for Self-Coded Distributed Space-Time Codes in FD Two-Way Relaying Networks.
- Author
-
Yu, Danyang, Liu, Yi, Shen, Pan, and Zhang, Hailin
- Subjects
SPACE-time codes ,ALGORITHMS ,SIGNAL-to-noise ratio - Abstract
In this paper, a power allocation space-time coding scheme based on the self-coding property of residual loop interference (RLI) for two-way full-duplex (FD) amplify-and-forward (AF) relaying networks is proposed. The relay and direct link cooperate to forward the received signals to destination node, forming the self-coded distributed space-time code, in which the relay performs self-coding using the RLI after implementing some self-interference cancellation techniques. Then, an iterative power allocation algorithm is presented. With the proposed power allocation algorithm, both amplifying factor and transmit powers of terminal nodes are jointly optimized to maximize the smaller signal-to-interference-plus-noise ratio (SINR) of terminal nodes under a total power constraint when estimated instantaneous channel state information is available. We theoretically demonstrate the benefits of the proposed power allocation algorithm compared to equal power allocation. Simulation results show that the proposed scheme achieves significant improvement in performance compared with existing schemes for FD relaying systems and half-duplex relaying systems. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
266. Performance Optimization for D2D Communications With Opportunistic Relay and Physical-Layer Network Coding.
- Author
-
Lin, Shijun, Li, Yong, Ding, Haichuan, Fang, Yuguang, and Shi, Jianghong
- Subjects
LINEAR network coding ,INTEGER programming ,ALGORITHMS ,RAYLEIGH fading channels ,SIGNAL-to-noise ratio - Abstract
In this paper, we investigate the joint signal to interference plus noise ratio (SINR) thresholds optimization and resource allocation to maximize the sum-rate of Device-to-Device (D2D) communications while still retaining the rate requirements for active cellular users (CUs), when the inactive CUs are used as opportunistic relays under three operational modes: without using network-coding (NNC), using traditional high-layer network-coding (HNC), and using physical-layer network-coding (PNC). Under Rayleigh fading, we show that, given the selections of relays, this sum-rate maximization in no-relay scheme, NNC, HNC, and PNC opportunistic relay schemes can be formulated as a mixed integer non-linear programming (MINLP), which is NP-hard in general. To find the solution to the MINLP, we propose a two-step approach to solve the problem: 1) for each possible pairing of a D2D pair and a CU, we derive the optimal SINR thresholds to obtain the maximum transmission rate of the D2D pair while satisfying the rate requirement of the CU; 2) based on the maximum transmission rates of D2D pairs for each possible pairing in the first step, we develop a bipartite-matching method to find the optimal pairing CUs for D2D pairs. Finally, according to the solution to the MINLP, we propose an iterative relay selection algorithm to find out the relays that can further improve the sum-rate of D2D communications. Extensive simulation results demonstrate that, compared with the scenario without relaying, the NNC, HNC, and PNC opportunistic relay schemes achieve a maximum performance enhancement of 106%, 138%, and 168%, respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
267. Parallel Offloading in Green and Sustainable Mobile Edge Computing for Delay-Constrained IoT System.
- Author
-
Deng, Yiqin, Chen, Zhigang, Yao, Xin, Hassan, Shahzad, and Ibrahim, Ali. M. A.
- Subjects
MOBILE computing ,ENERGY harvesting ,ALGORITHMS ,CLEAN energy ,INTERNET of things - Abstract
Currently, the Internet of Things (IoT) solutions are playing an important role in numerous areas, especially in smart homes and buildings, health-care, vehicles, and energy. It will continue to expand in various fields in the future. However, some issues limit the further development of IoT technologies. First, the battery-powered feature increases the maintenance cost of replacing batteries for IoT devices. Second, existing Cloud-IoT frameworks are not able to cope with emerging delay-constrained applications in the IoT system due to its centralized mode of operation and the considerable communication delay. Existing studies neither satisfy the demand for the quick response in time-constraint IoT applications nor fundamentally solving the problem of energy sustainability. Therefore, this paper studies the problem of energy sustainability and timeliness in IoT system. Based on Energy Harvesting Technologies (EHT), the Green and Sustainable Mobile Edge Computing (GS-MEC) framework is proposed to make IoT devices self-powered by utilizing the green energy in the IoT environment. In this framework, we formulate the problem of minimizing response time and packet losses of tasks under the limitation of energy queue stability to improve the timeliness and reliability of task processing. Additionally, the dynamic parallel computing offloading and energy management (DPCOEM) algorithm is designed to solve the problem based on the Lyapunov optimization technology. Finally, theoretical analysis demonstrates the effectiveness of the proposed algorithm, and the numerical result of simulation shows that the average performance of the proposed algorithm is an order of magnitude better than state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
268. On-Board Deep Q-Network for UAV-Assisted Online Power Transfer and Data Collection.
- Author
-
Li, Kai, Ni, Wei, Tovar, Eduardo, and Jamalipour, Abbas
- Subjects
ACQUISITION of data ,REINFORCEMENT learning ,ALGORITHMS ,DEEP learning ,GREEDY algorithms - Abstract
Unmanned Aerial Vehicles (UAVs) with Microwave Power Transfer (MPT) capability provide a practical means to deploy a large number of wireless powered sensing devices into areas with no access to persistent power supplies. The UAV can charge the sensing devices remotely and harvest their data. A key challenge is online MPT and data collection in the presence of on-board control of a UAV (e.g., patrolling velocity) for preventing battery drainage and data queue overflow of the devices, while up-to-date knowledge on battery level and data queue of the devices is not available at the UAV. In this paper, an on-board deep Q-network is developed to minimize the overall data packet loss of the sensing devices, by optimally deciding the device to be charged and interrogated for data collection, and the instantaneous patrolling velocity of the UAV. Specifically, we formulate a Markov Decision Process (MDP) with the states of battery level and data queue length of devices, channel conditions, and waypoints given the trajectory of the UAV; and solve it optimally with Q-learning. Furthermore, we propose the on-board deep Q-network that enlarges the state space of the MDP, and a deep reinforcement learning based scheduling algorithm that asymptotically derives the optimal solution online, even when the UAV has only outdated knowledge on the MDP states. Numerical results demonstrate that our deep reinforcement learning algorithm reduces the packet loss by at least 69.2%, as compared to existing non-learning greedy algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
269. A Data-Driven Traffic Steering Algorithm for Optimizing User Experience in Multi-Tier LTE Networks.
- Author
-
Gijon, Carolina, Toril, Matias, Luna-Ramirez, Salvador, and Luisa Mari-Altozano, Maria
- Subjects
LONG-Term Evolution (Telecommunications) ,ROAMING (Telecommunication) ,ALGORITHMS ,EXPERIENCE ,HEURISTIC algorithms - Abstract
Multi-tier cellular networks are a cost-effective solution for capacity enhancement in urban scenarios. In these networks, effective mobility strategies are required to assign users to the most adequate layer. In this paper, a data-driven self-tuning algorithm for traffic steering is proposed to improve the overall Quality of Experience (QoE) in multi-carrier Long Term Evolution (LTE) networks. Traffic steering is achieved by changing Reference Signal Received Quality (RSRQ)-based inter-frequency handover margins. Unlike classical approaches considering cell-aggregated counters to drive the tuning process, the proposed algorithm relies on a novel indicator, derived from connection traces, showing the impact of handovers on user QoE. Method assessment is carried out in a dynamic system-level simulator implementing a real multi-carrier LTE scenario. Results show that the proposed algorithm significantly improves QoE figures obtained with classical load balancing techniques. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
270. A Stochastic Range Estimation Algorithm for Electric Vehicles Using Traffic Phase Classification.
- Author
-
Scheubner, Stefan, Thorgeirsson, Adam Thor, Vaillant, Moritz, and Gauterin, Frank
- Subjects
ELECTRIC vehicles ,ENERGY consumption forecasting ,DETERMINISTIC algorithms ,ALGORITHMS - Abstract
Limited range and charging infrastructure leads to range anxiety of electric vehicle drivers. Current range estimation algorithms are deemed unreliable and large safety margins are reserved to prevent the risk of stranding. Range estimation in general depends on two factors: current battery energy content and the energy consumption forecast on the route to destination. This paper aims at improving the latter by enhancing the forecast with a notion of uncertainty. The prediction algorithm itself learns from driver and traffic data in a training set to generate accurate, driver-individual energy consumption forecasts. Thereby, a central part of the algorithm is the explicit evaluation of the traffic situation by classifying the traffic phases. With the help of this methodology, individual forecasts can be made more precise since they are highly dependent on surrounding traffic. To demonstrate the validity of the algorithms, the performance is evaluated using real test drive data comprising multiple drivers. On the basis of the performance evaluation, both the superiority of stochastic algorithms over deterministic predictions and the improvement of predictive performance by evaluating explicit traffic phases can be shown. Implementing the proposed methodology in modern day electric vehicles could reduce range anxiety and ultimately increase acceptance of electric mobility worldwide. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
271. Near-Optimal Resource Allocation Algorithms for 5G+ Cellular Networks.
- Author
-
Alsheyab, Huda Yousef, Choudhury, Salimur, Bedeer, Ebrahim, and Ikki, Salama S.
- Subjects
RESOURCE allocation ,NETWORK hubs ,QUALITY of service ,ALGORITHMS ,COMPUTATIONAL complexity ,AUTHORSHIP - Abstract
Fifth-generation and beyond (5G+) systems will support novel cases, and hence, require new network architecture. In this paper, network flying platforms (NFPs) as aerial hubs are considered in future 5G+ networks to provide fronthaul connectivity to small cells (SCs). We aim to find the optimal association between the NFPs and SCs to maximize the total sum rate subject for quality of service, bandwidth, and supported number of link constraints. The formulated optimization problem is an integer linear program and the optimal association between the NFPs and SCs is found using numerical solvers at the expense of high computational complexity. We propose two algorithms (centralized and distributed) to reach a sub-optimal association at reduced complexity. Simulation results show that the performance of the proposed algorithms approaches the counterpart of its optimal solution and outperforms the state-of-the-art techniques from the literature. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
272. Radio Resource Allocation for Multicarrier Low-Density-Spreading Multiple Access.
- Author
-
Al-Imari, Mohammed, Imran, Muhammad Ali, and Xiao, Pei
- Subjects
MULTIPLE access protocols (Computer network protocols) ,BIT error rate ,ALGORITHMS ,MULTIUSER detection (Telecommunication) ,RANDOM noise theory - Abstract
Multicarrier low-density-spreading multiple access (MC-LDSMA) is a promising multiple access technique that enables near-optimal multiuser detection. In MC-LDSMA, each user's symbol is spread over a small set of subcarriers, and each subcarrier is shared by multiple users. The unique structure of MC-LDSMA makes the radio resource allocation more challenging compared with some well-known multiple access techniques. In this paper, we study the radio resource allocation for a single-cell MC-LDSMA system. First, we consider the single-user case and derive the optimal power allocation and subcarriers partitioning schemes. Then, by capitalizing on the optimal power allocation of the Gaussian multiple-access channel, we provide an optimal solution for MC-LDSMA that maximizes the users' weighted sum rate under relaxed constraints. Due to the prohibitive complexity of the optimal solution, suboptimal algorithms are proposed based on the guidelines inferred by the optimal solution. The performance of the proposed algorithms and the effect of subcarrier loading and spreading are evaluated through Monte Carlo simulations. Numerical results show that the proposed algorithms significantly outperform conventional static resource allocation, and MC-LDSMA can improve the system performance in terms of spectral efficiency and fairness in comparison with orthogonal frequency-division multiple access. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
273. Precoding for the Sparsely Spread MC-CDMA Downlink With Discrete-Alphabet Inputs.
- Author
-
Li, Min, Liu, Chunshan, and Hanly, Stephen V.
- Subjects
CODING theory ,CODE division multiple access ,SPARSE approximations ,MULTIUSER detection (Telecommunication) ,ALGORITHMS ,SYMBOL error rate ,NUMERICAL analysis - Abstract
Sparse signatures have been proposed for the code-division multiple-access (CDMA) uplink to reduce multiuser detection complexity, but they have not yet been fully exploited for its downlink counterpart. In this paper, we propose multicarrier CDMA (MC-CDMA) downlink communication whereby regular sparse signatures are deployed in the frequency domain. Taking the symbol detection point of view, we formulate a problem appropriate for the downlink with discrete alphabets as inputs. The solution to the problem provides a power-efficient precoding algorithm for the base station (BS), subject to minimum symbol error probability (SEP) requirements at the mobile stations (MSs). In the algorithm, signature sparsity is shown to be crucial for reducing precoding complexity. Numerical results confirm system-load-dependent power reduction gain from the proposed precoding over the zero-forcing (ZF) precoding and the regularized ZF (RZF) precoding with optimized regularization parameter under the same SEP targets. For a fixed system load, it is also demonstrated that sparse MC-CDMA with a proper choice of sparsity level attains almost the same power efficiency and link throughput as that of dense MC-CDMA yet with reduced precoding complexity due to the sparse signatures. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
274. Efficient Detection for MIMO Systems Based on Gradient Search.
- Author
-
Chang, Ming-Xian and Chang, Wang-Yueh
- Subjects
WIRELESS communications ,ALGORITHMS ,MIMO systems ,DETECTORS ,CONJUGATE gradient methods - Abstract
Multiple-input–multiple-output (MIMO) technology can efficiently use the spectrum to increase the communication throughput. Designing low-complexity detection algorithms with high performance for the MIMO system has been an important issue. In this paper, we propose efficient detection algorithms for MIMO systems based on differential metrics. We first define differential metrics and give their recursive calculation of different orders. Based on differential metrics, we give the principle of gradient search. We then propose a gradient search algorithm (GSA) that can provide a tradeoff between performance and complexity. The GSA applies the indicative functions such that we can determine in advance some maximum-likelihood (ML) bits of the initial sequence and reduce the searching range. The GSA also uses a stop condition with which we can stop the search if the proper condition is satisfied. The GSA does not need QR decomposition (QRD) or matrix inversion. The multiplicative operations are only necessary before the searching process, during which only the additive operations are needed. For large-scaled MIMO systems, we also give a simple searching algorithm based on differential metrics. Finally, we propose a fixed-complexity gradient algorithm (FCGA), which has a fixed number of operations during the searching process and is appropriate for pipelined hardware implementation. The simulation results validate the efficiency of the proposed algorithms. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
275. On Proportional Fairness in Power Allocation for Two-Tone Spectrum-Sharing Networks.
- Author
-
Guo, Chongtao, Liao, Bin, Huang, Lei, Zhang, Peichang, Huang, Min, and Zhang, Jihong
- Subjects
WIRELESS communications ,INTERFERENCE (Telecommunication) ,RANDOM noise theory ,SPECTRUM analysis ,ALGORITHMS - Abstract
To efficiently trade off system sum rate and link fairness, power allocation in wireless spectrum-sharing networks often concentrates upon proportional fairness. The corresponding problem has been proved to be convex for a single tone but NP-hard for more than two tones. However, in the two-tone case, the complexity of the problem for achieving proportional fairness has not been addressed yet. In this paper, we prove that the issue of proportional-fairness optimization for the two-tone situation is NP-hard by reducing the problem of finding the maximum independent set in an undirected graph to it. Moreover, a computationally efficient algorithm is proposed to provide an efficient suboptimal solution. Simulation results are presented to illustrate the effectiveness of our proposal. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
276. Game-Theoretic Precoding for SWIPT in the DF-Based MIMO Relay Networks.
- Author
-
Fang, Bing, Zhong, Wei, Jin, Shi, Qian, Zuping, and Shao, Wei
- Subjects
WIRELESS communications ,MIMO systems ,ENERGY harvesting ,NASH equilibrium ,ALGORITHMS - Abstract
In this paper, we study the distributed precoding problem for simultaneous wireless information and power transfer (SWIPT) in decode-and-forward (DF)-based multiple-input–multiple-output (MIMO) relay networks. The system model considered here consists of a source, a relay, an information decoding (ID) receiver, and an energy harvesting (EH) receiver, all mounted with multiple antennas. Since full channel state information (CSI) is usually unavailable, a practical scenario, where only local CSI is required, is considered in this paper. Such a practical scenario naturally constitutes a noncooperative game, where the source and the relay can be regarded as two rational game players. With properly designed utilities, it can be further shown that the existence and uniqueness of the pure-strategy Nash equilibrium (NE) of the proposed game can both be guaranteed under some mild conditions. Therefore, a distributed iterative precoding algorithm can be developed based on the best-response dynamic to obtain the unique NE solution for the proposed game. Moreover, a proximal-point-based regularization approach is also pursued to ensure the convergence of the proposed algorithm without requiring special restrictions on the channel ranks. Numerical simulations are also provided to demonstrate the proposed algorithm. Results show that our algorithm can converge quickly to a satisfactory solution with guaranteed convergence. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
277. Reduced-Complexity User Scheduling Algorithms for Coordinated Heterogeneous MIMO Networks.
- Author
-
Purmehdi, Hakimeh, Elliott, Robert C., and Krzymien, Witold A.
- Subjects
ALGORITHMS ,MIMO systems ,CELL phone systems ,COMPUTER simulation ,PARTICLE swarm optimization - Abstract
In this paper, the downlink of a clustered coordinated multicell multiuser multiple-input multiple-output (MIMO) system is considered, and various low-complexity user scheduling algorithms to maximize the sum rate are proposed. The users' data signals are transmitted cooperatively via the base stations (BSs) of a cluster within the sectorized multicell heterogeneous cellular network. Exhaustive search as the optimal scheduling method is extremely complex, particularly for large numbers of users requesting service. We therefore propose suboptimal scheduling algorithms based on the lower complexity metaheuristic stochastic optimization techniques of simulated annealing (SA) and particle swarm (PS). Moreover, a hybrid algorithm combining the traits of PS and a greedy scheduler is also proposed. The performance and complexity of these algorithms are evaluated for a heterogeneous system model employing different precoding methods. Assessing the algorithms' performance via computer simulations, the effectiveness of the proposed schemes in terms of sum rate is demonstrated, yielding performance very close to that of the exhaustive search at much lower complexity. For each precoding method used in the employed system model, the best corresponding approach to scheduling from our proposed algorithms is determined. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
278. GeoMobCon: A Mobility-Contact-Aware Geocast Scheme for Urban VANETs.
- Author
-
Zhang, Lei, Yu, Boyang, and Pan, Jianping
- Subjects
VEHICULAR ad hoc networks ,CELL phone systems ,ALGORITHMS ,DELAY-tolerant networks ,COMPUTER network protocols - Abstract
Geocast, which consists of delivering messages to a specific location, has become an important technique with the accelerated development of the location-based services in mobile networks. Geocast in the automotive domain is of particular interest, enabling many promising applications, such as geographic advertising, location-based traffic alerts, etc. Different from the conventional geocast algorithms focusing on the distance-based approaches, in this paper, we propose a node mobility-aware and node contact-aware geocast algorithm (GeoMobCon) for urban vehicular ad hoc networks from the delay-tolerant network perspective to better deal with the high mobility and transient connectivity issues. Different levels and aspects of vehicle mobility information and self-maintained contact information are employed, making GeoMobCon simple, scalable, and communication and computation effective. Practical issues are well considered by introducing real-world trace analysis, trace-driven simulation, and efficient buffer management. Extensive performance comparisons with other protocols have been conducted to show the advantages of GeoMobCon. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
279. A Bidirectional Boost Converter With Application to a Regenerative Suspension System.
- Author
-
Hsieh, Chen-Yu, Moallem, Mehrdad, and Golnaraghi, Farid
- Subjects
AUTOMOBILE springs & suspension ,ALGORITHMS ,ELECTRIC current rectifiers ,COMPUTER simulation ,ENERGY harvesting - Abstract
This paper proposes an algorithm to control the suspension dynamics with an energy regeneration capability and high conversion efficiency. Central to the concept is the development of a switched-mode rectifier (SMR) that is capable of providing either an equivalent positive or negative damping and alternating between regenerative and motoring modes. Simulation results are presented to demonstrate power flow in regeneration and motoring modes and verify the equivalent damping characteristic and vibration energy harvesting. The studies are conducted on a small-scale proof-of-concept electromagnetic suspension system excited by emulated International Standard Organization (ISO) 8608 road profiles. An autonomous start/stop algorithm is proposed such that autonomously turns on or off the converter. This mechanism mitigates quiescent power consumption of auxiliary integrated circuits (ICs) such as gate drivers and current transducers, therefore increasing the conversion efficiency of the power electronics throughout an ISO standardized variable-speed driving cycle. The autonomous start/stop algorithm is implemented experimentally to demonstrate its feasibility under typical standardized driving cycles. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
280. Dynamic Spectrum Leasing Under Uncertainty: Modeling, Analysis and Algorithms.
- Author
-
Shen, Siduo, Lin, Xingqin, and Lok, Tat-Ming
- Subjects
DYNAMIC spectrum access ,ALGORITHMS ,GAME theory ,STOCHASTIC approximation ,APPROXIMATION theory - Abstract
Dynamic spectrum leasing (DSL) is a promising method to improve the spectrum efficiency. A lot of work has been done about spectrum sharing issues with static models. In this paper, we want to study the behavior of the primary users (PUs) under uncertainty. For this objective, we propose a model with time-varying parameters. The model captures both technical and economic features. We study the long-term behavior of the PUs in the model with stochastic Cournot game theory and variational inequality theory. We show that the PUs can maximize their long-term utilities with a static supply of spectrum. In addition, we also propose two algorithms based on stochastic approximation theory. The convergence and performance of the algorithms are demonstrated theoretically and numerically. The proposed model and analytical framework can be used to study and predict the behaviors of PUs given a DSL system and provide design insights for the DSL system. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
281. Full-Duplex MIMO Precoding for Sum-Rate Maximization With Sequential Convex Programming.
- Author
-
Huberman, Sean and Le-Ngoc, Tho
- Subjects
MIMO systems ,CONVEX programming ,CONVEX functions ,ALGORITHMS ,CHANNEL estimation - Abstract
This paper focuses on precoding design for sum-rate maximization while considering the effects of residual self-interference for multiuser multiple-input–multiple-output (MU-MIMO) full-duplex (FD) systems. The problem formulation leads to a nonconvex matrix-variable optimization problem, where we develop two efficient sum-rate maximization algorithms using sequential convex programming (SCP), namely, the difference of convex functions (DC)-based and the sequential convex approximations for matrix-variable programming (SCAMP) algorithms. In addition, we derive the achievable sum rate under the effect of residual self-interference. Simulation results show that, even in cases of high self-interference and high estimation error, the SCAMP algorithm provides approximately 20%–30% sum-rate improvements over both conventional optimized half-duplex (HD) transmission and the existing state-of-the-art FD algorithm in a wide range of scenarios. Finally, the convergence results indicate that the DC-based algorithm tends to initially give the best performance; however, at convergence, the SCAMP algorithm tends to significantly outperform the other algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
282. Kernel Feature Template Matching for Spectrum Sensing.
- Author
-
Hou, Shujie and Qiu, Robert Caiming
- Subjects
COGNITIVE radio ,ALGORITHMS ,KERNEL functions ,RADIO frequency ,SIGNAL-to-noise ratio ,WAVELETS (Mathematics) - Abstract
Feature template matching (FTM) was proposed by Zhang and Qiu in 2011 for spectrum sensing in cognitive radio. Theoretical analysis for FTM is, however, missing in the literature. This paper will address this issue. Another new direction suggested by this paper is a nonlinear version of FTM, which is called kernel FTM (KFTM). The proposed nonlinear algorithm is performed on data mapped to a kernel space usually with higher dimension by a general nonlinear mapping. The high-dimensional data are cheaply operated with the so-called kernel trick. Furthermore, higher order statistics is considered in the proposed algorithm. Simulations using the real-world measurements of digital television (DTV) signal show that a gain of more than 4 dB can be achieved for KFTM over its linear counterpart FTM. Theoretical analysis is conducted for KFTM (that can be directly applied to FTM). For the first time, a theoretical justification is also performed for FTM. The concentration inequalities of KFTM, which are valid for arbitrary dimensions, are established as a result of concentration of measure phenomenon. The closed-form expressions of the probability distributions (under null hypothesis) are derived for both FTM and KFTM under different kernel functions. The obtained closed-form results agree with simulations. The closed-form expressions of the decision thresholds for a target false-alarm probability are obtained as well. The thresholds are noise power independent; thus, the proposed algorithm overcomes the difficulty of noise uncertainty. [ABSTRACT FROM PUBLISHER]
- Published
- 2014
- Full Text
- View/download PDF
283. Robust Model Predictive Current Control Based on Inductance and Flux Linkage Extraction Algorithm.
- Author
-
Zhang, Xiaoguang, Zhao, Zhihao, Cheng, Yu, and Wang, Yaoqiang
- Subjects
ELECTRIC inductance ,PREDICTION models ,PERMANENT magnet motors ,FLUX (Energy) ,ALGORITHMS - Abstract
Two-vector model predictive current control (MPCC), which applies two vectors in a control cycle, has better steady state performance than conventional MPCC. However, two-vector MPCC needs to select two optimal vectors, calculate two current slopes and two vector working times, which have to use the inductance and the flux linkage parameter in the permanent magnet synchronous motor (PMSM) drives. Therefore, the control performance of two-vector MPCC is more influenced by the model parameter accuracy. Aiming at reducing parameter sensitivity of the two-vector MPCC method, a robust two-vector MPCC method is proposed, which can obtain accurate inductance and flux linkage information in real time based on the presented inductance extraction algorithm and the flux linkage extraction algorithm. Moreover, the proportional-integral regulator parameters of the extraction algorithms are theoretically deduced. The experiment results of the proposed method indicate that the satisfactory control performance can be achieved under the condition of the parameter mismatches. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
284. Partial and Full Relay Selection Algorithms for AF Multi-Relay Full-Duplex Networks With Self-Energy Recycling in Non-Identically Distributed Fading Channels.
- Author
-
Nguyen, Tan N., Duy, Tran Trung, Tran, Phuong T., Voznak, Miroslav, Li, Xingwang, and Poor, H. Vincent
- Subjects
MONTE Carlo method ,DISTRIBUTED algorithms ,RANDOM variables ,ALGORITHMS ,SIGNAL-to-noise ratio ,SYMBOL error rate ,NETWORK performance - Abstract
Full-duplex communication offers enhanced spectral efficiency for relay deployment, but suffers from the inherent self-interference from the strong transmit signal coupling to the sensitive receive chain. In this article, we propose a self-energy recycling (S-ER) protocol for full-duplex multi-relay networks, in which the energy from self-interference is harvested back at the relay for future use. Furthermore, two amplify-and-forward (AF) relay selection algorithms, namely, partial relay selection (PRS) and full relay selection (FRS) are introduced to enhance the reliability of the proposed systems. For PRS, the best relay is selected based on just the knowledge of the channels from the source to all relays, while in FRS, the best relay is selected based on the end-to-end signal-to-noise ratio, which requires knowledge of all source-relay and relay-destination links. We provide a thorough analysis on the outage performance and the spectrum efficiency of the proposed algorithms in both cases: all channel gains are independently but non-identically distributed (i.n.d.) (case 1) or independently, identically distributed (i.i.d.) (case 2) Rayleigh random variables. It is shown that SER and FRS can significantly enhance the performance of FD networks and avoid the outage floor when the number of relays increases, while the outage probability (OP) in PRS case reaches an outage floor. In addition, the end-to-end signal-to-noise ratio in both cases can be minimized if an optimal power-splitting factor is selected. All analytical results are verified by Monte Carlo simulation. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
285. Multihop-Delivery-Quality-Based Routing in DTNs.
- Author
-
Liang, Mingjiong, Zhang, Zhiguo, Liu, Cong, and Chen, Li
- Subjects
DELAY-tolerant networks ,ROUTING (Computer network management) ,ALGORITHMS ,COMPUTER network architectures ,ENERGY consumption - Abstract
In delay-tolerant networks (DTNs), stable end-to-end connections do not always exist. Messages are forwarded, assisted by the mobility of nodes, in a store–carry–forward paradigm. The mobility of nodes in most DTNs has a certain statistical regularity; thus, using historical information in DTNs to compute the delivery quality of nodes can help to select good forwarding nodes. This paper aims to establish a routing scheme based on multihop delivery quality, which is designed to reduce the energy consumption of message forwarding while maintaining a high delivery rate. We characterized the multihop delivery quality of each node with an expected delay and an expected probability, parameterized by the remaining hop count. Based on these two quality metrics, we developed two algorithms, namely, the delay-inferred forwarding (DIF) algorithm and the probability-inferred forwarding (PIF) algorithm. The basic idea of DIF and PIF is to find the optimal forwarding path by minimizing the expected delay and by maximizing the expected probability, respectively, in the hop graph that is defined in this paper. We performed extensive trace-driven simulations to compare our algorithm to other representative routing algorithms using several real traces. We observed the following: 1) Compared with the delegation algorithm, which uses one-hop delivery quality, both DIF and PIF significantly improve the message delivery rate, and they yield more improvements as the mobility of nodes becomes more regular; and 2) compared with the state-of-the-art optimal opportunistic forwarding (OOF) algorithm, which also uses a multihop delivery quality, DIF and PIF have significantly smaller forwarding overhead (with the maximum reduction in the number of forwarding being over 40%), whereas they are quite close to OOF in terms of both delivery rate and average delay. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
286. DSCA: Dynamic Spectrum Co-Access Between the Primary Users and the Secondary Users.
- Author
-
Backens, Jonathan, Xin, ChunSheng, Song, Min, and Chen, Changlong
- Subjects
COGNITIVE radio ,DYNAMIC spectrum access ,WIRELESS communications ,ALGORITHMS ,NETWORK performance - Abstract
In the current architecture of dynamic spectrum access, secondary users (SUs) only opportunistically access the spectrum of primary users (PUs). The resurgence of PUs disrupts secondary communications, which can result in poor performance for SUs. In this paper, we propose a novel architecture for dynamic spectrum access, termed dynamic spectrum co-access (DSCA), to enable the PU and the SU to simultaneously access the licensed spectrum. With DSCA, SUs transparently incentivize PUs through increasing the PU performance so that SUs can access the spectrum simultaneously with PUs; hence, there is no disruption to secondary communications due to the resurgence of PUs. We derive a mathematical model to formulate the minimum incentives for the spectrum co-access between the PU and the SU and to compute the region of co-access to determine the SUs that can co-access with a given PU. An algorithm is also developed to select the co-access primary and secondary links to maximize network performance. Numerical results indicate that DSCA significantly improves performance compared with the current architecture of dynamic spectrum access. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
287. Downlink MU-MIMO With THP Combined With Pre- and Post-processing and Selection of the Processing Vectors for Maximization of Per-Stream SNR.
- Author
-
Chavali, Nanda Kishore, Kuchi, Kiran, and Reddy, V. Umapathi
- Subjects
COMPUTER simulation of signal-to-noise ratio ,TRANSMITTERS (Communication) ,QUADRATURE amplitude modulation ,MATRICES (Mathematics) ,ALGORITHMS - Abstract
In this paper, we consider a downlink multiuser multiple-input–multiple-output (MU-MIMO) system with multiple antennas at the transmitter and multiple antennas at each user, where the transmitter can send one or more data streams to each user. We propose a non-iterative method by combining Tomlinson–Harashima precoding (THP) with pre- and post-processing and selecting processing vectors based on the maximization of instantaneous signal-to-noise ratio (SNR) of the data stream at the input of the detector of each user. The postprocessing vectors for all users are found to be eigenvectors corresponding to the maximum eigenvalue of a certain matrix involving the channel matrix of the user. The transmitter computes the vectors of the linear processing matrix through an orthonormalization procedure in a single step. The feedback matrix at the transmitter is then obtained from the effective channel matrix and the linear processing matrix. We express the instantaneous SNR of all data streams in terms of eigenvalues of a Wishart matrix, obtained from the channel matrix of the user, and find the diversity order for each data stream. Considering multiple scenarios, we find the outage probability of the instantaneous SNR for all data streams and the cumulative distribution function (cdf) of the sum-rate capacity for all users using the proposed method and compare the results with those of recently proposed methods that provide a closed-form solution and with that of block diagonalization, channel inversion, and THP in scenarios where they are applicable. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
288. Approximation Algorithms for Cell Planning in Heterogeneous Networks.
- Author
-
Zhao, Wentao, Wang, Shaowei, Wang, Chonggang, and Wu, Xiaobing
- Subjects
APPROXIMATION theory ,CELLULAR neural networks (Computer science) ,HETEROGENEOUS computing ,MOBILE communication systems ,ALGORITHMS - Abstract
Small cells are introduced to cellular systems to enhance coverage and improve capacity. Densely deploying small cells can not only offload the traffic of macrocells but also provide an energy- and cost-efficient way to meet the sharp increase in traffic demands in mobile networks. However, such a cell deployment paradigm also leads to heterogeneous network (HetNet) infrastructure and raises new challenges for cell planning. In this paper, we study the cell planning issue in the HetNet. Our optimization task is to select a subset of candidate sites to deploy macro or small cells to minimize the total cost of ownership (TCO) or the energy consumption of the cellular system while satisfying practical constraints. We introduce approximation algorithms to cope with two different cell-planning cases, which are both NP-hard. First, we discuss the macrocell-only case. Our proposed algorithm achieves an approximation ratio of O(\log R) in this scenario, where R is the maximum achievable capacity of macrocells. Then, we introduce an O(\log \widetildeR)-approximation algorithm to the small-cell scenario, where \widetildeR is the maximum achievable capacity of a macrocell with small cells overlaid on it. Numerical results indicate that the HetNet can significantly reduce the TCO and the energy consumption of the cellular system. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
289. A Fast and Resource Efficient Method for Indoor Positioning Using Received Signal Strength.
- Author
-
Wu, Zheng, Jedari, Esrafil, Shuvra, Shaeera Rabbanee, Rashidzadeh, Rashid, Saif, Mehrdad, and Fu, Kechang
- Subjects
INDOOR positioning systems ,WIRELESS LAN performance ,WIRELESS Internet ,SUPPORT vector machines ,ALGORITHMS - Abstract
This paper proposes an indoor localization method using online independent support vector machine (OISVM) classification method and undersampling techniques. The system is based on the received signal strength indicator (RSSI) of Wi-Fi signals. A new undersampling algorithm is developed to address the imbalanced data problem associated with the OISVM, and a kernel function parameter selection algorithm is introduced for the training process. The time complexity of both the training process and the prediction process are significantly decreased. Comparative experimental results indicate that the training speed and the prediction speed are improved by at least ten and five times, respectively. Furthermore, through online learning, the estimation error is decreased by 0.8 m. Such an improvement makes the proposed method an ideal indoor positioning solution for portable devices for which the processing power and the memory are limited. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
290. Localization for Drifting Restricted Floating Ocean Sensor Networks.
- Author
-
Luo, Hanjiang, Wu, Kaishun, Gong, Yue-Jiao, and Ni, Lionel M.
- Subjects
WIRELESS sensor networks ,MARINE communication ,GLOBAL Positioning System ,SENSOR placement ,ALGORITHMS - Abstract
Deploying wireless sensor networks in the ocean poses many challenges due to the harsh conditions of the ocean and the nonnegligible node mobility. In this paper, we propose hybrid ocean sensor networks called drifting restricted floating ocean sensor networks (DR-OSNs) for long-term maritime surveillance monitoring tasks, which combines both the advantages of wireless sensor networks and underwater wireless acoustic sensor networks. We present a localization scheme termed localization for double-head maritime sensor networks (LDSN) for DR-OSNs, which leverages the unique characteristics of DR-OSNs to establish the whole localization system after the network is deployed from a plane or a ship, and it does not need the presence of designated anchor nodes deployed underwater. The whole localization process consists of three steps with algorithms self-moored node localization (SML), underwater sensor localization (USD), and floating-node localization algorithm (FLA). The first step is for the super group nodes to localize their underwater moored nodes via an SML algorithm by leveraging the free-drifting movement of their surface nodes. Once the moored nodes in the super group nodes have localized themselves, they turn into anchor nodes underwater. Thus, in the second step, with the help of these new anchor nodes, the unlocalized underwater moored nodes use the USD algorithm to localize their positions. In the last step, when the free-drifting floating nodes without a Global Positioning System (GPS) module need to know their instant position, they apply the FLA to figure out their position. We conduct extensive simulations to evaluate the scheme, with the results indicating that LDSN achieves high localization accuracy and is an effective localization scheme for DR-OSNs. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
291. Efficient and Scalable Distributed Autonomous Spatial Aloha Networks via Local Leader Election.
- Author
-
Lyu, Jiangbin, Wong, Wai-Choong, and Chew, Yong Huat
- Subjects
WIRELESS communications ,GAME theory ,RADIO transmitter-receivers ,RANDOM access memory ,ALGORITHMS - Abstract
This paper uses a spatial Aloha model to describe a distributed autonomous wireless network in which a group of transmit–receive pairs (users) shares a common collision channel via slotted-Aloha-like random access. The objective of this study is to develop an intelligent algorithm to be embedded into the transceivers so that all users know how to self-tune their medium access probability (MAP) to achieve overall Pareto optimality in terms of network throughput under spatial reuse while maintaining network stability. While the optimal solution requires each user to have complete information about the network, our proposed algorithm only requires users to have local information. The fundamental of our algorithm is that the users will first self-organize into a number of nonoverlapping neighborhoods, and the user with the maximum node degree in each neighborhood is elected as the local leader (LL). Each LL then adjusts its MAP according to a parameter R, which indicates the radio intensity level in its neighboring region, whereas the remaining users in the neighborhood simply follow the same MAP value. We show that by ensuring R \le \text{2} at the LLs, the stability of the entire network can be assured, even when each user only has partial network information. For practical implementation, we propose each LL to use R=\text{2}$ as the constant reference signal to its built-in proportional and integral controller. The settings of the control parameters are discussed, and we validate through simulations that the proposed method is able to achieve close-to-Pareto-front throughput. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
292. Improved Spectral Efficiency With Acceptable Service Provision in Multiuser MIMO Scenarios.
- Author
-
Lima, Francisco Rafael Marques, Maciel, Tarcisio Ferreira, Freitas, Walter Cruz, and Cavalcanti, Francisco Rodrigo Porto
- Subjects
MIMO systems ,MULTIUSER computer systems ,SPACE division multiple access ,SYSTEM failures ,INTEGER programming ,ALGORITHMS - Abstract
In this paper, we study the downlink resource assignment problem of maximizing the total data rate subject to minimum satisfaction guarantees in multiservice scenarios assuming the use of multiuser (MU) multiple-input–multiple-output (MIMO) techniques. With the use of MU MIMO techniques, the same frequency resource can be shared by different terminals at the same time by assigning different spatial channels to each terminal. Different from single-user (SU) access per frequency resource where the resource assignment problem consists of searching for the best association between frequency resources and terminals, with MU access per resource, we aim at finding which space-division multiple-access (SDMA) group should be associated with each frequency resource. The first contribution of this paper is the formal presentation of this generalized problem as an optimization problem. Then, after some mathematical manipulations, we managed to convert this problem from a nonlinear integer to an integer linear problem (ILP) that can be optimally solved by standard techniques instead of resorting to brute-force methods. Motivated by the high computational complexity of the optimal solution, we propose a low-complexity algorithm. By analyzing outage rate and total data rate performance metrics, we show that the proposed solution presents a good performance–complexity tradeoff compared with the method for obtaining the optimal solution. [ABSTRACT FROM PUBLISHER]
- Published
- 2014
- Full Text
- View/download PDF
293. Coordinated Multipoint Transmission Design for Cloud-RANs With Limited Fronthaul Capacity Constraints.
- Author
-
Ha, Vu Nguyen, Le, Long Bao, and Dao, Ngoc-Dung
- Subjects
RADIO access networks ,DATA transmission systems ,QUALITY of service ,ALGORITHMS ,CONVEX functions ,PROBLEM solving - Abstract
In this paper, we consider the coordinated multipoint (CoMP) transmission design for the downlink cloud radio access network (Cloud-RAN). Our design aims to optimize the set of remote radio heads (RRHs) serving each user and the precoding and transmission power to minimize the total transmission power while maintaining the fronthaul capacity and users' quality-of-service (QoS) constraints. The fronthaul capacity constraint involves a nonconvex and discontinuous function that renders the optimal exhaustive search method unaffordable for large networks. To address this challenge, we propose two low-complexity algorithms. The first pricing-based algorithm solves the underlying problem through iteratively tackling a related pricing problem while appropriately updating the pricing parameter. In the second iterative linear-relaxed algorithm, we directly address the fronthaul constraint function by iteratively approximating it with a suitable linear form using a conjugate function and solving the corresponding convex problem. For performance evaluation, we also compare our proposed algorithms with two existing algorithms in the literature. Finally, extensive numerical results are presented, which illustrate the convergence of our proposed algorithms and confirm that our algorithms significantly outperform the state-of-the-art existing algorithms. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
294. Virtual Resource Management in Green Cellular Networks With Shared Full-Duplex Relaying and Wireless Virtualization: A Game-Based Approach.
- Author
-
Liu, Gang, Yu, F. Richard, Ji, Hong, and Leung, Victor C. M.
- Subjects
INTERFERENCE (Telecommunication) ,COMPUTER networks ,WIRELESS communications ,VIRTUAL machine systems ,ALGORITHMS - Abstract
Recent advances in loop interference cancelation techniques enable full-duplex relaying (FDR) systems, which transmit and receive simultaneously in the same band with high spectrum efficiency. Meanwhile, wireless virtualization has attracted a lot of attention from both academia and industry because it can provide more flexibility, diversity, and other benefits in the process of wireless network design, construction, operation, and management. In this paper, we introduce the idea of wireless virtualization into FDR cellular networks. Then, the problem of energy-aware virtual resource management is formulated as a three-stage Stackelberg game. The subgame perfect equilibrium for each stage is analyzed. In addition, the interplays of the three-stage game are discussed, and an iterative algorithm is proposed to obtain the Stackelberg equilibrium solution. Simulation results are presented to show the effectiveness of the proposed scheme. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
295. Identification and Punishment Policies for Spectrum Sensing Data Falsification Attackers Using Delivery-Based Assessment.
- Author
-
Althunibat, Saud, Denise, Birabwa Joanitah, and Granelli, Fabrizio
- Subjects
WIRELESS cooperative communication ,COGNITIVE radio ,FALSIFICATION of data ,DATA security ,ENERGY consumption ,ALGORITHMS ,CYBERTERRORISM - Abstract
Spectrum sensing data falsification (SSDF) attacks represent a major challenge for cooperative spectrum sensing (CSS) in cognitive radio (CR) networks. In an SSDF attack, a malicious user or many malicious users send false sensing results to the fusion center (FC) to mislead the global decision about spectrum occupancy. Thus, an SSDF attack degrades the achievable detection accuracy, throughput, and energy efficiency of CR networks (CRNs). In this paper, a novel attacker-identification algorithm is proposed that is able to skillfully detect attackers and reject their reported results. Moreover, we provide a novel attacker-punishment algorithm that aims at punishing attackers by lowering their individual energy efficiency, motivating them either to quit sending false results or leave the network. Both algorithms are based on a novel assessment strategy of the sensing performance of each user. The proposed strategy is called delivery-based assessment, which relies on the delivery of the transmitted data to evaluate the made global decision and the individual reports. Mathematical analysis and simulation results show promising performance of both algorithms compared with previous works, particularly when then the number of attackers is very large. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
296. Analysis of Spectrum Occupancy Using Machine Learning Algorithms.
- Author
-
Azmat, Freeha, Chen, Yunfei, and Stocks, Nigel
- Subjects
COGNITIVE radio ,MACHINE learning ,SUPPORT vector machines ,ALGORITHMS ,SPECTRUM allocation - Abstract
In this paper, we analyze the spectrum occupancy in cognitive radio networks (CRNs) using different machine learning techniques. Both supervised techniques [naive Bayesian classifier (NBC), decision trees (DT), support vector machine (SVM), linear regression (LR)] and unsupervised algorithms [hidden Markov model (HMM)] are studied to find the best technique with the highest classification accuracy (CA). A detailed comparison of the supervised and unsupervised algorithms in terms of the computational time and the CA is performed. The classified occupancy status is further utilized to evaluate the blocking probability of secondary user for future time slots, which can be used by system designers to define spectrum-allocation and spectrum-sharing policies. Numerical results show that SVM is the best algorithm among all the supervised and unsupervised classifiers. Based on this, we proposed a new SVM algorithm by combining it with a firefly algorithm (FFA), which is shown to outperform all the other algorithms. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
297. Optimal Strategy Design for Enabling the Coexistence of Heterogeneous Networks in TV White Space.
- Author
-
Cacciapuoti, Angela Sara, Caleffi, Marcello, and Paura, Luigi
- Subjects
COGNITIVE radio ,INTERFERENCE (Telecommunication) ,TELECOMMUNICATION systems ,ALGORITHMS ,DATABASES - Abstract
Very recently, regulatory bodies worldwide have approved dynamic access of unlicensed networks to the TV white space (TVWS) spectrum. Hence, in the near future, multiple heterogeneous and independently operated unlicensed networks will coexist within the same geographical area over shared TVWS. Although heterogeneity and coexistence are not unique to TVWS scenarios, their distinctive characteristics pose new and challenging issues. In this paper, the problem of the coexistence interference among multiple heterogeneous and independently operated secondary networks (SNs) in the absence of secondary cooperation is addressed. Specifically, the optimal coexistence strategy, which adaptively and autonomously selects the channel maximizing the expected throughput in the presence of coexistence interference, is designed. More in detail, at first, an analytical framework is developed to model the channel selection process for an arbitrary SN as a decision process. Then, the problem of the optimal channel selection, i.e., the channel maximizing the expected throughput, is proved to be computationally prohibitive (NP-hard). Finally, under the reasonable assumption of identically distributed interference on the available channels, the optimal channel selection problem is proved not to be NP-hard, and a computationally efficient (polynomial-time) algorithm for finding the optimal strategy is designed. Numerical simulations validate the theoretical analysis. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
298. Intelligent Traffic Light Controlling Algorithms Using Vehicular Networks.
- Author
-
Bani Younes, Maram and Boukerche, Azzedine
- Subjects
TRAFFIC signs & signals ,ALGORITHMS ,VEHICULAR ad hoc networks ,TRAFFIC flow ,ONLINE algorithms - Abstract
In this paper, we propose an intelligent traffic light controlling (ITLC) algorithm. ITLC is intended to schedule the phases of each isolated traffic light efficiently. This algorithm considers the real-time traffic characteristics of the competing traffic flows at the signalized road intersection. Moreover, we have adopted the ITLC algorithm to design a traffic scheduling algorithm for an arterial street scenario; we have thus proposed an arterial traffic light (ATL) controlling algorithm. In the ATL controlling algorithm, the intelligent traffic lights installed at each road intersection coordinate with each other to generate an efficient traffic schedule for the entire road network. We report on the performance of ITLC and ATL algorithms for several scenarios using NS-2. From the experimental results, we infer that the ITLC algorithm reduces, at each isolated traffic light, the queuing delay and increases the traffic fluency by 30% compared with the online algorithm (OAF) traffic light scheduling algorithm. The latter algorithm achieved the best performance when compared with the OAF traffic light scheduling algorithm. On the other hand, the ATL controlling algorithm increases the traffic fluency of traveling vehicles at arterial street coordinations by 70% more than the random and separate traffic light scheduling system. Furthermore, compared with the previously introduced traffic scheduling ART-SYS, the ATL controlling algorithm decreases the average delay at each traffic light by 10%. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
299. Toward Accurate Device-Free Wireless Localization With a Saddle Surface Model.
- Author
-
Wang, Jie, Gao, Qinghua, Pan, Miao, Zhang, Xiao, Yu, Yan, and Wang, Hongyu
- Subjects
WIRELESS localization ,UBIQUITOUS computing ,TRAFFIC monitoring ,ALGORITHMS ,LOCATION-based services ,COMPUTER software - Abstract
Device-free wireless localization (DFL) is a technique that can locate a target by analyzing its shadowing effect on wireless links, which causes the variation of link measurements, while removing the requirement of equipping the target with a device. It can provide fundamental data for pervasive computing, smart environment, and traffic surveillance applications. The observation model, which represents the relationship between wireless link measurement and target location, is very important for DFL, since it characterizes the shadowing effect of the target on wireless links and, therefore, determines the performance of the DFL system. In this paper, inspired by measurement results, we propose a saddle surface (SaS) model to describe the shadowing effect. The SaS model characterizes the elaborate information within the spatial impact area and provides more useful observation information for the location estimation algorithm. We incorporate the SaS model into the particle filter framework for location estimation. Extensive experiments in indoor and outdoor scenarios are carried out to evaluate the performance of the proposed schemes. The tracking errors of 0.78 and 0.21 m in the given two scenarios demonstrate the better performance of the proposed SaS model compared with existing models. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
300. Two-Stage Mechanism for Massive Electric Vehicle Charging Involving Renewable Energy.
- Author
-
Wang, Ran, Wang, Ping, and Xiao, Gaoxi
- Subjects
ELECTRIC vehicles ,RENEWABLE energy sources ,ENERGY management ,DYNAMICS ,ALGORITHMS - Abstract
Integrating massive electric vehicles (EVs) into the power grid requires charging to be coordinated to reduce energy costs and the peak-to-average ratio (PAR) of the system. The coordination becomes more challenging when the highly fluctuant renewable energies constitute a significant portion of the power resources. To tackle this problem, a novel two-stage EV charging mechanism is designed in this paper, which mainly includes three parts. At the first stage, based on the prediction of future energy requests and considering the elastic charging property of EVs, an offline optimal energy generation scheduling problem is formulated and solved in a day-ahead manner to determine the energy generation in each time slot the next day. Then, at the second stage, based on the planned energy generation day-ahead, an adaptive real-time charging strategy is developed to determine the charging rate of each vehicle in a dynamic manner. Finally, we develop a charging rate compression (CRC) algorithm, which tremendously reduces the complexity of the problem solving. The fast algorithm supports real-time operations and enables the large-scale small-step scheduling more efficiently. Simulation results indicate that the proposed scheme can help effectively save energy costs and reduce the system PAR. Detailed evaluations on the impact of renewable energy uncertainties show that our proposed approach performs well in enhancing the system fault tolerance against uncertainties and the noises of real-time data. We further extend the mechanism to track a given load profile and handle the scenario where EVs only have several discrete charging rates. As a universal methodology, the proposed scheme is not restricted to any specific data traces and can be easily applied to many other cases as well. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.