Collision Helps - Algebraic Collision Recovery for Wireless Erasure Networks

Current medium access control mechanisms are based on collision avoidance and collided packets are discarded. The recent work on ZigZag decoding departs from this approach by recovering the original packets from multiple collisions. In this paper, we present an algebraic representation of collisions which allows us to view each collision as a linear combination of the original packets. The transmitted, colliding packets may themselves be a coded version of the original packets. We propose a new acknowledgment (ACK) mechanism for collisions based on the idea that if a set of packets collide, the receiver can afford to ACK exactly one of them and still decode all the packets eventually. We analytically compare delay and throughput performance of such collision recovery schemes with other collision avoidance approaches in the context of a single hop wireless erasure network. In the multiple receiver case, the broadcast constraint calls for combining collision recovery methods with network coding across packets at the sender. From the delay perspective, our scheme, without any coordination, outperforms not only a ALOHA-type random access mechanisms, but also centralized scheduling. For the case of streaming arrivals, we propose a priority-based ACK mechanism and show that its stability region coincides with the cut-set bound of the packet erasure network

大規模多元接続ネットワークのためのグラフ構造に基づくランダムアクセス方式

電気通信大学201

Modern Random Access for Satellite Communications

The present PhD dissertation focuses on modern random access (RA) techniques. In the first part an slot- and frame-asynchronous RA scheme adopting replicas, successive interference cancellation and combining techniques is presented and its performance analysed. The comparison of both slot-synchronous and asynchronous RA at higher layer, follows. Next, the optimization procedure, for slot-synchronous RA with irregular repetitions, is extended to the Rayleigh block fading channel. Finally, random access with multiple receivers is considered.Comment: PhD Thesis, 196 page

Network coding-aided MAC protocols for cooperative wireless networks

The introduction of third generation (3G) technologies has caused a vast proliferation of wireless devices and networks, generating an increasing demand for high level Quality of Service (QoS). The wide spread of mobile applications has further reinforced the user need for communication, motivating at the same time the concepts of user cooperation and data dissemination. However, this trend towards continuous exchange of information and ubiquitous connectivity is inherently restricted by the energy-greedy functionalities of high-end devices. These limitations, along with the pressure exerted on the Information and Communications Technology (ICT) industry towards energy awareness, have induced the design of novel energy efficient schemes and algorithms. In this context, the Medium Access Control (MAC) layer plays a key role, since it is mainly responsible for the channel access regulation, the transmission scheduling and the resource allocation, thus constituting an appropriate point to effectively address energy efficiency issues that arise due to the users overcrowding. This dissertation provides a contribution to the design, analysis and evaluation of novel MAC protocols for cooperative wireless networks. In our attempt to design energy efficient MAC schemes, we were extensively assisted by the introduction of new techniques, such as Network Coding (NC), that intrinsically bring considerable gains in system performance. The main thesis contributions are divided into two parts. The first part presents NCCARQ, a novel NC-aided Cooperative Automatic Repeat reQuest (ARQ) MAC protocol for wireless networks. NCCARQ introduces a new access paradigm for cooperative ARQ schemes, exploiting NC benefits in bidirectional communication among wireless users. The NCCARQ performance in terms of QoS and energy efficiency is assessed by means of analytical probabilistic models and extensive computer-based simulations, revealing the significant gains we can achieve compared to standardized MAC solutions. In addition, the impact of realistic wireless channel conditions on the MAC protocol operation further motivated us to study the NCCARQ performance in wireless links affected by correlated shadowing, showing that the channel correlation may adversely affect the distributed cooperation benefits. The second part of the thesis is dedicated to the investigation of MAC issues in wireless data dissemination scenarios. In particular, the existence of multiple source nodes in such scenarios generates conflicting situations, considering the selfish behavior of the wireless devices that want to maximize their battery lifetime. Bearing in mind the energy efficiency importance, we propose game theoretic medium access strategies, applying energy-based utility functions which inherently imply energy awareness. In addition, Random Linear NC (RLNC) techniques are adopted to eliminate the need of exchanging excessive control packets, while Analog NC (ANC) is employed to efface the impact of collisions throughout the communication. During the elaboration of this thesis, two general key conclusions have been extracted. First, there is a fundamental requirement for implementation of new MAC protocols in order to effectively deal with state-of-the-art techniques (e.g., NC), recently introduced to enhance both the performance and the energy efficiency of the network. Second, we highlight the importance of designing novel energy efficient MAC protocols, taking into account that traditional approaches - designed mainly to assist the collision avoidance in wireless networks - tend to be obsolete.La presente tesis doctoral contribuye al diseño, análisis y evaluación de nuevos protocolos MAC cooperativos para redes inalámbricas. La introducción de nuevas técnicas, tales como la codificación de red (NC), que intrínsecamente llevan un considerable aumento en el rendimiento del sistema, nos ayudó ampliamente durante el diseño de protocolos MAC energéticamente eficientes. Las principales contribuciones de esta tesis se dividen en dos partes. La primera parte presenta el NCCARQ, un protocolo cooperativo de retransmisión automática (ARQ), asistido por NC para redes inalámbricas. La segunda parte de la tesis se centra en el diseño de protocolos de capa MAC en escenarios inalámbricos de difusión de datos. Teniendo en cuenta la importancia de la eficiencia energética, se proponen técnicas de acceso al medio basadas en teoría de juegos dónde las funciones objetivo están motivadas por el consumo energético. Las soluciones propuestas son evaluadas por medio de modelos analíticos y simulaciones por ordenador

