Synchronization and timing source priority in an ad-hoc network

0001The present invention relates to the field of communications, and, more particularly, to wireless communications in ad-hoc networks and related methods.

0002Wireless networks have experienced increased development in the past decade. One of the most rapidly developing areas is mobile ad-hoc networks. Physically, a mobile ad-hoc network includes a number of geographically-distributed, potentially mobile nodes sharing a common radio channel. Compared with other types of networks, such as cellular networks or satellite networks, the most distinctive feature of mobile ad-hoc networks is the lack of any fixed infrastructure. The network may be formed of mobile nodes only, and a network is created "on the fly" as the nodes transmit with each other. The network does not depend on a particular node and dynamically adjusts as some nodes join or others leave the network.

0003The standards governing Wireless Local Area Networks (WLANs) networking products are defined by a suite of specifications issued by the IEEE and known as the IEEE 802.11 standard, incorporated herein by reference in their entirety. The standards define the operation of both the radio PHY layer and the MAC layer including a synchronization mechanism. The synchronization mechanism is used to provide a uniform time base.

0004For example, a timing synchronization function is operative to keep the timers of all the nodes in the same basic service set (BSS) synchronized. Each node maintains its own local timer. In a conventional WLAN infrastructure network, the access point is the timing master and is operative to implement the timing synchronization function. The access point periodically transmits special frames called beacons that contain a copy of its timing synchronization function timer. The beacons are used by the other nodes to synchronize to the access point. A node always accepts the timing information received in a beacon from the access point servicing its BSS. If the timer of a node is different from the timestamp in the received beacon, the receiving node sets its local timer to the received timestamp value.

0005For ad-hoc networks, the timing synchronization is typically implemented using a distributed algorithm that is performed by the member nodes. Each node transmits beacons in accordance with an algorithm defined in the 802.11 standard. Each node adopts the timing received from any beacon or probe response that has a timing synchronization function value later than its own timer. Nodes expect to receive beacons at a nominal rate. The interval between beacon transmissions is defined by beacon period parameter of the node. A node sending a beacon sets the value of the timestamp to be equal to the value of the timing synchronization function timer of the node at the time that the first bit of the timestamp is transmitted to the PHY plus the transmitting delays of the node through its local PHY from the MAC-PHY interface to its interface with the wireless medium (i.e., antenna, etc.).

0006Time Division Multiple Access (TDMA) based ad-hoc networks are prone to synchronization issues due to node movement, radio clock drifting, merging of groups of nodes with different timing references. A timing reference is the beginning time of a common frame. There are many other causes for network synchronization errors.

0007Various problems exist with correcting timing reference errors. For example, a node can broadcast a timing reference packet to correct the timing errors in the network. But it may take sometime or require continuous flooding of the timing reference information for the timing reference node to know about the error conditions.

0008Current approaches include flooding the network with a Timing Reference Packet (TRP) but bandwidth consumption is a concern. If the network maintains a network clock then the TRP uses a time stamp to represent the correct timing reference. For example, an 802.11 type of network keeps a common network clock. If there are unstable links, not every node could hear the single flooding of the timing reference packet, and flooding may have to be done multiple times, or periodically. The timing reference packet has to be sent periodically due to clock drifting. If a network clock is not maintained (identity of the timing reference but not the reference time is distributed) then the TRP may contain a unique packet ID, so that whichever node has received the TRP can derive the correct identification of the timing reference node. The timing reference node is notified if a synchronization error is detected or the TRP is periodically flooded. However, a timing reference ambiguity can persist for some time.

0009Another conventional approach is Ad-hoc Extensions to the 802.15.2 MAC Protocol (developed by Winlab, Rutgers university). The group uses 2 keys in a beacon. A key is similar to the group ID. It is used to indicate synchronization status and membership. Either one of the two can be used to identify the group. The two keys shared by all member nodes have different expiration time stamps. They will be regenerated and re-distributed to all members, if expired. If the group is separated longer than the key expiration period, the current keys circulated in each group will be different. When the sub-groups merge, they will go through the normally required re-synchronization process. However, it will be immediately evident to all nodes in each group that there are two timing reference nodes.

0010This approach can be complicated when the groups are merging at the same moment as the new keys are being generated and re-distributed in ether, or both groups. Another disadvantage of this approach is the bandwidth consumption by the two keys. In an HP-NET, a key of 20 to 30 bits would consume a significant amount of the bandwidth allocated by each node to network control tasks.

