阅读说明：本技术 非时隙信道跳跃介质接入控制中的增强型广播传输方法 (Enhanced broadcast transmission method in non-time slot channel hopping medium access control ) 是由 K·维亚雅三克尔 R·维丹萨姆 于 2016-05-09 设计创作，主要内容包括：本发明披露了非时隙信道跳跃介质接入控制中的增强型广播传输方法。披露了一种操作网状网络的方法。该方法包括将网络连接为父节点的子节点(504,506)并且接收来自该父节点(502)的下行链路广播信道。该方法进一步包括响应于该接收步骤将该下行链路广播信道设置为上行链路广播信道。(The invention discloses an enhanced broadcast transmission method in non-slotted channel hopping medium access control. A method of operating a mesh network is disclosed. The method includes connecting a network as a child node (504, 506) of a parent node and receiving a downlink broadcast channel from the parent node (502). The method further includes setting the downlink broadcast channel to an uplink broadcast channel in response to the receiving step.)

1. An apparatus, comprising:

a transceiver configured to couple to a network;

a processor coupled to the transceiver and configured to:

causing the transceiver to connect the device to the network as a child of a parent node;

receiving, via the transceiver, a first broadcast schedule information element specifying a broadcast schedule of the parent node;

determining a broadcast schedule for the device based on the broadcast schedule of the parent node;

cause the transceiver to transmit a broadcast according to the broadcast schedule of the apparatus; and

cause the transceiver to transmit a beacon comprising a second broadcast schedule information element specifying the broadcast schedule of the device that is different from the broadcast schedule of the parent node.

2. The apparatus of claim 1, wherein:

the broadcast schedule of the parent node specifies a downlink broadcast channel of the parent node; and is

The processor is configured to determine the broadcast schedule of the device such that an uplink broadcast channel of the device corresponds to the downlink broadcast channel of the parent node.

3. The apparatus of claim 2, wherein:

the broadcast schedule of the parent node specifies an interval at which the parent node uses the downlink broadcast channel; and is

The processor is configured to determine the broadcast schedule of the device such that an interval at which the device uses the uplink broadcast channel of the device coincides with an interval at which the parent node uses the downlink broadcast channel.

4. The device of claim 2, wherein the processor is further configured to determine the broadcast schedule of the device such that a downlink broadcast channel of the device is different from the uplink broadcast channel of the device.

5. The apparatus of claim 4, wherein the second broadcast scheduling information element specifies the downlink broadcast channel of the apparatus.

6. The apparatus of claim 1, wherein:

the broadcast schedule of the parent node specifies an interval at which the parent node uses an uplink broadcast channel; and is

The processor is configured to determine the broadcast schedule of the device such that the device is prevented from uplink communication with the parent node during an interval in which the parent node uses the uplink broadcast channel.

7. The apparatus of claim 1, wherein the first broadcast scheduling information element includes a broadcast scheduling identifier field that specifies whether the first broadcast scheduling information element specifies: an uplink broadcast schedule of the parent node; a downlink broadcast schedule of the parent node; or an uplink broadcast schedule and a downlink broadcast schedule of the parent node.

8. The device of claim 1, wherein the network is a Personal Area Network (PAN).

9. The device of claim 8, wherein the PAN is within a presence local area network, FAN.

10. The apparatus of claim 1, wherein the first broadcast scheduling information element specifies a broadcast direction along a hierarchy of the network.

11. A node, comprising:

a transceiver; and

a processor coupled to the transceiver;

wherein the processor is configured to transmit, via the transceiver, an information element during a downlink broadcast period, the information element comprising:

a first field indicating a number of nodes of a network;

a second field indicating a propagation parameter; and

a third field indicating a mode parameter.

12. The node of claim 11, wherein:

the first field indicates a number of nodes of the network communicating through the node.

13. The node of claim 11, wherein:

the propagation parameter includes a first propagation value for configuring the receiving node to use a node broadcast schedule.

14. The node of claim 13, wherein:

the propagation parameter comprises a second propagation value for configuring the receiving node to determine a receiving node broadcast schedule.

15. The node of claim 11, wherein:

the fourth field indicates the logical distance of the routing path between the node and the receiving node.

16. The node of claim 11, wherein:

the fourth field indicates the amount of nodes between the node and the receiving node.

17. The node of claim 11, wherein:

the processor is configured to transmit to a parent node during an uplink broadcast period.

18. The node of claim 17, wherein:

