Design and Reliability Performance Evaluation of Network Coding Schemes for Lossy Wireless Networks

This thesis investigates lossy wireless networks, which are wireless communication networks consisting of lossy wireless links, where the packet transmission via a lossy wireless link is successful with a certain value of probability. In particular, this thesis analyses all-to-all broadcast in lossy wireless networks, where every node has a native packet to transmit to all other nodes in the network. A challenge of all-to-all broadcast in lossy wireless networks is the reliability, which is defined as the probability that every node in the network successfully obtains a copy of the native packets of all other nodes. In this thesis, two novel network coding schemes are proposed, which are the neighbour network coding scheme and the random neighbour network coding scheme. In the two proposed network coding schemes, a node may perform a bit-wise exclusive or (XOR) operation to combine the native packet of itself and the native packet of its neighbour, called the coding neighbour, into an XOR coded packet. The reliability of all-to-all broadcast under both the proposed network coding schemes is investigated analytically using Markov chains. It is shown that the reliability of all-to-all broadcast can be improved considerably by employing the proposed network coding schemes, compared with non-coded networks with the same link conditions, i.e. same probabilities of successful packet transmission via wireless channels. Further, the proposed schemes take the link conditions of each node into account to maximise the reliability of a given network. To be more precise, the first scheme proposes the optimal coding neighbour selection method while the second scheme introduces a tuning parameter to control the probability that a node performs network coding at each transmission. The observation that channel condition can have a significant impact on the performance of network coding schemes is expected to be applicable to other network coding schemes for lossy wireless networks

Design and Reliability Performance Evaluation of Network Coding Schemes for Lossy Wireless Networks

This thesis investigates lossy wireless networks, which are wireless communication networks consisting of lossy wireless links, where the packet transmission via a lossy wireless link is successful with a certain value of probability. In particular, this thesis analyses all-to-all broadcast in lossy wireless networks, where every node has a native packet to transmit to all other nodes in the network. A challenge of all-to-all broadcast in lossy wireless networks is the reliability, which is defined as the probability that every node in the network successfully obtains a copy of the native packets of all other nodes. In this thesis, two novel network coding schemes are proposed, which are the neighbour network coding scheme and the random neighbour network coding scheme. In the two proposed network coding schemes, a node may perform a bit-wise exclusive or (XOR) operation to combine the native packet of itself and the native packet of its neighbour, called the coding neighbour, into an XOR coded packet. The reliability of all-to-all broadcast under both the proposed network coding schemes is investigated analytically using Markov chains. It is shown that the reliability of all-to-all broadcast can be improved considerably by employing the proposed network coding schemes, compared with non-coded networks with the same link conditions, i.e. same probabilities of successful packet transmission via wireless channels. Further, the proposed schemes take the link conditions of each node into account to maximise the reliability of a given network. To be more precise, the first scheme proposes the optimal coding neighbour selection method while the second scheme introduces a tuning parameter to control the probability that a node performs network coding at each transmission. The observation that channel condition can have a significant impact on the performance of network coding schemes is expected to be applicable to other network coding schemes for lossy wireless networks

Achieving reliable and enhanced communication in vehicular ad hoc networks (VANETs)

A thesis submitted to the University of Bedfordshire in partial fulfilment of the requirement for the degree of Doctor of PhilosophyWith the envisioned age of Internet of Things (IoTs), different aspects of Intelligent Transportation System (ITS) will be linked so as to advance road transportation safety, ease congestion of road traffic, lessen air pollution, improve passenger transportation comfort and significantly reduce road accidents. In vehicular networks, regular exchange of current position, direction, speed, etc., enable mobile vehicle to foresee an imminent vehicle accident and notify the driver early enough in order to take appropriate action(s) or the vehicle on its own may take adequate preventive measures to avert the looming accident. Actualizing this concept requires use of shared media access protocol that is capable of guaranteeing reliable and timely broadcast of safety messages. This dissertation investigates the use of Network Coding (NC) techniques to enrich the content of each transmission and ensure improved high reliability of the broadcasted safety messages with less number of retransmissions. A Code Aided Retransmission-based Error Recovery (CARER) protocol is proposed. In order to avoid broadcast storm problem, a rebroadcasting vehicle selection metric η, is developed, which is used to select a vehicle that will rebroadcast the received encoded message. Although the proposed CARER protocol demonstrates an impressive performance, the level of incurred overhead is fairly high due to the use of complex rebroadcasting vehicle selection metric. To resolve this issue, a Random Network Coding (RNC) and vehicle clustering based vehicular communication scheme with low algorithmic complexity, named Reliable and Enhanced Cooperative Cross-layer MAC (RECMAC) scheme, is proposed. The use of this clustering technique enables RECMAC to subdivide the vehicular network into small manageable, coordinated clusters which further improve transmission reliability and minimise negative impact of network overhead. Similarly, a Cluster Head (CH) selection metric ℱ(\u1d457) is designed, which is used to determine and select the most suitably qualified candidate to become the CH of a particular cluster. Finally, in order to investigate the impact of available radio spectral resource, an in-depth study of the required amount of spectrum sufficient to support high transmission reliability and minimum latency requirements of critical road safety messages in vehicular networks was carried out. The performance of the proposed schemes was clearly shown with detailed theoretical analysis and was further validated with simulation experiments