0011Many references relate to the synchronization of devices in hierarchical wireless networks, where one or several synchronized masters operate as timeservers. <patcit id="pcit0001" dnum="US20040190487A"><text>U.S. Patent Application Serial No. 20040190487</text></patcit>, entitled "Method For Synchronizing A Control Channel To A Working Channel", filed on Mar. 31, 2003, for example, relates to a method for synchronizing a control channel to a working channel. Moreover, <patcit id="pcit0002" dnum="US6792247B"><text>U.S. Pat. No. 6,792,247</text></patcit> relates to a method for synchronizing reception in wireless networks, in which a synchronization packet of a special format is transmitted before a data packet is transmitted. <patcit id="pcit0003" dnum="US6785253B"><text>U.S. Pat. No. 6,785,253</text></patcit> and <patcit id="pcit0004" dnum="US6622022B"><text>U.S. Pat. No. 6,622,022</text></patcit> also disclose methods for synchronizing hierarchical wireless networks wherein at least one node is selected as the central transfer node or as the main network node which is responsible for providing frame synchronization services. Moreover, <patcit id="pcit0005" dnum="US6546026B"><text>U.S. Pat. No. 6,546,026</text></patcit> relates to a method for improving the time synchronization in wireless applications (e.g., TDMA).

0012Methods for synchronizing cellular wireless networks using GPS timing signals can also be found in <patcit id="pcit0006" dnum="US6542754B"><text>U.S. Pat. No. 6,542,754</text></patcit> and <patcit id="pcit0007" dnum="US6538600B"><text>U.S. Pat. No. 6,538,600</text></patcit>. Moreover, <patcit id="pcit0008" dnum="US6466608B"><text>U.S. Pat. No. 6,466,608</text></patcit> relates to a synchronization method that requires defining a hierarchical structure of the network, wherein the synchronization process is controlled by assigned master nodes. Moreover, <patcit id="pcit0009" dnum="US5812547A"><text>U.S. Pat. No. 5,812,547</text></patcit> relates to a method for transmitting data packets in a wireless network, without dependence on fixed time slot or a central timing mechanism.

0013<patcit id="pcit0010" dnum="US6594273B"><text>U.S. Pat. No. 6,594,273</text></patcit> relates to a method for communicating in an ad-hoc multihopping network, wherein the network includes active and passive terminals, and wherein only the active terminals participate in routing and synchronization. <patcit id="pcit0011" dnum="US6807165B"><text>U.S. Pat. No. 6,807,165</text></patcit> and <patcit id="pcit0012" dnum="US5699388A"><text>U.S. Pat. No. 5,699,388</text></patcit> present methods using a unique time source and propagating the synchronization in the network from upstream to downstream terminals. Moreover, <patcit id="pcit0013" dnum="US20040005902A"><text>U.S. Patent Application Serial No. 20040005902</text></patcit>, entitled "System and method for correcting the clock drift and maintaining the synchronization of low quality clocks in wireless networks", filed Jul. 5, 2002, relates to a method that allows synchronization of terminals at any precision, using a reference clock that operates as a network master.

0014In view of the foregoing background, it is therefore an object of the present invention to provide a bandwidth efficient and robust timing synchronization capability in an ad-hoc network.

0015This and other objects, features, and advantages in accordance with the present invention are provided by a mobile ad-hoc network including at least one group of mobile nodes including at least one timing reference (TR) node. Each mobile node includes a controller and a wireless communications device cooperating therewith to generate and transmit timing synchronization beacons having a respective hop count indicating a number of hops to the at least one timing reference node, receive timing synchronization beacons from neighboring nodes, and synchronize node communication timing with neighboring nodes based upon the number of hops to the at least one timing reference node.

0016The at least one timing reference node may include a Global Positioning System (GPS) supported node. The controller and the wireless communications device may cooperate to periodically update the respective hop count and/or to synchronize node communication timing with the at least one timing reference node or with a neighboring node that is closer to the at least one timing reference node than itself. The beacons may include a respective group ID.

0017Furthermore, the at least one timing reference node may cooperate with the other mobile nodes based upon a timing source priority tree including levels defined by hop counts. The at least one timing reference node is at a starting level of the timing source priority tree. The other nodes are at a higher level of the timing source priority tree than the starting level and correspond to the number of hops to the at least one timing reference node. The controller and the wireless communications device may cooperate to synchronize node communication timing with lower level group nodes.

