Disclosed is an improved implementation of a flood fill mesh network that utilizes low power and does not require any network addressing or routing protocol for network message delivery. Network messages are only communicated to a network node's correspondents using broadcast network messages over a wireless network. Network messages propagate throughout the network based on each correspondent node rebroadcasting received messages to its correspondent nodes, and so on. Coordinated synchronization across network nodes can be achieved by each network node broadcasting synchronization frames to its correspondents within a synchronization window time period and thereafter adjusting its own start time for the next synchronization period to converge synchronization. A guard band may also be utilized to account for any clock drift and signal path delays between any two communicating network nodes.

Disclosed is an improved implementation of a flood fill mesh radio network that utilizes probability forwarding for rebroadcasting network messages. The forwarding probability may be determined based on analyzing a neighbor topology map constructed by each network node relative to its neighbor nodes on the network and derived from state information supplied in synchronization frames. The forwarding probability may comprise a statistical probability that a message frame received by a network node will be forwarded to the intended destination network node by one or more of the network node's neighbor network nodes. The forwarding probability may also be based on constructing a heat map of hot nodes that are identified as those originating nodes in originating node/forwarding node pairs that are the first to forward message frames along paths in the network relative to duplicate message frames received from different originating/forwarding node pairs along different paths.

Disclosed is an improved implementation of a flood fill mesh radio network that utilizes message age disambiguation to prevent unnecessary propagation of repeated messages in the network. A digital counter may be used to generate a sequence of numbers based on counter values and the counter values may be associated with each message frame that is broadcast into the mesh network. The domain of generated sequence numbers can be divided up into low and high subdomains and the maximum number of message frames broadcast by a network node in the mesh network may be constrained so that no two messages broadcast by a network node remain circulating in the network longer than that required for the digital counter to wrap back to zero. Under this paradigm the counter values associated with each message can be compared to determine the relative age of the message frames to detect repeated messages.

Disclosed is an improved implementation of a flood fill mesh network that utilizes probability forwarding for rebroadcasting network messages. The forwarding probability may be determined based on analyzing a network topology map constructed by each network node relative to its neighbor nodes communicating on the network and derived from state information contained in synchronization frames broadcasted by the network nodes on the network. The forwarding probability may comprise a statistical probability that a message frame received by a network node will be forwarded to the intended destination network node by one or more of the network node's neighbor network nodes.

An electronic device may be operable to communicate over a physical medium and to regulate the transmission of a message onto the physical medium. The device may access the medium in accordance with a CSMA scheme, wherein one or more values of one or more CSMA parameters may be determined based on the result of a comparison of a received search token to data stored in the communication device. The message may be a response to a received request message, and the search token may have been received in the request message. A value of the CSMA parameter(s) may be determined based on the result of a comparison of the score and one or more thresholds. The threshold(s) may have been received in the request message. The value(s) of the CSMA parameter(s) may be determined based on one or more initial values contained in the received request message.

An electronic device may receive a protocol data unit (PDU) comprising a plurality of addressing bits. Data-link-layer processing of the PDU may be based on each of the addressing bits. Network layer processing of the PDU may be based on a first subset of the plurality of addressing bits. Transport-layer processing of the PDU may be based on a second subset of plurality of addressing bits. The data-link-layer processing may comprise determining whether the PDU is unicast-addressed or non-unicast-addressed. For a unicast-addressed PDU, the data-link-layer processing may comprise determining whether the PDU is destined for the electronic device based on a comparison of a Target ID field of the PDU and a device ID of the electronic device. For a non-unicast-addressed PDU, the Target ID field may not be present, and whether the PDU is destined for the electronic device may be determined based on other criteria.

The present disclosure generally relates to the field of resource reservation. More specifically, the present disclosure relates to a technique of reserving communication resources in a wireless communication network. A method embodiment comprises: receiving (S402), by a node of the plurality of nodes, a resource reservation message including first reservation information indicating one or more communication resources for at least one link of the wireless communication network; modifying (S404), by the node, the received resource reservation message by including second reservation information indicating one or more communication resources for a link of the node in the received resource reservation message; and transmitting (S406), by the node, the modified resource reservation message to one or more neighbor nodes of the node.

A packet sending method includes: receiving, by a first node, a first broadcast data packet sent by a second node; and if a sequence number of the first broadcast data packet equals 1 plus a sequence number of a latest data packet saved by the first node, and the first node does not receive, within a first preset time period, a first acknowledgement indication for the first broadcast data packet of the second node, sending, by the first node, a first broadcast acknowledgement packet when the first preset time period elapses, where the first broadcast acknowledgement packet includes the first acknowledgement indication, and the first acknowledgement indication includes the sequence number of the first broadcast data packet and an address of the second node. This method could resolve acknowledgement packet implosion while ensuring broadcast packet reliability of a wireless mesh network.

The method of the invention envisages determining, for each packet that is to be transmitted/retransmitted, through an LLC communication protocol, which is the top sublayer of the datalink layer of the ISO-OSI model, (LLC logic) autonomously, node by node, the specific communication apparatus to be used from the ones available on the single node, to which subset of the nodes said packet is to be transmitted (routing logic), i.e., the number and the set of neighbouring nodes to which it is to be transmitted, the specific communication apparatus to be used from the multiple ones that may be available, and the maximum number of retransmissions to be made, by using a decentralized self-learning algorithm that enables each node to learn and select dynamically the best operating mode, according to the number of transmissions already made.

According to one embodiment, a wireless communication device connected with a multi-hop network includes one or more processors. The processors communicate with a first parent node of the wireless communication device and with a child node of the wireless communication device. The processors transmit an instruction to restrict communication to the child node or do not receive data from the child node when receiving an abnormality notification indicating an abnormality from the first parent node.