Multiplex communications – Network configuration determination
Reexamination Certificate
2005-06-28
2010-12-28
Shah, Chirag G (Department: 2477)
Multiplex communications
Network configuration determination
C370S310000, C370S349000, C709S238000
Reexamination Certificate
active
07860025
ABSTRACT:
Each mobile router in an ad hoc mobile network is configured for concurrently attaching to multiple parents advertising respective parent depths relative to a clusterhead of the ad hoc mobile network. The mobile router selects an advertised depth relative to the clusterhead based on adding a prescribed increment to a maximum one of the parent depths, enabling the mobile routers to form a directed acyclic graph relative to the clusterhead. Each mobile router sends to each of its parents a neighbor advertisement message specifying at least one reachable prefix, a corresponding cost for reaching the reachable prefix, and a corresponding sequence identifier that enables the parents to validate the neighbor advertisement message relative to stored router entries. Hence, mobile routers automatically can form a directed acylic graph relative to the clusterhead, and can distribute routing information with minimal overhead.
REFERENCES:
patent: 5251205 (1993-10-01), Callon et al.
patent: 5881246 (1999-03-01), Crawley et al.
patent: 6865184 (2005-03-01), Thubert et al.
patent: 7006453 (2006-02-01), Ahmed et al.
patent: 2002/0141346 (2002-10-01), Garcia-Luna-Aceves et al.
patent: 2003/0202465 (2003-10-01), Cain
patent: 2004/0032852 (2004-02-01), Thubert et al.
patent: 2004/0081152 (2004-04-01), Thubert et al.
patent: 2005/0265259 (2005-12-01), Thubert et al.
patent: 2006/0010249 (2006-01-01), Sabesan et al.
patent: 2006/0101157 (2006-05-01), Eardley
patent: 2006/0133328 (2006-06-01), Levendel et al.
patent: 2006/0227724 (2006-10-01), Thubert et al.
patent: 2006/0291485 (2006-12-01), Thubert et al.
patent: 1 324 532 (2003-07-01), None
patent: WO 2005/010214 (2005-02-01), None
Badache et al., “Le routage dans les réseaux mobiles ad hoc”,Ministère De L'Enseignement Supérieur Et De La Recherche Scientifique, Sep. 2000, <http://opera/inrialpes.fr/people/Tayeb.Lemlouma/Papers/AdHocRouting.pdf>.
U.S. Appl. No. 10/856,809, filed Jun. 1, 2004, Thubert et al.
Ernst et al., “Network Mobility Support Terminology” <draft-ernst-monet-terminology-00.txt> IETF Internet Draft. Feb. 2002.
Baker, “An outsider's view of MANET” <draft-baker-manet-review-01> Network Working Group Internet Draft, Mar. 17, 2002.
Moy, “OSPF Version 2”, Network Working Group Request for Comments: 2178, Jul. 1997.
Perkins et al., “Ad hoc On-Demand Distance Vector (AODV) Routing” <draft-ietf-manet-aodv-13.txt> Mobile Ad Hoc Networking Working Group Internet Draft.
Johnson et al., “The Dynamic Source Routing Protocol” <draft-ietf-manet-dsr-09.txt> IETF MANET Working Group Internet Draft, Apr. 15, 2003.
Garcia-Luna-Aceves et all, “Source Tree Adaptive Routing (STAR) Protocol” <draft-ietf-manet-star-00.txt> IETF MANET Working Group Internet Draft, Oct. 22.
Park et al., “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks”, Proceedings of IEEE INFOCOM '97, (1997).
Park et al., “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks”, Proceedings of IEEE INFOCOM '97, (1997) (Powerpoint Presentation by Xin Zhang).
Thubert et al. “Nested Nemo Tree Discovery” <draft-thubert-tree-discovery-01.txt> NEMO Working group Internet Draft, Oct. 11, 2004.
Perkins, ed.,Ad Hoc Networking, 2001, pp. 255-298, Addison-Wesley, USA.
Ribiere Vincent Jean
Thubert Pascal
Wetterwald Patrick
Cisco Technology Inc.
Rivas Salvador E
Shah Chirag G
Turkevich Leon R.
LandOfFree
Directed acyclic graph discovery and network prefix... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Directed acyclic graph discovery and network prefix..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Directed acyclic graph discovery and network prefix... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4216104