Determining two node-disjoint paths using on-demand flooding

Details Determining two node-disjoint paths using on-demand flooding Determining two node-disjoint paths using on-demand flooding

2008-03-25

2008-03-25

Shah, Chirag G. (Department: 2616)

Multiplex communications

Network configuration determination

Using a particular learning algorithm or technique

C370S238000, C370S248000, C370S400000

Reexamination Certificate

active

10670052

ABSTRACT:
The present disclosure relates to determining and establishing at least two node disjoint paths, and, more specifically, to determining and establishing at least two node disjoint paths within a wireless ad-hoc network that includes a source and a target node using on-demand flooding.

REFERENCES:
patent: 6061736 (2000-05-01), Rochberger et al.
patent: 6751746 (2004-06-01), Jain et al.
patent: 7046634 (2006-05-01), Wong et al.
patent: 2004/0022224 (2004-02-01), Billhartz
patent: 2005/0036486 (2005-02-01), Sahinoglu et al.
patent: 2005/0243757 (2005-11-01), Yagyu et al.
patent: 2006/0221834 (2006-10-01), Schollmeier et al.

Affiliated with

Also associated with

Rating

Determining two node-disjoint paths using on-demand flooding does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Determining two node-disjoint paths using on-demand flooding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determining two node-disjoint paths using on-demand flooding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3908456