0018A method aspect is directed to a method of operating a group of mobile nodes within an ad-hoc network, the group including at least one timing reference (TR) node. The method includes each node of the group generating and transmitting timing synchronization beacons having a respective hop count indicating a number of hops to the at least one timing reference node, each node receiving timing synchronization beacons from neighboring nodes, and synchronizing node communication timing with neighboring nodes based upon the number of hops to the at least one timing reference node.

0019Each node may periodically update the respective hop count. Also, synchronizing may include synchronizing node communication timing with a neighboring node that is closer to the at least one timing reference node than itself. The at least one timing reference node may cooperate with other nodes based upon a timing source priority tree including levels defined by hop counts with the at least one timing reference node being at a starting level of the timing source priority tree, and the other mobile nodes being at higher levels of the timing source priority tree than the starting level and which correspond to the number of hops to the at least one timing reference node. Synchronizing may include synchronizing node communication timing of higher level group nodes with lower level group nodes.

0020<figref idref="f0001">FIGs. 1A-1F</figref> are schematic diagrams illustrating a sequence of stages of a merger of two respectively synchronized groups of nodes in an ad-hoc network.

0021<figref idref="f0002">FIG. 2A</figref> is a schematic signal timing diagram illustrating TDMA frame numbers for nodes 1-8 of <figref idref="f0003">FIG. 3</figref>.

0022<figref idref="f0002">FIG. 2B</figref> is a schematic diagram illustrating a group of non-synchronized nodes in an ad-hoc network.

0023<figref idref="f0003">FIG. 3</figref> is a schematic diagram illustrating a group of synchronized nodes in an ad-hoc network in accordance with the timing synchronization approach of the present invention.

0024<figref idref="f0004">FIG. 4</figref> is a schematic block diagram illustrating an example of a wireless node for use in the ad-hoc network of <figref idref="f0003">FIG. 3</figref>.

0025The present invention will now be described more fully hereinafter with reference to the accompanying drawings, in which preferred embodiments of the invention are shown. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. Like numbers refer to like elements throughout.

0026It is appreciated by one skilled in the art that the approach of the present invention is not limited for use with any particular communication standard (wireless or otherwise) and can be adapted for use with numerous wireless (or wired) communications standards such as Enhanced Data rates for GSM Evolution (EDGE), General Packet Radio Service (GPRS) or Enhanced GPRS (EGPRS), extended data rate Bluetooth, Wideband Code Division Multiple Access (WCDMA), Wireless LAN (WLAN), Ultra Wideband (UWB), coaxial cable, radar, optical, etc. Further, the invention is not limited for use with a specific PHY or radio type but is applicable to other compatible technologies as well.

0027Note that throughout this description, the term communications device is defined as any apparatus or mechanism adapted to transmit, receive or transmit and receive data through a medium. The communications device may be adapted to communicate over any suitable medium such as RF, wireless, infrared, optical, wired, microwave, etc. In the case of wireless communications, the communications device may comprise an RF transmitter, RF receiver, RF transceiver or any combination thereof. Wireless communication involves: radio frequency communication; microwave communication, for example long-range line-of-sight via highly directional antennas, or short-range communication; and/or infrared (IR) short-range communication. Applications may involve point-to-point communication, point-to-multipoint communication, broadcasting, cellular networks and other wireless networks.

0028<figref idref="f0001">FIGs. 1A-1F</figref> are snapshots of an example network <b>10</b> of mobile nodes <b>12</b> currently operating as two internally synchronized groups or clusters <b>(X:A&amp;B; Y:C)</b> and showing wireless links <b>14</b> connecting the nodes. The network <b>10</b> includes the plurality of mobile nodes <b>12,</b> such as laptop computers, personal digital assistants (PDAs) or mobile phones, that are connected by wireless communication links <b>14</b> as would be appreciated by the skilled artisan. A link <b>14</b> is the basic connection in a network and is simply the physical link between any two nodes <b>12.</b> Information describing the node includes a node ID (IP address, ATM address, etc) and positional information if available. Such a network could be a mobile ad-hoc wireless communications system. Such examples of networks are set forth in commonly assigned <patcit id="pcit0014" dnum="US6763013B"><text>U.S. Pat. Nos. 6,763,013</text></patcit>; <patcit id="pcit0015" dnum="US6754192B"><text>6,754,192</text></patcit>; and <patcit id="pcit0016" dnum="US20050053003A"><text>U.S. Pat. Publication Nos. 2005/0053003</text></patcit> and <patcit id="pcit0017" dnum="US20040203820A"><text>2004/0203820</text></patcit>, the disclosures which are incorporated by reference in their entirety.