the mode parameter includes a first mode value for configuring a receiving node to use the uplink broadcast period and the downlink broadcast period.

19. The node of claim 18, wherein:

the mode parameter includes a second mode value for configuring the receiving node to use a receiving node uplink broadcast period and a receiving node downlink broadcast period.

20. The node of claim 11, wherein:

a fifth field indicates a hierarchy of the network.

Background

Priority of provisional application No. 62/158,702 filed 2015, 5/8 (TI-76056PS) is claimed in this application under 35u.s.c. § 119(e), the entire disclosure of which is incorporated herein by reference.

The present embodiments relate to wireless mesh communication systems, and more particularly to enhanced broadcast transmission in presence and personal area networks.

A wireless mesh network is a wireless communication system in which at least one wireless transceiver must not only receive and process its own data, but it must also act as a relay for other wireless transceivers in the network. This may be accomplished by a wireless routing protocol in which data frames are propagated within the network by hopping from transceiver to transceiver in order to transmit the data frames from a source node to a destination node. The wireless node may be a wireless access point such as a wireless router, mobile phone, or computer capable of accessing a wireless field local area network (FAN). In other applications, the infinite node may be an external security monitor, a room monitor, a fire or smoke detector, a weather station, or any number of other FAN applications for home and business environments.

An actual mesh network must maintain a continuous network path for all wireless nodes. This requires reliable network formation, reconstruction around broken or interrupted network paths, and prioritized routing to ensure that data frames travel from source to destination along short, reliable network paths.

Fig. 1 illustrates an exemplary wireless field network (FAN) of the prior art as disclosed in version 0v79 of the 2013Wi-SUN alliance field network working group, the entire contents of which are incorporated herein by reference. The FAN includes a high-level Wi-Fi control circuit 160 that connects directly to the internet within the FAN through a wireless local area network (WAN) backhaul circuit 150 and provides services to network nodes. The FAN also includes a Personal Area Network (PAN) circuit a through C. Each PAN communicates with WAN backhaul circuits 150 through corresponding border router nodes (BRs) 100, 120 and 130.

PAN a is an exemplary network that may be similar to PANs B and C. PAN a communicates with WAN backhaul circuit 150 through border router node (BR) 100. The BR 100 communicates directly with a Relay Node (RN)102 and a Leaf Node (LN) 114. Thus, BR 100 is a parent node of RN 102 and LN 114. RN 102 is a parent node of RN 104 and communicates indirectly with LN 106 through RN 104. RN 102 also communicates directly with RN 108 and indirectly with RN 110 through RN 108. RN 108 also communicates directly with LN 112. RN 108 is a parent node of both RN 110 and LN 112.

Once a network node enters a PAN, it may communicate with other nodes of the PAN through an uplink transmission to a parent node, through a downlink transmission to a child node, or through a point-to-point transmission. The mechanism for each type of transmission depends on whether the network supports the transmission of periodic beacons. These mechanisms may be used by network nodes for synchronization if the network generates periodic beacons. Alternatively, the network nodes may not need to be synchronous and may transmit asynchronously. However, for either synchronous or asynchronous transmissions, network discovery still requires beacons so that nodes can join the PAN first. Network communication within a PAN is accomplished by Medium Access Control (MAC) frames. These frames include beacon frames, data frames, acknowledgement frames, and MAC command frames.

PAN nodes use carrier sense multiple access-collision avoidance (CSMA-CA) for either synchronous or asynchronous transmissions. The synchronous transmissions are aligned to PAN beacons having corresponding backoff periods. Asynchronous transmissions within the PAN are transmitted on non-slotted CSMA-CA channels. For asynchronous transmissions, the node waits for a random backoff period while listening to the channel. If the channel is busy, the node waits for another random backoff period before attempting to access the channel again. When the channel is idle, the node transmits the desired frame. The corresponding return acknowledgement frame without CSMA-CA acknowledges receipt.

Channel hopping has been widely used for communicating between network nodes in many wireless and wireline communication systems. Channel hopping essentially involves transmitting signals at different carrier frequencies at different time instances among many available subcarriers. A pseudo-random sequence known to both the transmitter and the receiver is typically used so that the designated receiver can listen on the correct channel. This improves communication robustness to external noise and helps to resist interference and eavesdropping. Various technologies, such as bluetooth and Digital Enhanced Cordless Telecommunications (DECT), incorporate channel hopping mechanisms. Channel hopping can be achieved in many different ways. The most common of which are synchronous channel hopping or slotted channel hopping (TSCH) and asynchronous non-slotted channel hopping as defined by IEEE 802.15.4e, the entire disclosure of which is incorporated herein by reference. There are also many standards that use such channel hopping MACs to define MAC protocols for different applications, such as Wi-SUN alliance FAN.