User-controlled cyber-security using automated key generation

Traditionally, several different methods are fully capable of providing an adequate degree of security to the threats and attacks that exists for revealing different keys. Though almost all the traditional methods give a good level of immunity to any possible breach in security keys, the biggest issue that exist with these methods is the dependency over third-party applications. Therefore, use of third-party applications is not an acceptable method to be used by high-security applications. For high-security applications, it is more secure that the key generation process is in the hands of the end users rather than a third-party. Giving access to third parties for high-security applications can also make the applications more venerable to data theft, security breach or even a loss in their integrity. In this research, the evolutionary computing tool Eureqa is used for the generation of encryption keys obtained by modelling pseudo-random input data. Previous approaches using this tool have required a calculation time too long for practical use and addressing this drawback is the main focus of the research. The work proposes a number of new approaches to the generation of secret keys for the encryption and decryption of data files and they are compared in their ability to operate in a secure manner using a range of statistical tests and in their ability to reduce calculation time using realistic practical assessments. A number of common tests of performance are the throughput, chi-square, histogram, time for encryption and decryption, key sensitivity and entropy analysis. From the results of the statistical tests, it can be concluded that the proposed data encryption and decryption algorithms are both reliable and secure. Being both reliable and secure eliminates the need for the dependency over third-party applications for the security keys. It also takes less time for the users to generate highly secure keys compared to the previously known techniques.The keys generated via Eureqa also have great potential to be adapted to data communication applications which require high security

逐次干渉除去とZigZag復号に基づくランダムアクセスプロトコルの解析と設計

超多数の端末が散発的に通信するネットワークの実現のため，多元接続方式としてランダムアクセスを適用する研究が多くなされている.ランダムアクセスの一種である非正則繰り返しスロット化 ALOHA(IRSA: Irregular Repetition Slotted ALOHA)は，パケット復調の手段として逐次干渉除去を用いて高いスループット性能を達成するものの，高負荷時における性能の劣化が著しいことが知られている.そこで，本研究では逐次干渉除去に加えてジグザグ復号を組み合わせることで高負荷時におけるスループット性能の劣化を抑圧するジグザグ復号可能な符号化スロット化 ALOHA(ZDCSA: Zigzag Decodable Coded Slotted ALOHA) および拡張 ZDCSA(EZDCSA: Enhanced-ZDCSA) を提案する. 一方で，IRSA と異なり時間フレーム長が固定でないフレームレス ALOHA が提案されており，逐次干渉除去に加えてキャプチャ効果を適用した場合の性能解析がなされている.キャプチャ効果を適用する場合，基地局に到着したパケットの信号対干渉雑音電力(SINR: Signal-to-Interference-plus-Noise Ratio)は基地局に近いユーザが遠いユーザと比較して高くなり復調が容易になると予測される.従来研究では，このような幾何学的配置構造を利用したプロトコルの設計はなされておらず，ユーザ全体で時間スロットあたりのパケットの送信確率を同一としている.本研究ではユーザが自身と基地局との距離を既知であるとし，パケットの送信確率を自律的に決定する距離を考慮した非正則フレームレス ALOHA(DIFA: Distance-aware Irregular Frameless ALOHA)を提案する.本論文では，提案方式である ZDCSA，E-ZDCSA，および DIFAが既存方式と比較して優れた スループット性能を達成することを数値解析より示す.電気通信大学201