0029In an ad hoc network, a cluster is a group of nodes that are topologically connected and share a membership in the group. The cluster could span 1-hop or multiple hops. The timing reference (TR) node of the cluster has certain specific functions that benefit the cluster. Any node may become the TR node and the TR's node ID may be used for the group ID with respect to at least timing synchronization issues. There may be one or more TR nodes in the group and a new TR node should be elected if the current TR node is powered down or leaves the network or group.

0030Referring more specifically to <figref idref="f0004">FIG. 4</figref>, the nodes <b>12</b> may be any suitable type of mobile device capable of communicating within a MANET, including a wireless communications device <b>20,</b> for example, and other devices as are appreciated by those of skill in the art. Of course, it will also be appreciated that certain nodes <b>12</b> may optionally be connected to a fixed communication infrastructure in some applications, if desired.

0031The mobile nodes <b>12</b> further illustratively include a controller <b>22,</b> the operation of which will be described below. By way of example, the controller <b>22</b> may be implemented using microprocessors, memory, software, etc., as will be appreciated by those of skill in the art. An associated memory <b>24</b> may also be included. Furthermore, the wireless communications device <b>20</b> may include wireless modems, wireless local area network (LAN) devices, cellular telephone devices, etc., as well as an associated antenna <b>26</b> or antennas, as illustratively shown. By way of example, one or more phased array antennas (as well as other suitable antennas) may be used, as will be appreciated by those skilled in the art.

0032Referring again to <figref idref="f0001">FIGs. 1A-1F</figref>, an example of a sequence of events that may cause a synchronization error will now be described. The groups <b>X:A&amp;B</b> and <b>Y:C</b> are not synchronized with each other but are internally synchronized with respective TR nodes <b>XTR</b> and <b>YTR</b> (<figref idref="f0001">FIG. 1A</figref>). The two groups <b>X:A&amp;B</b> and <b>Y:C</b> are about to merge. In <figref idref="f0001">Fig. 1B</figref>, group <b>X</b> is temporarily separated into <b>X:A</b> and <b>X:B.</b> Then, group <b>X:B</b> synchronizes with group <b>Y:C</b> and becomes group <b>Y:B</b> with <b>YTR</b> as the timing reference node as illustrated in <figref idref="f0001">FIG. 1C</figref>. In <figref idref="f0001">FIG. 1D</figref>, the timing reference node <b>YTR</b> becomes disabled and so timing synchronization is switched back to <b>XTR</b> (<figref idref="f0001">FIG. 1 E)</figref> thereby creating group <b>X:B&amp;C</b> with group <b>X:A</b> still believing that it is synchronized with the timing reference node <b>XTR</b> (FIG. IF). As a result, the merged group <b>X</b> would be fragmented due to timing synchronization errors.

0033Referring now to <figref idref="f0002">FIGs. 2A and 2B</figref>, further details of s timing synchronization problem will be described. As illustrated in <figref idref="f0002">FIG. 2A</figref>, the TDMA frames of nodes <b>1, 3, 4</b> and <b>8</b> are not synchronized with the TDMA frames of nodes <b>2, 5, 6</b> and <b>7.</b> In accordance with a conventional approach, if node <b>3</b> is the timing reference (TR) node of group <b>30,</b> it may broadcast timing reference packets in an attempt to correct timing errors in the group or network. However, this approach may take sometime or require continuous flooding of the timing reference information. So, a more bandwidth efficient and timely approach to correct the synchronization error is needed.

0034The approach of the present invention provides a bandwidth efficient and robust timing synchronization capability in an ad-hoc network and will be described with reference to <figref idref="f0003">FIGs. 3</figref> and <figref idref="f0004">4</figref>. The mobile ad-hoc network includes at least one group <b>40</b> of mobile nodes <b>12</b> including at least one timing reference <b>(TR)</b> node. Each mobile node <b>12</b> includes a controller <b>22</b> and a wireless communications device <b>20</b> cooperating therewith to generate and transmit timing synchronization beacons having a respective hop count indicating a number of hops to the at least one timing reference node <b>TR.</b> The nodes <b>12</b> receive timing synchronization beacons from neighboring nodes, and synchronize node communication timing with neighboring nodes based upon the number of hops to the at least one timing reference node <b>TR.</b>

