60 research outputs found
On Development of Some Soft Computing Based Multiuser Detection Techniques for SDMA–OFDM Wireless Communication System
Space Division Multiple Access(SDMA) based technique as a subclass of Multiple Input Multiple Output (MIMO) systems achieves high spectral efficiency through bandwidth reuse
by multiple users. On the other hand, Orthogonal Frequency Division Multiplexing (OFDM) mitigates the impairments of the propagation channel. The combination of SDMA and
OFDM has emerged as a most competitive technology for future wireless communication system. In the SDMA uplink, multiple users communicate simultaneously with a multiple
antenna Base Station (BS) sharing the same frequency band by exploring their unique user specific-special spatial signature. Different Multiuser Detection (MUD) schemes have been proposed at the BS receiver to identify users correctly by mitigating the multiuser
interference. However, most of the classical MUDs fail to separate the users signals in the over load scenario, where the number of users exceed the number of receiving antennas. On the other hand, due to exhaustive search mechanism, the optimal Maximum Likelihood (ML)
detector is limited by high computational complexity, which increases exponentially with increasing number of simultaneous users. Hence, cost function minimization based Minimum Error Rate (MER) detectors are preferred, which basically minimize the probability of error by iteratively updating receiver’s weights using adaptive algorithms such as Steepest Descent (SD), Conjugate Gradient (CG) etc. The first part of research proposes Optimization Techniques (OTs) aided MER detectors to overcome the shortfalls of the CG based MER detectors. Popular metaheuristic
search algorithms like Adaptive Genetic Algorithm (AGA), Adaptive Differential Evolution Algorithm (ADEA) and Invasive Weed Optimization (IWO), which rely on an intelligent search of a large but finite solution space using statistical methods, have been applied for
finding the optimal weight vectors for MER MUD. Further, it is observed in an overload SDMA–OFDM system that the channel output phasor constellation often becomes linearly
non-separable. With increasing the number of users, the receiver weight optimization task turns out to be more difficult due to the exponentially increased number of dimensions of the weight matrix. As a result, MUD becomes a challenging multidimensional optimization problem. Therefore, signal classification requires a nonlinear solution. Considering this, the second part of research work suggests Artificial Neural Network (ANN) based MUDs on thestandard Multilayer Perceptron (MLP) and Radial Basis Function (RBF) frameworks fo
A Vision and Framework for the High Altitude Platform Station (HAPS) Networks of the Future
A High Altitude Platform Station (HAPS) is a network node that operates in
the stratosphere at an of altitude around 20 km and is instrumental for
providing communication services. Precipitated by technological innovations in
the areas of autonomous avionics, array antennas, solar panel efficiency
levels, and battery energy densities, and fueled by flourishing industry
ecosystems, the HAPS has emerged as an indispensable component of
next-generations of wireless networks. In this article, we provide a vision and
framework for the HAPS networks of the future supported by a comprehensive and
state-of-the-art literature review. We highlight the unrealized potential of
HAPS systems and elaborate on their unique ability to serve metropolitan areas.
The latest advancements and promising technologies in the HAPS energy and
payload systems are discussed. The integration of the emerging Reconfigurable
Smart Surface (RSS) technology in the communications payload of HAPS systems
for providing a cost-effective deployment is proposed. A detailed overview of
the radio resource management in HAPS systems is presented along with
synergistic physical layer techniques, including Faster-Than-Nyquist (FTN)
signaling. Numerous aspects of handoff management in HAPS systems are
described. The notable contributions of Artificial Intelligence (AI) in HAPS,
including machine learning in the design, topology management, handoff, and
resource allocation aspects are emphasized. The extensive overview of the
literature we provide is crucial for substantiating our vision that depicts the
expected deployment opportunities and challenges in the next 10 years
(next-generation networks), as well as in the subsequent 10 years
(next-next-generation networks).Comment: To appear in IEEE Communications Surveys & Tutorial
Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks
Future wireless networks have a substantial potential in terms of supporting
a broad range of complex compelling applications both in military and civilian
fields, where the users are able to enjoy high-rate, low-latency, low-cost and
reliable information services. Achieving this ambitious goal requires new radio
techniques for adaptive learning and intelligent decision making because of the
complex heterogeneous nature of the network structures and wireless services.
Machine learning (ML) algorithms have great success in supporting big data
analytics, efficient parameter estimation and interactive decision making.
Hence, in this article, we review the thirty-year history of ML by elaborating
on supervised learning, unsupervised learning, reinforcement learning and deep
learning. Furthermore, we investigate their employment in the compelling
applications of wireless networks, including heterogeneous networks (HetNets),
cognitive radios (CR), Internet of things (IoT), machine to machine networks
(M2M), and so on. This article aims for assisting the readers in clarifying the
motivation and methodology of the various ML algorithms, so as to invoke them
for hitherto unexplored services as well as scenarios of future wireless
networks.Comment: 46 pages, 22 fig
Energy and performance-optimized scheduling of tasks in distributed cloud and edge computing systems
Infrastructure resources in distributed cloud data centers (CDCs) are shared by heterogeneous applications in a high-performance and cost-effective way. Edge computing has emerged as a new paradigm to provide access to computing capacities in end devices. Yet it suffers from such problems as load imbalance, long scheduling time, and limited power of its edge nodes. Therefore, intelligent task scheduling in CDCs and edge nodes is critically important to construct energy-efficient cloud and edge computing systems. Current approaches cannot smartly minimize the total cost of CDCs, maximize their profit and improve quality of service (QoS) of tasks because of aperiodic arrival and heterogeneity of tasks. This dissertation proposes a class of energy and performance-optimized scheduling algorithms built on top of several intelligent optimization algorithms. This dissertation includes two parts, including background work, i.e., Chapters 3–6, and new contributions, i.e., Chapters 7–11.
1) Background work of this dissertation.
Chapter 3 proposes a spatial task scheduling and resource optimization method to minimize the total cost of CDCs where bandwidth prices of Internet service providers, power grid prices, and renewable energy all vary with locations. Chapter 4 presents a geography-aware task scheduling approach by considering spatial variations in CDCs to maximize the profit of their providers by intelligently scheduling tasks. Chapter 5 presents a spatio-temporal task scheduling algorithm to minimize energy cost by scheduling heterogeneous tasks among CDCs while meeting their delay constraints. Chapter 6 gives a temporal scheduling algorithm considering temporal variations of revenue, electricity prices, green energy and prices of public clouds.
2) Contributions of this dissertation.
Chapter 7 proposes a multi-objective optimization method for CDCs to maximize their profit, and minimize the average loss possibility of tasks by determining task allocation among Internet service providers, and task service rates of each CDC. A simulated annealing-based bi-objective differential evolution algorithm is proposed to obtain an approximate Pareto optimal set. A knee solution is selected to schedule tasks in a high-profit and high-quality-of-service way. Chapter 8 formulates a bi-objective constrained optimization problem, and designs a novel optimization method to cope with energy cost reduction and QoS improvement. It jointly minimizes both energy cost of CDCs, and average response time of all tasks by intelligently allocating tasks among CDCs and changing task service rate of each CDC. Chapter 9 formulates a constrained bi-objective optimization problem for joint optimization of revenue and energy cost of CDCs. It is solved with an improved multi-objective evolutionary algorithm based on decomposition. It determines a high-quality trade-off between revenue maximization and energy cost minimization by considering CDCs’ spatial differences in energy cost while meeting tasks’ delay constraints. Chapter 10 proposes a simulated annealing-based bees algorithm to find a close-to-optimal solution. Then, a fine-grained spatial task scheduling algorithm is designed to minimize energy cost of CDCs by allocating tasks among multiple green clouds, and specifies running speeds of their servers. Chapter 11 proposes a profit-maximized collaborative computation offloading and resource allocation algorithm to maximize the profit of systems and guarantee that response time limits of tasks are met in cloud-edge computing systems. A single-objective constrained optimization problem is solved by a proposed simulated annealing-based migrating birds optimization. This dissertation evaluates these algorithms, models and software with real-life data and proves that they improve scheduling precision and cost-effectiveness of distributed cloud and edge computing systems
Monte Carlo Method with Heuristic Adjustment for Irregularly Shaped Food Product Volume Measurement
Volume measurement plays an important role in the production and processing of food products. Various methods have been
proposed to measure the volume of food products with irregular shapes based on 3D reconstruction. However, 3D reconstruction
comes with a high-priced computational cost. Furthermore, some of the volume measurement methods based on 3D reconstruction
have a low accuracy. Another method for measuring volume of objects uses Monte Carlo method. Monte Carlo method performs
volume measurements using random points. Monte Carlo method only requires information regarding whether random points
fall inside or outside an object and does not require a 3D reconstruction. This paper proposes volume measurement using a
computer vision system for irregularly shaped food products without 3D reconstruction based on Monte Carlo method with
heuristic adjustment. Five images of food product were captured using five cameras and processed to produce binary images.
Monte Carlo integration with heuristic adjustment was performed to measure the volume based on the information extracted from
binary images. The experimental results show that the proposed method provided high accuracy and precision compared to the
water displacement method. In addition, the proposed method is more accurate and faster than the space carving method
Intelligent Approaches for Energy-Efficient Resource Allocation in the Cognitive Radio Network
The cognitive radio (CR) is evolved as the promising technology to alleviate the spectrum scarcity issues by allowing the secondary users (SUs) to use the licensed band in an opportunistic manner. Various challenges need to be addressed before the successful deployment of CR technology. This thesis work presents intelligent resource allocation techniques for improving energy efficiency (EE) of low battery powered CR nodes where resources refer to certain important parameters that directly or indirectly affect EE. As far as the primary user (PU) is concerned, the SUs are allowed to transmit on the licensed band until their transmission power would not cause any interference to the primary network. Also, the SUs must use the licensed band efficiently during the PU’s absence. Therefore, the two key factors such as protection to the primary network and throughput above the threshold are important from the PU’s and SUs’ perspective, respectively. In deployment of CR, malicious users may be more active to prevent the CR users from accessing the spectrum or cause unnecessary interference to the both primary and secondary transmission. Considering these aspects, this thesis focuses on developing novel approaches for energy-efficient resource allocation under the constraints of interference to the PR, minimum achievable data rate and maximum transmission power by optimizing the resource parameters such as sensing time and the secondary transmission power with suitably selecting SUs.
Two different domains considered in this thesis are the soft decision fusion (SDF)-based cooperative spectrum sensing CR network (CRN) models without and with the primary user emulation attack (PUEA). An efficient iterative algorithm called iterative Dinkelbach method (IDM) is proposed to maximize EE with suitable SUs in the absence of the attacker. In the proposed approaches, different constraints are evaluated considering the negative impact of the PUE attacker on the secondary transmission while maximizing EE with the PUE attacker. The optimization problem associated with the non-convex constraints is solved by our proposed iterative resource allocation algorithms (novel iterative resource allocation (NIRA) and novel adaptive resource allocation (NARA)) with suitable selection of SUs for jointly optimizing the sensing time and power allocation. In the CR enhanced vehicular ad hoc network (CR-VANET), the time varying channel responses with the vehicular movement are considered without and with the attacker. In the absence of the PUE attacker, an interference-aware power allocation scheme based on normalized least mean square (NLMS) algorithm is proposed to maximize EE considering the dynamic constraints. In the presence of the attacker, the optimization problem associated with the non-convex and time-varying constraints is solved by an efficient approach based on genetic algorithm (GA). Further, an investigation is attempted to apply the CR technology in industrial, scientific and medical (ISM) band through spectrum occupancy prediction, sub-band selection and optimal power allocation to the CR users using the real time indoor measurement data. Efficacies of the proposed approaches are verified through extensive simulation studies in the MATLAB environment and by comparing with the existing literature. Further, the impacts of different network parameters on the system performance are analyzed in detail. The proposed approaches will be highly helpful in designing energy-efficient CRN model with low complexity for future CR deployment
Recommended from our members
Fair relay selection in wireless rural networks using game theory
Access to Internet is the key to facilitate the economic growth and development of the rural communities and to bridge the digital-divide between the urban and rural population. The traditional broadband access technologies are not always suitable for the rural areas due to their difficult topography and sparsely populated communities. Specialized relay stations can be deployed to extend the coverage of a wireless rural network but they come with an inherited increase in the infrastructural cost. An alternative is to utilize the in-range users as relays to enhance the coverage range of the wireless rural network.
In this thesis, the in-range ordinary users termed as primary users (PUs) are used to act as relays for the out-of-range users called the secondary users (SUs). Two relay selection solutions, the Fair Battery Power Consumption (FBPC) algorithm and the Credit based Fair Relay Selection (CF-RS) protocol have been proposed with the aim of providing fair chance to every PU to assist the SUs, thus resulting in fair utilization of battery power of all relays along with the coverage extension. The FBPC algorithm uses the concept of proportional fairness as the relay selection criterion. However, if only proportionally fair consumption of battery power is taken as the relay selection parameter, the FBPC algorithm may result in selecting relays with poor channel conditions. The rural network may also consist of selfish PUs which need to be incentivized to use their resources for the SUs. The CF-RS protocol is developed which takes into account both the achievable data rate and consumption of battery power for selection of a relay. The CF-RS protocol is formulated using Stackelberg game which employs a credit-based incentive mechanism to motivate the self-interested PUs to help the SUs by providing instantaneous as well as long term benefit to the PUs.
A basic network model consisting of PUs and SUs has been simulated and the performance of the FBPC algorithm and the CF-RS protocol have been evaluated in terms of data rate and utility achievable at the SUs, dissipation of battery power of the PUs and Jain’s fairness index to determine fairness in utilization of battery power. The results obtained show that the FBPC algorithm achieves approximately 100% fairness for utilization of battery power of relays but compromises the data rate attainable by the SUs. Thus the FBPC algorithm shall be viewed as a trade-off between the fair battery power dissipation of relays and the data rate achievable by the SUs. Whereas, the CF-RS protocol provides 55% better utility and longer service time to the SUs without harming the attainable data rate and achieves 80% fairness. When the CF-RS protocol is used for relay selection, it is advantageous even for the self-interested users to participate in the relaying process to earn some benefit to utilize it when needed to buy assistance from other users
- …