IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWORKS TO EXPLOIT DIVERSITY

ABSTRAC

Cooperative diversity architecture for wireless networks

The burgeoning demand for wireless networks necessitates reliable and energy-efficient communication architectures that are robust to the impairments of the wireless medium. Cooperative communication emerges as an appropriate technique that mitigates the severe effects of channel impairments through the use of cooperative diversity. Notwithstanding the fact that cooperative diversity is a very suitable technique to provide robust and reliable communication, the realization of cooperation idea precipitates many technical challenges that are associated with the overhaul of the wireless network design. This dissertation proposes a cooperative diversity architecture for wireless networks, that spans the physical, medium access and routing layers with parameters (jointly) optimized for overall system performance, taking into account the cost of cooperation in each layer. First, we present a new cooperative MAC protocol, COMAC, that enables cooperation of multiple relays in a distributed fashion. Through the proposed protocol, we investigate and demonstrate at what rate and for which scenarios cooperation brings benefits in terms of throughput and energy-efficiency. Our results demonstrate that cooperation initiation has a significant cost on both the throughput and energy-efficiency, which have been often disregarded in the literature. We next study the energy minimal joint cooperator selection and power assignment problem under transmit power constraints such that the cooperative transmissions satisfy an average bit error rate (BER) target. We derive the average BER of the cooperative system and we propose a simple yet close approximation to facilitate cooperator selection methods with closed form power assignment solutions. We formulate the joint cooperator selection and power assignment problem, we present the optimal solution (O-CSPA) and we also propose a distributed implementation (D-CSPA). Our results demonstrate that smart cooperator selection is essential, as it provides efficient resource allocation with reduced overhead leading to improved system performance. Our implementation and simulations of D-CSPA algorithm in COMAC protocol demonstrate that our distributed algorithm causes minimal overhead, yields improved throughput and reduced delay, while reducing the energy consumption. Finally, we propose a cooperative routing framework and a cross-layer architecture, RECOMAC, for wireless ad hoc networks. The RECOMAC architecture facilitates formation of cooperative sets on the fly in a decentralized and distributed fashion, requiring no overhead for relay selection and actuation, and resulting in opportunistically formed cooperative links that provide robust and reliable end-to-end communication, without the need for establishing a prior non-cooperative route, unlike existing schemes. The results demonstrate that under wireless channel impairments, such as fading and path loss, our cooperative forwarding framework and cross-layer architecture, RECOMAC significantly improve the system performance, in terms of throughput and delay, as compared to non-cooperative conventional layered network architecture with AODV routing over IEEE 802.11 MAC

Decentralized Ultra-Reliable Low-Latency Communications through Concurrent Cooperative Transmission

