Network coding in wireless networks
T Ho2006
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
AI
AI
Network coding improves throughput in wireless networks. When applied to battery driven devices, like wireless sensor nodes, it extends the network lifetime. Network coding reduces the energy consumption by minimizing the number of transmissions required to communicate a given amount of information across the network. However, aggressive application of network coding adversely affects the network lifetime. We illustrate this trade off in this paper, and
Related papers
Network coding for wireless communication networks
IEEE Journal on Selected Areas in Communications, 2009
Practical network coding in wireless networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking - MobiCom '07, 2007
Network coding is seen as a promising technique to improve network throughput. In this paper, we study two important problems in localized network coding in wireless networks, which only requires each node to know about and coordinate with one-hop neighbors. In particular, we first establish a condition that is both necessary and sufficient for useful coding to be possible. We show this condition is much weaker than expected, and hence allows a variety of coding schemes to suit different network conditions and application preferences. Based on the understanding we establish, we are able to design a robust coding technique called loop coding that can improve network throughput and TCP throughput simultaneously.
Network Coding
2008
Network coding promises to significantly impact the way communications networks are designed, operated, and understood. This book presents a unified and intuitive overview of the theory, applications, challenges, and future directions of this emerging field, and is a must-have resource for those working in wireline or wireless networking. • Uses an engineering approach - explains the ideas and practical techniques • Covers mathematical underpinnings, practical algorithms, code selection, security, and network management • Discusses key topics of inter-session (non-multicast) network coding, lossy networks, lossless networks, and subgraph-selection algorithms Starting with basic concepts, models, and theory, then covering a core subset of results with full proofs, Ho and Lun provide an authoritative introduction to network coding that supplies both the background to support research and the practical considerations for designing coded networks. This is an essential resource for gradu...
Wireless network coding: An innovative technology
2013 International Conference on Green Computing, Communication and Conservation of Energy (ICGCE), 2013
Network coding is a new technology that motivates us to rethink about networking in wireless networks. Network coding of wireless helps to improve the performance networks. The existing network infrastructure will not support to the network coding communications. This concept requires us modifying the existing network communications. In this paper we brief the principles of network coding, network coding techniques, benefits and applications. We also discuss the current research topics of interest and the issues related to network coding aware routing in wireless ad hoc networks and we also present the simulation results which describe the energy gain and number of transmissions in traditional routing versus network coding.
Network and Traffic Design Aspects in Network-Coding-Enabled Wireless Networks
International Journal of Computers Communications & Control, 2019
Practical experience of using opportunistic network coding has already been gained in several real network deployments, indicating the influence of some of the fundamental characteristics of the network and the traffic load. However, these aspects have not been systematically investigated in the scope of the construction of efficient and robust large-scale network-coding-enabled wireless mesh networks. In this paper we focus on these aspects using an example of two opportunistic networkcoding procedures: the well-known COPE and the Bearing Opportunistic Network coding (BON). In addition, the design aspects for network-coding-enabled wireless mesh networks and applications are discussed. We have shown that opportunistic network coding can improve the performance of different networks and supported applications in terms of throughput, delay and jitter, although the benefits are not significant in all the cases. Thus, the use of opportunistic network coding should be considered upfront during the wireless network design phase in order to obtain the greatest benefits.
Bounds on the Benefit of Network Coding: Throughput and Energy Saving in Wireless Networks
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications
In this paper we establish fundamental limitations to the benefit of network coding in terms of energy and throughput in multihop wireless networks. Thereby we adopt two well accepted scenarios in the field: single multicast session and multiple unicast sessions. Most of our results apply to arbitrary wireless network and are, in particular, not asymptotic in kind. In terms of throughput and energy saving we prove that the gain of network coding of a single multicast session is at most a constant factor. Also, we present a lower bound on the expected number of transmissions of multiple unicast sessions under an arbitrary network coding. We identify scenarios for which the network coding gain for energy saving becomes surprisingly close to 1, in some cases even exactly 1, corresponding to no benefit at all. Interestingly, we prove that the gain of network coding in terms of transport capacity is bounded by a constant factor π in any arbitrary wireless network and for all traditional channel models. This shows that the traditional bounds on the transport capacity [1]-[4] do not change more than constant factor π if we employ network coding. As a corollary, we find that the gain of network coding on the throughput of large scale homogeneous wireless networks is asymptotically bounded by a constant. Note that our result is more general than the previous work [5] and it is obtained by a different technique. In conclusion, we show that in contrast to wired networks, the network coding gain in wireless networks is constraint by fundamental limitations.
Applications of network coding in global routing
2009 IEEE International Conference on IC Design and Technology, 2009
We study the applications of the network coding technique for interconnect optimization and improving the routability of VLSI designs. Network coding technique generalizes the traditional routing approach by enabling the intermediate nodes to generate new signals by combining the signals received over their incoming wires. This is in contrast to the traditional (routing) approach, in which each intermediate node can only forward the incoming signals. While the traditional methods of interconnect routing have attracted a large body of research, applications of network coding in VLSI design have received a relatively little interest from the research community. Accordingly, in this paper we focus on establishing efficient coding networks for VLSI designs. The paper makes the following contributions. First, we extend the Hanan theorem for multi-net rectilinear coding networks. Second, we present several heuristic solutions for finding near-optimal coding networks. Finally, we perform an extensive simulation study to evaluate the advantage of network coding over the traditional routing solutions and to identify routing instances where the network coding techniques are expected to be beneficial. Our results show that network coding can help to reduce the required wirelenght, in particular in the congested areas and in the presence of blockages.
Energy Efficiency Optimzation in Wireless Network Coding
In both wired and wireless networks, network coding provides important benefits such as minimized latency and energy consumption, unrepeated use of same channel, maximized bit rate, improved transmissions efficiency in used network, increased throughput and efficiently managed bandwidth. This paper provides an in-depth background on the theoretic details of network coding, adopts a more practical oriented approach to implementation, and concentrates on the impact of network coding in a dynamically changing wireless environment using distributed algorithms that do not have knowledge of the network environment. Specifically, we focus on energy optimization, which is the amount of energy required to transfer a unit of information from one source to several receivers simultaneously. The model for the proposed system is derived and simulated using the dynamic forwarding factor and transmission power efficiency. Simulation results show that our model could offer network coding benefits of...
Energy Efficient Routing and Network Coding in Core Networks
arXiv (Cornell University), 2019
We propose network coding as an energy efficient data transmission technique in core networks with non-bypass and bypass routing approaches. The improvement in energy efficiency is achieved through reduction in the traffic flows passing through intermediate nodes. A mixed integer linear program (MILP) is developed to optimize the use of network resources, and the results show that our proposed network coding approach introduces up to 33% power savings for the non-bypass case compared with the conventional architectures. For the bypass case, 28% power savings are obtained considering futuristic network components power consumption. A heuristic based on the minimum hop count routing shows power savings comparable to the MILP results. Furthermore, we study how the change in network topology affects the savings produced by network coding. The results show that the savings are proportional to the average hop count of the network topology. We also derive power consumption analytic bounds and closed form expressions for networks that implement network coding and thus also verify the results obtained by the MILP model.
A Practical Perspective of Wireless Network Coding
Wireless networks are one of the most essential components of the communication networks. In contrast to the wired networks, the inherent broadcast nature of wireless networks provides a breeding ground for both opportunities and challenges ranging from security to reliability. Moreover, energy is a fundamental design constraint in wireless networks. The boom of wireless network is closely coupled with the schemes that can reduce energy consumption. Network coding for the wireless networks is seen as a potential candidate scheme that can help overcome the energy and security challenges while providing significant benefits. This paper presents a basic model for formulating network coding problem in wireless setting. Since the optimal solution to wireless network coding is NP (nondeterministic polynomial-time)-hard, we intend to explore the impact of different parameters with random and non-random solutions. We present extensive simulation to show the strength of random network coding scheme in general wireless network scenarios. This study provide a comprehensive insight into the limits of wireless network coding.
Related topics
Related papers
Performance Analysis of Utilizing Coding Nodes in Wireless Networks
2012 International Symposium on Telecommunication Technologies (ISTT)
Network Coding is a method that effectively combines several packets from different sources and broadcasts the combined packet to several destinations in single transmission time slot. Each destination is capable to extract the intended information by decoding from a common packet. In short, network coding is a method that improves the throughput for wireless networks and wired networks. However, while it increases the throughput of networks, it also causes side effects such as complexity of packets management and increased delay for coding opportunity. In this paper, genetic algorithm is proposed to optimize the resources for network coding. Genetic algorithm will search for suitable routes to the destination according to the desired throughput with a desired multicast rate. The simulation results show that the average end to end delay of network after minimizing coding nodes is less than normal network coding.
A joint routing and coding approach to linear network coding
2011 Wireless Advanced, 2011
Adopting a cross-layer approach, in this paper we propose an algorithm for joint routing and network coding. The proposed algorithm jointly assigns routes and designs linear network codes over finite fields to achieve the capacity of the network. The algorithm has a dynamic programming approach where a cost function is used to assign weights to all edges in the network. The cheapest flow is chosen subject to certain encoding constraints in order to achieve the network capacity with network coding while minimizing the network complexity. The effectiveness of the algorithm is demonstrated through carefully chosen examples. We show that the constraints imposed by the joint routing and coding algorithm are necessary for successful decoding at the sinks, and their violation can lead to a failure in achieving the network capacity or an increase in the number of encoding nodes.
Performance Trade-offs in a Network Coding Router
We consider the problem of optimizing the performance of a network coding router with two stochastic flows. We develop a queueing model which accounts for the fact that coding is not performed when packets are transmitted, but is done by a separate program or hardware which operates independently of the hardware that sends packets out over links. We formulate and solve a constrained optimization problem which provides the optimal time that the router should wait before sending the information that it has uncoded, so that the average response time of the system is minimized. The trade-offs between delay and bandwidth or energy associated with the choice of the waiting time are also investigated, and the results indicate that network coding offers significant performance gains in a moderate to heavily loaded system.
Energy Minimization through Network Coding for Lifetime Constrained Wireless Networks
International Conference on Computer Communications and Networks, 2008
Energy management is the key issue in the design and operation of wireless network applications like sensor net- works, pervasive computing and ubiquitous computing where the network is primarily driven by battery-powered embedded devices. This paper studies network coding as an energy min- imization technique. Network coding reduces the energy con- sumption by minimizing the number of transmissions required to
Network Coding: A Brief Tutorial
2007
Network coding is a new paradigm that is promising to change the way networking is done. In network coding intermediate nodes combine different packets to exploit more bandwidth and throughput. In addition, network coding reduces both delay and energy requirements.
Network Coding for Sensor Networks, Distributed Storage and Video Streaming
2010
The classical store-and-forward routing has and will continue to be the most important routing architecture in many modern packet-switched communication networks. In a packet-switched network, data is sent in the form of discrete packets that traverse hop-by-hop from a source to a destination. At each intermediate hop, the router stores and examines the packets it receives then forwards them
Network Coding Protocols with Delay and Energy Constraints
2014
Network coding is a technique that proposes a different approach for the protocol design in data communication networks. Thus, the nodes in the network are allowed not only to store and forward data packets, but also to process and mix different packets in a single coded packet. By using this technique, the throughput and robustness of the network can be significantly improved. However, the transmission delay of network coding is still not well understood. In real-time communication systems with stringent delay constraints, understanding the transmission delay distribution is at the core of implementing network coding in practical scenarios. Moreover, the benefits of network coding for broadcast scenarios have been proven, but the use of this technique in data gathering applications is limited. Unlike broadcast applications, where the main objective is to minimize the transmission delay, in data gathering applications the challenge is to reduce the data collection time, called the c...
Centrality-based network coding node selection mechanism for improving network throughput
16th International Conference on Advanced Communication Technology, 2014
The problem of minimizing the number of coding nodes is caused by network coding overhead and is proved to be NP-hard. To resolve this issue, this paper proposes Centralitybased Network Coding Node Selection (CNCNS) that is the heuristic and distributed mechanism to minimize the number of network coding (NC) nodes without compromising the achievable network throughput. CNCNS iteratively analyses the node centrality and selects NC node in the specific area. Since CNCNS operates with distributed manner, it can dynamically adapt the network status with approximately minimizing network coding nodes. Especially, CNCNS adjusts the network performance of network throughput and reliability using control indicator. Simulation results show that the well selected network coding nodes can improve the network throughput and almost close to throughput performance of a system where all network nodes operate network coding.
A Comparison of Wireless Node Topologies for Network Coding Using Practical Path-Loss Models
2010 Ninth International Conference on Networks, 2010
In this paper we discuss the physical arrangement of wireless nodes to form topologies suitable for the implementation of Network Coding. Boundaries for the most favorable placement of the nodes to form Bow-Tie and Butterfly network coding suitable topologies, are mathematically calculated with a logdistance model. Simulations in OPNET Modeler were conducted with these node positions in mind, in order to verify the practicality of implementing network coding in these two network topologies. We provide results indicating the trade-off between reduced network load and higher end-to-end delay for the Bow-Tie topology while the Butterfly topology only experience gains with no trade-off.
Special issue on network coding
EURASIP Journal on Advances in Signal Processing, 2017
Future networks are expected to depart from traditional routing schemes in order to embrace network coding (NC)-based schemes. These have created a lot of interest both in academia and industry in recent years. Under the NC paradigm, symbols are transported through the network by combining several information streams originating from the same or different sources. This special issue contains thirteen papers, some dealing with design aspects of NC and related concepts (e.g., fountain codes) and some showcasing the application of NC to new services and technologies, such as data multi-view streaming of video or underwater sensor networks. One can find papers that show how NC turns data transmission more robust to packet losses, faster to decode, and more resilient to network changes, such as dynamic topologies and different user options, and how NC can improve the overall throughput. This issue also includes papers showing that NC principles can be used at different layers of the networks (including the physical layer) and how the same fundamental principles can lead to new distributed storage systems. Some of the papers in this issue have a theoretical nature, including code design, while others describe hardware testbeds and prototypes.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.