Referring to fig. 2, there is a non-slotted channel hopping diagram for network nodes A, B and C. In a non-slotted channel hopping MAC, each node chooses a hopping sequence and hops their receivers to different channels according to the sequence. Each node spends a specified time interval or dwell interval on each channel before hopping to the next channel. There are many ways to track the non-slotted channel hopping sequences of neighboring nodes within a PAN, such as the FH-discovery method proposed by the Wi-SUN alliance.

However, there are several problems that can occur with various channel hopping communication systems. Unicast transmissions to a particular receiver are the receivers that are pointed to in the sense that the node transmits the frame in CSMA-CA in the channel of the receiver. Referring to fig. 3, for example, node a has a normal hopping sequence 1-2-3-4-5. The node B has a normal hopping sequence 1-5-2-4-3. Node a receives a data request from node B on channel 2. Node a responsively transmits data to node B on channel 5. Node B receives the data and transmits an Acknowledgement (ACK) to node a on channel 5. But the data and ACK exceed the dwell time of channel 5 and cause the node B to temporarily abandon its normal hopping sequence on channel 2. If another node of the PAN transmits a data frame to node B on channel 2 according to its normal hopping sequence, the frame will be lost because node B is still communicating with node a on channel 5.

Another problem may arise during broadcast transmissions within a PAN. As shown in fig. 4, the broadcast transmission occurs during a broadcast listening slot. Each node broadcasts a broadcast listening slot to which its transmitter points, and then all other nodes interested in the broadcast transmission can listen to the broadcast channel of the broadcasting node. When a device listens to another node broadcast slot, it must tune its receiver to the broadcast channel being broadcast. This requires the node to deviate from the unicast channel it broadcasts. The node then resumes its unicast channel hopping after completing the broadcast channel listening as if no deviation had occurred. For example, when node a listens to a broadcast by node B, the other nodes in the PAN will not know that node a has suspended its unicast schedule. If another PAN node transmits a frame to node a based on its advertised unicast schedule, the frame will be lost.

Another problem arises when there is no limit to the number of broadcast channels that a node can listen to. In this case, the node may spend much of its time listening to the broadcast channel. Therefore, it does not follow its unicast channel hopping schedule and may lose unicast transmissions from other nodes within the PAN. A similar problem arises when a node listens to only a few other nodes broadcasts to maximize time on its unicast schedule. In this case, it may lose the required broadcast data from other nodes. For example, a node may lose routing information, such as routing protocols for low power and lossy network (RPL) frames. Thus, when available, the node may not be able to select a better parent. One solution is to follow a single global broadcast schedule for all nodes. But this limits the broadcast transmission to a single schedule and requires precise time synchronization for all nodes.

While prior art network solutions provide a steady improvement in wireless network communications, the present inventors have recognized that further improvements to mesh network protocols are still possible. Accordingly, the preferred embodiments described below are directed to this and other improvements over the prior art.

Disclosure of Invention

In a first embodiment of the present invention, a method of operating a mesh network in a wireless communication system is disclosed. The method comprises the following steps: the network is connected as a child node of a parent node, and receives a downlink broadcast channel from the parent node. The method further includes setting the downlink broadcast channel to an uplink broadcast channel in response to the receiving step.

In a second embodiment of the present invention, a method of operating a mesh network in a wireless communication system is disclosed. The method includes transmitting a beacon from a first node to a second node. The first node directs the second node to set the same uplink broadcast channel as the downlink broadcast channel of the first node.

Drawings

FIG. 1 is a diagram illustrating an exemplary radio Field Area Network (FAN) of the prior art;

fig. 2 is a diagram illustrating an exemplary channel hopping schedule for respective network nodes A, B and C;

fig. 3 is a diagram illustrating a problem that may occur with non-slotted channel hopping for network nodes A, B and C according to the prior art;

FIG. 4 is an exemplary diagram illustrating the relationship between unicast scheduling and broadcast scheduling in the prior art;

fig. 5 is a flow chart illustrating network discovery and PAN entry by candidate nodes according to the present invention;