Emerging cyber-physical systems demand for communication technologies that enable seamless interactions between humans and physical objects in a shared environment. This thesis proposes decentralized URLLC (dURLLC) as a new communication paradigm that allows the nodes in a wireless multi-hop network (WMN) to disseminate data quickly, reliably and without using a centralized infrastructure. To enable the dURLLC paradigm, this thesis explores the practical feasibility of concurrent cooperative transmission (CCT) with orthogonal frequency-division multiplexing (OFDM). CCT allows for an efficient utilization of the medium by leveraging interference instead of trying to avoid collisions. CCT-based network flooding disseminates data in a WMN through a reception-triggered low-level medium access control (MAC). OFDM provides high data rates by using a large bandwidth, resulting in a short transmission duration for a given amount of data. This thesis explores CCT-based network flooding with the OFDM-based IEEE 802.11 Non-HT and HT physical layers (PHYs) to enable interactions with commercial devices. An analysis of CCT with the IEEE 802.11 Non-HT PHY investigates the combined effects of the phase offset (PO), the carrier frequency offset (CFO) and the time offset (TO) between concurrent transmitters, as well as the elapsed time. The analytical results of the decodability of a CCT are validated in simulations and in testbed experiments with Wireless Open Access Research Platform (WARP) v3 software-defined radios (SDRs). CCT with coherent interference (CI) is the primary approach of this thesis. Two prototypes for CCT with CI are presented that feature mechanisms for precise synchronization in time and frequency. One prototype is based on the WARP v3 and its IEEE 802.11 reference design, whereas the other prototype is created through firmware modifications of the Asus RT-AC86U wireless router. Both prototypes are employed in testbed experiments in which two groups of nodes generate successive CCTs in a ping-pong fashion to emulate flooding processes with a very large number of hops. The nodes stay synchronized in experiments with 10 000 successive CCTs for various modulation and coding scheme (MCS) indices and MAC service data unit (MSDU) sizes. The URLLC requirement of delivering a 32-byte MSDU with a reliability of 99.999 % and with a latency of 1 ms is assessed in experiments with 1 000 000 CCTs, while the reliability is approximated by means of the frame reception rate (FRR). An FRR of at least 99.999 % is achieved at PHY data rates of up to 48 Mbit/s under line-of-sight (LOS) conditions and at PHY data rates of up to 12 Mbit/s under non-line-of-sight (NLOS) conditions on a 20 MHz wide channel, while the latency per hop is 48.2 µs and 80.2 µs, respectively. With four multiple input multiple output (MIMO) spatial streams on a 40 MHz wide channel, a LOS receiver achieves an FRR of 99.5 % at a PHY data rate of 324 Mbit/s. For CCT with incoherent interference, this thesis proposes equalization with time-variant zero-forcing (TVZF) and presents a TVZF receiver for the IEEE 802.11 Non-HT PHY, achieving an FRR of up to 92 % for CCTs from three unsyntonized commercial devices. As CCT-based network flooding allows for an implicit time synchronization of all nodes, a reception-triggered low-level MAC and a reservation-based high-level MAC may in combination support various applications and scenarios under the dURLLC paradigm

Engineering Self-Adaptive Collective Processes for Cyber-Physical Ecosystems

The pervasiveness of computing and networking is creating significant opportunities for building valuable socio-technical systems. However, the scale, density, heterogeneity, interdependence, and QoS constraints of many target systems pose severe operational and engineering challenges. Beyond individual smart devices, cyber-physical collectives can provide services or solve complex problems by leveraging a “system effect” while coordinating and adapting to context or environment change. Understanding and building systems exhibiting collective intelligence and autonomic capabilities represent a prominent research goal, partly covered, e.g., by the field of collective adaptive systems. Therefore, drawing inspiration from and building on the long-time research activity on coordination, multi-agent systems, autonomic/self-* systems, spatial computing, and especially on the recent aggregate computing paradigm, this thesis investigates concepts, methods, and tools for the engineering of possibly large-scale, heterogeneous ensembles of situated components that should be able to operate, adapt and self-organise in a decentralised fashion. The primary contribution of this thesis consists of four main parts. First, we define and implement an aggregate programming language (ScaFi), internal to the mainstream Scala programming language, for describing collective adaptive behaviour, based on field calculi. Second, we conceive of a “dynamic collective computation” abstraction, also called aggregate process, formalised by an extension to the field calculus, and implemented in ScaFi. Third, we characterise and provide a proof-of-concept implementation of a middleware for aggregate computing that enables the development of aggregate systems according to multiple architectural styles. Fourth, we apply and evaluate aggregate computing techniques to edge computing scenarios, and characterise a design pattern, called Self-organising Coordination Regions (SCR), that supports adjustable, decentralised decision-making and activity in dynamic environments.Con lo sviluppo di informatica e intelligenza artificiale, la diffusione pervasiva di device computazionali e la crescente interconnessione tra elementi fisici e digitali, emergono innumerevoli opportunità per la costruzione di sistemi socio-tecnici di nuova generazione. Tuttavia, l'ingegneria di tali sistemi presenta notevoli sfide, data la loro complessità—si pensi ai livelli, scale, eterogeneità, e interdipendenze coinvolti. Oltre a dispositivi smart individuali, collettivi cyber-fisici possono fornire servizi o risolvere problemi complessi con un “effetto sistema” che emerge dalla coordinazione e l'adattamento di componenti fra loro, l'ambiente e il contesto. Comprendere e costruire sistemi in grado di esibire intelligenza collettiva e capacità autonomiche è un importante problema di ricerca studiato, ad esempio, nel campo dei sistemi collettivi adattativi. Perciò, traendo ispirazione e partendo dall'attività di ricerca su coordinazione, sistemi multiagente e self-*, modelli di computazione spazio-temporali e, specialmente, sul recente paradigma di programmazione aggregata, questa tesi tratta concetti, metodi, e strumenti per l'ingegneria di ensemble di elementi situati eterogenei che devono essere in grado di lavorare, adattarsi, e auto-organizzarsi in modo decentralizzato. Il contributo di questa tesi consiste in quattro parti principali. In primo luogo, viene definito e implementato un linguaggio di programmazione aggregata (ScaFi), interno al linguaggio Scala, per descrivere comportamenti collettivi e adattativi secondo l'approccio dei campi computazionali. In secondo luogo, si propone e caratterizza l'astrazione di processo aggregato per rappresentare computazioni collettive dinamiche concorrenti, formalizzata come estensione al field calculus e implementata in ScaFi. Inoltre, si analizza e implementa un prototipo di middleware per sistemi aggregati, in grado di supportare più stili architetturali. Infine, si applicano e valutano tecniche di programmazione aggregata in scenari di edge computing, e si propone un pattern, Self-Organising Coordination Regions, per supportare, in modo decentralizzato, attività decisionali e di regolazione in ambienti dinamici

