Software architecture and hardware abstraction layer for...

Multiplex communications – Communication techniques for information carried in plural... – Adaptive

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S338000, C709S231000

Reexamination Certificate

active

07656901

ABSTRACT:
A system and method that creates an abstraction of the physical layer of a wireless communication network (100), in particular, a wireless ad-hoc peer-to-peer communication network (100), and that normalizes the feedback from the physical layer to enable multiple types of nodes (102, 106, 107) in the wireless network to operate using a common wireless routing protocol. This routing protocol uses a link quality metric to determine the best route regardless of how it actually chooses the route or disseminates such link quality information. The generalized routing metric can be derived for any node (102, 106, 107), regardless of its relative performance or its media access control (MAC) technology. The system and method also create a transaction summary that can be used for link adaptation and link quality estimation to determine, for example, future data rates, link quality/routing metrics, and transmit powers.

REFERENCES:
patent: 5231634 (1993-07-01), Giles et al.
patent: 5233604 (1993-08-01), Ahmadi et al.
patent: 5459455 (1995-10-01), Sato
patent: 5999517 (1999-12-01), Koning et al.
patent: 6807165 (2004-10-01), Belcea
patent: 6873839 (2005-03-01), Stanforth
patent: 2002/0058502 (2002-05-01), Stanforth
patent: 2002/0082014 (2002-06-01), Andersson et al.
patent: 2002/0101880 (2002-08-01), Kim
patent: 2003/0107998 (2003-06-01), Mowery
patent: 2003/0134622 (2003-07-01), Hsu et al.
patent: 2003/0161268 (2003-08-01), Larsson
patent: 2003/0177275 (2003-09-01), Lind
patent: 2004/0013120 (2004-01-01), Shen
patent: 2004/0047314 (2004-03-01), Li
patent: 2004/0125779 (2004-07-01), Kelton et al.
patent: 2004/0146007 (2004-07-01), Saadawi et al.
patent: 2004/0199576 (2004-10-01), Tan
patent: 2004/0219909 (2004-11-01), Kennedy et al.
patent: 2004/0260808 (2004-12-01), Strutt
patent: 2005/0005190 (2005-01-01), Ofir et al.
patent: 2005/0102292 (2005-05-01), Tamayo et al.
patent: 2005/0108518 (2005-05-01), Pandya
patent: 2005/0157733 (2005-07-01), Liu et al.
patent: 2005/0249122 (2005-11-01), Wheeler et al.
patent: 2005/0259571 (2005-11-01), Battou
patent: 2005/0286440 (2005-12-01), Strutt
patent: 2006/0026305 (2006-02-01), Illowsky et al.
patent: 2006/0080455 (2006-04-01), Das et al.
patent: 2008/0077814 (2008-03-01), Cherukuri et al.
patent: 2004028057 (2004-04-01), None
patent: WO 2004028057 (2004-04-01), None
U.S. Appl. No. 11/138,241, filed May 24, 2005, Guenael Strutt.
C. Perkins, et al., “Ad Hoc On-Demand Distance Vector (AODV) Routing,” RFC 3561, http://www.ietf.org/rfc/rfc3561.txt, Jul. 2003.
T. Clausen, et al., “Optimized Link State Routing Protocol (OLSR),” RFC 3626, http://www.ietf.org/rfc/rfc3626.txt, Oct. 2003.
R. Ogier, et al., “Topology Dissemination Based on Reverse-Path Forwarding (TBRPF),” RFC 3684, http://www.ietf.org/rfc/rfc3684.txt, Feb. 2004.
D. DeCouto, et al., “A High-Throughput Path Metric for Multi-Hop Wireless Routing,” 9th ACM Intern'l Conf. on Mobile Computing and Networking, San Diego, CA, Sep. 2003.
PCT/US05/028623 - International Search Report mailed Jan. 30 2006 - 9 pages.

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

Software architecture and hardware abstraction layer for... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Software architecture and hardware abstraction layer for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Software architecture and hardware abstraction layer for... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4183029

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