Browsing by Subject "Network Coding"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Exploring Link Correlation for Performance Improvements in Wireless Networks(2017-02) Wang, ShuaiIn wireless communication, many technologies, such as Wi-Fi, BlueTooth and ZigBee, operate in the same ISM band. With the exponential growth of wireless devices, the ISM band becomes more and more crowded. These wireless devices compete with each other to access spectrum resources, generating cross-technology interference (CTI). Since cross-technology interference may destroy wireless communication, the field is facing an urgent and challenging need to investigate the packet reception quality of wireless links under CTI. In this dissertation, we propose an in-depth systematic study from empirical measurement, theoretical analysis, modeling, to design and implementation of protocols that exploit packet reception patterns of wireless links under cross-technology interference. Based on extensive measurements, we exploit link correlation phenomenon that packet receptions from a transmitter to multiple receivers are correlated. We then propose link correlation model which contradicts the widely made link independent assumption. The proposed model has a broad impact on network designs that utilize concurrent wireless links, which include (i) traditional network protocols such as broadcast, and (ii) diversity-based protocols such as network coding and opportunistic routing. In the study of the impact of link correlation model on traditional network protocols, we present the design and implementation of CorLayer, a general supporting layer for energy efficient reliable broadcast that carefully blacklists certain poorly correlated wireless links. We integrate CorLayer transparently with sixteen state-of-the-art broadcast protocols specified in thirteen publications on three physical testbeds running TelosB, MICAz, and GreenOrbs nodes, respectively. The experimental results show that CorLayer remarkably improves energy efficiency across a wide spectrum of broadcast protocols and that the total number of packet transmissions can be reduced consistently by 47% on average. In the study of the impact of link correlation model on diversity-based protocols, we propose link correlation aware network coding and link correlation aware opportunistic routing. In link correlation aware network coding, we introduce Correlated Coding which seeks to optimize the transmission efficiency by maximizing necessary coding opportunities. In link correlation aware opportunistic routing, we propose a novel candidate forwarder selection algorithm to help opportunistic routing fully exploit the diversity benefit of the wireless broadcast medium. Testbed evaluation and extensive simulation show that the traditional network coding and opportunistic routing protocols’ transmission efficiency is significantly improved with our link correlation model.Item Secure and robust overlay content distribution.(2010-10) Kang, Hun JeongWith the success of applications spurring the tremendous increase in the volume of data transfer, efficient and reliable content distribution has become a key issue. Peer-to-peer (P2P) technology has gained popularity as a promising approach to large-scale content distribution due to its benefits including self-organizing, load-balancing, and fault-tolerance. Despite these strengths, P2P systems also present several challenges such as performance guarantees, reliability, efficiency, and security. In P2P systems deployed on a large scale, these challenges are more difficult to deal with because of the large number of participants, unreliable user behaviors, and unexpected situations. This thesis explores solutions to improve the efficiency, robustness, and security of large-scale P2P content distribution systems, focusing on three particular issues: lookup, practical network coding, and secure network coding. A distributed hash table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. This thesis focuses on improving the lookup performance of Kademlia DHT protocol. Although many studies have proposed DHTs to provide a means of organizing and locating peers to many distributed systems, to the best of my knowledge, Kademlia is a unique DHT deployed on an Internet-scale in the real world. This study evaluates the lookup performance of Kad (a variation of Kademlia) deployed in one of the largest P2P file-sharing networks. The measurement study shows that lookup results are not consistent; only 18% of nodes located by storing and searching lookups are the same. This lookup inconsistency problem leads to poor performance and the inefficient use of resources during lookups. This study identifies the underlying reasons for this inconsistency problem and the poor performance of lookups, and proposes solutions to guarantee reliable lookup results while providing the efficient use of resources. This thesis studies the practicality of network coding to facilitate cooperative content distribution. Network coding is a new data transmission technique which allows any nodes in a network to encode and distribute data. It is a good solution offering reliability and efficiency in distributing content, but the usefulness of network coding is still in dispute because of its dubious performance gains and coding overhead in practice. With the implementation of network coding in a real-world application, this thesis measures the performance and overhead of network coding for content distribution in practice. This study also provides a lightweight yet efficient encoding scheme which allows network coding to provide improved performance and robustness with negligible overhead. Network coding is a promising data transmission technique. However, the use of network coding also poses security vulnerabilities by allowing untrusted nodes to produce new encoded data. Network coding is seriously vulnerable to pollution attacks where malicious nodes inject false corrupted data into a network. Because of the nature of the network coding, even a single unfiltered false data block may propagate widely in the network and disrupt correct decoding on many nodes, by being mixed with other correct blocks. Since blocks are re-coded in transit, traditional hash or signature schemes do not work with network coding. Thus, this thesis introduces a new homomorphic signature scheme which efficiently verifies encoded data on-the-fly and comes with desirable features appropriate for P2P content distribution. This scheme can protect network coding from pollution attacks without delaying downloading processes.