Network Coding-Based Broadcast in Mobile Ad-hoc Networks

Li, Li; Ramjee, Ramachandran; Buddhikot, Milind M.; Miller, Scott C.

doi:10.1109/infcom.2007.203

Cited by 136 publications

(135 citation statements)

References 8 publications

Supporting

Mentioning

134

Contrasting

Unclassified

Order By: Relevance

“…The proposed inter-sessions network coding approach in [43] is a distributed method that relies only on local 2-hop information. It is an appropriate scheme for the case of a delay-tolerant network.…”

Section: Summary and Discussionmentioning

confidence: 99%

“…CODEB The problem of minimizing the number of transmissions in all-to-all broadcasting is addressed in [43]. All-to-all broadcasting is a special case of broadcasting, in which all node broadcast their respective packets to all other nodes.…”

Section: Inter-session Network Codingmentioning

confidence: 99%

“…In more detail, each relay node with a set of packets in its output queue tries to find a subset of the packets to XOR, such that the number of native packets in the coded packet are maximized. In [43], it is shown that this problem is NP-hard. Therefore, a greedy algorithm is proposed.…”

Section: Inter-session Network Codingmentioning

confidence: 99%

“…It is assumed that a subset of nodes are the source nodes, and each packet has a deadline to be received by all nodes, and the nodes have multi-channel multi-radio capability capability. Similar to [43], this work combines PDP, which is a deterministic forwarding approach with binary network coding. In [43], if there is a deadline constraint, the relay nodes will send the received packets immediately, which may decrease coding opportunities.…”

Section: Inter-session Network Codingmentioning

confidence: 99%

“…Similar to [43], this work combines PDP, which is a deterministic forwarding approach with binary network coding. In [43], if there is a deadline constraint, the relay nodes will send the received packets immediately, which may decrease coding opportunities. In order to increase the coding opportunities, the authors in [49] propose three methods to compute the waiting time of the packets at the relay nodes, such that the packets meet the deadline constraints.…”

Section: Inter-session Network Codingmentioning

confidence: 99%

See 4 more Smart Citations

Network Coding Techniques for Wireless and Sensor Networks

Ostovari

Khreishah

2013

The Art of Wireless Sensor Networks

View full text Add to dashboard Cite

Network coding is a technique where relay nodes mix packets using mathematical operations, which reduces the number of transmitted packets. Network coding was first proposed for wired networks to solve the bottleneck problem and to increase the throughput. However, the broadcast nature of wireless networks and the diversity of the links make network coding more attractive in wireless networks. Network coding can be classified as either inter or intra-session. Inter-session network coding allows the packets from different sessions (sources) to be mixed to solve the bottleneck problem. In contrast, intra-session network coding, which can be used to address the packet loss problem, uses the diversity of the wireless links and mixes packets from the same sessions. In this chapter, we survey the recent works on network coding in both general wireless networks and wireless sensor networks. We present various network coding techniques, their assumptions, applications, as well as an overview of the proposed methods.

show abstract

Section: Summary and Discussionmentioning

confidence: 99%

Section: Inter-session Network Codingmentioning

confidence: 99%

Section: Inter-session Network Codingmentioning

confidence: 99%

Section: Inter-session Network Codingmentioning

confidence: 99%

Section: Inter-session Network Codingmentioning

confidence: 99%

See 3 more Smart Citations

Network Coding Techniques for Wireless and Sensor Networks

Ostovari

Khreishah

2013

The Art of Wireless Sensor Networks

View full text Add to dashboard Cite

show abstract

Nth best relay selection with network coding in two‐way relay systems

Han

Wang

Zhao

2012

Int J Communication

View full text Add to dashboard Cite

SUMMARYIn this paper, we propose an Nth best relay selection (Nth‐RS) scheme for analog network coding in two‐way relay systems. In traditional two‐way single‐relay selection schemes, only the best one is selected to forward network‐coded signals. However, in practical applications, the best relay may be unavailable because of the scheduling or overload constraints. In this case, we investigate a more general scheme, where the Nth best but available relay is selected. To evaluate the transmission of reliability, the expression of outage probability in exponential–integral form and its asymptotic expression in closed form are presented. Moreover, the upper bound and lower bound of outage probability are also derived. The analysis reveals that the diversity order of Nth‐RS equals to (M − N + 1), where M is the number of relay nodes, and the results are verified by simulations. In order to improve system performance, transmit power between sources and relay is optimally allocated to minimize the upper bound of outage probability under total power constraint. Simulation results show that Nth‐RS scheme with proposed power allocation can achieve substantial improvement over equal power allocation scheme. Copyright © 2012 John Wiley & Sons, Ltd.

show abstract

Broadcasting with hard deadlines in wireless multihop networks using network coding

Ostovari

Khreishah

2013

Wireless Communications

View full text Add to dashboard Cite

Broadcasting with network coding mixes packets to minimize the number of transmissions, which improves the energy efficiency of wireless networks. On the other hand, delaying the transmissions increases coding opportunities at intermediate nodes, but increases the delay of packets. In this paper, we consider these two contradicting factors and study the problem of minimizing the number of transmissions in wireless networks while meeting the deadline constraints. We show that this problem is NP-complete; therefore, we provide a heuristic to solve it. First, we construct broadcasting trees, each of them rooted at one source. We then specify overlapping conditions based on the constructed trees, to determine the number of transmissions each node has to perform without the deadline constraints. Then, we partition the set of packets such that coding is performed among the packets of the same partition, which does not result in deadline misses. Linear coding may not be applicable in some wireless networks because of its computational complexity. For these networks, we propose three XOR coding approaches which rely only on local neighborhood information. Simulation results show that our techniques not only reduce the number of transmissions, but also allow the majority of nodes to receive the packets on time.

show abstract

Network Coding-Based Broadcast in Mobile Ad-hoc Networks

Cited by 136 publications

References 8 publications

Network Coding Techniques for Wireless and Sensor Networks

Network Coding Techniques for Wireless and Sensor Networks

Nth best relay selection with network coding in two‐way relay systems

Broadcasting with hard deadlines in wireless multihop networks using network coding

Contact Info

Product

Resources

About