An Adaptive Transmission Mode Selection Scheme for Cellular Underlaid D2D Communication

In this paper, we propose to use Artificial Bee Colony (ABC) optimization to solve the joint mode selection, channel assignment, and power allocation (JMSCPA) problem to maximize system throughput and spectral efficiency. JMSCPA is a problem where the allocation of channel and power depends on the mode selection. Such problems require two step solution and are called bi-level optimization problems. As bi-level optimization increases the complexity and computational time, we propose a modified version of single-level ABC algorithm aided with the adaptive transmission mode selection algorithm to allocate the cellular, reuse, and dedicated modes to the DUs along with channel and power allocation based on the network traffic load scenarios. A single variable, represented by the users (CUs and DUs) is used to allocate mode selection, and channel allocation to solve the JMSCPA problem, leading to a simpler solution with faster convergence, and significant reduction in the computational complexity which scales linearly with the number of users. Further, the proposed solution avoids premature stagnation of conventional ABC into local minima by incorporating a modification in its update procedure. The efficacy of the ABC-aided approach, as compared to the results reported in the literature, is validated by extensive numerical investigations under different simulation scenarios.

     

Evapotranspiration Modeling Using Different Tree Based Ensembled Machine Learning Algorithm

Water Resources Management - The present study investigates and evaluate the scope and potential of modern computing tools and techniques such as ensembled machine learning methods in estimating...     

Automatic early glaucoma detection by extracting parapapillary atrophy and optic disc from fundus image using SVM

Multimedia Tools and Applications - This paper presents early-automated glaucoma detection algorithm by extracting early diagnostic parameters, namely, parapapillary atrophy and Cup to Disc ratio...     

A novel binary gaining–sharing knowledge-based optimization algorithm for feature selection

Neural Computing and Applications - To obtain the optimal set of features in feature selection problems is the most challenging and prominent problem in machine learning. Very few human-related...     

PRATIT: a CNN-based emotion recognition system using histogram equalization and data augmentation

Multimedia Tools and Applications - Emotions are spontaneous feelings that are accompanied by fluctuations in facial muscles, which leads to facial expressions. Categorization of these facial...     

Hydrotreatment of jatropha oil over noble metal catalysts

Jatropha oil is a promising nonedible feedstock for producing renewable diesel. In this work, the hydrotreatment processing of jatropha oil was investigated. Instead of using conventional alumina-supported Co–Mo, Ni–Mo, and Ni–W catalysts that need sulfidation pretreatment, noble metals such as Pd and Ru were chosen. Trials were performed in an isothermal trickle-bed reactor and the reaction conditions were as follows: temperature 603–663?K, weight hourly space velocity (WHSV) 1 to 4/h, pressure 1.5–3?MPa, and H₂/oil ratio 200–800 (v/v). Yield of n-C₁₅ to n-C₁₈ hydrocarbons was maximized (70.3 and 43.8% for Pd/Al₂O₃ and Ru/Al₂O₃, respectively) at the following conditions: T?=?663 K, WHSV?=?2/h, P?=?3?MPa, and H₂/oil ratio?=?600 (v/v). Since Ru favored cracking reactions to a larger extent than Pd, the yield of C₁₅ to C₁₈ hydrocarbons over Ru/Al₂O₃ was lowered. Using simple first-order plots for oil conversion, activation energies for the hydrotreating process over Pd/Al₂O₃ and Ru/Al₂O₃ were found and they were equal to 109 and 121?kJ/mol, correspondingly.     

Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks

Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes.     

Why does it pay to be selfish in a MANET?

Routing protocols for a mobile ad hoc network have assumed that all mobile nodes voluntarily participate in forwarding others' packets. This was a reasonable assumption because all MNs in a MANET belonged to a single authority. In the near future, however, a MANET may consist of MNs that belong to many different organizations since numerous civilian applications are expected to crop up. In this situation, some MNs may run independently and purposely decide not to forward packets so as to save their own energy. This could potentially lead to network partitioning and corresponding performance degradation. To minimize such situations in MANETs, many studies have explored the use of both the carrot and the stick approaches by having reputation-based, credit-payment, and game theory schemes. This article summarizes existing schemes, identifies their relative advantages, and projects future directions     

A new finite-difference-based method for wide-angle beam propagation

A novel split-step finite-difference method for wide-angle beam propagation is presented. The formulation allows solution of the second-order scalar wave equation without having to make the slowly varying envelope and one-way propagation approximations. The method is highly accurate and numerically efficient requiring only simple matrix multiplication for propagation.