Ad-hoc network and method employing globally optimized...

Multiplex communications – Diagnostic testing – Determination of communication parameters

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S401000

Reexamination Certificate

active

07633882

ABSTRACT:
An ad-hoc network includes an ad-hoc network coordinator (NC) having a first processor, a first memory, and a first communication interface; and a plurality of ad-hoc network devices (NDs). Each of the NDs includes a second processor, a second memory, and a second communication interface structured to communicate with the first communication interface of the NC or with the second communication interface of at least another one of the NDs. The first processor cooperates with at least some of the NDs to globally optimize a route based on a plurality of link costs for: (i) pairs of the NDs, or (ii) pairs of the NDs and at least one pair including one of the NDs and the NC, in order to minimize cost along the route that: (a) one of the NDs or the NC employs to send a packet to: (b) another one of the NDs or the NC.

REFERENCES:
patent: 5412654 (1995-05-01), Perkins
patent: 6728214 (2004-04-01), Hao et al.
patent: 6850492 (2005-02-01), Chander et al.
patent: 7177646 (2007-02-01), O'Neill et al.
patent: 7386002 (2008-06-01), Meier
patent: 2002/0061001 (2002-05-01), Garcia-Luna-Aceves et al.
patent: 2004/0090943 (2004-05-01), da Costa et al.
patent: 2004/0213233 (2004-10-01), Hong et al.
patent: 2004/0233855 (2004-11-01), Gutierrez et al.
patent: 2004/0246900 (2004-12-01), Zhang et al.
patent: 2005/0041591 (2005-02-01), Duggi et al.
patent: 2005/0041676 (2005-02-01), Weinstein et al.
patent: 2005/0111428 (2005-05-01), Orlik et al.
patent: 2005/0157661 (2005-07-01), Cho
patent: 2005/0232281 (2005-10-01), Rosenzweig et al.
patent: 2005/0257269 (2005-11-01), Chari et al.
patent: 2006/0062154 (2006-03-01), Choy et al.
patent: 2006/0245424 (2006-11-01), Ramanathan et al.
patent: 2007/0147255 (2007-06-01), Oyman
Lundberg, D., “Ad hoc protocol evaluation and experiences of real world ad hoc networking,” Tech. Rep., Department of Information Technology, Uppsala University, 2002, pp. i, ii, 1-44.
Daescu, O., et al., “Gara: A geometry aided routing algorithm,” 2004 Workshop on High Performance Switching and Routing, 2004, pp. 224-228.
Hershberger, J., et al., “Vickrey prices and shortest paths: What is an edge worth?,” Foundations of Computer Science, 2001, Proceedings. 42nd IEEE Symposium on, Oct. 2001, 8 pp.
Draves, R., et al., “Comparison of routing metrics for static multi-hop wireless networks,” Tech. Rep. MSR-TR-2004-18, Microsoft Research, 1999, 12 pp.
Mosko, M., et al., “Loop-free routing using a dense label set in wireless networks,” Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS04), IEEE Computer Society, 2004, 10 pp.
Prakash, R., “Unidirectional links prove costly in wireless ad-hoc networks,” Seattle, Aug. 1999, 3rd InternationalWorkshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 15-22.
Vanitchanant, N., et al., “Unidirectionality in ad-hoc networks: a simulation study,” MILCOM: Military Communications Conference, Oct. 2003, vol. 2, IEEE, pp. 1298-1304.
Wikipedia, “Dijkstra's algorithm”, http://en.wikipedia.org/wiki/Dijkstra%27s—algorithm, 2005, 5 pp.

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

Ad-hoc network and method employing globally optimized... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Ad-hoc network and method employing globally optimized..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ad-hoc network and method employing globally optimized... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4083575

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