IP Library Granted Patent US 8,605,651
Granted Patent B2
US 8,605,651 · App. 12/693,339 · Granted Dec 10, 2013

Method for automatic selection of a MAC protocol for a communication system and related system

Inventors: Torquato Bertani (Milan, IT); Lorenzo Bianconi (Spicchio-Vinci, IT); Alessandro Erta (Milan, IT); Umberto Malesci (Milan, IT)
Assignee: Fluidmesh Networks, LLC
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,605,651
App. No.
12/693,339
Granted
Dec 10, 2013
Kind
B2
Abstract

MAC protocol selection is described. In a communication system, a MAC protocol is automatically selected from a set of MAC protocols based on a connectivity graph of at least part of the communication system.

Claims (27)

1. A method of operating a communication system, comprising the steps of:

a) providing at least one communication node of the communication system with a connectivity graph of at least part of the communication system, wherein the connectivity graph is constructed using a plurality of messages broadcasted by a plurality of issuing nodes in the communication system, each message comprising, for each issuing node, a unique identifier of the issuing node and a list of unique identifiers of each neighbor node of the issuing node,

b) analyzing said connectivity graph at said at least one communication node,

c) selecting a Medium Access Control (MAC) protocol at said at least one communication node from a set of at least two MAC protocols based on said analyzed connectivity graph, and

d) operating said communication system with the selected MAC protocol;

wherein said connectivity graph comprises information for each neighbor node of the communication node, comprising a unique identifier of the communication node's neighbor node and a list of unique identifiers of each neighbor node of the neighbor node; and wherein said step of analyzing said connectivity graph comprises comparing each list of unique identifiers with (i) the unique identifier or identifiers of the communication node's neighbor node or neighbor nodes and (ii) a unique identifier of the communication node, and to qualify the connectivity graph as not fully connected in case at least one list of unique identifiers contains at least one unique identifier different from (i) the unique identifier or unique identifiers of the communication node's neighbor node or neighbor nodes and (ii) the unique identifier of the communication node.

2. The method according to claim 1 , wherein the set of at least two MAC protocols includes at least one centralized MAC protocol.

3. The method according to claim 1 , wherein the at least one communication node is a fixedly installed electronic appliance.

4. The method according to claim 1 , wherein the at least one communication node is adapted to:

receive a message from at least one neighbor node of the communication system, said message comprising a unique identifier of the communication node's neighbor node, and a list of unique identifiers of every neighbor node of the neighbor node, and

store information comprised in messages received from all neighbor nodes of the communication node.

5. The method according to claim 1 , wherein said at least one communication node is adapted to broadcast a message, said message comprising (i) a unique identifier of the communication node and (ii) a list of unique identifier(s) of every neighbor node of the communication node.

6. The method according to claim 1 , wherein said connectivity graph is time-variant.

7. A method of operating a communication system, comprising the steps of:

a) providing at least one communication node of the communication system with a connectivity graph of at least part of the communication system, wherein the connectivity graph is constructed using a plurality of messages broadcasted by a plurality of issuing nodes in the communication system, each message comprising, for each issuing node, a unique identifier of the issuing node and a list of unique identifiers of each neighbor node of the issuing node,

b) analyzing said connectivity graph at said at least one communication node,

c) selecting a Medium Access Control (MAC) protocol at said at least one communication node from a set of at least two MAC protocols based on said analyzed connectivity graph, and

d) operating said communication system with the selected MAC protocol;

wherein said connectivity graph comprises information for each neighbor node of the communication node, comprising a unique identifier of the communication node's neighbor node and a list of unique identifiers of each neighbor node of the neighbor node; and wherein said step of analyzing said connectivity graph comprises comparing each list of unique identifiers with (i) the unique identifier or identifiers of the communication node's neighbor node or neighbor nodes and (ii) a unique identifier of the communication node, and to qualify the connectivity graph as fully connected in case no list of unique identifiers contains unique identifier(s) different from (i) the unique identifiers of the communication node's neighbor node or neighbor nodes and (ii) the unique identifier of the communication node.

8. The method according to claim 7 , wherein the set of at least two MAC protocols includes at least one distributed MAC protocol without reservation.

9. The method according to claim 7 , wherein the set of at least two MAC protocols includes at least one distributed MAC protocol with reservation.

10. The method according to claim 7 , wherein the at least one communication node is a fixedly installed electronic appliance.

11. The method according to claim 7 , wherein the at least one communication node is adapted to:

receive a message from at least one neighbor node of the communication system, said message comprising a unique identifier of the communication node's neighbor node, and a list of unique identifiers of every neighbor node of the neighbor node, and

store information comprised in messages received from all neighbor nodes of the communication node.

12. The method according to claim 7 , wherein said at least one communication node is adapted to broadcast a message, said message comprising (i) a unique identifier of the communication node and (ii) a list of unique identifier(s) of every neighbor node of the communication node.

13. The method according to claim 7 , wherein said connectivity graph is time-variant.

Assignments (3)
CHANGE OF NAME Recorded May 26, 2011
From: FLUIDMESH NETWORKS ACQUISITION, LLC
To: FLUIDMESH NETWORKS, LLC
Reel/Frame 026348/0958 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 5, 2011
From: FLUIDMESH NETWORKS, INC.
To: FLUIDMESH NETWORKS ACQUISITION, LLC
Reel/Frame 026229/0135 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 25, 2010
From: BERTANI, TORQUATO; BIANCONI, LORENZO; ERTA, ALESSANDRO; MALESCI, UMBERTO
To: FLUIDMESH NETWORKS, INC.
Reel/Frame 023843/0156 →
Priority Claims (1)
EP 09001072 · Jan 27, 2009 · regional
Continuity (1)
Related Publication 20100189005A1 · Jul 29, 2010