Patent application number | Description | Published |
20130013806 | EFFICIENT RENDEZVOUS FOR DISTRIBUTED MESSAGES IN FREQUENCY-HOPPING COMMUNICATION NETWORKS - In one embodiment, a rendezvous request message is generated (e.g., by a sender) that specifies a channel C and a rendezvous time T for which a distributed message is to be transmitted in a frequency-hopping computer network. The rendezvous request message is then transmitted on one or more channels used in the computer network based on reaching a plurality of intended recipients of the distributed message with the rendezvous request message prior to rendezvous time T. Accordingly, the distributed message is then transmitted on channel C at rendezvous time T. In another embodiment, a device receives a rendezvous request message, and in response to determining to honor the rendezvous request message, listens for the distributed message on channel C at rendezvous time T. | 01-10-2013 |
20130016757 | TIMING RE-SYNCHRONIZATION WITH REDUCED COMMUNICATION ENERGY IN FREQUENCY HOPPING COMMUNICATION NETWORKSAANM Hui; Jonathan W.AACI Foster CityAAST CAAACO USAAGP Hui; Jonathan W. Foster City CA USAANM Woo; Lik Chuen AlecAACI Union CityAAST CAAACO USAAGP Woo; Lik Chuen Alec Union City CA USAANM Hong; WeiAACI BerkeleyAAST CAAACO USAAGP Hong; Wei Berkeley CA US - In one embodiment, a battery-operated communication device “quick-samples” a frequency hopping sequence at a periodic rate corresponding to a substantially low duty cycle, and is discovered by (e.g., attached to) a main-powered communication device. During a scheduled sample, the main-powered communication device transmits a control packet to be received by the battery-operated communication device, the control packet containing timing information and transmitted to account for worst-case clock drift error between the two devices. The battery-operated communication device responds to the control packet with a link-layer acknowledgment containing timing information from the battery-operated communication device. Accordingly, the two devices may re-synchronize their timing based on the timing information in the control packet and acknowledgment, respectively. | 01-17-2013 |
20130016758 | OVERLAYING INDEPENDENT UNICAST FREQUENCY HOPPING SCHEDULES WITH A COMMON BROADCAST SCHEDULEAANM Hui; Jonathan W.AACI Foster CityAAST CAAACO USAAGP Hui; Jonathan W. Foster City CA USAANM Hong; WeiAACI BerkeleyAAST CAAACO USAAGP Hong; Wei Berkeley CA USAANM Woo; Lik Chuen AlecAACI Union CityAAST CAAACO USAAGP Woo; Lik Chuen Alec Union City CA US - In one embodiment, each device in a frequency hopping communication network independently determines its own local unicast listening schedule, and discovers a neighbor unicast listening schedule for each of its neighbors. The devices also synchronize to a common broadcast schedule for the network that simultaneously overlays a configured portion of all unicast listening schedules in the network. Accordingly, the device operate in a receive mode according to their local unicast listening schedule and the common broadcast schedule during the overlaid configured portion, and in a transmit mode according to each neighbor unicast listening schedule and the common broadcast schedule during the overlaid configured portion depending upon a destination of transmitted traffic. | 01-17-2013 |
20130016759 | POWER CONSERVATION AND LATENCY MINIMIZATION IN FREQUENCY HOPPING COMMUNICATION NETWORKSAANM Hui; Jonathan W.AACI Foster CityAAST CAAACO USAAGP Hui; Jonathan W. Foster City CA USAANM Hong; WeiAACI BerkeleyAAST CAAACO USAAGP Hong; Wei Berkeley CA USAANM Woo; Lik Chuen AlecAACI Union CityAAST CAAACO USAAGP Woo; Lik Chuen Alec Union City CA US - In one embodiment, a communication device samples a particular frequency hopping sequence during only a particular specified sub-timeslot of a timeslot. If a transmission energy is not detected during the specified sub-timeslot, the device turns off its receiver for a remainder of the timeslot. Otherwise, it continues to sample the particular frequency hopping sequence for at least one or more additional sub-timeslots of the remainder of the timeslot. In another embodiment, a communication device determines whether a neighboring communication device is operating in a first mode or a second mode. If in the second mode, it transmits a transmission to the neighboring communication device starting at any sub-timeslot of the plurality of sub-timeslots. If in the first mode, it transmits the transmission to the neighboring communication device while ensuring that the transmission is actively energized during a particular specified sub-timeslot. | 01-17-2013 |
20130018993 | EFFICIENT USE OF DYNAMIC HOST CONFIGURATION PROTOCOL IN LOW POWER AND LOSSY NETWORKSAANM Hui; Jonathan W.AACI Foster CityAAST CAAACO USAAGP Hui; Jonathan W. Foster City CA USAANM Woo; Lik Chuen AlecAACI Union CityAAST CAAACO USAAGP Woo; Lik Chuen Alec Union City CA USAANM Hong; WeiAACI BerkeleyAAST CAAACO USAAGP Hong; Wei Berkeley CA US - In one embodiment, each of a plurality of devices in a computer network is configured to i) transmit a unicasted dynamic host configuration protocol (DHCP) solicit message to a neighbor device having a route to a border router as an assumed DHCP relay without regard to location of a DHCP server, and ii) operate as a DHCP relay to receive unicasted DHCP solicit messages and relay the solicit message to the border router of the network without regard to location of the DHCP server, and to relay a DHCP reply to a corresponding requestor device. | 01-17-2013 |
20130028103 | LINK RELIABILITY METRICS IN COMMUNICATION NETWORKS - In one embodiment, a transmitter in a communication network receives an indication of active transmission times of a receiver to which the transmitter attempts to reach with first transmissions, the active transmission times indicating respective times of second transmissions initiated by the receiver. Based on determining when the first transmissions occur, the transmitter may then compute a link reliability metric for a link from the transmitter to the receiver by excluding one or more of the first transmissions from the indicated active transmission times of the second transmissions. In one embodiment, the active transmission times are in the past and the reliability metric excludes any first transmissions in the past during those times, while in another embodiment the active transmission times are scheduled in the future and the reliability metric does not include any first transmissions since the first transmissions may be scheduled to avoid the active transmission times. | 01-31-2013 |
20130028295 | COLLECTING POWER OUTAGE NOTIFICATIONS IN A FREQUENCY HOPPING COMMUNICATION NETWORK - In one embodiment, a device in a frequency hopping communication network operate in a first mode according to a common broadcast schedule for the network that simultaneously overlays a first configured portion of all independently determined unicast listening schedules in the network. In response to determining a power outage condition, the device switches to operation in a power outage mode where the common broadcast schedule for the network in the power outage mode simultaneously overlays a second configured portion of all independently determined unicast listening schedules in the network, the second configured portion greater than the first configured portion. In one embodiment, the device broadcasts one or more power outage notifications (PONs) in response to determining the power outage condition as a reduction of a main power supply at the device. In another embodiment, the device receives a PON while powered as the power outage condition. | 01-31-2013 |
20130036305 | Group Key Management and Authentication Schemes for Mesh Networks - According to one embodiment, techniques are provided to enable secure communication among devices in a mesh network using a group temporal key. An authenticator device associated with a mesh network stores a pairwise master key for each of a plurality of devices in a mesh network upon authentication of the respective devices. Using the pairwise master key, the authenticator device initiates a handshake procedure with a particular device in the mesh network to mutually derive a pairwise temporal key from the pairwise master key. The authenticator device encrypts and signs a group temporal key using the pairwise temporal key for the particular device and sends the group temporal key encrypted and signed with the pairwise temporal key to the particular device. | 02-07-2013 |
20130042301 | Authentication Control In Low-Power Lossy Networks - Techniques are provided for the controlled scheduling of the authentication of devices in a lossy network, such as a mesh network. An authenticator device that is configured to authenticate devices in a lossy network receives an authentication start message from a particular device to be authenticated. The authenticator device determines a schedule for engaging in an authentication procedure for the particular device based on an indication of current network utilization. | 02-14-2013 |
20130094536 | EFFICIENT NETWORK DISCOVERY IN FREQUENCY HOPPING NETWORKS - In one embodiment, a device in a frequency hopping communication network transmits responsive beacon messages based on adaptive types of responsive beacon message transmission based on a number of received beacon requests within a given time period: the number below a threshold results in synchronized unicast messages; the number above the threshold results in unsynchronized broadcast messages. In another embodiment, the device suppresses unsolicited beacon message transmission based on a density-aware redundancy count of other unsolicited beacon message transmissions from neighboring devices. In another embodiment, the device may transmit unsolicited beacon messages according to an adaptive interval based on stability of the network. In another embodiment, the device may suppress transmission of a beacon request to join the communication network based on a density-aware redundancy count of other beacon requests from neighboring devices, and transmits beacon requests at an adaptive interval that increases in response to each unanswered beacon request. | 04-18-2013 |
20130250866 | FULL-DUPLEX CAPACITY ALLOCATION FOR OFDM-BASED COMMUNICATION - In one embodiment, device determines a quantity of subcarriers available for data frame transmission and data frame receipt based on information included in an acknowledgement data frame. The device transmits a first data frame over at least one of the subcarriers and includes information associated with one or more additional data frames pending transmission. The device then receives a second data frame, subsequent to transmission of the first data frame, and determines a quantity of subcarriers available for transmission of the one or more additional data frames pending transmission based on the information included in the second data frame. | 09-26-2013 |
20130250953 | ALLOWING A SINGLE TRANSMITTER TO TRANSMIT MULTIPLE DATA FRAMES IN OFDM COMMUNICATION NETWORKS - In one embodiment, a transmitting device may determine a first data frame to a first destination and a second data frame to a second destination, and may assign subcarriers in a non-overlapping arrangement to the first and second data frames. Once assigned, the transmitting device may augment a transmission physical (PHY) header with a destination and tone map tuple for each of the first and second destinations, and transmits the transmission with the first and second data frames simultaneously on the assigned subcarriers. | 09-26-2013 |
20130250969 | OPTIMIZING THROUGHPUT OF DATA FRAMES IN ORTHOGONAL FREQUENCY DIVISION MULTIPLEXING (OFDM) COMMUNICATION NETWORKS - In one embodiment, a device maintains a predetermined number of high-priority subcarriers for use in communicating high-priority data frames and a predetermined number of low-priority subcarriers for use in communicating low-priority data frames. A data frame is received and a data frame priority is determined for the data frame. If the data frame is determined to be a low-priority data frame, a minimum number of subcarriers, from the low-priority subcarriers, required for communication of the data frame is determined and the data frame is communicated using the minimum number of subcarriers. If the data frame is determined to be a high-priority data frame, a maximum number of subcarriers available, including the high-priority subcarriers and the low-priority subcarriers, is determined and the data frame is communicated using the maximum number of subcarriers. | 09-26-2013 |
20130251053 | REDUCING THE IMPACT OF SUBCARRIER QUALITY EVALUATION - In one embodiment, a device may select, based on an optimal tone map, a particular subcarrier for use when transmitting a data frame, the data frame to serve as a tone map request (TMREQ). The device may then populate one or more unused quality subcarriers of the TMREQ data frame other than the particular subcarrier with a well-known bit sequence, and transmits the TMREQ data frame to a receiving device to cause the receiving device to evaluate transmission quality of the one or more unused quality subcarriers based on the well-known bit sequence. | 09-26-2013 |
20130251054 | DYNAMIC SUBCARRIER UTILIZATION AND INTELLIGENT TRANSMISSION SCHEDULING - In one embodiment, a transmitting device monitors transmission activity of each of a plurality of subcarriers in a communication network, and determines a set of unutilized subcarriers of the plurality of subcarriers. As such, the transmitting device may then transmit a data frame on one or more of the unutilized subcarriers to a receiving device while transmission activity is present on one or more utilized subcarriers within the network. In another embodiment, the transmitting device may also determine timing information associated with the transmission activity, and may correspondingly schedule the transmitting to optimize network performance based on the timing information. | 09-26-2013 |
20130279365 | DISTRIBUTED NODE MIGRATION BETWEEN ROUTING DOMAINS - In one embodiment, a device connected to a network receives at a network interface a first network size indicator for a first network and a second network size indicator for a second network. A difference between the first network size indicator and the second network size indicator is determined and a switching probability is calculated if the difference between the network size indicators is greater than a predetermined network size difference threshold. The device may then migrate from the first network to the second network based on the switching probability. | 10-24-2013 |
20130279540 | ON-DEMAND PAIR-WISE FREQUENCY-HOPPING SYNCHRONIZATION - In one embodiment, a device receives and stores a broadcast schedule, and may determine whether a neighbor unicast listening schedule is available for a neighboring device. If so, the device may transmit a data frame to the neighboring device pursuant to the neighbor unicast listening schedule. If a neighbor unicast listening schedule is not available, the device may transmit the data frame to the neighboring device pursuant to a broadcast schedule. Once the data frame is received by the neighboring device, pursuant to the neighbor unicast listening schedule or the broadcast schedule, an acknowledgement may be received from the neighboring device, which may include an updated neighbor unicast listening schedule for that neighboring device. | 10-24-2013 |
20130283347 | SCALABLE REPLAY COUNTERS FOR NETWORK SECURITY - In one embodiment, an authenticator in a communication network maintains a persistent authenticator epoch value that increments each time the authenticator restarts. The authenticator also maintains a persistent per-supplicant value for each supplicant of the authenticator, each per-supplicant value set to a current value of the authenticator epoch value each time the corresponding supplicant establishes a new security association with the authenticator. To communicate messages from the authenticator to a particular supplicant, each message uses a per-supplicant replay counter having a security association epoch counter and a message counter specific to the particular supplicant. In particular, the security association epoch counter for each message is set as a difference between the authenticator epoch value and the per-supplicant value for the particular supplicant when the message is communicated, while the message counter is incremented for each message communicated. | 10-24-2013 |
20130283360 | DISTRIBUTED GROUP TEMPORAL KEY (GTK) STATE MANAGEMENT - In one embodiment, each security protocol supplicant in a computer network determines its group temporal key (GTK) state, and exchanges the GTK state with one or more neighbor supplicants in the computer network. Based on the exchange, a supplicant may determine whether any inconsistencies exist in its GTK state, and in response to any inconsistencies in the GTK state, may perform a GTK state synchronization with a security protocol authenticator by indicating to the authenticator what is needed to resolve the inconsistent GTK state at the particular supplicant. In another embodiment, the authenticator, which is configured to not store per-supplicant GTK state, may transmit beacons containing GTK identifiers (IDs) of GTKs currently enabled on the authenticator, and also responds to supplicants having inconsistent GTK states with one or more needed GTKs as indicated by the supplicants. | 10-24-2013 |
20140036908 | RECORDING PACKET ROUTES USING BLOOM FILTERS - In one embodiment, a Bloom filter is provided in a data packet signal functional to preferably encode the identifier of each nodal device and record the nodal hop count the signal traverses across in a computer network. The Bloom filter provided in a data packet signal has one or more fields. The recorded nodal path may updated en-route as the data packet traverses a nodal path in the computer network and/or the order of nodes traversed by the data packet in the computer network are encoded in the bloom filter. | 02-06-2014 |
20140036912 | MULTICAST GROUP ASSIGNMENT USING PROBABILISTIC APPROXIMATIONS - In one embodiment, a source node (e.g., responsible node) determines a plurality of destination nodes of a message, and generates a probabilistic data structure that encodes each of the plurality of destination nodes without any false negatives and with zero or more false positives. The source node may then transmit the message with the probabilistic data structure toward the plurality of destination nodes, wherein nodes receiving the message interpret the probabilistic data structure to determine whether the receiving node is probabilistically one of the intended plurality of destination nodes. | 02-06-2014 |
20140036925 | COMPRESSING DATA PACKET ROUTING INFORMATION USING BLOOM FILTERS - In one embodiment, a Transit Information Bloom Filter (TIBF) signal component is generated for use with a routing protocol control message, the TIBF signal component identifying at least one parent node for a corresponding routing topology. The TIBF signal component is encoded in a generated Bloom filter. The parameters of the generated Bloom filter are based at least on one parent node to be encoded and a desired false positive rate for the Bloom filter. The address for each parent node is also encoded in the Bloom filter. | 02-06-2014 |
20140064172 | TIMING RE-SYNCHRONIZATION WITH REDUCED COMMUNICATION ENERGY IN FREQUENCY HOPPING COMMUNICATION NETWORKS - In one embodiment, a battery-operated communication device “quick-samples” a frequency hopping sequence at a periodic rate corresponding to a substantially low duty cycle, and is discovered by (e.g., attached to) a main-powered communication device. During a scheduled sample, the main-powered communication device transmits a control packet to be received by the battery-operated communication device, the control packet containing timing information and transmitted to account for worst-case clock drift error between the two devices. The battery-operated communication device responds to the control packet with a link-layer acknowledgment containing timing information from the battery-operated communication device. Accordingly, the two devices may re-synchronize their timing based on the timing information in the control packet and acknowledgment, respectively. | 03-06-2014 |
20140092752 | DENSITY-BASED POWER OUTAGE NOTIFICATION TRANSMISSION SCHEDULING IN FREQUENCY-HOPPING NETWORKS - In one embodiment, a node may discover the density of neighboring nodes in a frequency-hopping communication network. In response to identifying a power outage condition, the node may also dynamically determine an initial power outage notification (PON) transmission protocol based on the density of neighboring nodes. The node may then communicate a first PON to a plurality of neighboring nodes according to the initial PON transmission protocol. | 04-03-2014 |
20140092905 | ROUTING MESSAGES IN A COMPUTER NETWORK USING DETERMINISTIC AND PROBABILISTIC SOURCE ROUTES - In one embodiment, a data packet message is provided which includes a routing header configured to accommodate both a deterministic source route and a probabilistic source route for encoding a nodal source route. The nodal source route is selectively encoded with one or both of a deterministic source route and a probabilistic source route based upon one or more predetermined criteria. | 04-03-2014 |
20140105015 | NETWORK TRAFFIC SHAPING FOR LOW POWER AND LOSSY NETWORKS - In one embodiment, data packet messages are received in a Field Area Router (FAR) sent from one or more sources toward one or more destination devices in a Low-Power Lossy Network (LLN). An LLN routing topology for the data packet messages is interpolated in the FAR. An expected time for the data packet messages to reach a destination device in the LLN is determined based upon the routing topology interpolation. Traffic shaping is applied by thse FAR for the data packet messages based upon the determined expected time for the data packet messages to reach destination devices in the LLN. | 04-17-2014 |
20140105211 | ELIMINATING IPV6 NEIGHBOR SOLICITATIONS IN CONSTRAINED COMPUTER NETWORKS - In one embodiment, the techniques herein provide that a node may receive a packet from a neighboring node in a low power and lossy network (LLN). The node may then extract, from the packet, a link-layer source address from a link layer header and an internet protocol (IP) source address from an IP header. The node may then determine whether the neighboring node originated the packet and, based on that determination, the node may correlate the link-layer source address with the IP source address to provide neighbor discovery. | 04-17-2014 |
20140108643 | MAINTAINING AND COMMUNICATING NODAL NEIGHBORING INFORMATION - In one embodiment, a nodal device receives information from each of its neighboring nodes in a network. The information identifies a link quality between the nodal device and each of its neighboring nodes. The link quality information is stored in one or more bloom filters in the nodal device such that a table having a compressed format is provided in the bloom filter. The table includes probabilistic identifiers to identify link quality between the nodal device and each of its neighboring nodes. | 04-17-2014 |
20140126354 | SEAMLESS MULTIPATH RETRANSMISSION USING SOURCE-ROUTED TUNNELS - In one embodiment, a device receives a destination unreachable message originated by a particular node along a first source route, the message carrying an encapsulated packet as received by the particular node. In response, the device may determine a failed link along the first source route based on a tunnel header and the particular node. Once determining an alternate source route without the failed link, the device may re-encapsulate and re-transmit the original packet on an alternate source route with a new tunnel header indicating the alternate source route (e.g., and a new hop limit count for the tunnel header and an adjusted hop limit count in the original packet). | 05-08-2014 |
20140126431 | INTERFACING WITH LOW-POWER AND LOSSY NETWORKS - In one embodiment, a client device determines when it is coupled to an IoT/LLN device to establish and enable an IP link between a headset interface on the client device and a signal interface on the IoT/LLN device. Once the IP link is established, a duplex data signal is transmitted between the client device and the IoT/LLN device, via the IP link. | 05-08-2014 |
20140126610 | FAST FREQUENCY-HOPPING SCHEDULE RECOVERY - In one embodiment, a device determines a need to resynchronize a broadcast and unicast frequency-hopping schedules on its network interface. In response to the need, the device may solicit the broadcast schedule from one or more neighbor devices having the synchronized broadcast schedule, and then establishes the unicast schedule for the network interface using communication during the synchronized broadcast schedule. | 05-08-2014 |
20140269413 | CYCLE-FREE MULTI-TOPOLOGY ROUTING - In one embodiment, a node in a shared-media communication network may determine a first directed acyclic graph (DAG) topology, wherein the first DAG topology has a particular direction. The node may determine a second DAG topology in the shared-media communication network based on the first DAG topology. The second DAG topology may share the particular direction of the first DAG topology, to prevent loops between the first and the second DAG topologies. | 09-18-2014 |
20140314096 | CONTROLLING ROUTING DURING SCHEDULED NODE DOWNTIME - In one embodiment, a first node in a shared-media communication network may receive a message indicated a scheduled downtime of a second node located between the first node and a destination. The first node may determine whether to perform a search for an alternate route toward the destination. In response to determining to perform the search, the first node may perform the search for an alternate route toward the destination for use at least during the scheduled downtime. | 10-23-2014 |
20140330947 | EFFICIENT USE OF DYNAMIC HOST CONFIGURATION PROTOCOL IN LOW POWER AND LOSSY NETWORKS - In one embodiment, each of a plurality of devices in a computer network is configured to i) transmit a unicasted dynamic host configuration protocol (DHCP) solicit message to a neighbor device having a route to a border router as an assumed DHCP relay without regard to location of a DHCP server, and ii) operate as a DHCP relay to receive unicasted DHCP solicit messages and relay the solicit message to the border router of the network without regard to location of the DHCP server, and to relay a DHCP reply to a corresponding requestor device. | 11-06-2014 |
20140372577 | DYNAMICALLY ADJUSTING NETWORK PARAMETERS USING WEATHER FORECASTS - In one embodiment, network parameters are dynamically adjusted using weather forecasts. The embodiments include determining a weather forecast that predicts a weather condition proximate to a network. Network parameters are then selected for adjustment based on the predicted weather condition. The selected network parameters are adjusted to improve performance of the network in response to the predicted weather condition. | 12-18-2014 |
20140372585 | RELIABLE BULK DATA DISSEMINATION USING RATELESS CODES - In one embodiment, an aggregating node receives feedback messages from one or more destination nodes in the network. The destination nodes are designated to receive data as packets from a source node using rateless coding. Further, the feedback messages indicate whether packets are needed at a corresponding destination node to complete the data. Then, the feedback messages are aggregated into a single aggregated message, and the aggregated message is transmitted toward the source node. | 12-18-2014 |
20140376361 | FAST REROUTE USING DIFFERENT FREQUENCY-HOPPING SCHEDULES - In one embodiment, a primary node in a shared-media communication network is selected by a node toward a destination. In response to determining the primary node, the node determines a frequency-hopping schedule of the primary node. One or more backup nodes for the primary nodes are then determined based on a frequency-hopping schedule diversity between the primary node and the one or more backup nodes. | 12-25-2014 |
20140376567 | OVERLAYING RECEIVE SCHEDULES FOR ENERGY-CONSTRAINED DEVICES IN CHANNEL-HOPPING NETWORKS - In one embodiment, a time at which a first device in a frequency-hopping communication network is expected to transmit a data message is determined. A first schedule is then generated based on the determined time, and the first schedule is overlaid on a frequency-hopping schedule for a second device in the network. The first schedule defines a first timeslot during which the second device listens for the data message, while the frequency-hopping schedule defines second timeslots during which the second device listens for data messages from other devices in the network. Notably, a duration of the first timeslot is greater than respective durations of the second timeslots. | 12-25-2014 |
20150023363 | OBTAINING DATA RECEPTION PARAMETERS ON-DEMAND IN A MULTIPLE INTERFACE NETWORK - In a multi-PHY, low power and lossy network comprising a plurality of nodes, a sender determines that a dwell time threshold limit for transmission of data will be exceeded by transmission of the data over a first network interface or that the recipient is unknown. The sender determines transmission parameters for the transmission of the data over the first network interface and transmits the transmission parameters to a receiver device over a second network interface that is different than the first network interface. The sender determines a channel on the first network interface for transmission of the data and transmits the determined channel with the transmission parameters to the receiver, or the receiver determines the channel on the first network interface for transmission of the data and transmits an indication of the determined channel to the sender in response to receiving the transmission parameters. | 01-22-2015 |
20150023369 | OBTAINING DATA RECEPTION PARAMETERS IN A MULTIPLE INTERFACE NETWORK - In a multi-PHY, low power and lossy network comprising a plurality of nodes, a sender determines that a dwell time threshold limit for transmission of data will be exceeded by transmission of the data over a first network interface or that the recipient is unknown. The sender determines transmission parameters for the transmission of the data over the first network interface and transmits the transmission parameters to a receiver device over a second network interface that is different than the first network interface. The sender determines a channel on the first network interface for transmission of the data and transmits the determined channel with the transmission parameters to the receiver, or the receiver determines the channel on the first network interface for transmission of the data and transmits an indication of the determined channel to the sender in response to receiving the transmission parameters. | 01-22-2015 |
20150026268 | UTILIZING MULTIPLE INTERFACES WHEN SENDING DATA AND ACKNOWLEDGEMENT PACKETS - Utilizing multiple network interfaces when sending data and acknowledgement packages comprises, in a low power and lossy network (LLN) or other network, a sender device comprises two or more network interfaces for communicating with one or more recipient devices. The sender device assesses the transmission capabilities of the network interfaces to determine data rates available for each interface. The sender device specifies which network interface will be used to transfer data and which network interface will be used to receive an acknowledgement from the recipient device. The sender device selects the network interface with the larger data capacity for transmitting a data packet and the network interface with the smaller data capacity for receiving an acknowledgement. The data transmission and the acknowledgement transmission may be transmitted simultaneously. The recipient device uses transmission parameters received from the sender device to determine the data rate with which to transmit the acknowledgement. | 01-22-2015 |
20150043384 | MULTIPLE TOPOLOGY ROUTING ARCHITECTURE IN COMPUTER NETWORKS - In a multiple interface, low power and lossy network comprising a plurality of nodes, a low transmission power and medium transmission power topology are defined for the network and a channel-hopping schedule is defined for the devices operating in each topology. A sender determines that data is capable of being transmitted via a link on the low transmission power topology. The sender determines the transmission parameters for the transmission of the data over the link on the low transmission power topology and determines a low transmission power channel for transmission of the data. The sender transmits the determined channel and the transmission parameters to the receiver. The sender transmits the data via the determined channel in the low transmission power topology. | 02-12-2015 |
20150043519 | INTERLEAVING LOW TRANSMISSION POWER AND MEDIUM TRANSMISSION POWER CHANNELS IN COMPUTER NETWORKS - In a multiple interface, low power and lossy network comprising a plurality of nodes, a low transmission power and medium transmission power topology are defined for the network and a channel-hopping schedule is defined for the devices operating in each topology. A sender determines that data is capable of being transmitted via a link on the low transmission power topology. The sender determines the transmission parameters for the transmission of the data over the link on the low transmission power topology and determines a low transmission power channel for transmission of the data. The sender transmits the determined channel and the transmission parameters to the receiver. The sender transmits the data via the determined channel in the low transmission power topology. | 02-12-2015 |
20150063365 | DYNAMIC FRAME SELECTION WHEN REQUESTING TONE MAP PARAMETERS IN MESH NETWORKS - In a multiple interface, low power and lossy network comprising a plurality of nodes, a sender node dynamically selects a data packet for setting a transmission parameter request in response to determining that an age value for a set of transmission parameters associated with a recipient device has expired or is expiring. The sender node selects an desired data packet for sending a transmission parameter request and transmits the selected data packet to the recipient device. The sender node receives a transmission parameter response from the recipient node comprising updated transmission parameters for that recipient node and then updates the current transmission parameters associated with the recipient node accordingly. | 03-05-2015 |
20150071295 | ON-DEMAND MEDIUM TO LOW TRANSMISSION POWER CHANNEL SWITCHING IN COMPUTER NETWORKS - In a multiple interface, low power and lossy network comprising a plurality of nodes, a low transmission power and medium transmission power topology are defined for the network and a channel-hopping schedule is defined for the devices operating in each topology. A sender determines that data is capable of being transmitted via a link on the low transmission power topology. The sender determines the transmission parameters for the transmission of the data over the link on the low transmission power topology and determines a low transmission power channel for transmission of the data. The sender transmits the determined channel and the transmission parameters to the receiver. The sender transmits the data via the determined channel in the low transmission power topology. | 03-12-2015 |