Drake University

Displaying 1-2 of 2 results

  • White Papers // Mar 2011

    Classifying Networks for Network Coding

    Network coding is a relatively recent development in the realm of maximizing information transfer in communications and computer networks. Traditional networks operate by simply storing and forwarding data along. Network coding, however, allows intermediate network nodes to combine data using arithmetic operations. In many instances, this can lead to more...

    Provided By Drake University

  • White Papers // Jan 2010

    Distributed Routing Algorithms for Wireless Ad Hoc Networks Using D-Hop Connected D-Hop Dominating Sets

    This paper describes a distributed algorithm for producing a variety of sets of nodes that can be used to form the backbone of an ad hoc wireless network. The backbone produced is a d-hop dominating set, and in special cases is also d-hop connected and has a desirable shortest path...

    Provided By Drake University

  • White Papers // Mar 2011

    Classifying Networks for Network Coding

    Network coding is a relatively recent development in the realm of maximizing information transfer in communications and computer networks. Traditional networks operate by simply storing and forwarding data along. Network coding, however, allows intermediate network nodes to combine data using arithmetic operations. In many instances, this can lead to more...

    Provided By Drake University

  • White Papers // Jan 2010

    Distributed Routing Algorithms for Wireless Ad Hoc Networks Using D-Hop Connected D-Hop Dominating Sets

    This paper describes a distributed algorithm for producing a variety of sets of nodes that can be used to form the backbone of an ad hoc wireless network. The backbone produced is a d-hop dominating set, and in special cases is also d-hop connected and has a desirable shortest path...

    Provided By Drake University