Multipath forwarding algorithms using network coding

Multiplex communications – Communication over free space – Having a plurality of contiguous regions served by...

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S237000, C370S235000, C370S321000, C370S337000, C370S458000, C370S328000

Reexamination Certificate

active

07912003

ABSTRACT:
A method of transmitting data across a wireless mesh network is described which uses network coding at each of the intermediate nodes between the source node and the destination node. Each intermediate node also controls the rate at which it broadcasts packets based on link congestion and the backlog of packets at each of the possible next-hop nodes for the data flow.

REFERENCES:
patent: 6714787 (2004-03-01), Reed et al.
patent: 2006/0146716 (2006-07-01), Lun et al.
patent: 2006/0146875 (2006-07-01), Yang
patent: 2006/0245442 (2006-11-01), Srikrishna et al.
patent: 2006/0251062 (2006-11-01), Jain et al.
patent: 2007/0066315 (2007-03-01), Kado
patent: 2007/0081603 (2007-04-01), Jang et al.
patent: WO 2006/071187 (2006-07-01), None
patent: WO 2007/008123 (2007-01-01), None
patent: WO2007035462 (2007-03-01), None
Biswas, et. al., “ExOR Opportunistic Multi-Hop routing for Wireless Networks”, SIGCOMM'05, Aug. 21-26, 2005, Philadelphia, Pennsylvania, USA.
Chaporkar, et al., “Throughout Guarantees Through Maximal Scheduling in Wireless Networks”, 43rd Allerton conference, 2005.
Deb, et. al., “Network Coding for Wireless Applications: A Breif Tutorial”, Coorinated Science Laboratory, University of Illinois at Urbana-Champaign, Lucent Bell Laboratories, Data Compression Laboratory, California Institute of Technology Computer Science & Artificial Intelligence Laboratory, Massachusetts Institute of Technology.
Ho, et al., “Online Incremental Network Coding for Multiple Unicasts”, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign.
Katti, et al., “Network Coding Made Practical”, Computer Science and Artificial Intelligence Laboratory Technical Report, MIT-CSAIL-TR-2006-009, Feb. 16, 2006.
Katti, et al., “XORs In The Air: Practical Wireless Network Coding”.
Li, et al., “Network Coding in Unidirected Networks”, Department of Electrical and Computer Engineering, University of Toronto.
Li, et al., “Network Coding: The Case of Multiple Unicast Sessions”, Department of Electrical and Computer Engineering, University of Toronto.
Lun, et al., “Achieving Minimum-Cost Multicast: A Decentralized Approach Based on Network Coding”.
Lun, et al., “Network Coding for Efficient Wireless Unicast”.
Lun, et al., “On Coding for Reliable Communication Over Packet Networks”.
Ramoorthy, et al., “On the Capacity of Network Coding for Random Networks”, IEEE Transactions on Information Theory, vol. 51, No. 8, Aug. 2005.
Raniwala, et al., “Centralized Channel Assignment & Routing Algorithms for Multi-Channel Wireless Mesh Networks”.
Tassiulas, et al., “Stability Properties of Constrained Queuing Systems and Scheduling Policies for Maximum Throughput in Multihop Radio Networks”, IEEE Transactions on Automatic Control, vol. 37, No. 12, Dec. 1992.
Wu, et al., “Information Exchange in Wireless Networks with Network Coding and Physical-Layer Broadcast”, Technical Report MSR-TR-2004-78, Aug. 2004.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Multipath forwarding algorithms using network coding does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Multipath forwarding algorithms using network coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multipath forwarding algorithms using network coding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2758212

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.