Ad-hoc network and method employing globally optimized routes for packets
First Claim
1. An ad-hoc network comprising:
- an ad-hoc network coordinator comprising;
a first processor,a first memory, anda first communication interface; and
a plurality of ad-hoc network devices, each of said ad-hoc network devices comprising;
a second processor,a second memory, anda second communication interface structured to communicate with the first communication interface of said ad-hoc network coordinator or with the second communication interface of at least another one of said ad-hoc network devices,wherein the second processor of each of said ad-hoc network devices is structured to determine a local graph,wherein said local graph of a corresponding ad-hoc network device comprises;
a set of vertices corresponding to all of said ad-hoc network devices that the corresponding ad-hoc network device can communicate with,a set of edges connecting said vertices, anda set of link costs associated with said edges,wherein each vertex of said vertices corresponds to one of said ad-hoc network devices that the corresponding ad-hoc network device can communicate with, andwherein each edge of said edges links the corresponding ad-hoc network device to one vertex of said vertices,wherein the second processor of each of said ad-hoc network devices is further structured to send the local graph to said ad-hoc network coordinator,wherein the first processor of said ad-hoc network coordinator is structured to determine a global graph from the union of the local graph of each of said ad-hoc network devices, andwherein said first processor employs said global graph and cooperates with at least some of said ad-hoc network devices to globally optimize a route in said ad-hoc network for;
(i) pairs of said ad-hoc network devices, or (ii) pairs of said ad-hoc network devices and at least one pair including one of said ad-hoc network devices and said ad-hoc network coordinator, in order to minimize cost along said route that;
(a) one of said ad-hoc network devices or said ad-hoc network coordinator employs to send a packet to;
(b) another one of said ad-hoc network devices or said ad-hoc network coordinator.
2 Assignments
0 Petitions
Accused Products
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.
-
Citations
27 Claims
-
1. An ad-hoc network comprising:
-
an ad-hoc network coordinator comprising; a first processor, a first memory, and a first communication interface; and a plurality of ad-hoc network devices, each of said ad-hoc network devices comprising; a second processor, a second memory, and a second communication interface structured to communicate with the first communication interface of said ad-hoc network coordinator or with the second communication interface of at least another one of said ad-hoc network devices, wherein the second processor of each of said ad-hoc network devices is structured to determine a local graph, wherein said local graph of a corresponding ad-hoc network device comprises; a set of vertices corresponding to all of said ad-hoc network devices that the corresponding ad-hoc network device can communicate with, a set of edges connecting said vertices, and a set of link costs associated with said edges, wherein each vertex of said vertices corresponds to one of said ad-hoc network devices that the corresponding ad-hoc network device can communicate with, and wherein each edge of said edges links the corresponding ad-hoc network device to one vertex of said vertices, wherein the second processor of each of said ad-hoc network devices is further structured to send the local graph to said ad-hoc network coordinator, wherein the first processor of said ad-hoc network coordinator is structured to determine a global graph from the union of the local graph of each of said ad-hoc network devices, and wherein said first processor employs said global graph and cooperates with at least some of said ad-hoc network devices to globally optimize a route in said ad-hoc network for;
(i) pairs of said ad-hoc network devices, or (ii) pairs of said ad-hoc network devices and at least one pair including one of said ad-hoc network devices and said ad-hoc network coordinator, in order to minimize cost along said route that;
(a) one of said ad-hoc network devices or said ad-hoc network coordinator employs to send a packet to;
(b) another one of said ad-hoc network devices or said ad-hoc network coordinator. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method for determining routing of packets of an ad-hoc network comprising an ad-hoc network coordinator and a plurality of ad-hoc network devices, said ad-hoc network devices communicating with said ad-hoc network coordinator or with at least another one of said ad-hoc network devices, said method comprising:
-
determining a local graph for each of said ad-hoc network devices, wherein said local graph of a corresponding ad-hoc network device comprises; a set of vertices corresponding to all of said ad-hoc network devices that the corresponding ad-hoc network device can communicate with, a set of edges connecting said vertices, and a set of link costs associated with said edges, wherein each vertex of said vertices corresponds to one of said ad-hoc network devices that the corresponding ad-hoc network device can communicate with, and wherein each edge of said edges links the corresponding ad-hoc network device to one vertex of said vertices; sending the local graph from each of said ad-hoc network devices to said ad-hoc network coordinator; determining a global graph from the union of the local graph of each of said ad-hoc network devices; for;
(i) pairs of said ad-hoc network devices, or (ii) pairs of said ad-hoc network devices and at least one pair including one of said ad-hoc network devices and said ad-hoc network coordinator globally optimizing a route in said ad-hoc network based on said global graph; andminimizing cost along said route that;
(a) one of said ad-hoc network devices or said ad-hoc network coordinator employs to send a packet to;
(b) another one of said ad-hoc network devices or said ad-hoc network coordinator. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27)
-
Specification