Mobility-aware Software-Defined Service-Centric Networking for Service Provisioning in Urban Environments

Disruptive applications for mobile devices, such as the Internet of Things, Connected and Autonomous Vehicles, Immersive Media, and others, have requirements that the current Cloud Computing paradigm cannot meet. These unmet requirements bring the necessity to deploy geographically distributed computing architectures, such as Fog and Mobile Edge Computing. However, bringing computing close to users has its costs. One example of cost is the complexity introduced by the management of the mobility of the devices at the edge. This mobility may lead to issues, such as interruption of the communication with service instances hosted at the edge or an increase in communication latency during mobility events, e.g., handover. These issues, caused by the lack of mobility-aware service management solutions, result in degradation in service provisioning. The present thesis proposes a series of protocols and algorithms to handle user and service mobility at the edge of the network. User mobility is characterized when user change access points of wireless networks, while service mobility happens when services have to be provisioned from different hosts. It assembles them in a solution for mobility-aware service orchestration based on Information-Centric Networking (ICN) and runs on top of Software-Defined Networking (SDN). This solution addresses three issues related to handling user mobility at the edge: (i) proactive support for user mobility events, (ii) service instance addressing management, and (iii) distributed application state data management. For (i), we propose a proactive SDN-based handover scheme. For (ii), we propose an ICN addressing strategy to remove the necessity of updating addresses after service mobility events. For (iii), we propose a graph-based framework for state data placement in the network nodes that accounts for user mobility and latency requirements. The protocols and algorithms proposed in this thesis were compared with different approaches from the literature through simulation. Our results show that the proposed solution can reduce service interruption and latency in the presence of user and service mobility events while maintaining reasonable overhead costs regarding control messages sent in the network by the SDN controller

Power minimization in wireless systems with superposition coding.

