Spelling suggestions: "subject:"network foding"" "subject:"network eoding""
61 |
Wireless Network Coding with Intelligent Reflecting SurfacesKafizov, Amanat 04 1900 (has links)
Conventional wireless techniques are becoming inadequate for beyond fifth-generation (5G) networks due to latency and bandwidth considerations. To increase the wireless network throughput and improve wireless communication systems’ error performance, we propose physical layer network coding (PNC) in an Intelligent Reflecting Surface (IRS)-assisted environment. We consider an IRS-aided butterfly network, where we propose an algorithm for obtaining the optimal IRS phases. Also, analytic expressions for the bit error rate (BER) are derived. The numerical results demonstrate that the scheme proposed in this thesis significantly enhances the BER performance. The proposed scheme is compared to traditional network coding without IRS. For instance, at a target BER of 10−3, 28 dB and 0.75 dB signal to noise ratio (SNR) gains are achieved at the relay and destination node of the 32-element IRS-assisted butterfly network model.
|
62 |
ImplementingDistributed Storage System by Network Coding in Presence of Link FailureChareonvisal, Tanakorn January 2012 (has links)
Nowadays increasing multimedia applications e.g., video and voice over IP, social networks and emails poses higher demands for sever storages and bandwidth in the networks. There is a concern that existing resource may not able to support higher demands and reliability. Network coding was introduced to improve distributed storage system. This thesis proposes the way to improve distributed storage system such as increase a chance to recover data in case there is a fail storage node or link fail in a network. In this thesis, we study the concept of network coding in distributed storage systems. We start our description from easy code which is replication coding then follow with higher complex code such as erasure coding. After that we implement these concepts in our test bed and measure performance by the probability of success in download and repair criteria. Moreover we compare success probability for reconstruction of original data between minimum storage regenerating (MSR) and minimum bandwidth regenerating (MBR) method. We also increase field size to increase probability of success. Finally, link failure was added in the test bed for measure reliability in a network. The results are analyzed and it shows that using maximum distance separable and increasing field size can improve the performance of a network. Moreover it also improves reliability of network in case there is a link failure in the repair process.
|
63 |
Network coding applications to high bit-rate satellite networksGiambene, G., Muhammad, M., Luong, D.K., Bacco, M., Gotta, A., Celandroni, N., Jaff, Esua K., Susanto, Misfa, Hu, Yim Fun, Pillai, Prashant, Ali, Muhammad, de Cola, T. January 2015 (has links)
No / Satellite networks are expected to support multimedia traffic flows, offering high capacity with QoS guarantees. However, system efficiency is often impaired by packet losses due to erasure channel effects. Reconfigurable and adaptive air interfaces are possible solutions to alleviate some of these issues. On the other hand, network coding is a promising technique to improve satellite network performance. This position paper reports on potential applications of network coding to satellite networks. Surveys and preliminary numerical results are provided on network coding applications to different exemplary satellite scenarios. Specifically, the adoption of Random Linear Network Coding (RLNC) is considered in three cases, namely, multicast transmissions, handover for multihomed aircraft mobile terminals, and multipath TCP-based applications. OSI layers on which the implementation of networking coding would potentially yield benefits are also recommended.
|
64 |
Network coding for multicast communications over satellite networksJaff, Esua K., Susanto, Misfa, Ali, Muhammad, Pillai, Prashant, Hu, Yim Fun January 2015 (has links)
No / Random packet errors and erasures are common in satellite
communications. These types of packet losses could become significant in
mobile satellite scenarios like satellite-based aeronautical communications
where mobility at very high speeds is a routine. The current adaptive coding
and modulation (ACM) schemes used in new satellite systems like the DVBRCS2
might offer some solutions to the problems posed by random packet
errors but very little or no solution to the problems of packet erasures where
packets are completely lost in transmission. The use of the current ACM
schemes to combat packet losses in a high random packet errors and erasures
environment like the satellite-based aeronautical communications will result in
very low throughput. Network coding (NC) has proved to significantly improve
throughput and thus saves bandwidth resources in such an environment. This
paper focuses on establishing how in random linear network coding (RLNC)
the satellite bandwidth utilization is affected by changing values of the
generation size, rate of packet loss and number of receivers in a satellite-based
aeronautical reliable IP multicast communication. From the simulation results,
it shows that the bandwidth utilization generally increases with increasing
generation size, rate of packet loss and number of receivers.
|
65 |
OPTIMAL CODING AND SCHEDULING TECHNIQUES FOR BROADCASTING DEADLINE CONSTRAINT TRAFFIC OVER UNRELIABLE WIRELESS CHANNELSGangammanavar, Harshavardhana J. January 2009 (has links)
No description available.
|
66 |
Un codage réseau contraint pour les réseaux de capteurs sans fil / Constrained network coding for wireless sensor networksSalhi, Ismail 04 April 2012 (has links)
Les réseaux de communication inter-machines font partie des grandes évolutions de l'informatique contemporaine. Ces réseaux évolutifs promettent une nouvelle gamme de services et une meilleure connaissance du monde qui nous entoure. Pourtant, ils subissent plusieurs limitations de par la nature même des nœuds qui les composent : un débit faible et une fiabilité réduite dues aux contraintes en termes de capacité de calcul et de mémoire, une durée de vie limitée, ainsi que des délais non bornés souvent causés par des taux de perte élevés. Ces mêmes problématiques constituent, depuis une quinzaine d'années, un frein au déploiement à large échelle des réseaux de capteurs dans le monde réel. De récents développements dans la théorie de l'information sont finalement en train de bouleverser l'ordre établi, donnant naissance à une nouvelle approche connue sous le nom de théorie du codage réseau. Cette nouvelle façon d'acheminer l'information transforme les méthodes d'exploitation, de gestion et même la compréhension des réseaux de communications actuels et futurs. C'est dans ce contexte, que nous proposons dans cette thèse d'étudier l'impact, les bénéfices et la faisabilité du codage réseau dans les réseaux de capteurs sans fil. L'objectif étant de montrer l'intérêt d'exploiter ses concepts pour les différents paradigmes propres aux réseaux inter-machines en général, et aux réseaux de capteurs en particulier. Il s'agit dans un premier temps d'évaluer les apports prospectifs du codage réseau, qu'il soit linéaire ou opportuniste, strictement en termes de performances (i.e., latence et débit). Dans une seconde partie, nous poursuivrons notre étude en traitant de l'impact du codage réseau sur la fiabilité des réseaux de capteurs, ces derniers étant caractérisés par l'absence de mécanismes de contrôle de flux de bout-en-bout. Dans une dernière contribution, nous explorons la faisabilité dans une plateforme réelle, d'un mécanisme de codage réseau contraint spécifiquement conçu pour les réseaux à faible débit. Ce code opportuniste, est centré sur l'optimisation mémoire et l'efficacité énergétique. Il permet à la fois, d'améliorer les performances du réseau mais aussi sa fiabilité. De manière plus générale, cette thèse se présente comme une réponse à la question : « Quel type de codage, pour quels réseaux de capteurs ? » Elle ne prétend pas être l'unique réponse, mais propose néanmoins des briques théoriques et technologiques qui illustrent à la fois, la faisabilité du codage réseau dans les réseaux contraints, mais aussi la nécessité de l'adapter à leurs critères / Today, it is likely that Machine-to-machine (M2M) architectures are the future of computer networks. These communication systems promise new strains of pervasive services and a better awareness of the world around us. However, they suffer several limitations caused by the very nature of their components: a low data-rate, unreliable transmissions, limited storage and processing capabilities, finite lifespan and unpredictable delays often caused by a high packet loss rate. These are the same issues that are still preventing, since the late eighties, the awaited large-scale deployment of wireless sensor networks in the world of telecommunications. Recent developments in the Information Theory are finally bringing a wind of change on the common ways of considering data communications, via a new concept known as the Network Coding Theory. This new data delivery approach is transforming the way we operate, manage and even understand existing and future communications networks. In this context, we propose in this thesis to study the impact, benefits and feasibility of network coding in wireless sensor networks. Our goal is to evaluate the cost/benefit value of its practical concepts for different M2M network paradigms in general, and for sensor networks in particular. Primarily, we assess the potential impact of opportunistic and linear network coding on sensor networks strictly in terms of performance (i.e., data rate and latency). Then we address the problem of reliable communications in coded sensor networks, since such systems are characterized by the absence of end-to-end flow control mechanisms. In the last chapter, we explore the feasibility of network coding in a real testbed. We investigate how an innovative coding technique specifically designed for low-power/low-rate networks can use opportunistic coding to enhance the performance and the reliability of the network. More broadly, this thesis presents one answer to the question: “Which network coding for what sensor network?” It does not claim to be the sole answer to this issue, but rather a series of theoretical and technological blocks that denote both the feasibility of network coding in constrained environments and also the need to adapt it to their particular criteria
|
67 |
Network Coding for Wirless Relaying and Wireline NetworksVijayvaradharaj, T M January 2014 (has links) (PDF)
Network coding has emerged as an attractive alternative to routing because of the through put improvement it provides by reducing the number of channel uses. In a wireless scenario, in addition, further improvement can be obtained through Physical layer Network Coding (PNC), a technique in which nodes are allowed to transmit simultaneously, instead of transmitting in orthogonal slots. In this thesis, the design and analysis of network coding schemes are considered, for wireless two-way relaying, multi-user Multiple Access Relay Channel (MARC) and wireline networks.
In a wireless two-way relay channel with PNC, the simultaneous transmissions of user nodes result in Multiple Access Interference (MAI) at there lay node. The harmful effect of MAI is the presence of signal set dependent deep channel fade conditions, called singular fade states, under which the minimum distance of the effective constellation at the relay become zero. Adaptively changing the network coding map used at the relay according to channel conditions greatly reduces the impact of this MAI. In this work, we obtain these adaptive PNC maps, which are finite in number ,by completing partially filled Latin Squares and using graph vertex coloring. Having obtained the network coding maps, the set of all possible channel realizations is quantized into a finite number of regions, with a specific network coding map chosen in a particular region and such a quantization is obtained analytically for 2λ-PSK signal set. The performance of the adaptive PNC scheme for two-way relaying is analyzed and tight high SNR upper bounds are obtained for the average end-to-end symbol error probability, in terms of the average error probability of a point-to-point fading channel. The adaptive PNC scheme is generalized for two-way relaying with multiple antennas at the nodes.
As an alternative to the adaptive PNC scheme for two-way relaying, a Distributed Space Time Coding (DSTC) scheme is proposed, which effectively re-moves the effect of singular fade states at the transmitting nodes itself without any Channel State Information at the Transmitter (CSIT), and without any need to change the PNC map as a function of channel fade conditions. It is shown that the singular fade states can be viewed equivalently as vector subspaces of C2, which are referred to as the singular fade subspaces. DSTC design criterion to minimize the number of singular fade subspaces and maximize the coding gain is formulated and explicit low decoding complexity DSTC designs are provided.
For the K-user MARC, in which K source nodes want to transmit messages to a destination node D with the help of are lay node R, a new PNC scheme is proposed. Use of a many-to-one PNC map with conventional minimum squared Euclidean distance decoding at D, results in a loss of diversity order due to error propagation from the relay node. To counter this, we propose a novel low complexity decoder which offers the maximum diversity order of two.
Next, we consider wire line networks and explore the connections between linear network coding, linear index coding and discrete polymatroids, which are the multi-set analogue of matroids.
We define a discrete polymatroidal network and show that a fractional vector linear solution over a field Fq exists for a network if and only if the network is discrete polymatroidal with respect to a discrete polymatroid representable over Fq.An algorithm to construct networks starting from certain class of discrete polymatroids is provided. Every representation over Fq for the discrete polymatroid, results in a fractional vector linear solution over Fq for the constructed network.
It is shown that a linear solution to an index coding problem exists if and only if there exists a representable discrete polymatroid satisfying certain conditions which are determined by the index coding problem considered. El Rouayheb et. al. showed that the problem of finding a multi-linear representation for a matroid can be reduced to finding a perfect linear index coding solution for an index coding problem obtained from that matroid. Multi-linear representation of a matroid can be viewed as a special case of representation of an appropriate discrete polymatroid. We generalize the result of El Rouayheb et. al. by showing that the problem of finding a representation for a discrete polymatroid can be reduced to finding a perfect linear index coding solution for an index coding problem obtained from that discrete polymatroid.
|
68 |
On Network Coding and Network-Error CorrectionPrasad, Krishnan January 2013 (has links) (PDF)
The paradigm of network coding was introduced as a means to conserve bandwidth (or equivalently increase throughput) in information flow networks. Network coding makes use of the fact that unlike physical commodities, information can be replicated and coded together at the nodes of the network. As a result, routing can be strictly suboptimal in many classes of information flow networks compared to network coding. Network-error correction is the art of designing network codes such that the sinks of the network will be able to decode the required information in the presence of errors in the edges of the network, known as network-errors. The network coding problem on a network with given sink demands can be considered to have the following three major subproblems, which naturally also extend to the study of network-error correcting codes, as they can be viewed as a special class of network codes (a) Existence of a network code that satisfies the demands (b) Efficient construction of such a network code (c) Minimum alphabet size for the existence of such a network code.
This thesis primarily considers linear network coding and error correction and in- vestigates solutions to these issues for certain classes of network coding and error correction problems in acyclic networks. Our contributions are broadly summarised as follows.
(1) We propose the use of convolutional codes for multicast network-error correc- tion. Depending upon the number of network-errors required to be corrected in the network, convolutional codes are designed at the source of the multicast network so that these errors can be corrected at the sinks of the networks as long as they are separated by certain number of time instants (for which we give a bound). In con- trast to block codes for network-error correction which require large field sizes, using convolutional codes enables the field size of the network code to be small. We discuss the performance of such networks under the BSC edge error model.
(2)Existing construction algorithms of block network-error correcting codes require a rather large field size, which grows with the size of the network and the number of sinks, and thereby can be prohibitive in large networks. In our work, we give an algorithm which, starting from a given network-error correcting code, can obtain an- other network code using a small field, with the same error correcting capability as the original code. The major step in our algorithm is to find a least degree irreducible poly- nomial which is coprime to another large degree polynomial. We utilize the algebraic properties of finite fields to implement this step so that it becomes much faster than the brute-force method. A recently proposed algorithm for network coding using small fields can be seen as a special case of our algorithm for the case of no network-errors.
(3)Matroids are discrete mathematical objects which generalize the notion of linear independence of sets of vectors. It has been observed recently that matroids and network coding share a deep connection, and several important results of network coding has been obtained using these connections from matroid theory. In our work, we establish that matroids with certain special properties correspond to networks with error detecting and correcting properties. We call such networks as matroidal error detecting (or equivalently, correcting) networks. We show that networks have scalar linear network-error detecting (or correcting) codes if and only if there are associated with representable matroids with some special properties. We also use these ideas to construct matroidal error correcting networks along with their associated matroids. In the case of representable matroids, these algorithms give rise to scalar linear network- error correcting codes on such networks. Finally we also show that linear network coding is not sufficient for the general network-error detection (correction) problem with arbitrary demands.
(4)Problems related to network coding for acyclic, instantaneous networks have been extensively dealt with in the past. In contrast, not much attention has been paid to networks with delays. In our work, we elaborate on the existence, construction and minimum field size issues of network codes for networks with integer delays. We show that the delays associated with the edges of the network cannot be ignored, and in fact turn out to be advantageous, disadvantageous or immaterial, depending on the topology of the network and the network coding problem considered. In the process, we also show multicast network codes which involve only delaying the symbols arriving at the nodes of the networks and coding the delayed symbols over a binary field, thereby making coding operations at the nodes less complex.
(5) In the usual network coding framework, for a given set of network demands over an arbitrary acyclic network with integer delays assumed for the links, the out- put symbols at the sink nodes, at any given time instant, is a Fq-linear combination of the input symbols generated at different time instants where Fq denotes the field over which the network operates. Therefore the sinks have to use sufficient memory elements in order to decode simultaneously for the entire stream of demanded infor- mation symbols. We propose a scheme using an ν-point finite-field discrete fourier transform (DFT) which converts the output symbols at the sink nodes at any given time instant, into a Fq-linear combination of the input symbols generated during the same time instant without making use of memory at the intermediate nodes. We call this as transforming the acyclic network with delay into ν-instantaneous networks (ν is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (non-transform) approach if and only if there exists a network code satisfying sink demands in the transform approach.
|
69 |
Apport de la gestion des interférences aux réseaux sans-fil multi-sauts. Le cas du Physical-Layer Network Coding / Interference management in multi-hop wireless networksNaves, Raphaël 19 November 2018 (has links)
Fréquemment exploités pour venir en complément aux réseaux mobiles traditionnels, les réseaux sans-fil multi-sauts, aussi appelés réseaux ad-hoc, sont particulièrement mis à profit dans le domaine des communications d'urgence du fait de leur capacité à s'affranchir de toute infrastructure. Néanmoins, la capacité de ces réseaux étant limitée dès lors que le nombre d'utilisateurs augmente, la communauté scientifique s'efforce à en redéfinir les contours afin d'étendre leur utilisation aux communications civiles. La gestion des interférences, considérée comme l'un des principaux défis à relever pour augmenter les débits atteignables dans les réseaux sans-fil multi-sauts, a notamment connu un changement de paradigme au cours des dernières années. Alors qu'historiquement cette gestion est régie par les protocoles de la couche d'accès dont l'objectif consiste à éviter les interférences entre utilisateurs, il est désormais possible, grâce à différentes techniques avancées de communication numérique, de traiter ces interférences, et même de les exploiter. Ces techniques de transmission, dites techniques de gestion des interférences, viennent alors concurrencer les mécanismes d'ordonnancement traditionnels en autorisant plusieurs transmissions simultanées et dans la même bande de fréquence vers un même récepteur. Dans cette thèse, nous nous intéressons à l'une de ces techniques, le Physical-Layer Network Coding (PLNC), en vue de son intégration dans des réseaux ad-hoc composés de plusieurs dizaines de nœuds. Les premiers travaux se concentrant principalement sur des petites topologies, nous avons tout d'abord développé un framework permettant d'évaluer les gains en débit à large échelle du PLNC par rapport à des transmissions traditionnelles sans interférence. Motivés par les résultats obtenus, nous avons ensuite défini un nouveau cadre d'utilisation à cette technique visant à élargir sa sphère d'application. Le schéma de PLNC proposé, testé à la fois sur de vrais équipements radio et par simulation, s'est alors révélé offrir des gains significatifs en débit et en fiabilité en comparaison aux solutions existantes. / Frequently used to complement the traditional mobile networks, multi-hop wireless networks, also referred to as ad-hoc networks, are particularly useful in emergency situations due to the fact that they do not rely on any infrastructure. Nevertheless, as the capacity of such networks does not scale with the number of users, the scientific community has strived to rethink their use in order to extend their application to civil communications. For instance, long considered as one of the most formidable challenges in multi-hop wireless networks, interference management has recently undergone a paradigm shift. While interference management is traditionally carried out by the access layer protocols whose objective is to avoid interference between users, it is now possible to exploit the interference thanks to new advanced communication techniques. These transmission techniques, so-called interference management techniques, go against the communication paradigm underlying existing scheduling mechanisms by allowing multiple simultaneous transmissions to a common receiver in the same frequency band. In this thesis, we focus on one of these techniques, namely the Physical-Layer Network (PLNC), with the objective of integrating it in ad-hoc networks. Mostly studied from both the theoretical and practical perspective in small topologies, we first design a framework for quantifying the large-scale PLNC gains over the traditional interference-free transmissions. Driven by the obtained results, we introduce a solution to increase the PLNC sphere of operation in large multi-hop wireless networks. Our comprehensive evaluation methodology, including experimental testbed validations for credibility, as well as realistic simulations, show that the proposed PLNC scheme brings important gains in terms of throughput and reliability when compared to state-of-the-art approaches.
|
70 |
Wireless Broadcasting with Network CodingLu, Lu January 2011 (has links)
Wireless digital broadcasting applications such as digital audio broadcast (DAB) and digital video broadcast (DVB) are becoming increasingly popular since the digital format allows for quality improvements as compared to traditional analogue broadcast. The broadcasting is commonly based on packet transmission. In this thesis, we consider broadcasting over packet erasure channels. To achieve reliable transmission, error-control schemes are needed. By carefully designing the error-control schemes, transmission efficiency can be improved compared to traditiona lautomatic repeat-request (ARQ) schemes and rateless codes. Here, we first study the application of a novel binary deterministic rateless (BDR) code. Then, we focus on the design of network coding for the wireless broadcasting system, which can significantly improve the system performance compared to traditional ARQ. Both the one-hop broadcasting system and a relay-aided broadcasting system areconsidered. In the one-hop broadcasting system, we investigate the application of systematic BDR (SBDR) codes and instantaneously decodable network coding (IDNC). For the SBDR codes, we determine the number of encoded redundancy packets that guarantees high broadcast transmission efficiencies and simultaneous lowcomplexity. Moreover, with limited feedback the efficiency performance can be further improved. Then, we propose an improved network coding scheme that can asymptotically achieve the theoretical lower bound on transmission overhead for a sufficiently large number of information packets. In the relay-aided system, we consider a scenario where the relay node operates in half duplex mode, and transmissions from the BS and the relay, respectively, are over orthogonal channels. Based on random network coding, a scheduling problem for the transmissions of redundancy packets from the BS and the relay is formulated. Two scenarios; namely instantaneous feedback after each redundancy packet, and feedback after multiple redundancy packets are investigated. We further extend the algorithms to multi-cell networks. Besides random network coding, IDNC based schemes are proposed as well. We show that significant improvements in transmission efficiency are obtained as compared to previously proposed ARQ and network-coding-based schemes. / QC 20110907
|
Page generated in 0.0765 seconds