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

Inactive Publication Date: 2019-04-26
刘福珍
View PDF8 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

There is such a problem in the prior art: the size of the sequence number is set here based on the priority made when the next hop is a single hop. For an ad hoc network, its distribution is a tree distribution. When the top node of the tree will When the information is transmitted to the leaf nodes, the distribution between each leaf node is scattered, so it is a complex multi-hop distribution. The size of the sequence number alone cannot be the first selection factor for priority transmission. It is possible that the sequence number is small but Its branches are longer, and the next hop is closer to the root node (that is, the node within the wireless communication range of the base station in the wireless ad hoc network), that is, there is a situation where the node has more priority for communication; the serial number broadcast by the node is monotonically increasing Even number, when node B finds that the route to node D (routing sequence number is s) is interrupted, node B broadcasts a routing information, notifying that the sequence number of the route bec

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Wireless ad hoc network communication method based on single-soldier cooperative combat
  • Wireless ad hoc network communication method based on single-soldier cooperative combat
  • Wireless ad hoc network communication method based on single-soldier cooperative combat

Examples

Experimental program
Comparison scheme
Effect test

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

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a wireless ad hoc network communication method based on single-soldier cooperative combat. Each single soldier is regarded as a node in a wireless ad hoc network, and a node closest to the remaining nodes is selected in multiple nodes through an optimal path algorithm to be regarded as a relay node. A communication base station and a cloud server are also included. Information transfer is carried out between the wireless nodes through the relay node. The relay node is updated and replaced in real time. Wireless nodes in a communication radius range R transfer single-soldier combat information to a cloud server end through the communication base station, and combat command information is returned through the cloud server and transmitted among the wireless nodes. Battlefield long-range and short-range ad hoc network communication is realized. An improved destination sequenced distance vector routing (DSDV) protocol is adopted for networking among the wireless nodes, a traditional destination sequenced distance vector routing protocol is combined with an ant colony algorithm for networking, and the nodes exchange information with neighboring nodes thereof through a routing information protocol (RIP).

Description

technical field [0001] The invention belongs to the technical field of communication, in particular to a wireless ad hoc network communication method based on individual soldier cooperative operations. Background technique [0002] The wireless ad-hoc network is composed of nodes and is an autonomous, multi-hop network. The entire network has no fixed infrastructure and can be used when the existing network infrastructure (such as base stations, APs (Access Points)) cannot be used or is inconvenient. In the case of , it provides intercommunication between nodes. Due to the limited transmission power and wireless coverage of nodes, if two nodes that are far away from each other want to communicate, they must use other nodes to forward packets. In this way, a wireless multi-hop network is formed between the nodes. Mobile nodes in the network have routing and packet forwarding functions, and can form any network topology through wireless connections. A wireless ad hoc network...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04W40/12H04W40/22H04W40/24H04W84/18
CPCH04W40/12H04W40/22H04W40/246H04W40/248H04W84/18
Inventor 高强袁宝乔亚男刘宗杰马志腾冯庆云丛超张颜艳刘秀秀盛沛然
Owner 刘福珍
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap