CN105873169A - Wireless ad-hoc network communication method - Google Patents
Wireless ad-hoc network communication method Download PDFInfo
- Publication number
- CN105873169A CN105873169A CN201610429700.1A CN201610429700A CN105873169A CN 105873169 A CN105873169 A CN 105873169A CN 201610429700 A CN201610429700 A CN 201610429700A CN 105873169 A CN105873169 A CN 105873169A
- Authority
- CN
- China
- Prior art keywords
- node
- repeater
- information
- coordinator
- self
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
- H04W52/0225—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a wireless ad-hoc network communication method with the advantages that simplicity and reliability are realized; the large-scale nodes can be accommodated. Nodes in the wireless ad-hoc network include one or a plurality of coordinators and a plurality of relays, and can comprise a plurality of terminal nodes, wherein each node only requires to record the self father node number and does not need to record the self son node number; the storage expenditure and the complexity degree of each node are greatly reduced; only two steps including requesting and reply exist in the network accessing process; the transferring is not needed, so that the network maintenance expenditure is very low; when a certain relay is abnormal, the sub node can immediately request to become the son node of other nodes; the son nodes of the son nodes of the other nodes cannot be influenced, so that the self heeling capability of the network is very good; the plurality of coordinators can realize the mutual backup and cooperated work for preventing the network interruption due to the abnormality of one coordinator. The wireless ad-hoc network communication method is very suitable for being applied to Internet of things requiring multi-stage relay and having a great number of low-power consumption nodes.
Description
Technical field
The present invention relates to radio communication, the wireless communications method of a kind of MANET, it is highly suitable for needing multilevel relay and there is the Internet of Things application of a large amount of low power consumption node.
Background technology
Core and the basis of technology of Internet of things remain " Internet technology ", are a kind of network technologies of the extension on the basis of Internet technology and extension;Its user side extends and extend to, between any article and article, carry out information exchange and communication.Along with rise and the development of technology of Internet of things, for being connected with the Internet by any article, the equipment network carrying out information exchange and communication requires more and more higher, and quantity also gets more and more.Wireless communication network system is mostly all based on ZigBee technology or WiFi technology and carries out networking at present.Wherein, ZigBee technology be a kind of closely, low complex degree, low-power consumption, low rate, the bidirectional wireless communication technology of low cost.It is mainly used between short, low in energy consumption and that transfer rate is the highest various electronic equipments, carry out data transmission and typically have periodic data, intermittent data and the application of low reaction time data transmission.And WiFi technology is the technology that the terminals such as PC, handheld device (such as PAD, mobile phone) can wirelessly be interconnected by one, in fact it is a high frequency radio information.Wireless communication network system based on ZigBee technology can realize equipment bridge joint, power consumption is relatively low, these advantages compensate for the defect of WiFi technology to a certain extent, but there is also following shortcoming simultaneously: the amount of overhead that agreement accounts for bandwidth is higher to channel bandwidth requirement, simultaneously online equipment limited amount.Wireless communication network system based on WiFi technology has the advantage that transfer rate is high, data band is wide, popularity rate is high, but its shortcoming is: networking capability is low, and extending space is limited, and power consumption is high, and online equipment is few simultaneously.Along with pushing ahead of Internet of Things information revolution, multilevel relay, low-power consumption, wireless self-networking communication means remote, jumbo can be realized in the urgent need to one.
Summary of the invention
The invention discloses a kind of simple, reliable, multilevel relay, extensive node wireless self-organized network communication method can be accommodated.
Node in the wireless self-networking communication network of the present invention includes one or more coordinator and multiple repeater, and can include multiple terminal node.Coordinator, as the manager of network and data acquisition or the gateway of control, is only used as the root node of wireless network, and is not the child node as other nodes；Repeater has the function of data relaying, by multilevel relay, is greatly expanded the coverage without group communication network；Terminal node does not have relay function, and power consumption that can be the lowest is run.
For realizing above-mentioned target, system works in the following ways:
Coordinator and the repeater networked keep reception state, the request of networking is initiated in the active of repeater to be networked and terminal node, after coordinator and all repeaters networked receive this request, within a random short time, reply node number and the relaying degree of depth of oneself of oneself；Repeater or terminal node compare information strength and the relaying degree of depth of received return information, and repeater or terminal node select a repeater or coordinator as the father node of oneself from the reply data received, thus add network；Its method selected is on the premise of guarantee information intensity, selects the father node relaying the relatively low repeater of the degree of depth or coordinator as oneself；Repeater and terminal node only record the node number of self father node, without recording self child node.
Multiple coordinators are simultaneously operable, and backup each other, repeater and terminal node decide in its sole discretion in the network being connected to which coordinator, and when a coordinator breaks down, all of terminal node and repeater may be connected on another coordinator.
After repeater and terminal node network, send uplink information, node number and father node number including oneself, after corresponding father node receives information, if it is repeater, then the father node number of self is added in this uplink information and forward, then information arrives upper level repeater, by that analogy, information arrives coordinator the most at last, and this information has comprised the relay route of this up process simultaneously.
After coordinator receives the information that node is up, send echo message and relay route, after next stage repeater receives this information, it is the information that requirement self forwards according to the judgement of relay route information, then, after amendment relay route, is sent to next stage repeater, information eventually arrives at the node specified, repeater is all according to relay route therein the most every time, updates the relaying degree of depth of self, prevents the node real depth caused due to the path changing of its superior node different from the degree of depth that oneself records.
After the one or many uplink information of repeater and terminal node does not receives response, it is believed that self goes offline, then initiate the request of networking, reselect father node.
The discovery of relaying loop and solution, the repeater networked, it is not responding to the networking request that self father node sends, two repeater father nodes each other can be avoided the occurrence of, secondly repeater is when forwarding uplink data, judge that the node number (i.e. data are sent or forwarded over by oneself) having had oneself in up path is if then thinking generation loop trunks, force self to break, send loop abnormal information simultaneously, wherein comprise all repeater node number in this loop, other receive the repeater of this information, judge abnormal information comprises the node number of self, then force self to break；The node re-request of broken string networks.
The communication complexity caused by reducing network node number to distribute, use the mode of fixed knot period, the most all terminal nodes, repeater and coordinator have a unique and fixing node number in systems, and this node number does not changes with the change of network topology structure.
For reducing the power consumption of terminal node further, reduce the time awaited a response, use father node (being whether coordinator) the directly return information of terminal node, after terminal node receives response, immediately enter the mode of operation of low-power consumption, not continuing to the response of oneself coordinator, the repeater sending back complex information then continues to send information to coordinator.
Compared with prior art, the present invention has a following beneficial effect:
Each node only requires the father node number recording self, without recording self child node number, greatly reduces storage overhead and the complexity of each node, can accommodate substantial amounts of node and network；
Entering network process only to ask, reply two steps, and all need not relaying, the expense making network operation is extremely low；
When certain repeater exception, its child node can ask to become the child node of other nodes immediately, and without affecting the child node of its child node, the self-healing ability making network is fabulous
Multiple coordinators can backup each other, and co-ordination prevents a coordinator abnormal, causes network to interrupt.
Accompanying drawing explanation
Fig. 1 is the topology diagram of the wireless network of the present invention.
Fig. 2 is the wireless network communication topology figure at a time of the present invention.
Fig. 3 is repeater or the flow chart of terminal node networking of the present invention.
Fig. 4 is that the repeater of the present invention processes the flow chart that up-downgoing data relay.
Fig. 5 is that the wireless network via node communication of the present invention is obstructed, loop trunks and the process schematic again networked are occurred.
Detailed description of the invention
The invention will be further described below in conjunction with the accompanying drawings
The network topology structure of the wireless network of the present invention is as shown in Figure 1.Network packet contains one or more coordinators, multiple repeaters and multiple terminal node.Terminal node with the repeater of surrounding or coordinator communication, and can not can be in communication with each other with terminal node, and each repeater can be with the repeater of surrounding or coordinator communication；
As in figure 2 it is shown, the communication topology figure formed after completing to network for repeater and terminal node, the direction of arrow in figure illustrates the membership relation of father and son's node.Upstream data always eventually arrives at coordinator according to the direction of arrow；Two coordinators are simultaneously operable, and backup each other, repeater and terminal node decide in its sole discretion in the network being connected to which coordinator；When a coordinator breaks down, all of terminal node and repeater may be connected on another coordinator.
In network, the process of the work of each category node is as follows:
1) coordinator and the repeater networked keep reception state, wait the networking request of other repeaters or terminal node, after receiving networking request, within a random short time, reply node number and the node degree of depth of oneself of oneself；
2) it is illustrated in figure 3 repeater and terminal node completes the program flow diagram that networks, repeater or terminal node actively initiate the request of networking, receive from coordinator or the return information of repeater that networked the most always, and compare information strength and the node degree of depth of received return information, on the premise of guarantee information intensity, select the relatively low repeater of the node degree of depth or coordinator as the father node of oneself, thus add network, all nodes only record the node number of self father node, without recording self child node.
It is illustrated in figure 4 repeater and processes the program flow diagram of relay wireless data, after repeater and terminal node network, send uplink information, including the father node number of oneself, after corresponding father node receives information, if it is repeater, then being added in this uplink information by the father node number of self and forward, then information arrives upper level repeater, by that analogy, information eventually arrives at coordinator, and this information has comprised the relay route of this up process simultaneously；
4) after coordinator receives the information that node is up, send echo message and relay route, after next stage repeater receives this information, it is the information that requirement self forwards according to the judgement of relay route information, then after amendment relay route, it is sent in next stage repeater, information eventually arrives at the node specified, repeater is all according to relay route therein the most every time, update the relaying degree of depth of self, prevent the node real depth caused due to the path changing of its superior node different from the degree of depth that oneself records.
After the one or many uplink information of repeater and terminal node does not receives response, it is believed that self goes offline, then initiate the request of networking, reselect father node.
Owing to node does not records the child node of self, when node lives again networking, it may happen that using one or more levels child node of self as father node, thus it is split into relaying loop, find and the method on solution relay ring road is: the repeater networked, it is not responding to the networking request that self father node sends, two repeater father nodes each other can be avoided the occurrence of, secondly repeater is when forwarding uplink data, judge the node number having had oneself in up path, the most sent or forwarded over by oneself, if then thinking generation loop trunks, force self to break, send loop abnormal information simultaneously, wherein comprise all repeater node number in this loop, other receive the repeater of this information, judge abnormal information comprises the node number of self, then force self to break；The node re-request of broken string networks.
As shown in Figure 5, after communication when between repeater R1 and coordinator is obstructed (shown in the dotted line in the left figure of Fig. 5), repeater R1 applies for networking again, it can happen that be that the byte point of its byte point is relayed loop (Fig. 5 shown in figure) as father node from formation, in the case, the data that repeater R1 sends will return to R1 after repeater R3 and R2, then R1 forces self to break, send loop abnormal information simultaneously, wherein comprise the node number information of R2 and R3, make R2 and R3 break；Final R1, R2, R3, by again networking, can form the network structure shown in figure as right in Fig. 5.
The communication complexity caused by reducing network node number to distribute, use the mode of fixed knot period, the most all terminal nodes, repeater and coordinator have a unique and fixing node number in systems, and this node number does not changes with the change of network topology structure.
For reducing the power consumption of terminal node further, reduce the time awaited a response, use father node (being whether coordinator) the directly return information of terminal node, after terminal node receives response, immediately enter the mode of operation of low-power consumption, not continuing to the response of oneself coordinator, the repeater sending back complex information then continues to send information to coordinator.
Claims (6)
1. the method for a wireless networking communications, it is characterised in that the node in wireless self-networking communication network includes one or more coordinator and multiple repeater, and can include multiple terminal node；And work in the following way:
1) coordinator and the repeater networked keep reception state, the request of networking is initiated in the active of repeater to be networked and terminal node, after coordinator and all repeaters networked receive this request, within a random short time, reply oneself node number and the relaying degree of depth of oneself, repeater or terminal node select a repeater or coordinator as the father node of oneself from the reply data received, thus add network；
2) after repeater and terminal node network, send uplink information, node number and father node number including oneself, after corresponding father node receives information, if it is repeater, then the father node number of self is added in this uplink information and forward, then information arrives upper level repeater, by that analogy, information arrives coordinator the most at last, and this information has comprised the transfer path of this up process simultaneously；
3) after coordinator receives the information that node is up, send echo message and transfer path, after next stage repeater receives this information, it is the information that requirement self forwards according to the judgement of transfer routing information, then behind amendment transfer path, being sent in next stage repeater, information eventually arrives at the node specified；
4) after the one or many uplink information of repeater and terminal node does not receives response, it is believed that self goes offline, then initiate the request of networking, reselect father node.
Multiple coordinator the most according to claim 1 works simultaneously, mutually redundant method, which it is characterized by: decided in its sole discretion in the network being connected to coordinator by repeater and terminal node, when a coordinator breaks down, all of terminal node and repeater may be connected on another coordinator.
The discovery of relaying loop the most according to claim 1 and solution, it is characterized by: repeater is not responding to the networking request that self father node sends, repeater is when forwarding uplink data, judge that the node number (i.e. data are sent or forwarded over by oneself) having had oneself in up path is if then thinking generation loop trunks, force self to break, send loop abnormal information simultaneously, wherein comprise all repeater node number in this loop, other receive the repeater of this information, judge abnormal information comprises the node number of self, then force self to break；The node re-request of broken string networks.
The method of the communication complexity that reduction network node number the most according to claim 1 distribution is caused, it is characterized by: use the mode of fixed knot period, the most all terminal nodes, repeater and coordinator have a unique and fixing node number in systems, and this node number does not changes with the change of network topology structure.
The most according to claim 1 prevent repeater from truly relaying the method that the degree of depth is different from the relaying degree of depth that oneself records, it is characterized by: repeater according to relay route therein, updates the relaying degree of depth of self when converting downlink data.
The method reducing the power consumption of terminal node the most further, it is characterized by: father node (whether for coordinator) the directly return information of terminal node, after terminal node receives response, immediately enter the mode of operation of low-power consumption, not continuing to the response of oneself coordinator, the repeater sending back complex information then continues to send information to coordinator.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610429700.1A CN105873169B (en) | 2016-06-17 | 2016-06-17 | Wireless ad hoc network communication method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610429700.1A CN105873169B (en) | 2016-06-17 | 2016-06-17 | Wireless ad hoc network communication method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105873169A true CN105873169A (en) | 2016-08-17 |
| CN105873169B CN105873169B (en) | 2019-12-13 |
Family
ID=56649725
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610429700.1A Active CN105873169B (en) | 2016-06-17 | 2016-06-17 | Wireless ad hoc network communication method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105873169B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107132801A (en) * | 2017-06-30 | 2017-09-05 | 南京信息工程大学 | A kind of remote switch device based on Arduino |
| CN107454619A (en) * | 2017-07-18 | 2017-12-08 | 深圳市盛路物联通讯技术有限公司 | Radio sensing network repeater abnormality eliminating method and equipment |
| WO2019114670A1 (en) * | 2017-12-12 | 2019-06-20 | 华为技术有限公司 | Access method and device for relay system |
| CN111130613A (en) * | 2018-10-31 | 2020-05-08 | 珠海格力电器股份有限公司 | Terminal node equipment, relay control method and device and wireless communication networking |
| CN112533264A (en) * | 2020-11-10 | 2021-03-19 | 烽火通信科技股份有限公司 | Method and device for realizing networking scene mode |
| CN112737939A (en) * | 2020-12-15 | 2021-04-30 | 安徽继远软件有限公司 | Network self-healing method and network architecture based on cooperative communication of Internet of things |
| CN112738747A (en) * | 2020-12-29 | 2021-04-30 | 南京布袋健康管理有限公司 | Fitness bicycle self-networking method, device, server and storage medium based on Zigbee |
| CN113596889A (en) * | 2021-07-20 | 2021-11-02 | 重庆声光电智联电子有限公司 | Wireless ad hoc network system and method |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102869016A (en) * | 2012-09-29 | 2013-01-09 | 无锡南理工科技发展有限公司 | Safe adding method of nodes in high speed node ad hoc network |
| CN103347294A (en) * | 2013-07-11 | 2013-10-09 | 清华大学 | Wireless sensor system and data collecting method |
| CN103476082A (en) * | 2013-09-26 | 2013-12-25 | 常熟理工学院 | Method for achieving construction of next-generation wireless sensor network |
| CN103906044A (en) * | 2014-03-04 | 2014-07-02 | 杭州迅龙科技有限公司 | Networking method of wireless electricity consumption information acquisition ad hoc network |
| CN103929344A (en) * | 2014-04-29 | 2014-07-16 | 北京瑞赛长城航空测控技术有限公司 | Self-organized and self-healing wireless tree-based network and organizing method thereof |
| CN105323871A (en) * | 2014-07-30 | 2016-02-10 | 西安拓蓝电子科技有限公司 | Wireless network ad hoc system and method thereof |
-
2016
- 2016-06-17 CN CN201610429700.1A patent/CN105873169B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102869016A (en) * | 2012-09-29 | 2013-01-09 | 无锡南理工科技发展有限公司 | Safe adding method of nodes in high speed node ad hoc network |
| CN103347294A (en) * | 2013-07-11 | 2013-10-09 | 清华大学 | Wireless sensor system and data collecting method |
| CN103476082A (en) * | 2013-09-26 | 2013-12-25 | 常熟理工学院 | Method for achieving construction of next-generation wireless sensor network |
| CN103906044A (en) * | 2014-03-04 | 2014-07-02 | 杭州迅龙科技有限公司 | Networking method of wireless electricity consumption information acquisition ad hoc network |
| CN103929344A (en) * | 2014-04-29 | 2014-07-16 | 北京瑞赛长城航空测控技术有限公司 | Self-organized and self-healing wireless tree-based network and organizing method thereof |
| CN105323871A (en) * | 2014-07-30 | 2016-02-10 | 西安拓蓝电子科技有限公司 | Wireless network ad hoc system and method thereof |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107132801A (en) * | 2017-06-30 | 2017-09-05 | 南京信息工程大学 | A kind of remote switch device based on Arduino |
| CN107454619A (en) * | 2017-07-18 | 2017-12-08 | 深圳市盛路物联通讯技术有限公司 | Radio sensing network repeater abnormality eliminating method and equipment |
| CN107454619B (en) * | 2017-07-18 | 2020-06-16 | 深圳市盛路物联通讯技术有限公司 | Wireless sensor network repeater exception handling method and device |
| WO2019114670A1 (en) * | 2017-12-12 | 2019-06-20 | 华为技术有限公司 | Access method and device for relay system |
| CN111130613A (en) * | 2018-10-31 | 2020-05-08 | 珠海格力电器股份有限公司 | Terminal node equipment, relay control method and device and wireless communication networking |
| CN112533264A (en) * | 2020-11-10 | 2021-03-19 | 烽火通信科技股份有限公司 | Method and device for realizing networking scene mode |
| CN112737939A (en) * | 2020-12-15 | 2021-04-30 | 安徽继远软件有限公司 | Network self-healing method and network architecture based on cooperative communication of Internet of things |
| CN112738747A (en) * | 2020-12-29 | 2021-04-30 | 南京布袋健康管理有限公司 | Fitness bicycle self-networking method, device, server and storage medium based on Zigbee |
| CN112738747B (en) * | 2020-12-29 | 2024-03-22 | 南京布袋健康管理有限公司 | Zigbee-based body-building bicycle ad hoc network method and device |
| CN113596889A (en) * | 2021-07-20 | 2021-11-02 | 重庆声光电智联电子有限公司 | Wireless ad hoc network system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105873169B (en) | 2019-12-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105873169A (en) | Wireless ad-hoc network communication method | |
| US10051546B2 (en) | Communication control method and mobile terminal | |
| CN102340838B (en) | Medium access control method for prolonging network lifetime in wireless body area network | |
| KR100915520B1 (en) | Routing protocol within hybrid-cellular networks | |
| US8050196B2 (en) | Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation | |
| CN110856194A (en) | Dual-mode fusion networking method and communication method | |
| WO2013031314A1 (en) | Wireless sensor network system | |
| CN106953683B (en) | Route realization method suitable for large-scale dynamic networking based on MF-TDMA satellite channel | |
| CN101247339B (en) | Method for centralized resource reservation management in mobile wireless sensor network | |
| CN103139865B (en) | Networking and the method communicated in a kind of electric power Internet of Things | |
| CN115643593B (en) | Wireless ad hoc network communication system and method based on high dynamic routing protocol | |
| CN107172680B (en) | Wireless relay system based on cluster tree network | |
| CN114422009B (en) | Two-dimensional annular self-organizing inter-satellite link channel access control method | |
| CN109510769B (en) | Converged routing system suitable for wide-narrow combined network and method thereof | |
| Del-Valle-Soto et al. | An efficient multi-parent hierarchical routing protocol for WSNs | |
| CN112218246B (en) | BLE ad hoc network suitable for mine linear space and forming method thereof | |
| CN212627945U (en) | Network bridge device node | |
| CN110995601B (en) | Software-defined space-based backbone network topology construction method | |
| CN112351509A (en) | Self-organizing network protocol based on determinacy management method | |
| CN103929789A (en) | Automatic selection method for MANET network master control node based on active routing algorithm | |
| CN108200624B (en) | LPWAN-based hybrid network networking communication method with automatic network access function | |
| CN114374639A (en) | Air awakening-based LoRa-Mesh networking method and mobile terminal networking method | |
| JP2012070368A (en) | Multi-hop communication method, multi-hop communication system, and communication terminal | |
| CN111182555A (en) | Short-distance multi-node relay type self-adaptive wireless networking method | |
| CN111628922A (en) | Network communication method, bridge device node, and network communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |