摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.