Device and method for a multi-hop mobile ad hoc network

• US 8,966,046 B2
• Filed: 06/09/2011
• Issued: 02/24/2015
• Est. Priority Date: 06/10/2010
• Status: Active Grant

• Current Assignee: Defendec Inc.
• Original Assignee: Defendec Inc.
• Inventors: Preden, Jrgo-Sren, Uusjrv, Madis
• Primary Examiner(s): Scott, Randy
• Application Number:
  US13/702,110
• Publication Number:
  US 20130138792A1
• Time in Patent Office: 1,356 Days
• US Class Current: 709/223
• CPC Class Codes: H04L 41/02 Standardisation; Integration
• CPC Class Codes: H04W 52/0216 using a pre-established activity schedule, e.g. traffic indication frame
• CPC Class Codes: H04W 56/001 Synchronization between nodes
• CPC Class Codes: H04W 8/005 Discovery of network devices, e.g. terminals
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

An ad hoc network having self-organized clusters of nodes, i.e., one-hop ad hoc subnetworks. Any node can assume the role of a routing node if it is able to communicate with at least one node in another cluster so as to self-organize the clusters of nodes into a multi-hop ad hoc network. An intra-cluster synchronization of sleep and awake periods of nodes in a power-saving mode of operation is performed separately within each cluster. An inter-cluster synchronization of awake periods of neighboring clusters to be temporally non-overlapping is performed by the routing nodes.

Claims

1. A method of operating a node in an ad hoc network, comprising:

joining or initiating a cluster in an ad hoc network, wherein a plurality of nodes are able to self-organize themselves into clusters of nodes, each cluster comprising a collection of nodes which are capable of one-hop communication directly with each other;

performing an intra-cluster temporal synchronization of sleep and awake periods of nodes in a power-saving mode of operation within the own cluster without any single node coordinating the operation of the individual nodes in the cluster;

accessing a communication medium using a contention mechanism without any single node coordinating the operation of the individual nodes in the cluster;

selectively assuming, when appropriate, a routing function to a neighboring cluster so as to self-organize the clusters of nodes into a multi-hop ad hoc network comprised of individual clusters of nodes;

performing, when the routing function is assumed, inter-cluster data routing between the own cluster and the neighboring cluster; and

performing, when the routing function is assumed, an inter-cluster synchronization of awake periods of the own cluster and the neighboring cluster to be temporally non-overlapping.

2. The method of claim 1, further comprising keeping awake during the awake periods of both the own cluster and the neighboring cluster to perform the inter-cluster synchronization and to provide an inter-cluster multi-hop communication.

3. The method of claim 1, further comprising employing a contention mechanism for medium access within a cluster.

4. The method of claim 1, wherein the intra-cluster synchronization comprises periodically broadcasting synchronization messages to and receiving synchronization messages from nodes belonging to the cluster, at beginning of the awake period of the cluster in order to synchronize clocks of the nodes according to the synchronization messages broadcast within the cluster.

5. The method of claim 4, further comprising, in response to receiving a cluster synchronization message from another node in the cluster, synchronizing the receiving node'"'"'s own clock using a receive time of the received cluster synchronization message and a time offset from a awake period start time indicated in the received cluster synchronization message.

6. The method of claim 1, wherein the inter-cluster synchronization comprises:

detecting, when the routing node function is assumed, an intra-cluster synchronization of the neighboring cluster; and

adjusting, when the routing node function is assumed, the intra-cluster synchronization of the own cluster dependent on the detected intra-cluster synchronization of the neighboring cluster.

7. The method of claim 1, wherein the inter-cluster synchronization comprises:

synchronizing, when the routing node function is assumed, the own clock according to cluster synchronization messages broadcasted within the own cluster;

detecting, when the routing node function is assumed, a clock of the neighboring cluster based on cluster synchronization messages broadcasted within the neighboring cluster;

checking, when the routing node function is assumed, whether the clock of the own cluster and the clock of the neighboring cluster are synchronized; and

performing, if necessary, when the routing node function is assumed, the inter-cluster synchronization by advancing or postponing a transmission time of cluster synchronization messages within the own cluster in relation to the clock of the neighboring cluster.

