213,895 research outputs found
Low Complexity All-Optical Network Coder Architecture
Network coding, a networking paradigm in which
different pieces of data are coded together at various points along
a transmission, has been proposed for providing a number of
benefits to networks including increased throughput, robustness,
and security. For optical networks, the potential for using
network coding to provide survivability is especially noteworthy
as it may be possible to allow for the ultra-fast recovery time
of dedicated protection schemes with the bandwidth efficiency
of shared protection schemes. However, the need to perform
computations at intermediate nodes along the optical route leads
to the undesirable necessity of either electronically buffering and
processing the data at intermediate nodes or outfitting the network
with complex photonic circuits capable of performing the
computations entirely within the optical domain. In this paper,
we take the latter approach but attempt to mitigate the impact of
the device complexity by proposing a low-complexity, all-optical
network coder architecture. Our design provides easily scalable,
powerful digital network coding capabilities at the optical layer,
and we show that existing network coding algorithms can be
adjusted to accommodate it
Multi-user video streaming using unequal error protection network coding in wireless networks
In this paper, we investigate a multi-user video streaming system applying unequal error protection (UEP) network coding (NC) for simultaneous real-time exchange of scalable video streams among multiple users. We focus on a simple wireless scenario where users exchange encoded data packets over a common central network node (e.g., a base station or an access point) that aims to capture the fundamental system behaviour. Our goal is to present analytical tools that provide both the decoding probability analysis and the expected delay guarantees for different importance layers of scalable video streams. Using the proposed tools, we offer a simple framework for design and analysis of UEP NC based multi-user video streaming systems and provide examples of system design for video conferencing scenario in broadband wireless cellular networks
Optimal Algorithms for Near-Hitless Network Restoration via Diversity Coding
Diversity coding is a network restoration technique which offers near-hitless
restoration, while other state-of-the art techniques are significantly slower.
Furthermore, the extra spare capacity requirement of diversity coding is
competitive with the others. Previously, we developed heuristic algorithms to
employ diversity coding structures in networks with arbitrary topology. This
paper presents two algorithms to solve the network design problems using
diversity coding in an optimal manner. The first technique pre-provisions
static traffic whereas the second technique carries out the dynamic
provisioning of the traffic on-demand. In both cases, diversity coding results
in smaller restoration time, simpler synchronization, and much reduced
signaling complexity than the existing techniques in the literature. A Mixed
Integer Programming (MIP) formulation and an algorithm based on Integer Linear
Programming (ILP) are developed for pre-provisioning and dynamic provisioning,
respectively. Simulation results indicate that diversity coding has
significantly higher restoration speed than Shared Path Protection (SPP) and
p-cycle techniques. It requires more extra capacity than the p-cycle technique
and SPP. However, the increase in the total capacity is negligible compared to
the increase in the restoration speed.Comment: An old version of this paper is submitted to IEEE Globecom 2012
conferenc
In-Network Processing For Mission-Criticalwireless Networked Sensing And Control: A Real-Time, Efficiency, And Resiliency Perspective
As wireless cyber-physical systems (WCPS) are increasingly being deployed in mission-critical applications, it becomes imperative that we consider application QoS requirements in in-network processing (INP). In this dissertation, we explore the potentials of two INP methods, packet packing and network coding, on improving network performance while satisfying application QoS requirements. We find that not only can these two techniques increase the
energy efficiency, reliability, and throughput of WCPS while satisfying QoS requirements of applications in a relatively static environment, but also they can provide low cost proactive protection against transient node failures in a more dynamic wireless environment.
We first study the problem of jointly optimizing packet packing and the timeliness of data delivery. We identify the conditions under which the problem is strong NP-hard, and we find that the problem complexity heavily depends on aggregation constraints instead of network and traffic properties. For cases when the problem is NP-hard, we show that there is no polynomial-time approximation scheme (PTAS); for cases when the problem can be solved in polynomial time, we design polynomial time, offline algorithms for finding the optimal packet packing schemes. We design a distributed, online protocol tPack that schedules packet transmissions to maximize the local utility of packet packing at each node. We evaluate the properties of tPack in NetEye testbed. We find that jointly optimizing data delivery timeliness and packet packing and considering real-world aggregation constraints significantly improve network performance.
We then work on the problem of minimizing the transmission cost of network coding based routing in sensor networks. We propose the first mathematical framework so far as we know on how to theoretically compute the expected transmission cost of NC-based routing in terms of expected number of transmission. Based on this framework, we design a polynomial-time greedy algorithm for forwarder set selection and prove its optimality on transmission cost minimization. We designed EENCR, an energy-efficient NC-based routing protocol that implement our forwarder set selection algorithm to minimize the overall transmission cost. Through comparative study on EENCR and other state-of-the-art routing protocols, we show that EENCR significantly outperforms CTP, MORE and CodeOR in delivery reliability, delivery cost and network goodput.
Furthermore, we study the 1+1 proactive protection problem using network coding. We show that even under a simplified setting, finding two node-disjoint routing braids with minimal total cost is NP-hard. We then design a heuristic algorithm to construct two node-disjoint braids with a transmission cost upper bounded by two shortest node-disjoint paths. And we design ProNCP, a proactive NC-based protection protocol using similar design philosophy as in EENCR. We evaluate the performance of ProNCP under various transient network failure scenarios. Experiment results show that ProNCP is resilient to various network failure scenarios and provides a state performance in terms of reliability, delivery cost and goodput.
Our findings in this dissertation explore the challenges, benefits and solutions in designing real-time, efficient, resilient and QoS-guaranteed wireless cyber-physical systems, and our solutions shed lights for future research on related topics
Frequency Rendezvous and Physical Layer Network Coding for Distributed Wireless Networks
In this thesis, a transmission frequency rendezvous approach for secondary users deployed in decentralized dynamic spectrum access networks is proposed. Frequency rendezvous is a critical step in bootstrapping a wireless network that does not possess centralized control. Current techniques for enabling frequency rendezvous in decentralized dynamic spectrum access networks either require pre-existing infrastructure or use one of several simplifying assumptions regarding the architecture, such as the use of regularly spaced frequency channels for communications. Our proposed approach is designed to be operated in a strictly decentralized wireless networking environment, where no centralized control is present and the spectrum does not possess pre-defined channels. In our proposed rendezvous algorithm, the most important step is pilot tone detection and receiver query. In order to realize a shortest search time for the target receiver, an efficient scanning rule should be employed. In this thesis, three scanning rules are proposed and evaluated, namely: frequency sequence scanning, pilot tone strength scanning, and cluster scanning. To validate our result, we test our scanning rules with actual paging band spectrum measurements. Previous research on security of network coding focuses on the protection of data dissemination procedures and the detection of malicious activities such as pollusion attacks. The capabilities of network coding to detect other attacks has not been fully explored. In this thesis, a new mechanism based on physical layer network coding to detect wormhole attacks is proposed. When two signal sequences collide at the receiver, the difference between the two received sequences is determined by its distances to the senders. Therefore, by comparing the differences between the received sequences at two nodes, we can estimate the distance between them and detect those fake neighbor connections through wormholes. While the basic idea is clear, we design many schemes at both physical and network layers to turn the idea into a practical approach. Simulations using BPSK modulation at the physical layer show that the wireless nodes can effectively detect fake neighbor connections without the adoption of any special hardware on them
Instantly Decodable Network Coding for Real-Time Scalable Video Broadcast over Wireless Networks
In this paper, we study a real-time scalable video broadcast over wireless
networks in instantly decodable network coded (IDNC) systems. Such real-time
scalable video has a hard deadline and imposes a decoding order on the video
layers.We first derive the upper bound on the probability that the individual
completion times of all receivers meet the deadline. Using this probability, we
design two prioritized IDNC algorithms, namely the expanding window IDNC
(EW-IDNC) algorithm and the non-overlapping window IDNC (NOW-IDNC) algorithm.
These algorithms provide a high level of protection to the most important video
layer before considering additional video layers in coding decisions. Moreover,
in these algorithms, we select an appropriate packet combination over a given
number of video layers so that these video layers are decoded by the maximum
number of receivers before the deadline. We formulate this packet selection
problem as a two-stage maximal clique selection problem over an IDNC graph.
Simulation results over a real scalable video stream show that our proposed
EW-IDNC and NOW-IDNC algorithms improve the received video quality compared to
the existing IDNC algorithms
- …