FIG. 6A is a broadcast scheduling information element (BS-IE) frame of the present invention;

FIG. 6B is a diagram illustrating the broadcast schedule type bits of FIG. 6A;

FIG. 7 is a diagram illustrating the relationship between unicast schedules and broadcast schedules for nodes A, B and C according to the present invention;

FIG. 8A is a personal area network cell (PAN-IE) frame of the present invention; and is

Fig. 8B is a diagram illustrating the broadcast scheduling mode bit of fig. 8A.

Detailed Description

Referring now to fig. 5, fig. 5 is a flow chart illustrating network discovery and PAN entry by a candidate node according to the present invention. The method starts in step 500 when a candidate node attempting to connect to a PAN starts a passive scan. The candidate node receives a PAN beacon from the PAN coordinator in step 502 and requests a connection PAN in step 504. The PAN coordinator may grant or deny the request at step 506. If the PAN coordinator rejects the request, the candidate node resumes passive scanning at step 500. Alternatively, if the request is authorized, the PAN coordinator adds the candidate node as a child node in step 508. At step 510, the newly added node adds the PAN coordinator to its neighbor list. The node then transmits its own beacon to the PAN. The PAN entry is complete in step 514.

Referring now to fig. 6A, fig. 6A is a broadcast scheduling information element (BS-IE) frame of the present invention. This frame is an information element or beacon that identifies the broadcast schedule of the originating or broadcasting node. Multicast data or routing requires broadcast transmission. For example, RPL routing relies on broadcast messages to form routes. Unlike conventional systems, broadcast transmissions in non-slotted channel hopping networks occur only at a particular frequency during a specified broadcast period. Thus, the transmission and reception of the broadcast must be synchronized to succeed. Network nodes typically use uplink broadcasts for transmission to network neighbors or for route discovery procedures.

The Broadcast Interval (BI) field of the BS-IE is a 32-bit (4 octets) unsigned integer indicating a duration in milliseconds between broadcast dwell intervals within the broadcast schedule of the broadcasting node. The Broadcast Schedule Identifier (BSI) field is a 16-bit (2-octet) unsigned integer that is set to a BSI value corresponding to the broadcast channel hopping sequence currently used in the PAN. The Dwell Interval (DI) field is an 8-bit unsigned integer set to the time (in milliseconds) during which the node is active on each channel of the node's hop schedule. The clock drift field is an 8-bit unsigned integer set to report the worst case clock drift of the node to measure its frequency hopping DI. The timing accuracy field is an 8-bit unsigned integer that indicates the accuracy of time values generated by the node up to a 10 millisecond resolution. The channel plan field is a 3-bit unsigned integer indicating the source of the channel plan for the node. The channel function field is a 3-bit unsigned integer that indicates the source of the channel function for the node. The excluded channel control field is a 2-bit integer indicating whether an excluded channel exists in the BS-IE. The channel information field is of variable size and indicates specific details including channel spacing, number of channels, channel hop count, channel hop list, and excluded channel range.

Turning now to fig. 6B, fig. 6B is a diagram illustrating the broadcast schedule type bit of fig. 6A in accordance with the present invention. As previously described, the broadcast schedule identifier field is a 16-bit (2 octets) unsigned integer set to the BSI value corresponding to the broadcast channel hopping sequence currently used in the PAN. The first 2 bits indicate a Broadcast Scheduling (BS) type. The remaining 14 bits indicate the broadcast channel hopping sequence currently used in the PAN. The BS type field is set to 00 to indicate that a broadcast channel is used for uplink and downlink communications. It is set to 01 to indicate that the broadcast channel is used for uplink communication only and set to 10 to indicate that the broadcast channel is used for downlink communication only.