Zheng, Xiaoting.Thesis (M.Phil.)--Chinese University of Hong Kong, 2008.Includes bibliographical references (p. 64-69).Abstracts in English and Chinese.Abstract --- p.iAcknowledgement --- p.iiiChapter 1 --- Introduction --- p.1Chapter 1.1 --- Rayleigh Fading --- p.1Chapter 1.2 --- Transmission Schemes --- p.2Chapter 1.2.1 --- Frequency Division Multiple Access(FDMA) --- p.2Chapter 1.2.2 --- Time Division Multiple Access(TDMA) --- p.3Chapter 1.2.3 --- Code Division Multiple Access(CDMA) --- p.5Chapter 1.2.4 --- The Broadcast Channel --- p.5Chapter 1.3 --- Cooperative Transmissions --- p.9Chapter 1.3.1 --- Relaying Protocols --- p.10Chapter 1.4 --- Outline of Thesis --- p.12Chapter 2 --- Background Study --- p.13Chapter 2.1 --- Superposition Coding --- p.13Chapter 2.2 --- Cooperative Transmission --- p.15Chapter 2.2.1 --- Single Source Single Destination --- p.15Chapter 2.2.2 --- Multiple Sources Single Destination --- p.16Chapter 2.2.3 --- Single Source Multiple Destinations --- p.17Chapter 2.2.4 --- Multiple Sources Multiple Destinations --- p.17Chapter 2.3 --- Power Minimization --- p.18Chapter 2.3.1 --- Power Minimization in Code-Multiplexing System --- p.19Chapter 2.3.2 --- Power Minimization in Frequency-multiplexing System --- p.19Chapter 2.3.3 --- Power Minimization in Time-Multiplexing System --- p.20Chapter 3 --- Sum Power Minimization with Superposition Coding --- p.21Chapter 3.1 --- System Model --- p.22Chapter 3.2 --- Superposition Coding Scheme --- p.22Chapter 3.2.1 --- Optimal Superposition Coding Scheme --- p.22Chapter 3.2.2 --- Sub-optimal Superposition Coding Scheme --- p.27Chapter 3.3 --- Performance Evaluation --- p.30Chapter 3.4 --- Assignment Examples for Superposition Coding Scheme --- p.33Chapter 4 --- Source-cooperated Transmission in a Wireless Cluster --- p.42Chapter 4.1 --- System Model --- p.42Chapter 4.2 --- Selection Protocol --- p.44Chapter 4.2.1 --- Protocol Description and Problem Formulation --- p.44Chapter 4.2.2 --- Distributed Selection Algorithm --- p.46Chapter 4.2.3 --- Low Rate Regime --- p.50Chapter 4.3 --- Simulation Results --- p.52Chapter 4.3.1 --- Simulation Configuration --- p.53Chapter 4.3.2 --- Cases with a Smaller Feasible Solution Set --- p.53Chapter 4.3.3 --- Cases with a Larger Feasible Solution Set --- p.56Chapter 5 --- Conclusion and Future Work --- p.61Chapter 5.1 --- Conclusion --- p.61Chapter 5.2 --- Future Work --- p.62Chapter 5.2.1 --- Fairness --- p.62Chapter 5.2.2 --- Distributed Algorithm --- p.63Chapter 5.2.3 --- Game Theory --- p.63Chapter 5.2.4 --- Distributed Information --- p.63Bibliography --- p.6

Superimposed radio signals in wireless sensor networks

Drahtlose Sensornetzwerke sind Netzwerke, die aus einer Vielzahl von Kleinstrechnern aufgebaut werden. Diese Kleinstrechner sind typischerweise sehr ressourcenarm und leistungsschwach. Sie tragen eine Funkkommunikationseinheit mit der sie zu anderen Kleinstrechnern (sog. Funkknoten) Nachrichten austauschen können. Diese Nachrichten können auch stückweise von Knoten zu Knoten über weite Distanzen weitergeleitet werden. In einem solchen Fall spricht man von Multi-hop Kommunikation. Funkknoten können durch bestimmte Mechanismen Nachrichten automatisch weiterleiten und Nachrichtenwege selbständig im Netzwerk etablieren. Ein Systemaufbau von vielen leistungsschwachen Knoten legt es nahe, auf möglichst vielen Ebenen der Systemarchitektur kooperative Mechanismen zu nutzen. Überlagerte Funksignale sind ein solcher Kooperationsmechanismus. Sie treten immer dann auf, wenn mehrere Quellen zugleich auf der gleichen Frequenz Signale aussenden. Die vorliegende Arbeit stellt das Konzept der überlagerten Funksignale dar und zeigt eine Reihe von Nutzungsmöglichkeiten in drahtlosen Sensornetzen. Die Randbedingungen sind hier stets eine sehr leistungsschwache Hardware. Unter diesen Voraussetzungen werden mit Hilfe der neuen Modelle grundsätzliche Probleme in drahtlosen Sensornetzwerken wie Zeitsynchronisation, Zuverlässigkeit, Kanalnutzung und Datenfusion, gelöst. Die Basis bildet das neue Modulationsverfahren (ESK, energy shift keying), welches überlagerte Funksignale für Gruppen von Funkknoten ermöglicht. Dieses Übertragungsverfahren ist speziell für sehr einfach aufgebaute Hardware geeignet und basiert auf reiner Energiedetektion. In vielen Implementierungen und Studien wird der praktische Nutzen von überlagerten Funksignalen gezeigt. Die Anwendungen reichen von Ultraschall-Lokationssystemen über Warenerkennung im Supermarkt bis hin zu Echtzeit-Zugriffsmechansimen für verteilte Funksysteme.Wireless sensor networks consist of a number of embedded computers. These embedded computers are typically very weak in energy and computing power but carry a wireless communication unit to exchange packet messages with other embedded computer (called nodes). The messages can be transported from one to another node building multi-hop communication. Nodes are capable of automatically forwarding messages and establishing routes for messages through the network. Such systems of a number of weak nodes can greatly benefit of cooperative mechanisms. Superimposed radio signals are such a cooperative mechanisms. They occur whenever two or more nodes emit radio signals at the same time and in the same frequency band. This work presents a new concept for superimposed radio signals and shows various use-cases in wireless sensor network. The constraints are the weak hardware with limited computing and energy resources. New models are derived and presented that can solve principal problem in wireless sensor networks such as time synchronization, channel usage, reliability and data fusion. Basis for all contributions is the new modulation scheme for superimposed radio signals call ESK (energy shift keying). ESK is a multi-stage modulation based on energy detection in the receiver, enabling superimposed radio signals for a group of sensor nodes. Various Implementations and studies are presented that illustrate the practical use of superimposed radio signals. The applications range from ultrasound location systems over item handing in a retail store to real-time access protocols in wireless distributed systems

