Patent application number | Description | Published |
20090238160 | Hybrid Multiple Access Method and System in Wireless Networks with extended Content Free Access Period - A method for communicating in a network including a coordinator node and a set of leaf nodes transmits periodically, from the coordinator node to the set of leaf nodes, a beacon defining a superframe, wherein the supper frame includes an active period and an inactive period, and wherein the active period includes a first contention access period (CAP- | 09-24-2009 |
20090238293 | OFDMA Based Medium Access Control and Frame Structure Design for Industrial Applications - A network includes a master and a set of slaves that communicate orthogonal frequency-division multiplexing (OFDM) and time division multiple access (TDMA) symbols on sub-carriers. A master broadcasts to the set of slaves using downlinks and all of the sub-carriers, a broadcast polling packet including data packets for each slave and sub-carrier assignments for the slaves. Each slave, in response to receiving the downlink polling packet, transmits simultaneously a response packet to the master using uplinks and the assigned sub-carriers. The master then transmits to the set of slave using the downlinks and all of the sub-carriers, a group acknowledgement packet, wherein the broadcast polling packet, the response packet, and the group acknowledgement packet comprise one superframe in one communication cycle, and wherein the broadcasting on the downlinks and the transmitting on the uplinks are disjoint in time. | 09-24-2009 |
20100189069 | Joint Carrier Allocation and Time Sharing for OFDMA/TDMA Networks - A method and system provide multiple-access control and frequency band allocation, and transmission time sharing among multiple users in orthogonal frequency-division multiple-access (OFDMA) and time-division multiple-access (TDMA) networks. The method can be applied to uplinks and downlinks of multi-user, multi-carrier communication networks. Under a total transmission-power minimization constraint, the method can allocate carriers and transmission time to users optimally, and at the same time, can guarantee a data rate or equivalently a latency requirement of each user. | 07-29-2010 |
20110038343 | Distributed Beacon Enabled Wireless Networks - In a wireless network that includes multiple nodes, each periodic announcement cycle of a communication schedule is partitioned into a set of time slots, including a set of management time slots, a set of beacon time slots, and a set of superframe time slots. Management frames are broadcast during the management slot to specify beacons. Beacons are transmitted during the beacon slots to specify when to transmit the superframes during the superframe time slots. | 02-17-2011 |
20140204759 | Load Balanced Routing for Low Power and Lossy Networks - A node includes a receiver for receiving a first packet from a first node at a first time and a second packet from a second node at a second time, a processor for determining the first time and the second time and for comparing the first time with the second time to produce a ratio of workloads of the first node and the second node, and a transmitter for transmitting packets to the first and the second nodes based on the ratio. | 07-24-2014 |
Patent application number | Description | Published |
20080253298 | Method and System for Managing Routes in a Wireless Network of Nodes - A method for manages routes in a wireless network of nodes by determining a distances between each pair of nodes in a set of nodes of a wireless network. The distances are maintained in a memory of a particular node of the wireless network as a distance map in a form of a wavelet, and routing a packet between the nodes is according to the distances stored as the wavelet. | 10-16-2008 |
20080253328 | Hybrid Multiple Access Method and System in Wireless Networks - A method and system access a channel in a wireless network of nodes. A coordinator transmits periodically a beacon, in which time between two consecutive beacons constitute a beacon interval. The coordinator and other nodes transceive a superframe during the beacon interval, in which the superframe begins with an active interval, which is immediately followed by an inactive interval, and in which the active interval begins with a contention free period, which is immediately followed by a contention access period, which is immediately followed by the inactive interval. | 10-16-2008 |
20090201844 | Method, Apparatus And System For Multicast Communication In A Wireless Multi-Hop Network - A method for multicast communication in a network having plural nodes according to the ZigBee network specification includes creating a multicast group including a subset of the plural nodes and excluding at least one non-member node in the plural nodes. The multicast group has a multicast address. The method also includes transmitting multicast message including the multicast address and receiving the multicast message at each node in the multicast group. | 08-13-2009 |
20090213816 | Timeslot Sharing Protocol for Wireless Communication Networks - A method for transmitting information in a communication network of multiple nodes, in which information transmission is partitioned into successive superframes, and in which each superframe is partitioned into a beacon period followed by a data period, which may consist of a contention free period (CFP), and each beacon period and CFP of the data period is partitioned into timeslots. The method includes allocating to at least a first node of the multiple nodes a designated timeslot in which to transmit data in at least one of a plurality of superframes, and allocating to at least a second node of the multiple nodes the same designated timeslot in which to transmit information during at least one subsequent superframe. | 08-27-2009 |
20100248637 | Method for Estimating Location of Nodes in Wireless Networks - A method localizes a set of nodes in a wireless network that includes a target node having unknown location and a set of anchor nodes having known locations. The set of anchor nodes is partitioned into subsets of anchor nodes, wherein each subset has at least three anchor nodes. A distance from the target node to each of anchor nodes in each subset is measured, to estimate possible locations of the target node. A geometric constraint is applied to each estimated location to determine valid locations, which are then filtered to determine filtered locations. The filtered locations are averaged to determine an initial estimate of the location. | 09-30-2010 |
20110002226 | Method for Discovering Routes in Wireless Communications Networks - A method and system discovers a route in a wireless communications network, FIG. | 01-06-2011 |
20110176416 | Method for Discovering Multiple Routes in Sensor Networks - Multiple routes from a data source node to multiple data destination nodes in a large scale multi-hop mesh network are discovered. Nodes discover multiple routes to two destinations in an initial discovery phase that includes only two network-wide flooding of packets. The method can also work with one destination. The method can be extended to include more destinations with a proportional increase in the communication overhead. After the completion of the discovery phase, nodes can communicate or forward their own or received data by using any of the available routes. | 07-21-2011 |
20120327792 | Method for Discovering and Maintaining Routes in Smart Meter Networks - A set of routes are discovered in a network including concentrators, smart meters and an imaginary node. Each concentrator node, a source, broadcasts a route request (RREQ) packet to the imaginary destination node. Intermediate nodes store a route as a node list (NL) in the RREQ packet and as a route table (RT) in the node. Then, each smart meter node can select a primary route and a secondary route from the smart meter node to any concentrator from the route table. | 12-27-2012 |
20130208583 | Avoiding Broken Links in Smart Meter Networks for Loop-Free Routing of Packets - Broken links in a sensor network are avoided by representing the network as a DODAG. A rank associated with each node defines a position of each node relative to other nodes, and the rank is in a form of a proper fraction, and the rank of each node never increases to enable loop-free routing. | 08-15-2013 |
20130223334 | Channel Scan for Smart Meter Networks to Determine Operating Channels - An operation channel in a multi-hop network is determined. The network uses a set of channels, and one of the nodes is a network management node. The operation channel is selected in the network management node. Then, the network management node broadcasts a channel information packet including the operation channel using all channels. The channel information packet is received in each of other nodes, either directly from the network management node or from an intermediate node that received and rebroadcasted the channel information packet. Lastly, the operation channel in each node is set according to the channel information packet until the network is formed. | 08-29-2013 |
20130242936 | Time Slot and Frequency Allocation in Wireless Communication Networks - In a wireless network including a server and clients, network resources, such as time slots and channel frequencies, are managed by having the server define the resources for future use by the clients, while the clients actually allocate the resources for their exclusive use according to performance criteria determined by the clients. The network can be ad-hoc and in industrial environments with low-latency requirements. | 09-19-2013 |