8. The method of claim 1, wherein the joining to a cluster comprises:

monitoring cluster synchronization messages broadcasted in the ad hoc network for a predetermined period of time,

if cluster synchronization messages are received during the monitoring period, selecting one of existing clusters according to some criteria based on the received cluster synchronization messages, and initiating a cluster join procedure to join the selected cluster.

9. The method of claim 8, wherein the cluster join procedure comprises:

sending a join request message to one of the nodes in the selected existing cluster,

in response to receiving a join response message, which indicates that the join request is accepted and contains a list of nodes that are currently in the selected cluster, sending inquiry to all nodes in the selected cluster; and

joining the selected cluster if a reply is received from all nodes in the selected cluster.

10. The method of claim 8, further comprising:

initiating a new cluster initiate procedure, if no cluster synchronization messages are received during the monitoring period, or if the cluster join procedure fails.

11. The method of claim 1, wherein the time domain is divided into time slots and the awake period of each cluster occupies one time slot in the time domain.

12. The method of claim 11, wherein a new cluster initiate procedure comprises:

selecting for the new cluster a free time slot which is not occupied by neighboring clusters in the time domain;

deriving an identifier of the new cluster from an identifier of the selected time slot;

broadcasting a cluster initiation message declaring the new cluster; and

operating in the new cluster whose wakeup period occupies the selected time slot.

13. The method of claim 11, further comprising:

staying awake and monitoring all the time slots in the time domain at predetermined intervals, to detect any neighboring clusters that the current cluster is not aware of.

14. The method of claim 1, wherein the selectively assuming a routing function comprises:

setting up a routing partnership with a node in a neighboring cluster which becomes the partnering router; and

broadcasting a notification of setting up of the routing partnership in the own cluster.

15. The method of claim 14, further comprising:

in response to losing the routing partnership with the node in the neighboring cluster, broadcasting a notification of cancellation of the routing partnership in the own cluster.

16. A network node apparatus, comprising a processor unit and a radio communication unit, the processor unit being configured to perform routines:

joining or initiating a cluster in an ad hoc network, wherein a plurality of nodes are able to self-organize themselves into clusters of nodes, each cluster comprising a collection of nodes which are capable of one-hop communication directly with each other;

performing an intra-cluster temporal synchronization of sleep and awake periods of nodes in a power-saving mode of operation within the own cluster without any single node coordinating the operation of the individual nodes in the cluster;

accessing a communication medium using a contention mechanism without any single node coordinating the operation of the individual nodes in the cluster;

selectively assuming, when appropriate, a routing function to a neighboring cluster so as to self-organize the clusters of nodes into a multi-hop ad hoc network comprised of individual clusters of nodes;

performing, when the routing function is assumed, inter-cluster data routing between the own cluster and the neighboring cluster; and

performing, when the routing function is assumed, an inter-cluster synchronization of awake periods of the own cluster and the neighboring cluster to be temporally non-overlapping.

17. An ad hoc network, comprising a plurality of network nodes, each of the plurality of nodes including a processor unit and a radio communication unit, the processor unit being configured to perform routines:

joining or initiating a cluster in an ad hoc network, wherein a plurality of nodes are able to self-organize themselves into clusters of nodes, each cluster comprising a collection of nodes which are capable of one-hop communication directly with each other;

performing an intra-cluster temporal synchronization of sleep and awake periods of nodes in a power-saving mode of operation within the own cluster without any single node coordinating the operation of the individual nodes in the cluster;

accessing a communication medium using a contention mechanism without any single node coordinating the operation of the individual nodes in the cluster;

selectively assuming, when appropriate, a routing function to a neighboring cluster so as to self-organize the clusters of nodes into a multi-hop ad hoc network comprised of individual clusters of nodes;

performing, when the routing function is assumed, inter-cluster data routing between the own cluster and the neighboring cluster; and

performing, when the routing function is assumed, an inter-cluster synchronization of awake periods of the own cluster and the neighboring cluster to be temporally non-overlapping.