Independent-tree ad hoc multicast routing

Details Independent-tree ad hoc multicast routing Independent-tree ad hoc multicast routing

2006-04-25

2006-04-25

Salad, Abdullahi E. (Department: 2157)

Electrical computers and digital processing systems: multicomput

Computer-to-computer data routing

Alternate path routing

C709S238000, C370S238000

Reexamination Certificate

active

07035937

ABSTRACT:
A routing protocol for a multicasting network, such as an ad hoc network, employs alternate tree or path computation algorithms that continually compute backup trees or paths that can be employed to replace failed trees or paths. The sets of alternate multicast trees or paths are preferably pre-calculated before a first tree or path fails to minimize delay in replacing a failed tree or path. Preferably, the algorithms are designed to compute the alternate multicast trees or paths in such a manner that they are maximally independent of the original set of trees and paths to minimize correlation between the original trees or paths and the replacement trees or paths and to possibly increase the useful time of the calculated trees. This helps insure that the replacement trees or paths will not be likely themselves to fail soon after failure of the original trees or paths.

REFERENCES:
patent: 6321270 (2001-11-01), Crawley
patent: 6721290 (2004-04-01), Kondylis et al.
patent: 6728205 (2004-04-01), Finn et al.
patent: 6732189 (2004-05-01), Novaes
patent: 6791981 (2004-09-01), Novaes
patent: 2001/0034793 (2001-10-01), Madruga et al.
patent: 2003/0193958 (2003-10-01), Narayanan
Ahmed et al, “A Collaborative Multicast Routing (CMR) Protocol for Hybrid Wireless Networks,” HRL Laboratories, LLC. (Malibu, CA), pp. 1-9.
Vaishampayan et al, “Efficient and Robust Multicast Routing in Mobile Ad Hoc Networks,” IEEE, 2004.
Ganguli et al, “An Improvement of ODMRP for Reliable Delivery of Busty Traffic,” IEEE, p. 5 pages.
Cooper, D.E. et al, “High Coverage Multicasting for Mobile Ad-hoc Networks,” School of Computing Science, University of Newcastle, pp. 1-12.
Wang, B. et al, “Adaptive Technique for Tree-based Multicasting in Wireless Ad Hoc Networks,” Department of Computer Science & Engineering, pp. 1-30.
Palanisamy, “Multicast Applications for Mobile Ad-Hoc Networks,” Department of Computer Science & Engineering, pp. 1-11.
Wang et al, “Source-based Energy-Efficient Multicasting in Wireless Ad Hoc Networks,” Department of Computer Science & Engineering, Arizona State University, pp. 1-32.
Liang, “Constructing Minimum-Energy Broadcast Trees In Wireless Ad Hoc Networks,” Department of Computer Science, The Australian National University, pp. 112-122.
Wieselthier et al, “Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks,” Mobile Networks & Applications, 2001, pp. 251-263.
Yasinsac et al, “Modeling Protocols for Secure Group Communication in Ad Hoc Networks,” Computer Science Department, Florida State University, pp. 1-10.
Li et al, “Broadcasting and Topology Control In Wireless Ad Hoc Networks,” Department of Computer Science, Illinois Inst. of Tech., pp. 1-27.
Bur et al, “Multicast Routing for Ad Hoc Networks with a Multiclass Scheme for Quality Service,” NETLAB, Dept. of Computer Engineering Bogazici University, pp. 10 pages.
Bakht, et al, “Multicasting in Mobile Ad-Hoc Networks,” School of Computing & Mathematical Sciences, Liverpool John Moores University, p. 6 pages.
Kindylis, et al, “Multicasting Sustained CBR and VBR Traffic in Wireless Ad-Hoc Networks,” HRL Laboratories, pp. 1-7.
Gui et al, “Scalable Multicasting in Mobile Ad Hoc Networks,” IEEE, 2004, pp. 11 pages.
Kunz et al, “Multicasting in Ad-Hoc Networks: Comparing MAODV and ODMRP,” Carleton University, pp. 11 pages.
Madruga, E., “Multicasting in Ad-Hoc Networks,” A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy, University of California, Santa Cruz, Sep. 2002, p. 145 pages.
Mudruga et al, “Scalable Multicasting: The Core-Assisted Mesh Protocol,” Computer Engineering Department, University of California, pp. 1-19.
Lee, et al, “A Performance Comparison Study of Ad Hoc Wireless Multicast Protocols,” Computer Science Department, University of California, pp. 10 pages.
Ge, et al, “Overlay Multicasting for Ad Hoc Networks,” Department of Computer Science & Engineering, University of California, pp. 131-143.
Mavinkurve, et al, “MIP3S: Algorithms for Power-Conserving Multicasting in Static Wireless Ad Hoc Networks,” Computer Science & Engineering Dept., State University of New York at Buffalo, p. 6 pages.
Vaishampayan, et al, “Roust Tree-based Multicasting in Ad hoc Networks,” Department of Computer Science, University of California Santa Cruz, p. 6 pages.
Girici et al, “Multicasting of Connectionless Traffic in Resource—Limited Ad Hoc Wireless Networks,” Dept. of Electrical & Computer Eng., University of Maryland at College Park, p. 5 pages.
O'Neill et al, “Optimal Routes and Flows in Multicasting over Ad Hoc Networks,” Department of Electrical Engineering, Stanford Universty, pp. 1-5.
Gui et al, “Scalable Multicasting in Mobile Ad Hoc Networks,” IEEE, 2004, p. 11 pages.

Affiliated with

Also associated with

Rating

Independent-tree ad hoc multicast routing does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Independent-tree ad hoc multicast routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Independent-tree ad hoc multicast routing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3614468