Energy efficient offloading techniques for heterogeneous networks

Mobile data offloading has been proposed as a solution for the network congestion problem that is continuously aggravating due to the increase in mobile data demand. The concept of offloading refers to the exploitation of network heterogeneity with the objective to mitigate the load of the cellular network infrastructure. In this thesis a multicast protocol for short range networks that exploits the characteristics of physical layer network coding is presented. In the proposed protocol, named CooPNC, a novel cooperative approach is provided that allows collision resolutions with the use of an indirect inter-network cooperation scheme. Through this scheme, a reliable multicast protocol for partially overlapping short range networks with low control overhead is provided. It is shown that with CooPNC, higher throughput and energy efficiency are achieved, while it presents lower delay compared to state-of-the-art multicast protocols. A detailed description of the proposed protocol is provided, with a simple scenario of overlapping networks and also for a generalised scalable scenario. Through mathematical analysis and simulations it is proved that CooPNC presents significant performance gains compared to other state-of-the-art multicast protocols for short range networks. In order to reveal the performance bounds of Physical Layer Network Coding, the so-called Cross Network is investigated under diverse Network Coding (NC) techniques. The impact of Medium Access Control (MAC) layer fairness on the throughput performance of the network is provided, for the cases of pure relaying, digital NC with and without overhearing and physical layer NC with and without overhearing. A comparison among these techniques is presented and the throughput bounds, caused by MAC layer limitations, are discussed. Furthermore, it is shown that significant coding gains are achieved with digital and physical layer NC and the energy efficiency performance of each NC case is presented, when applied on the Cross Network.In the second part of this thesis, the uplink offloading using IP Flow Mobility (IFOM) is also investigated. IFOM allows a LTE mobile User Equipment (UE) to maintain two concurrent data streams, one through LTE and the other through WiFi access technology, that presents uplink limitations due to the inherent fairness design of IEEE 802.11 DCF. To overcome these limitations, a weighted proportionally fair bandwidth allocation algorithm is proposed, regarding the data volume that is being offloaded through WiFi, in conjunction with a pricing-based rate allocation algorithm for the rest of the data volume needs of the UEs that are transmitted through the LTE uplink. With the proposed approach, the energy efficiency of the UEs is improved, and the offloaded data volume is increased under the concurrent use of access technologies that IFOM allows. In the weighted proportionally fair WiFi bandwidth allocation, both the different upload data needs of the UEs, along with their LTE spectrum efficiency are considered, and an access mechanism is proposed that improves the use of WiFi access in uplink offloading. In the LTE part, a two-stage pricing-based rate allocation is proposed, under both linear and exponential pricing approaches, with the objective to satisfy all offloading UEs regarding their LTE uplink access. The existence of a malicious UE is also considered that aims to exploit the WiFi bandwidth against its peers in order to upload less data through the energy demanding LTE uplink and a reputation based method is proposed to combat its selfish operation. This approach is theoretically analysed and its performance is evaluated, regarding the malicious and the truthful UEs in terms of energy efficiency. It is shown that while the malicious UE presents better energy efficiency before being detected, its performance is significantly degraded with the proposed reaction method.La derivación del tráfico de datos móviles (en inglés data offloading) ha sido propuesta como una solución al problema de la congestión de la red, un problema que empeora continuamente debido al incremento de la demanda de datos móviles. El concepto de offloading se entiende como la explotación de la heterogeneidad de la red con el objetivo de mitigar la carga de la infraestructura de las redes celulares. En esta tesis se presenta un protocolo multicast para redes de corto alcance (short range networks) que explota las características de la codificación de red en la capa física (physical layer network coding). En el protocolo propuesto, llamado CooPMC, se implementa una solución cooperativa que permite la resolución de colisiones mediante la utilización de un esquema indirecto de cooperación entre redes. Gracias a este esquema, se consigue un protocolo multicast fiable i con poco overhead de control para redes de corto alcance parcialmente solapadas. Se demuestra que el protocolo CooPNC consigue una mayor tasa de transmisión neta (throughput) y una mejor eficiencia energética, a la vez que el retardo se mantiene por debajo del obtenido con los protocolos multicast del estado del arte. La tesis ofrece una descripción detallada del protocolo propuesto, tanto para un escenario simple de redes solapadas como también para un escenario general escalable. Se demuestra mediante análisis matemático y simulaciones que CooPNC ofrece mejoras significativas en comparación con los protocolos multicast para redes de corto alcance del estado del arte. Con el objetivo de encontrar los límites de la codificación de red en la capa física (physical layer network coding), se estudia el llamado Cross Network bajo distintas técnicas de Network Coding (NC). Se proporciona el impacto de la equidad (fairness) de la capa de control de acceso al medio (Medium Access Control, MAC), para los casos de repetidor puro (pure relaying), NC digital con y sin escucha del medio, y NC en la capa física con y sin escucha del medio. En la segunda parte de la tesis se investiga el offloading en el enlace ascendente mediante IP Flow Mobility (IFOM). El IFOM permite a los usuarios móviles de LTE mantener dos flujos de datos concurrentes, uno a través de LTE y el otro a través de la tecnología de acceso WiFi, que presenta limitaciones en el enlace ascendente debido a la equidad (fairness) inherente del diseño de IEEE 802.11 DCF. Para superar estas limitaciones, se propone un algoritmo proporcional ponderado de asignación de banda para el volumen de datos derivado a través de WiFi, junto con un algoritmo de asignación de tasa de transmisión basado en pricing para el volumen de datos del enlace ascendente de LTE. Con la solución propuesta, se mejora la eficiencia energética de los usuarios móviles, y se incrementa el volumen de datos que se pueden derivar gracias a la utilización concurrente de tecnologías de acceso que permite IFOM. En el algoritmo proporcional ponderado de asignación de banda de WiFi, se toman en consideración tanto las distintas necesidades de los usuarios en el enlace ascendente como su eficiencia espectral en LTE, y se propone un mecanismo de acceso que mejora el uso de WiFi para el tráfico derivado en el enlace ascendente. En cuanto a la parte de LTE, se propone un algoritmo en dos etapas de asignación de tasa de transmisión basada en pricing (con propuestas de pricing exponencial y lineal) con el objetivo de satisfacer el enlace ascendente de los usuarios en LTE. También se contempla la existencia de usuarios maliciosos, que pretenden utilizar el ancho de banda WiFi contra sus iguales para transmitir menos datos a través del enlace ascendente de LTE (menos eficiente energéticamente). Para ello se propone un método basado en la reputación que combate el funcionamiento egoísta (selfish).Postprint (published version

Passive network tomography for erroneous networks: A network coding approach

Passive network tomography uses end-to-end observations of network communication to characterize the network, for instance to estimate the network topology and to localize random or adversarial glitches. Under the setting of linear network coding this work provides a comprehensive study of passive network tomography in the presence of network (random or adversarial) glitches. To be concrete, this work is developed along two directions: 1. Tomographic upper and lower bounds (i.e., the most adverse conditions in each problem setting under which network tomography is possible, and corresponding schemes (computationally efficient, if possible) that achieve this performance) are presented for random linear network coding (RLNC). We consider RLNC designed with common randomness, i.e., the receiver knows the random code-books all nodes. (To justify this, we show an upper bound for the problem of topology estimation in networks using RLNC without common randomness.) In this setting we present the first set of algorithms that characterize the network topology exactly. Our algorithm for topology estimation with random network errors has time complexity that is polynomial in network parameters. For the problem of network error localization given the topology information, we present the first computationally tractable algorithm to localize random errors, and prove it is computationally intractable to localize adversarial errors. 2. New network coding schemes are designed that improve the tomographic performance of RLNC while maintaining the desirable low-complexity, throughput-optimal, distributed linear network coding properties of RLNC. In particular, we design network codes based on Reed-Solomon codes so that a maximal number of adversarial errors can be localized in a computationally efficient manner even without the information of network topology.Comment: 40 pages, under submission for IEEE Trans. on Information Theor

Non-Orthogonal Signal and System Design for Wireless Communications

The thesis presents research in non-orthogonal multi-carrier signals, in which: (i) a new signal format termed truncated orthogonal frequency division multiplexing (TOFDM) is proposed to improve data rates in wireless communication systems, such as those used in mobile/cellular systems and wireless local area networks (LANs), and (ii) a new design and experimental implementation of a real-time spectrally efficient frequency division multiplexing (SEFDM) system are reported. This research proposes a modified version of the orthogonal frequency division multiplexing (OFDM) format, obtained by truncating OFDM symbols in the time-domain. In TOFDM, subcarriers are no longer orthogonally packed in the frequency-domain as time samples are only partially transmitted, leading to improved spectral efficiency. In this work, (i) analytical expressions are derived for the newly proposed TOFDM signal, followed by (ii) interference analysis, (iii) systems design for uncoded and coded schemes, (iv) experimental implementation and (v) performance evaluation of the new proposed signal and system, with comparisons to conventional OFDM systems. Results indicate that signals can be recovered with truncated symbol transmission. Based on the TOFDM principle, a new receiving technique, termed partial symbol recovery (PSR), is designed and implemented in software de ned radio (SDR), that allows efficient operation of two users for overlapping data, in wireless communication systems operating with collisions. The PSR technique is based on recovery of collision-free partial OFDM symbols, followed by the reconstruction of complete symbols to recover progressively the frames of two users suffering collisions. The system is evaluated in a testbed of 12-nodes using SDR platforms. The thesis also proposes channel estimation and equalization technique for non-orthogonal signals in 5G scenarios, using an orthogonal demodulator and zero padding. Finally, the implementation of complete SEFDM systems in real-time is investigated and described in detail

Modelling and Analysis of Smart Grids for Critical Data Communication

Practical models for the subnetworks of smart grid are presented and analyzed. Critical packet-delay bounds for these subnetworks are determined, with the overall objective of identifying parameters that would help in the design of smart grid with least end-to-end delay. A single-server non-preemptive queueing model with prioritized critical packets is presented for Home Area Network (HAN). Closed-form expressions for critical packet delay are derived and illustrated as a function of: i) critical packet arrival rate, ii) service rate, iii) utilization factor, and iv) rate of arrival of non-critical packets. Next, wireless HANs using FDMA and TDMA are presented. Upper and lower bounds on critical packet delay are derived in closed-form as functions of: i) average of signal-to interference-plus-noise ratio, ii) random channel scale, iii) transmitted power strength, iv) received power strength, v) number of EDs, vi) critical packet size, vii) number of channels, viii) path loss component, ix) distances between electrical devices and mesh client, x) channel interference range, xi) channel capacity, xii) bandwidth of the channel, and xiii) number of time/frequency slots. Analytical and simulation results show that critical packet delay is smaller for TDMA compared to FDMA. Lastly, an Intelligent Distributed Channel-Aware Medium Access Control (IDCA-MAC) protocol for wireless HAN using Distributed Coordination Function (DCF) is presented. The protocol eliminates collision and employs Multiple Input Multiple Output (MIMO) system to enhance system performance. Simulation results show that critical packet delay can be reduced by nearly 20% using MA-Aware protocol compared to IDCA-MAC protocol. However, the latter is superior in terms throughput. A wireless mesh backbone network model for Neighbourhood Area Network (NAN) is presented for forwarding critical packets received from HAN to an identified gateway. The routing suggested is based on selected shortest path using Voronoi tessellation. CSMA/CA and CDMA protocols are considered and closed{form upper and lower bounds on critical packet delay are derived and examined as functions of i) signal-to-noise ratio, ii) signal interference, iii) critical packet size, iv) number of channels, v) channel interference range, vi) path loss components, vii) channel bandwidth, and viii) distance between MRs. The results show that critical packet delay to gateway using CDMA is lower compared to CSMA/CA protocol. A fiber optic Wide Area Network (WAN) is presented for transporting critical packets received from NAN to a control station. A Dynamic Fastest Routing Strategy (DFRS) algorithm is used for routing critical packets to control station. Closed-form expression for mean critical packet delay is derived and is examined as a function of: i) traffic intensity, ii) capacity of fiber links, iii) number of links, iv) variance of inter-arrival time, v) variance of service time, and vi) the latency of links. It is shown that delay of critical packets to control station meets acceptable standards set for smart grid