Schedule-Based Cooperative Multi-agent Reinforcement Learning for Multi-channel Communication in Wireless Sensor Networks

Wireless sensor networks (WSNs) have become an important component in the Internet of things (IoT) field. In WSNs, multi-channel protocols have been developed to overcome some limitations related to the throughput and delivery rate which have become necessary for many IoT applications that require sufficient bandwidth to transmit a large amount of data. However, the requirement of frequent negotiation for channel assignment in distributed multi-channel protocols incurs an extra-large communication overhead which results in a reduction of the network lifetime. To deal with this requirement in an energy-efficient way is a challenging task. Hence, the Reinforcement Learning (RL) approach for channel assignment is used to overcome this problem. Nevertheless, the use of the RL approach requires a number of iterations to obtain the best solution which in turn creates a communication overhead and time-wasting. In this paper, a Self-schedule based Cooperative multi-agent Reinforcement Learning for Channel Assignment (SCRL CA) approach is proposed to improve the network lifetime and performance. The proposal addresses both regular traffic scheduling and assignment of the available orthogonal channels in an energy-efficient way. We solve the cooperation between the RL agents problem by using the self-schedule method to accelerate the RL iterations, reduce the communication overhead and balance the energy consumption in the route selection process. Therefore, two algorithms are proposed, the first one is for the Static channel assignment (SSCRL CA) while the second one is for the Dynamic channel assignment (DSCRL CA). The results of extensive simulation experiments show the effectiveness of our approach in improving the network lifetime and performance through the two algorithms.

     

A process-tolerant out-of-band blocker rejection technique for SAW-less receivers

In this paper, an active filtering technique is presented which is capable of filtering the out-of-band blockers in wireless receivers. The concept is based on the feedforward cancellation technique where a blocker replica is subtracted at the output of the low-noise amplifier (LNA). In contrast to the previously reported feedforward cancellation methods, exact gain and phase matching are easily obtained in the proposed architecture to produce a highly selective narrowband frequency response at the output of the LNA with wide rejection bandwidth. For the proof of concept, the system is implemented in a 65 nm CMOS technology. It occupies a total area of 0.8 mm² and the current consumption is 24 mA from a 1.2 V supply. The system post-layout simulations showed a blocker rejection of more than 33 dB for blocker signals 100 MHz away from the desired signal when the feedforward path is activated. The noise figure (NF) of the entire system is 3.8 dB that degrades to 5.8 dB when the feedforward path is activated.     

Adaptive modulation and decision feedback equalization for frequency‐selective MIMO channels

In this paper, an adaptive modulation scheme for the multiple‐input multiple‐output (MIMO) frequency‐selective channels is investigated. We consider a scenario with precoded block‐based transceivers over spatially correlated Rayleigh multipath MIMO channels. To eliminate the inter‐block interference, the zero‐padding is used. The receiver is equipped with a MIMO minimum‐mean‐squared‐error decision feedback equalizer. The precoder aims to force each subchannel to have an identical signal‐to‐interference‐plus‐noise ratio (SINR). To adjust the constellation size, the unbiased mean square error at the equalizer output is sent back to the transmitter. To simplify our analysis, the feedback channel is considered as instantaneous and error free. We first derive the probability density function of the overall SINR for flat fading and frequency‐selective channels. On the basis of the probability density function of the upper bound of the SINR, we evaluate the system performance. We present accurate closed‐form expressions of the average spectral efficiency, the average bit error rate and the outage probability. The derived expressions are compared with Monte Carlo simulation results. Furthermore, we analyze the effect of the channel spatial correlation. Copyright © 2013 John Wiley & Sons, Ltd.     

Improved Turbo Decoding Using Soft Combining Principle

One great challenge in wireless communication systems is to ensure reliable communications. Turbo codes are known by their interesting capabilities to deal with transmission errors. In this paper, we present a novel turbo decoding scheme based on soft combining principle. Our method improves decoding performance using soft combining technique inside the turbo decoder. Working on Max-Log-Maximum a Posteriori (Max-Log-MAP) turbo decoding algorithm and using an Additive White Gaussian Noise (AWGN) channel model and 16 Quadrature Amplitude Modulation (16QAM), simulation results show that the suggested solution is efficient and outperforms the conventional Max-Log-MAP algorithm in terms of Bit Error Rate (BER). The performance analysis is carried out in terms of BER by varying parameters such as the Energy per bit to Noise power spectral density ratio ( \(\text {E}_{\text {b}}/\text {N}_{\text {o}}\) ), and decoding iterations number. We call our proposed solution Soft Combined Turbo Codes.     

Location Management in PCS Networks by Caching Two-Level Forwarding-Pointers

