Abstract: A backhaul system operative to: increase network capacity, prevent unwanted re-transmissions, and facilitate multiple hopes. The system utilizes a first sequence and a second sequence of periods in conjunction with wireless packet transmission by several adjacent nodes, thereby (i) preventing a transmission of a downlink packet to a mid-point communication node from interfering with reception of any previous downlink packet in a node adjacent to the mid-point node, (ii) preventing a transmission of an uplink packet to the mid-point node from interfering with reception of any previous uplink packet in yet another node that is also adjacent to the mid-point node, and (iii) preventing transmissions of packets by the mid-point node from interfering with reception of any other packet in the mid-point node. Multiple beams are then used to counter a residual effect of multiple transmissions arriving in the mid-point node at the same time.

Abstract: System and methods for wirelessly transporting data from a first communication node to a second communication node using different combinations of beams and on a packet-by-packet basis. Packets associated with a certain Quality of Service (QoS) and/or latency requirements are transported between the first and the second nodes using a first transmission path, while packets associated with a different QoS/latency requirements, are transported between the first and the second nodes using another transmission path, in which in order to switch from the first path to the second path, the system adjusts appropriate beam directions in real-time, and so as to result in fast-switching beam configurations that dynamically change in accordance to packet movement in the network. Latency-critical packets are directed to the faster path, while other packets are directed to the slower path, so as to prevent network congestion and optimize overall network performance.

Abstract: Approaches for routing a packet in a network having multiple cells each comprising a parent node and one or more child nodes include establishing and storing an identifier table including one or more link identifiers associated with the child node(s); upon receiving the packet, generating a string of one or more bits based at least in part on the link identifier(s); and transmitting the packet and the generated string to the child node(s).

Abstract: Approaches for updating a firmware file in a network having multiple transceiver nodes and being capable of receiving and transmitting the firmware file include dividing the firmware file into multiple of chunks, each chunk being able to be included in a single data packet transmitted between two of the transceiver nodes; transmitting each of the chunks from the first one of the transceiver nodes to the second one of the transceiver nodes; transmitting a request message from the first one of the transceiver nodes to the second one of the transceiver nodes, the request message including information associated with the chunks that have been transmitted in step (b); and transmitting a responding message from the second one of the transceiver nodes to the first one of the transceiver nodes, the responding message including information associated with one or more chunks that are included in the request message but not received by the second one of the transceiver nodes.

Abstract: Approaches for updating a firmware file in a network having multiple transceiver nodes and being capable of receiving and transmitting the firmware file include dividing the firmware file into multiple of chunks, each chunk being able to be included in a single data packet transmitted between two of the transceiver nodes; transmitting each of the chunks from the first one of the transceiver nodes to the second one of the transceiver nodes; transmitting a request message from the first one of the transceiver nodes to the second one of the transceiver nodes, the request message including information associated with the chunks that have been transmitted in step (b); and transmitting a responding message from the second one of the transceiver nodes to the first one of the transceiver nodes, the responding message including information associated with one or more chunks that are included in the request message but not received by the second one of the transceiver nodes.

Abstract: Approaches for multicast routing a group packet that includes a payload and routing information (e.g., a target identifier vector and a target multicast group ID) in a network having multiple cells each comprising a parent node and one or more child nodes include establishing and storing one or more child-node multicast group map tables associated with the child node(s) for each cell; receiving a multicast group packet; determining whether to forward the multicast group packet to the child node(s) based at least in part on the child-node multicast group map table(s) associated therewith and the received target identifier vector; and if so, causing the parent node to forward the multicast group packet to the child node(s).

Abstract: To promote efficient and reliable communication of beacons among neighboring nodes in a wireless network, instead of having each node transmit beacons over its operational channel and switch to a different channel to receive its one-hop neighbors' beacons, nodes may transmit beacons over a different channel (i.e., different from the operational channel) and receive beacons over their operational channels. These outgoing “visitor beacons” may contain the usual beacon information but most importantly specify the operating channel of the transmitting node over which conventional beacons may be transmitted and received.

Abstract: Approaches for recovering a connectivity failure in a network having multiple cells, each (i) supporting communication among multiple transceiver nodes, (ii) being capable of receiving and transmitting a packet and (iii) being associated with a parent node and one or more child nodes, include assigning a rank number to each of the nodes; upon detecting a connectivity failure of one of the nodes to its parent node, searching for a new parent node based at least in part on the rank numbers assigned to the nodes; and upon identifying the new parent node within a first predetermined time period, reconnecting said one of the nodes to the network by associating it with the new parent node.

Abstract: Approaches for routing a packet in a network having multiple cells each comprising a parent node and one or more child nodes include establishing and storing an identifier table including one or more link identifiers associated with the child node(s); upon receiving the packet, generating a string of one or more bits based at least in part on the link identifier(s); and transmitting the packet and the generated string to the child node(s).

Abstract: To promote efficient and reliable communication of beacons among neighboring nodes in a wireless network, instead of having each node transmit beacons over its operational channel and switch to a different channel to receive its one-hop neighbors' beacons, nodes may transmit beacons over a different channel (i.e., different from the operational channel) and receive beacons over their operational channels. These outgoing “visitor beacons” may contain the usual beacon information but most importantly specify the operating channel of the transmitting node over which conventional beacons may be transmitted and received.

Abstract: Approaches for updating a firmware file in a network having multiple transceiver nodes and being capable of receiving and transmitting the firmware file include dividing the firmware file into multiple of chunks, each chunk being able to be included in a single data packet transmitted between two of the transceiver nodes; transmitting each of the chunks from the first one of the transceiver nodes to the second one of the transceiver nodes; transmitting a request message from the first one of the transceiver nodes to the second one of the transceiver nodes, the request message including information associated with the chunks that have been transmitted in step (b); and transmitting a responding message from the second one of the transceiver nodes to the first one of the transceiver nodes, the responding message including information associated with one or more chunks that are included in the request message but not received by the second one of the transceiver nodes.

Abstract: Approaches for multicast routing a group packet that includes a payload and routing information (e.g., a target identifier vector and a target multicast group ID) in a network having multiple cells each comprising a parent node and one or more child nodes include establishing and storing one or more child-node multicast group map tables associated with the child node(s) for each cell; receiving a multicast group packet; determining whether to forward the multicast group packet to the child node(s) based at least in part on the child-node multicast group map table(s) associated therewith and the received target identifier vector; and if so, causing the parent node to forward the multicast group packet to the child node(s).

Abstract: The present mobile social networking assembly establishes new connections between users within the network of proximity created by the assembly and while the users mutually match the each others' data. The assembly implements a broadcast-based efficient/fast data exchange using minimal power via Dynamic Human Mobile Broadcast Networking without infrastructure demands. Implemented within a mobile telephone or as a stand-alone unit (10) for use with a mobile telephone (18), the assembly efficiently exchanges user data with other social networking assemblies and notifies users of data matches via existing mobile telephone networks (30). Power saving mechanisms include minimizing redundant data transfer and synchronizing the data exchange between users to allow broadcast sleep mode usage.