Conception d'un modèle novateur améliorant la performance dans les réseaux de la sécurité publique sur LTE hétérogènes

Durant les situations d’urgences, la disponibilité des moyens de télécommunications est cruciale et indispensable pour les usagers des réseaux de la Sécurité Publique (PSN). En revanche, durant de tels moments, le besoin en échange d’information croît d’une façon spectaculaire. Par conséquent, l’accès au médium radio devient congestionné très rapidement. Malheureusement, durant ces moments, les ressources dédiées aux réseaux (PSN) ne semblent pas être suffisantes pour satisfaire toutes les requêtes d’établissement des nouveaux bearers. Les réseaux LTE viennent donc contribuer à la résolution de cette problématique, en offrant l’accès à la Radio Commerciale Partagée pour le réseau PSN, avec une certaine priorisation, afin d’améliorer les communications PSN lors des situations d’urgences. Néanmoins, cet accès ne doit pas accaparer toutes les ressources du réseau commercial. De plus, la technologie LTE permet l’utilisation des communications Device-to-Device qui consiste à échanger l’information directement entre les équipements sans avoir à passer par l’eNodeB. Les communications D2D doivent donc être exploitées pour contourner les problèmes de congestion, surtout lors des désastres. Par ailleurs, l’amélioration de la performance des réseaux PSN ne se limite pas dans la gestion efficace des ressources radio. L’allocation des ressources de bande passante au niveau du réseau Backhaul et du réseau coeur LTE doit aussi être améliorée. Dans cette thèse un nouveau modèle novateur a été conçu pour l’amélioration de la performance dans les réseaux de la sécurité publique sur les réseaux LTE hétérogènes. Ce modèle qui compte dix solutions, intervient sur les trois réseaux composant le réseau LTE, à savoir le réseau d’accès, le réseau Backhaul et le réseau coeur LTE. Nos différentes solutions ont toutes été validées par simulations, et ont toutes apporté une amélioration par rapport à aux approches classiques ou par rapport à d’autres approches existantes dans la littérature

Exploiting Network Coding in Lossy Wireless Networks

Users increasingly depend on Wireless LANs (WLANs) for business and entertainment. It is well-known that wireless links are error-prone and require retransmissions to recover from errors and packet losses. Previous work proposed to use network coding (NC) for more efficient MAC-layer retransmissions in WLANs. However, their design is independent from underlying physical layer and MAC capabilities and algorithms. These independent design may result in inefficient utilization of network coding gain, or even impair system performance. This dissertation presents a practical network coding-aided MAC layer retransmission scheme, namely XOR Rescue (XORR). Unlike previous independent network coding design, XORR provides a global approach by integrating the utilization of network coding, adaptation to time-varying wireless channel, fairness, and multi-rate transmission in wireless networks. The main characteristic of XORR is opportunism: each node relies on local information to detect the best transmission/retransmission and exploits the benefits provided by both network coding and multiuser diversity whenever they arise. Th

XOR Rescue: Exploiting Network Coding in Lossy Wireless Networks

Users increasingly depend on WLAN for business and entertainment. It is well-recognized that wireless links are prone to errors. Previous work, ER, proposed to use network coding (NC) for providing more ef cient MAC-layer retransmission scheme in WLAN. However, it uses inef cient and costly reception report scheme and does not consider the effect of heterogenous and time-varying wireless conditions and fairness. These issues are critical for getting full bene ts of network coding. We show that, without addressing them, NC may even cause negative effect on the system. In this paper, we present a novel MAC-layer retransmission scheme, namely XORR, which uses reception estimation without extra overhead and adopts NC-aware opportunistic scheduling with maintaining temporal fairness in WLAN. We prove our NC-aware scheduling algorithm is fair and it will always improve the expected goodput for each wireless clients. We further verify XORR with extensive simulation as well as experiment studies and nd that our scheme outperforms traditional opportunistic scheduling (without NC) and 802.11 about 25 % and 40%, respectively. 1