0035A beacon is a small condensed message that can be passed around and may include a node ID field and a parameter value field, e.g., indicating a number of hops to the TR node. The beacon may further include a group ID field defining a boundary for transmission of the beacon.

0036The at least one timing reference node TR may include a Global Positioning System (GPS) supported node. The controller <b>22</b> and the wireless communications device <b>20</b> may cooperate to periodically update the respective hop count and/or to synchronize node communication timing with the at least one timing reference node <b>TR</b> or with a neighboring node that is closer to the at least one timing reference node TR than itself.

0037Furthermore, the at least one timing reference node TR may cooperate with the other mobile nodes <b>12</b> based upon a timing source priority tree including levels (e.g., L=10, L=11 and L=12 as shown in <figref idref="f0003">FIG. 3</figref>) defined by hop counts. The at least one timing reference node TR is at a starting level (e.g., L=10) of the timing source priority tree. The other nodes <b>1, 4, 6, 7</b> (e.g., L=11) and nodes <b>2, 5</b> and <b>8</b> (e.g., L=12) are at a higher level of the timing source priority tree than the starting level and correspond to the number of hops to the at least one timing reference node TR. The controller <b>22</b> and the wireless communications device <b>20</b> of each node may cooperate to synchronize node communication timing with lower level group nodes.

0038A method aspect is directed to a method of operating a group <b>40</b> of mobile nodes <b>12</b> within an ad-hoc network, the group including at least one timing reference (TR) node. The method includes each node <b>12</b> of the group generating and transmitting timing synchronization beacons having a respective hop count indicating a number of hops to the at least one timing reference node <b>TR,</b> each node receiving timing synchronization beacons from neighboring nodes <b>12,</b> and synchronizing node communication timing with neighboring nodes based upon the number of hops to the at least one timing reference node.

0039The timing synchronization approach of the present invention may be referred to as Timing Source Priority Dynamic Hop-count (TSDH) approach with each node advertising a Group ID and a hop count (TSDH) in its beacon. The timing reference (TR) node acts as the timing reference. A single TR node was elected, e.g., with a distributed algorithm. If there are nodes with GPS timing each GPS supported node can act as a TR node. The hop-count indicates how far away a particular node is from the TR and the TR becomes a root node with the other nodes being the children nodes hanging to the root node to define a tree structure. Multiple TSDH tree structures are possible if there are more than one GPS supported nodes.

0040GPS supported nodes may result in an automatic upgrade, e.g., the TR node (for GPS) may have a TSDH level L=0, while the TR node (for non-GPS) may have a TSDH level L=10. This feature may force the whole network to synchronize with GPS nodes. Re-synchronization is possible with the TSDH as if any part of the network develops a timing synchronization error, the direction of correcting the timing will be made towards the root node of TSDH tree. For TSDH tree maintenance there may be three simple rules: Rule 1 is that the root node's TSDH value will be unchanged over time, e.g., L=0 if GPS supported, and L=10 for a non-GPS TR node; Rule 2 is that other nodes periodically update their hop count; and Rule 3 is that a node's advertised TSDH max value is TSDH = min {neighbor - TSDH} + 1. This creates tension between the root and the branches and leaves of the TSDH tree. In other words, at network edge, TSDH is trying to fly higher and higher, the root node pulls the chain straight. In the example of <figref idref="f0003">FIG. 3</figref>, node <b>3</b> is GPS based and the root of the TSDH tree. Node <b>2</b> (TSDH = 2) has different timing with node <b>4</b> and node 5. Node 2 will synchronize with node <b>4</b> (TSDH = 1), a parent node in the tree.

0041The approach of the present invention is bandwidth efficient because the hop-counts (TSDH) are automatically and dynamically updated due to node movement and topology change. No topology information packet/message is needed as the TSDH tree is automatically maintained, and in a distributed fashion. The approach is robust in ad-hoc network with unstable links. The TSDH value can be represented by a few bits.

0042Re-synchronization capability (e.g., course timing corrections) is more instant. The approach is distributed throughout a network. Automatic GPS support includes automatically synchronized to GPS timing. GPS-based node is given a minimum value, e.g., zero. Network timing tracking (e.g., small timing corrections) is addressed because when multiple GPS-based nodes exist in the network, then the clock drifting issue is mitigated. The network timing is being stabilized locally around any GPS nodes. Weighted timing correction can be achieved due to the sense of higher priority timing source being known locally among the neighbor nodes.