One of the challenging tasks in Personal Communication Services (PCS) is to efficiently maintain the location of PCS subscribers who move from one region to another (hereafter called mobile users). When a mobile user receives a call, the network has to quickly determine its current location. The existing location management scheme suffers from high signaling traffic in locating the mobile users. Two-level forwarding pointer scheme has been proposed from per-user forwarding pointer scheme to reduce the cost of signaling traffic. In this paper, we enhance the two-level forwarding pointer scheme. When a mobile user moves from its current Registered Area (RA), which is served by Mobile Switching Center (MSC), to another RA the local switch that acts as a parent of those two MSCs maintains this movement in its memory (hereafter called cache entry). A cache entry is used to locate rapidly the mobile user instead of querying the Home Location Register (HLR) and waiting for its reply. HLR is centralized in the network and far away from the mobile users so that the signaling traffic crossing it is expensive. Sometimes the cache entry may be failed to reach the mobile user then a two-level forwarding pointers will be created from the corresponding Visitor Location Register (VLR), attached to its MSC, through a correct path to locate the mobile user. Thus, there is a saving in cost of querying the underlying HLR. The analytical results indicate that such proposal efficiently reduces the signaling traffic cost for all values of Call to Mobility Ratio (CMR), this is especially considerable when CMR ≥1, without any increase in the call setup delay. Salah M. Ramadan (samohra@yahoo.com) received the BS and MS degrees from Computers Engineering Department, Al-Azhar University, Cairo, Egypt, in 1995 and 2002, respectively. From 2002, he was a Ph.D. student in Computers Engineering Department at Al-Azhar University and is currently pursuing the Ph.D. degree, where he is a research assistant in the Wireless Networks Branch. His research interests include traffic management in ATM networks, routing protocols, mobility management in PCS networks, and mobile computing. He is currently an instructor in Cisco Academy, Egypt. Ahmed M. El-Sherbini (Sherbini@mcit.gov.eg) received the Ph.D. in Electrical and Communication Engineering, Case Western University, U.S.A. March 1983 and M.Sc. in Communication Engineering, Cairo University, Giza, Egypt, June 1980. (M. Sc. Research Studies at the Ecole Nationale Superieure des Telecommunications (ENST), Paris, France). He is the Director, National Telecommunication Institute – Ministry of Communications and Information Technology, Egypt and Professor of Electrical and Communication Engineering Dept. Faculty of Engineering, Cairo University, Egypt. M. I. Marie received his B.Sc., M.Sc. and Ph.D. in electronic and communication engineering from Cairo University on 1972, 1981, 1985, respectively. Now he is a professor of communications at Computer and System Engineering department Al-Azhar University, Cairo, Egypt. His fields of interest includes digital communication, computer networks and protocols development. M. Zaki (azhar@mailer.scu.eun.eg) is the professor of software engineering, Computer and System Engineering Department, Faculty of Engineering, Al-Azhar University at Cairo. He received his B.Sc. and M.Sc. degrees in electrical engineering from Cairo University in 1968 and 1973 respectively. He received his Ph.D. degrees in computer engineering from Warsaw Technical University, Poland in 1977. His fields of interest include artificial intelligence, soft computing, and distributed system.     

Modeling and characterization of a 5.2 GHz VCO for UWB applications in 0.13 μm CMOS process

This paper describes a 5.2 GHz voltage-controlled oscillator (VCO) as a key component in RF transceivers. The circuit includes a complementary cross-coupled MOSFET as a negative conductance, beside a tank circuit which consists of an optimal on-chip spiral inductor (L), and an accumulation mode MOS varactor (C(V)). A model for phase noise and figure merit is introduced and verified through simulation in a standard 0.13 μm CMOS process. The VCO core drew a 4.2 mA of current from a 1.2 V power supply and a phase noise of −98.5 dBc/Hz at 1 MHz offset from the 5.2 GHz carrier was calculated. The whole performance of the circuit specifically the tuning range was found to be 26%.     

Distributed address auto configuration protocol for Manet networks

In heterogeneous network environments, the network connections of a multi-homed device may have significant bandwidth differential. For a multi-homed transmission protocol designed for network failure tolerance, such as SCTP, path selection algorithms for data transmission drastically affect performance. This article studies the effect of path bandwidth differential on the performance of retransmission strategies in multi-homing environments. It identifies that fast retransmission on an alternate path may cause receive buffer blocking when path bandwidth differential is significant and the receive buffer is limited. A theoretical model is proposed for selecting retransmission path during the fast retransmission phase, based on receive buffer and path conditions. From these observations and analysis results, this article proposes that path selection strategies for transmitting new data and retransmitted data should be decoupled. A new path selection scheme is proposed and evaluated through SCTP simulations.