Intelligent Circuits and Systems

ICICS-2020 is the third conference initiated by the School of Electronics and Electrical Engineering at Lovely Professional University that explored recent innovations of researchers working for the development of smart and green technologies in the fields of Energy, Electronics, Communications, Computers, and Control. ICICS provides innovators to identify new opportunities for the social and economic benefits of society.　 This conference bridges the gap between academics and R&D institutions, social visionaries, and experts from all strata of society to present their ongoing research activities and foster research relations between them. It provides opportunities for the exchange of new ideas, applications, and experiences in the field of smart technologies and finding global partners for future collaboration. The ICICS-2020 was conducted in two broad categories, Intelligent Circuits & Intelligent Systems and Emerging Technologies in Electrical Engineering

Spatial modulation: theory to practice

Spatial modulation (SM) is a transmission technique proposed for multiple–input multiple– output (MIMO) systems, where only one transmit antenna is active at a time, offering an increase in the spectral efficiency equal to the base–two logarithm of the number of transmit antennas. The activation of only one antenna at each time instance enhances the average bit error ratio (ABER) as inter–channel interference (ICI) is avoided, and reduces hardware complexity, algorithmic complexity and power consumption. Thus, SM is an ideal candidate for large scale MIMO (tens and hundreds of antennas). The analytical ABER performance of SM is studied and different frameworks are proposed in other works. However, these frameworks have various limitations. Therefore, a closed–form analytical bound for the ABER performance of SM over correlated and uncorrelated, Rayleigh, Rician and Nakagami–m channels is proposed in this work. Furthermore, in spite of the low–complexity implementation of SM, there is still potential for further reductions, by limiting the number of possible combinations by exploiting the sphere decoder (SD) principle. However, existing SD algorithms do not consider the basic and fundamental principle of SM, that at any given time, only one antenna is active. Therefore, two modified SD algorithms tailored to SM are proposed. It is shown that the proposed sphere decoder algorithms offer an optimal performance, with a significant reduction of the computational complexity. Finally, the logarithmic increase in spectral efficiency offered by SM and the requirement that the number of antennas must be a power of two would require a large number of antennas. To overcome this limitation, two new MIMO modulation systems generalised spatial modulation (GNSM) and variable generalised spatial modulation (VGSM) are proposed, where the same symbol is transmitted simultaneously from more than one transmit antenna at a time. Transmitting the same data symbol from more than one antenna reduces the number of transmit antennas needed and retains the key advantages of SM. In initial development simple channel models can be used, however, as the system develops it should be tested on more realistic channels, which include the interactions between the environment and antennas. Therefore, a full analysis of the ABER performance of SM over urban channel measurements is carried out. The results using the urban measured channels confirm the theoretical work done in the field of SM. Finally, for the first time, the performance of SM is tested in a practical testbed, whereby the SM principle is validated