Route advertisement by managed gateways
US-2024380696-A1 · Nov 14, 2024 · US
US2018288782A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2018288782-A1 |
| Application number | US-201715587348-A |
| Country | US |
| Kind code | A1 |
| Filing date | May 4, 2017 |
| Priority date | Mar 30, 2017 |
| Publication date | Oct 4, 2018 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Disclosed herein are a scheduling apparatus and method. The scheduling apparatus includes a network topology configuration unit and a scheduling unit. The network topology configuration unit configures a network topology that connects nodes to which rank values have been allocated based on a sink node. The scheduling unit schedules data transmission over an uplink and a downlink in a first region and a second region defined in each slot frame based on the rank values obtained based on the sink node. The first region and the second region have different time offsets within the slot frame.
Opening claim text (preview).
What is claimed is: 1 . A scheduling apparatus, comprising: a network topology configuration unit configured to configure a network topology that connects nodes to which rank values have been allocated based on a sink node; and a scheduling unit configured to schedule data transmission over an uplink and a downlink in a first region and a second region defined in each slot frame based on the rank values obtained based on the sink node; wherein the first region and the second region have different time offsets within the slot frame. 2 . The scheduling apparatus of claim 1 , wherein the network topology configuration unit configures a network topology in a tree form by connecting nodes, having received respective beacon signals transmitted by the sink node at intervals of a predetermined period, to a time slot channel scheduling network formed by the sink node. 3 . The scheduling apparatus of claim 2 , wherein the network topology configuration unit configures the network topology in a tree form by using an IPv6 routing protocol for low-power lossy networks (RPL) protocol in a network layer and a time slot channel scheduling-based 802.15.4e protocol in a link layer. 4 . The scheduling apparatus of claim 1 , wherein the scheduling unit transmits data in the first region when a rank value obtained based on the sink node is an even rank, and transmits data in the second region when a rank value obtained based on the sink node is an odd rank. 5 . The scheduling apparatus of claim 4 , wherein the scheduling unit generates a number of slot frames for the uplink and a number of slot frames for the downlink at a preset ratio, and sets the number of slot frames for the uplink to a value larger than the number of slot frames for the downlink. 6 . The scheduling apparatus of claim 4 , wherein the scheduling unit comprises: an uplink scheduler configured to schedule transmission and reception of uplink data; and a downlink scheduler configured to schedule transmission and reception of downlink data. 7 . The scheduling apparatus of claim 6 , wherein the uplink scheduler performs the reception scheduling for the uplink by scheduling a time offset and a channel offset within the slot frame based on Equation below: TimeOffset=(NodeRank%2)*(TimeOffset/2)+Hash(NodeID+ChildID+SlotframeID)%(TimeOffset/2) ChannelOffset=Hash(ChildID+SlotframeID)%the number of channels [Equation] where % denotes a modular operation, * denotes a multiplication operation, / denotes a division operation, and Hash ( ) denotes a hash function. 8 . The scheduling apparatus of claim 6 , wherein the uplink scheduler performs the transmission scheduling for the uplink by scheduling a time offset and a channel offset within the slot frame based on Equation below: TimeOffset=(ParentRank%2)*(TimeOffset/2)+Hash(ParentID+NodeID+SlotframeID)%(TimeOffset/2) ChannelOffset=Hash(NodeID+SlotframeID)%the number of channels where % denotes a modular operation, * denotes a multiplication operation, / denotes a division operation, and Hash ( ) denotes a hash function. 9 . The scheduling apparatus of claim 6 , wherein the downlink scheduler performs the reception scheduling for the downlink by scheduling a time offset and a channel offset within the slot frame based on Equation below: TimeOffset=(ParentRank%2)*(TimeOffset/2)+Hash(ParentID+SlotframeID)%(TimeOffset/2) ChannelOffset=Hash(ParentID+SlotframeID)%the number of channels [Equation] where % denotes a modular operation, * denotes a multiplication operation, / denotes a division operation, and Hash ( ) denotes a hash function. 10 . The scheduling apparatus of claim 6 , wherein the downlink scheduler performs the transmission scheduling for the downlink by scheduling a time offset and a channel offset within the slot frame based on Equation below: TimeOffset=(ParentRank%2)*(TimeOffset/2)+Hash(ParentID+SlotframeID)%(TimeOffset/2) ChannelOffset=Hash(ParentID+SlotframeID)%the number of channels [Equation] where % denotes a modular operation, * denotes a multiplication operation, / denotes a division operation, and Hash ( ) denotes a hash function. 11 . A scheduling method for a scheduling apparatus, the scheduling method comprising: configuring a network topology that connects nodes to which rank values have been allocated based on a sink node; and scheduling data transmission over an uplink and a downlink in a first region and a second region defined in each slot frame based on the rank values obtained based on the sink node; wherein the first region and the second region have different time offsets within the slot frame. 12 . The scheduling method of claim 11 , wherein configuring the network topology comprises configuring a network topology in a tree form by connecting nodes, having received respective beacon signals transmitted by the sink node at intervals of a predetermined period, to a time slot channel scheduling network formed by the sink node. 13 . The scheduling method of claim 12 , wherein configuring the network topology comprises configuring the network topology in a tree form by using an IPv6 routing protocol for low-power lossy network (RPL) protocol in a network layer and a time slot channel scheduling-based 802.15.4e protocol in a link layer. 14 . The scheduling method of claim 11 , wherein scheduling the data transmission over the uplink and the downlink comprises performing scheduling in such a way as to transmit data in the first region when a rank value obtained based on the sink node is an even rank and to transmit data in the second region when a rank value obtained based on the sink node is an odd rank. 15 . The scheduling method of claim 14 , wherein scheduling the data transmission over the uplink and the downlink further comprises generating a number of slot frames for the uplink and a number of slot frames for the downlink at a preset ratio, and setting the number of slot frames for the uplink to a value larger than the number of slot frames for the downlink. 16 . The scheduling method of claim 14 , wherein scheduling the data transmission over the uplink and the downlink further comprises performing the reception scheduling for the uplink by scheduling a time offset and a channel offset within the slot frame based on Equation below: TimeOffset=(NodeRank%2)*(TimeOffset/2)+Hash(NodeID+ChildID+SlotframeID)%(TimeOffset/2) ChannelOffset=Hash(ChildID+SlotframeID)%the number of channels [Equation] where % denotes a modular operation, * denotes a multiplication operation, / denotes a division operation, and Hash ( ) denotes a hash function. 17 . The scheduling method of claim 14 , wherein scheduling the data transmission over the uplink and the downlink further comprises performing the transmission scheduling for the uplink by scheduling a time offset and a channel offset within the slot frame based on Equation below: TimeOffset=(ParentRank%2)*(TimeOffset/2)+Hash(ParentID+NodeID+SlotframeID)%(TimeOffset/2) ChannelOffset=Hash(NodeID+SlotframeID)%the number of channels where % denotes a modular operation, * denotes a multiplication operation, / denotes a division operation, and Hash ( ) denotes a hash function. 18 . The scheduling method of claim 14 , wherein scheduling the data transmission over the uplink and the downlink further comprises performing the reception scheduling for the downlink by scheduling a time offset and a channel offset within the slot frame based on Equation below: TimeOffset=(ParentRank%2)*(T
based on resource usage policies · CPC title
Topology update or discovery · CPC title
using a network of reference devices, e.g. beaconing · CPC title
for groups of terminals or users · CPC title
Routing tree calculation · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.