IP Library Granted Patent US 8,681,693
Granted Patent B2
US 8,681,693 · App. 12/501,921 · Granted Mar 25, 2014

Dynamic networking spectrum reuse transceiver

Inventors: Robert A. Kennedy (Austin, TX); William R. Highsmith (Indialantic, FL); Robert J. Lawless (Apopka, FL); William F. Bernett (Melbourne, FL); Paul G. Greenis (Indian Harbour Beach, FL)
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,681,693
App. No.
12/501,921
Granted
Mar 25, 2014
Kind
B2
Abstract

Systems and methods are disclosed for the operation of a network of cognitive radios in a dynamic network topology. The systems and methods make use cross-layer communications to input parameters required by network services into a reasoning engine, which in turns processes the parameter the parameter information and reports linguistic results to the network services. The cross-layer communications are leveraged to shift network service functionality to the MAC or PHY Layers. Route discovery functionality is shifted from routing services down to the MAC or PHY Layers. The route discovery functionality is implemented by a process to elect a relay node based on the number of available channels that each of the source node neighbors has available to communicate with other neighbors.

Claims (8)

1. A method for optimization of routing in a wireless network comprising:

(a) identifying a communication for transmission from a source node (S) to a destination node (D);

(b) discovering a first set of common available atomic channels between said S node and one or more nodes (N 1 ) situated one hop from said S node;

(c) using said first set of common available atomic channels, broadcasting to said N 1 nodes a request to discover sets of common available atomic channels between each of said N 1 nodes and one or more nodes (N 2 ) situated one hop from each of said N 1 nodes and two hops from said S node;

(d) in parallel, each of said N 1 nodes discovering available atomic channels between each of said N 1 nodes and each of their said one hop N 2 nodes;

(e) each of said N 1 nodes performing an AND operation on the set of available atomic channels between itself and its said one hop N 2 nodes to obtain a common set of available atomic channels for each of said N 1 nodes;

(f) redesignating each of said N 1 nodes as an S node and each N 2 node as an N 1 node and repeating steps (b) through (e) until said D node is one hop from an N 1 node;

(g) routing the communication to the (D) node through said set of common available atomic channels.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 12, 2014
From: INVESTORS LIFE INSURANCE CORPORATION
To: BONE VALLEY PATENTS, LLC
Reel/Frame 033087/0493 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 15, 2011
From: ADAPT4, LLC
To: INVESTORS LIFE INSURANCE CORPORATION
Reel/Frame 026448/0566 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 23, 2009
From: KENNEDY, ROBERT A; HIGHSMITH, WILLIAM R.; LAWLESS, ROBERT J; BERNETT, WILLIAM F; GREENIS, PAUL G.
To: ADAPT4, LLC
Reel/Frame 023559/0240 →
Continuity (4)
Provisional Application 61080202 · Jul 11, 2008
Provisional Application 61121797 · Dec 11, 2008
Provisional Application 61083420 · Jul 24, 2008
Related Publication 20100061299A1 · Mar 11, 2010