The gaining sharing knowledge based optimization algorithm (GSK) is recently developed metaheuristic algorithm, which is based on how humans acquire and share knowledge during their life-time. This paper investigates a modified version of the GSK algorithm to find the best feature subsets. Firstly, it represents a binary variant of GSK algorithm by employing a probability estimation operator (Bi-GSK) on the two main pillars of GSK algorithm. And then, the chaotic maps are used to enhance the performance of the proposed algorithm. Ten different types of chaotic maps are considered to adapt the

Current methods for building radio maps for wireless localization systems require a tedious, manual and error-prone calibration of the area of interest. Each time the layout of the environment is changed or different hardware is used, the whole process of location fingerprinting and constructing the radio map has to be repeated. The process gets more complicated in the case of localizing multiple entities in a device-free scenario, since the radio map needs to take all possible combinations of the location of the entities into account. In this demo, we present a novel system (AROMA) that is

In cognitive radio (CR) networks, determining the optimal transmission power for the secondary users (SU) is crucial to achieving the goal of maximizing the secondary throughput while protecting the primary users (PU) from service disruption and interference. In this paper, we propose an adaptive transmission power scheme for cognitive terminals opportunistically accessing a primary channel. The PU operates over the channel in an unslotted manner switching activity at random times. The secondary transmitter (STx) adapts its transmission power according to its belief regarding the PU's state of

Recently, emerging vehicular applications are increasing the demand of vehicles which form significant burdens on network backhaul and represents a cause to the quality of experience (QoE) decay of the vehicular users. Proactive caching is a promising technique to mitigate the load on core networks by caching some of the expected data items. This work proposes a hierarchical proactive caching scheme which jointly considers caching in vehicles and roadside units (RSUs). Minimization of the vehicle communication latency is the main objective of our study. The optimization problem is formulated

In this paper, we introduce a novel geographic routing with cooperation scheme for 5G Device-to-Device ad hoc networks. The prime focus of our scheme (coined Cooperative Routing for Reliable Paths (CRRP)) is to enhance the routing performance in cooperative communication networks in terms of the path length and reliability. In particular, it introduces novel algorithms for cooperative relay and forwarder selections, which strike the best balance between path length and achieved symbol error rate, compared to prior work in the literature. Moreover, it exhibits the flexibility of deciding

We consider a secondary user with energy harvesting capability. We design access schemes for the secondary user which incorporate random spectrum sensing and random access, and which make use of the primary automatic repeat request (ARQ) feedback. The sensing and access probabilities are obtained such that the secondary throughput is maximized under the constraints that both the primary and secondary queues are stable and that the primary queueing delay is kept lower than a specified value needed to guarantee a certain quality of service (QoS) for the primary user. We consider spectrum sensing

We consider a cognitive radio scenario with an energy harvesting secondary user (SU) attempting to access a primary channel randomly. We assume multipacket reception (MPR) capability and investigate a system in which the SU may or may not exploit the primary feedback messages. The access probabilities are obtained to maximize the secondary throughput under the constraints of primary queue stability and such that the primary queueing delay is kept below a specified value in order to guarantee a certain quality of service (QoS) for the primary user (PU). We investigate the impact of the energy

In this paper, we completely characterize the deterministic capacity region of a four-node relay network with no direct links between the nodes, where each node communicates with the three other nodes via a relay. Towards this end, we develop an upper bound on the deterministic capacity region, based on the notion of a one-sided genie. To establish achievability, we use the detour schemes that achieve the upper bound by routing specific bits via indirect paths instead of sending them directly. © 2013 IEEE.

Sensor Actor NETworks (SANET) represent a major component of ubiquitous service environments promising interesting solutions to a wide range of problems. Despite the obvious increase in the research activities proposing architectures and protocols for SANETs, we are still no where near the production of industrial-grade SANET software that can be relied upon for mission critical applications. The cost of programming, deploying and maintaining SANET environments is still highly prohibitive due to the lack of industrial tools capable of realizing adaptive SANET software in a cost effective way

We consider a class of wireless powered devices employing hybrid automatic repeat request to ensure reliable end-to-end communications over a two-state time-varying channel. A receiver, with no power source, relies on the energy transferred by a simultaneous wireless information and power transfer enabled transmitter to receive and decode information. Under the two-state channel model, information is received at two different rates while it is only possible to harvest energy in one of the states. The receiver aims to decode its messages with minimum expected number of re-transmissions. Dynamic