Wireless ad hoc network communication method based on single-soldier cooperative combat
A technology of wireless ad hoc network and communication method, which is applied in the field of wireless ad hoc network communication based on individual soldier cooperative operations, and can solve problems such as single network, DSDV cannot be applied to rapidly changing networks, and branch length
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
no. 1 example
[0021] like figure 1As shown, a wireless ad hoc network communication method based on individual soldier cooperative operations, each individual soldier carries a UMWS-H ad hoc network device to build a wireless ad hoc network, and the UMWS-H ad hoc network device is used to carry out Send and receive information between nodes, and remotely forward the received information through the base station; each individual soldier is a node in the wireless ad hoc network, and among several nodes, the one closest to the other nodes is selected through the optimal path algorithm. As a relay node, the node does not need a dedicated router for data transmission, and also includes a communication base station and a cloud server. The wireless nodes transmit information through the relay node, and the relay node performs real-time update and replacement , that is, when the distance between the original relay node and other nodes is greater than the threshold, the node closest to the other nod...
no. 2 example
[0076] Second embodiment: the method for constructing a multi-tree topology can be replaced by: on the basis of the traditional destination station number distance vector DSDV protocol, a HELLO handshake network is established between each node, and each node connected to the router node in the HELLO handshake network network Add a dormant state to each link, select a shared spanning tree on a given network topology, and the links on it are always in the working state to ensure network connectivity, and other links that are not on the spanning tree will not Entering the dormant state, each router saves the shortest path routing table of the entire network path and the routing table of the corresponding spanning tree. For a data packet, the ingress router determines that the data packet adopts one of the paths according to the current link load, and adds a label identification. The non-ingress router selects the corresponding routing table for forwarding according to the label. ...
no. 3 example
[0079] The third embodiment: the ant colony algorithm can be replaced by: on the basis of the traditional destination station numbering distance vector DSDV protocol, the patent application number is 201210539933.9, and the patent name is an energy-saving routing method combining shortest path tree and spanning tree, through Combining the traditional Destination Number Distance Vector DSDV protocol with the idea of combining the shortest path tree and spanning tree in this patent application to select the optimal path can also realize wireless communication networking. A HELLO handshake network is established between each node. Each link connected to the router node in the HELLO handshake network network increases the dormant state, and a shared spanning tree is selected on a given network topology, and the links on it are always in In the working state to ensure network connectivity, other links that are not on the spanning tree will enter the dormant state if there is no tr...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com