Multiplex communications – Communication over free space – Having a plurality of contiguous regions served by...
Reexamination Certificate
2005-09-06
2005-09-06
Vanderpuye, Kenneth (Department: 2661)
Multiplex communications
Communication over free space
Having a plurality of contiguous regions served by...
C370S238000, C370S338000
Reexamination Certificate
active
06940832
ABSTRACT:
The present invention provides a method for selecting and routing data in an ad-hoc mobile wireless network having a plurality of Nodes including multiple sources and destinations. The method includes sending a forward control packet from a source to the destination via at least one intermediate Node at intervals of time, where the intermediate Node is randomly selected. Each of the intermediate Nodes store weights of the neighbor Nodes. When the forward control packets reach the destination Node, they are evaluated in accordance with one or more given parameters and send back as backward control packets storing the evaluation results. As each of the intermediate Nodes receive the backward control packets, the weights of the corresponding neighbor Nodes are modified based on the stored evaluation results. Similarly, as the backward control packets are received at the source Nodes and the weights of the corresponding neighbor Nodes are modified based on the stored evaluation results. Finally, a group of routing routes to the destination are selected based on the modified weights of the neighbor Nodes and data packets are send from the source to the destination via the intermediate Nodes upon selection of the group.
REFERENCES:
patent: 5412654 (1995-05-01), Perkins
patent: 5987011 (1999-11-01), Toh
patent: 6304556 (2001-10-01), Haas
patent: 6338087 (2002-01-01), Okanoue
patent: 6535498 (2003-03-01), Larsson et al.
patent: 6718394 (2004-04-01), Cain
Elizabeth Royer et al., “A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks”,IEEE Personal Communications Magazine; Apr. 1999, pp 46-55.
P. Misra, “Routing Protocols for Ad Hoc Mobile Wireless Networks”, [Online] http://www.cis.ohio-state.edu/˜jain/cis788-99/adhoc routnig/index.html.
C.E. Perkins et al., “Highly Dynamic Destination Sequenced Distance Vector Routing (DSDV) for Mobile Computers”,Computer Communications Review, Oct. 1994, pp 234-244.
Charles E. Perkins et al., “Ad-hoc On-Demand Distance Vector Routing”, Proceedings of the2ndIEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, Feb. 1999, pp 90-100.
B. Bullnheimer et al., “Applying the Ant System to the Vehicle Routing Problem”, Presented at the2ndMetaheuristic International Conference, Sophia-Antipolis, France (1997).
G. DiCaro et al., “AntNet: Distributed Stigmergetic Control for Communications Networks”,Journal of Artificial Intelligence Research,vol. 9, pp 317-365 (1998).
G. DiCaro et al., “Two Ant Colony Algorithms For Best-Effort Routing in Datagram Networks”, Proceedings of theTenth IASTED International Conference on Parallel and Distributed Computing and Systems(PDCS'98), pp 541-546, IASTED/ACTA Press, (1998).
M. Dorigo et al., “Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem”,IEEE Transactions on Evolutionary Computation,vol. 1, #1, pp 53-66, Apr. 1997.
T. Stutzle et al., “The MAX-MIN Ant System and Local Search for the Traveling Salesman Problem”, Proceedings of theIEEE International Conference on Evolutionary Computation(ICEC'97), pp 309-314 (1997).
M. Dorigo et al., “The Ant Colony Optimization Meta-Heuristic, New Ideas in Optimization”,McGraw-Hill,editor David Corne and Marco Dorigo and Fred Glover, pp 11-32 (1999).
W. J. Gutjahr, “A Generalized Convergence Result for the Graph-based Ant System Methaheuristic”,Manuscript, University of Vienna,2000.
W. J. Gutjahr, “ACO Algorithms with Guaranteed Convergence to the Optimal Solution”,Technical Report, University of Vienna,ISDS 2001-02.
T. Stutzle et al., “A Short Convergence Proof for a Class of ACO Algorithms”,Technical Report, IRIDIA,2000-35.
Hussein Osama
Saadawi Tarek
Hoffmann & Baron , LLP
The Research Foundation of the City University of New York
Vanderpuye Kenneth
LandOfFree
Routing method for mobile infrastructureless network does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Routing method for mobile infrastructureless network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Routing method for mobile infrastructureless network will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3426405