10,117 research outputs found
An Extended Network Coding Opportunity Discovery Scheme in Wireless Networks
Network coding is known as a promising approach to improve wireless network
performance. How to discover the coding opportunity in relay nodes is really
important for it. There are more coding chances, there are more times it can
improve network throughput by network coding operation. In this paper, an
extended network coding opportunity discovery scheme (ExCODE) is proposed,
which is realized by appending the current node ID and all its 1-hop neighbors'
IDs to the packet. ExCODE enables the next hop relay node to know which nodes
else have already overheard the packet, so it can discover the potential coding
opportunities as much as possible. ExCODE expands the region of discovering
coding chance to n-hops, and have more opportunities to execute network coding
operation in each relay node. At last, we implement ExCODE over the AODV
protocol, and efficiency of the proposed mechanism is demonstrated with NS2
simulations, compared to the existing coding opportunity discovery scheme.Comment: 15 pages and 7 figure
TCP-Aware Backpressure Routing and Scheduling
In this work, we explore the performance of backpressure routing and
scheduling for TCP flows over wireless networks. TCP and backpressure are not
compatible due to a mismatch between the congestion control mechanism of TCP
and the queue size based routing and scheduling of the backpressure framework.
We propose a TCP-aware backpressure routing and scheduling that takes into
account the behavior of TCP flows. TCP-aware backpressure (i) provides
throughput optimality guarantees in the Lyapunov optimization framework, (ii)
gracefully combines TCP and backpressure without making any changes to the TCP
protocol, (iii) improves the throughput of TCP flows significantly, and (iv)
provides fairness across competing TCP flows
Joint Channel Assignment and Opportunistic Routing for Maximizing Throughput in Cognitive Radio Networks
In this paper, we consider the joint opportunistic routing and channel
assignment problem in multi-channel multi-radio (MCMR) cognitive radio networks
(CRNs) for improving aggregate throughput of the secondary users. We first
present the nonlinear programming optimization model for this joint problem,
taking into account the feature of CRNs-channel uncertainty. Then considering
the queue state of a node, we propose a new scheme to select proper forwarding
candidates for opportunistic routing. Furthermore, a new algorithm for
calculating the forwarding probability of any packet at a node is proposed,
which is used to calculate how many packets a forwarder should send, so that
the duplicate transmission can be reduced compared with MAC-independent
opportunistic routing & encoding (MORE) [11]. Our numerical results show that
the proposed scheme performs significantly better that traditional routing and
opportunistic routing in which channel assignment strategy is employed.Comment: 5 pages, 4 figures, to appear in Proc. of IEEE GlobeCom 201
- …