algorithmics and modular computations, Theory of Codes and Cryptography (3).From an analytical 1. RE Blahut. Theory and practice of error control codes. eecs.uottawa.ca/∼yongacog/courses/coding/ (3) R.E. Blahut,Theory and Practice of Error Control Codes, Addison Wesley, 1983. QA 268. Cached. Download as a PDF 457, Theory and Practice of Error Control CodesBlahut 1984 (Show Context). Citation Context..ontinued fractions.

Theory and practice of error control codes

Cognitive radios have been proposed as a means to implement efficient reuse of the licensed spectrum. The key feature of a cognitive radio is its ability to recognize the primary (licensed) user and adapt its communication strategy to minimize the interference that it generates. We consider a communication scenario in which the primary and the cognitive user wish to communicate to different receivers, subject to mutual interference. Modeling the cognitive radio as a transmitter with side-information about the primary transmission, we characterize the largest rate at which the cognitive radio can reliably communicate under the constraint that (i) no interference is created for the primary user, and (ii) the primary encoder-decoder pair is oblivious to the presence of the cognitive radio.

Cognitive Radio: An Information-Theoretic Perspective

A–Z survey of Internet of Things: Architectures, protocols, applications, recent advances, future directions and recommendations

Advances in sensor technology has enabled the development of small, relatively inexpensive, and low-power sensors, which are connected together through wireless medium, forming what is so called Wireless Sensor Networks (WSNs). WSNs have huge number of applications out of which military target tracking and surveillance. However, sensors operate on limited power resources; therefore, utilizing those resources has brought the attention of current researchers. In this paper, we propose a Balanced Power-Aware Clustering and Routing protocol (BPA-CRP). Specifically, we developed a batch-based clustering and routing protocol in which the network topology divides the sensor field into equal-sized layers and clusters. The clustering algorithm allows any cluster to operate multiple rounds (a batch) without any need for set-up overhead. BPA-CRP assigns four different broadcast ranges for each sensor. Not only to this extent, but rather, BPA-CRP introduces a routing algorithm in which a new node role called “Forwarder” which is capable of relaying the collected data from the layer, it resides in, and far away forwarders toward the base station. As a complementary to prior described protocol, BPA-CRP proposes that a batch ends when the energy of any of the forwarders dips below a certain threshold. Additionally, BPA-CRP introduces the “Only Normal” operation mode, which primarily prevents exhausted nodes from serving as cluster heads or forwarders any longer. In fact, all of just mentioned enhancements not only are energy-aware, but also contributes in accomplishing efficient load balancing. Finally, we put proper node death-handling rules, which guarantee that each node dies smoothly without any loss of data, neither causing disruption for the network. Simulation results showed an exceptional performance of BPA-CRP over different relevant works in terms of network lifetime and network energy utilization. The load balancing capability of BPA-CRP is validated as well.

BPA-CRP: A balanced power-aware clustering and routing protocol for wireless sensor networks

The advent of various wireless technologies has paved the way for the realization of new infrastructures and applications for smart cities Wireless Sensor Networks (WSNs) are one of the most important among these technologies WSNs are widely used in various applications in our daily lives Due to their cost effectiveness and rapid deployment, WSNs can be used for securing smart cities by providing remote monitoring and sensing for many critical scenarios including hostile environments, battlefields, or areas subject to natural disasters such as earthquakes, volcano eruptions, and floods or to large-scale accidents such as nuclear plants explosions or chemical plumes The purpose of this paper is to propose a new framework where WSNs are adopted for remote sensing and monitoring in smart city applications We propose using Unmanned Aerial Vehicles to act as a data mule to offload the sensor nodes and transfer the monitoring data securely to the remote control center for further analysis and decision making Furthermore, the paper provides insight about implementation challenges in the realization of the proposed framework In addition, the paper provides an experimental evaluation of the proposed design in outdoor environments, in the presence of different types of obstacles, common to typical outdoor fields The experimental evaluation revealed several inconsistencies between the performance metrics advertised in the hardware-specific data-sheets In particular, we found mismatches between the advertised coverage distance and signal strength with our experimental measurements Therefore, it is crucial that network designers and developers conduct field tests and device performance assessment before designing and implementing the WSN for application in a real field setting

Wireless Sensor Networks for Smart Cities: Network Design, Implementation and Performance Evaluation

Energy-Aware and Density-Based Clustering and Relaying Protocol (EA-DB-CRP) for gathering data in wireless sensor networks

In this research, two novel cluster head selection protocols are proposed, namely, Energy and Distance Based Cluster Head Selection (EDB-CHS) and EDB-CHS with Balanced Objective Function (EDB-CHS-BOF). They mainly aim at balancing energy consumption amongst all sensor nodes, prohibiting their precocious death, and extending the network lifetime. More specifically, in EDB-CHS protocol, a new cluster shape is proposed and consequently a tight closed-form expression for the optimal number of cluster heads (CHs) in the network is derived. Additionally, an efficacious CHS algorithm is presented, which is an expression of threshold probability that takes into account the residual energy of sensor nodes, how far they are located from the Base Station (BS), as well as the node's optimal probability of being a CH. On the other hand, the EDB-CHS-BOF protocol is proposed mainly to address the matter of having long-distance communications as a result of obtaining adjacent CHs. In EDB-CHS-BOF protocol, a new threshold probability for each sensor node to be a CH in any round is proposed. Not only to this extent, but rather a balanced objective function is proposed to ensure a well-proportioned distribution of CHs over the network. Simulation results demonstrate the superiority of the proposed protocols over other directly related works in terms of network lifetime and total data delivery.

https://ietresearch.onlinelibrary.wiley.com/doi/pdf/10.1049/iet-com.2019.0092

EDB-CHS-BOF: energy and distance-based cluster head selection with balanced objective function protocol

In this paper, we propose a new energy–aware and density-based clustering and routing algorithms for gathering data in wireless sensor networks. It basically aims at distributing the energy consumption between nodes in the network. In our proposed protocol, we introduce a topology that partitions the network field into equally-sized layers where each layer is divided into equal clusters. Additionally, we introduce a density-based algorithm that takes into consideration the number of nodes in a cluster. Finally, we propose an energy aware relaying algorithm that uses free space channel propagation model among nodes and selects the relay nodes based on their energy levels and locations among others. The performance of our proposed protocol is assessed through carrying out numerous MATLAB experiments. Simulation results showed that our proposed protocol has a remarkable improvement against other related works in term of network lifetime.

A New Density-Based Relaying Protocol for Wireless Sensor Networks

Impairments-aware time slot allocation model for energy-constrained multi-hop clustered IoT nodes considering TDMA and DSSS MAC protocols

The authors discuss the importance of using the singular value decomposition (SVD) in computing the capacity of multiple input multiple output (MIMO) and in estimation the channel gain from the transmitter to the receiver. Examples that show how the SVD simplifies computing the MIMO channel capacity are discussed. Numerical results that show what factors determine the performance of using SVD in channel estimation are also discussed.

Zouhair Al-qudah

Papers

Energy-Aware and Density-Based Clustering and Relaying Protocol (EA-DB-CRP) for gathering data in wireless sensor networks

EDB-CHS-BOF: energy and distance-based cluster head selection with balanced objective function protocol

A New Density-Based Relaying Protocol for Wireless Sensor Networks

Impairments-aware time slot allocation model for energy-constrained multi-hop clustered IoT nodes considering TDMA and DSSS MAC protocols

Singular Value Decomposition: Principles and Applications in Multiple Input Multiple Output Communication System