When the network node receives a BS-IE frame from a parent node (502, fig. 5), it sets its uplink broadcast channel to the parent downlink broadcast channel (510, fig. 5). This is illustrated in the diagram of fig. 7, where node a is the parent node of node B, and node B is the parent node of node C. If node a communicates directly with the BR node of the PAN, it sets its uplink broadcast channel (broadcast _ uplink) to the same time and frequency as the downlink broadcast of the BR node. Node a also selects the downlink broadcast channel (broadcast _ downlink) between CH4 and CH 1. The node B sets its uplink broadcast channel (broadcast _ uplink) to the same time and frequency as the downlink broadcast of node a. The node B also selects a downlink broadcast channel (broadcast _ downlink) between CH1 and CH 3. Node C sets its uplink broadcast channel (broadcast _ uplink) to the same time and frequency as the downlink broadcast of node B. Node C also selects the downlink broadcast channel (broadcast _ downlink) between CH3 and CH 4. This process is highly advantageous for several reasons. First, it assumes that a child node will not lose downlink broadcasts from its parent node. The child node will transmit an uplink broadcast during the parent node downlink broadcast using CSMA-CA. Thus, if there is a parent downlink broadcast, the child node will receive it. Second, the child node can select any downlink broadcast schedule or reuse an existing uplink broadcast schedule. Third, after a network node enters the PAN and transmits its own beacon (512, fig. 5), the selected broadcast schedule is communicated to other network nodes along with the channel hopping pattern. Fourth, each network node may select to have the same downlink broadcast schedule as its uplink broadcast schedule. In this case, all network nodes share a common broadcast schedule, and network maintenance and implementation is greatly simplified. Finally, each node can independently select a different broadcast schedule to maximize broadcast channel diversity.

In an alternative embodiment of the invention, the Border Router (BR) node may specify a broadcast mode of operation for network nodes of the PAN. Fig. 8A is a diagram of a personal area network cell (PAN-IE), which is part of a MAC command frame according to the present invention. The PAN size field is a 16-bit (2-octet) unsigned integer set to the number of PAN nodes communicating over the BR. The routing cost field is an 8-bit unsigned integer set to an estimate of the logical distance or number of nodes of the routing path from the node to the BR. The parent node BS-IE field is used as a 1-bit signal indicating whether the receiving node must propagate the parent node's BS-IE. If the bit is set to 1, the receiving node must use the broadcast schedule of the parent node as indicated by the BS-IE of the parent node. If the node is set to 0, the receiving node may create its own broadcast schedule in the corresponding BS-IE. The routing method field is a 1-bit signal indicating whether the PAN is a level 2 or level 3 network. The EAPOL ready field is a 1-bit signal indicating whether the transmitting node can accept the EAPOL authentication message. One bit of the 6-bit reserved field is used to indicate the indicated Broadcast (BS) mode of the receiving node. As shown in fig. 8B, this 1-bit field is set to 0 to indicate that the broadcast channel is globally unique. In this case, each node of the PAN uses the same uplink and downlink broadcast periods. Alternatively, if the BS mode field is set to 1, the receiving node selects the parent node downlink broadcast period for its uplink broadcast period and selects the downlink broadcast period on its own. When a node selects different broadcast schedules for the uplink and downlink directions, it should also periodically exchange timing information for each schedule so that other nodes can follow different schedules, respectively.

A node may select more than one uplink schedule. If so, it should inform other PAN nodes of the selected schedule through its message exchange. However, it is preferable to limit the number of different uplink BS-IEs to the number that the node can listen to, to a maximum of two to keep the network management easy to handle. In particular, if the network node selects more than one downlink broadcast schedule, the child nodes should be informed so that they can follow all parent downlink broadcasts. A node may also change the different BS-IEs it monitors and then broadcast them in its configuration beacon. For example, a node may obtain a beacon from a new node and decide to follow the new node while still following its parent. In this case, the node should follow its preferred parent downlink schedule while also following the broadcast schedule of the alternate node. Shortly thereafter, the device may choose to change the parent node or stop monitoring the schedule of the alternate node.

When a node receives a broadcast frame in its uplink BS slot, it indicates the broadcast frame to the Next Higher Layer (NHL). The NHL may then choose to send the frame in its downlink BS slot to ensure that the broadcast frame is actually received by the different groups of nodes. Therefore, the NHL should thus specify whether the broadcast frame will be transmitted within the uplink or downlink broadcast period.

The data packet received during the uplink broadcast period is from a parent node of the receiving node. Therefore, it should rebroadcast within the receiving node downlink period to ensure that the child nodes of the node receive the broadcast frame. Also, when a broadcast frame is received during a downlink broadcast period of a node, an interworking should be performed. Since this frame is from a child node, it should be rebroadcast to other children of the child of nodes in the PAN.

Still further, while various examples have been provided accordingly, those skilled in the art will appreciate that various modifications, substitutions and alterations can be made to the described embodiments while still falling within the scope of the invention as defined by the following claims. For example, although the preferred embodiments of the present invention apply to directed acyclic graphs or tree networks, they can be readily adapted to any network topology. Other combinations will be readily apparent to those of ordinary skill in the art having access to the present description.