Abstract: Interference in a wireless network is detected by first applying during a detection stage a two-sample Kolmogorov-Smirnov (KS) test to samples obtained from a channel in the wireless network to obtain a KS statistic. When the KS statistic is larger than a predetermine threshold, it is determined that the samples include narrowband interference, and wideband otherwise.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A method and system discovers a route in a wireless communications network including multiple nodes. A RREQ frame is broadcast by a first node. The RREQ frame is generated to discover a route. A second node receives the RREQ frame. The second node unicasts a PING frame to the first node to verify an integrity of a wireless communications channel between the first node and the second node. Then, the second node unicasts a RREP frame only if the integrity of the wireless channel is verified.

Abstract: 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.

Abstract: 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.

Abstract: A method and system discovers a route in a wireless communications network, FIG. 1, including multiple nodes (101-103). A RREQ frame (115) is broadcast by a first node (101). The RREQ frame is generated to discover a route. A second node (102) receives the RREQ frame. The second node (102) unicast a PING frame (210) to the first node (101) to verify an integrity of a wireless communications channel between the first node (101) and the second node (102). Then, the second node (102) unicasts a RREP frame only if the integrity of the wireless channel is verified.

Abstract: 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.

Abstract: 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.

Abstract: 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.