CN105873169B - Wireless ad hoc network communication method - Google Patents
Wireless ad hoc network communication method Download PDFInfo
- Publication number
- CN105873169B CN105873169B CN201610429700.1A CN201610429700A CN105873169B CN 105873169 B CN105873169 B CN 105873169B CN 201610429700 A CN201610429700 A CN 201610429700A CN 105873169 B CN105873169 B CN 105873169B
- Authority
- CN
- China
- Prior art keywords
- node
- information
- repeater
- network
- coordinator
- 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.)
- Active
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 simple and reliable wireless ad hoc network communication method capable of accommodating large-scale nodes. The nodes in the wireless ad hoc network communication network comprise one or more coordinators and a plurality of relays, and can comprise a plurality of terminal nodes; each node only needs to record the self parent node number, and does not need to record the self child node number, so that the storage cost and complexity of each node are greatly reduced; the network access process only has two steps of requesting and replying, and does not need transfer, so that the overhead of network maintenance is extremely low; when a certain repeater is abnormal, the subnode can immediately request to become the subnode of other nodes without influencing the subnode of the subnode, so that the self-healing capability of the network is excellent; a plurality of coordinators can be mutually backed up, and the coordination work prevents one coordinator from being abnormal, so that the network is interrupted; the method is very suitable for the application of the Internet of things which needs multi-stage relays and has a large number of low-power consumption nodes.
Description
Technical Field
the invention relates to wireless communication, in particular to a wireless communication method of an ad hoc network, which is very suitable for the application of the Internet of things requiring multi-stage relays and having a large number of low-power-consumption nodes.
background
The core and the foundation of the internet of things technology are still 'internet technology', and the internet technology is an extension and expansion network technology on the basis of the internet technology, and a user side of the internet technology extends and expands to any article and among articles to exchange and communicate information. With the rise and development of the internet of things technology, the requirement on networking of equipment for connecting any article with the internet, exchanging information and communicating is higher and higher, and the quantity of the equipment is more and more. At present, most wireless communication networking systems are based on ZigBee technology or WIFI technology for networking. The ZigBee technology is a two-way wireless communication technology with short distance, low complexity, low power consumption, low speed and low cost. The method is mainly used for data transmission among various electronic devices with short distance, low power consumption and low transmission rate and is typically applied to periodic data transmission, intermittent data transmission and low-reaction-time data transmission. The WIFI technology is a technology that can wirelessly connect terminals such as personal computers and handheld devices (e.g., PADs and mobile phones) to each other, and is actually a high-frequency radio message. The wireless communication networking system based on the ZigBee technology can realize device bridging, has low power consumption, makes up the defects of the WIFI technology to a certain extent, and has the following defects at the same time: the overhead of the protocol occupying the bandwidth is high in channel bandwidth requirement, and the number of network devices is limited. The wireless communication networking system based on the WIFI technology has the advantages of high transmission rate, wide data bandwidth and high popularization rate, but has the following defects: the networking capability is low, the expansion space is limited, the power consumption is high, and the number of network equipment is small. With the forward progress of the information revolution of the internet of things, a wireless ad hoc network communication method capable of realizing multi-stage relay, low power consumption, long distance and large capacity is urgently needed.
Disclosure of Invention
The invention discloses a simple, reliable and multistage relay wireless ad hoc network communication method capable of accommodating large-scale nodes.
The nodes in the wireless ad hoc network communication network of the present invention include one or more coordinators and a plurality of repeaters, and may include a plurality of end nodes. The coordinator is used as an administrator of the network and an entrance for data acquisition or control, and is only used as a root node of the wireless network, but not used as a child node of other nodes; the repeater has a data relay function, and the coverage range of the non-group communication network is greatly expanded through multi-stage relay; the terminal node has no relay function and can operate with very low power consumption.
To achieve the above object, the system works in the following way:
The coordinator and the relays which have accessed the network keep receiving states, the relays which are to be accessed to the network and the terminal nodes actively initiate network access requests, and after receiving the requests, the coordinator and all the relays which have accessed to the network reply the node numbers and the relay depths of the coordinators and the relays in a random short time; the repeater or the terminal node compares the information intensity and the relay depth of the received reply information, and the repeater or the terminal node selects one repeater or coordinator from the received reply data as a parent node of the repeater or the coordinator, so as to join the network; the selection method is that under the premise of ensuring the information intensity, a relay or a coordinator with lower relay depth is selected as a father node of the self; the repeater and the terminal node only record the node number of the parent node of the repeater and do not need to record the child node of the repeater and the terminal node.
Multiple coordinators can work simultaneously, and as backup to each other, the relay and the terminal node can decide to connect to the network of which coordinator.
After the repeater and the terminal node access the network, sending uplink information, wherein the uplink information comprises a node number and a father node number of the repeater and the corresponding father node receives the information and adds the father node number of the repeater to the uplink information and forwards the uplink information if the corresponding father node is the repeater, so that the information reaches the upper-level repeater, and by analogy, the information finally reaches the coordinator and simultaneously contains a relay path passed by the uplink.
After receiving the information of node uplink, the coordinator sends response information and a relay path, after receiving the information, the next-stage relay judges that the information is the information required to be forwarded by itself according to the relay path information, and after modifying the relay path, the information is sent to the next-stage relay, and finally reaches the appointed node, and meanwhile, the relay updates the relay depth of the relay each time according to the relay path in the relay path, so that the real depth of the node caused by the path change of the node at the previous stage is prevented from being different from the recorded depth of the relay path.
after one or more times of uplink information of the repeater and the terminal node does not receive responses, the repeater and the terminal node think that the repeater and the terminal node are disconnected, and then a network access request is initiated to reselect a father node.
the repeater that has already been networked, do not respond to the network entry request that self father node sends, can avoid appearing two repeaters each other's father node, secondly the repeater is while transmitting the upstream data, judge whether there is own node number (namely data have already been sent by oneself or have already been forwarded by oneself) in the upstream path already, think that the loop is relayed and take place, force oneself to break off the line, send the abnormal information of the loop at the same time, include all repeater node numbers in this loop among them, other repeaters that receive this information, judge that includes the node number of oneself in the abnormal information, force oneself to break off the line; and the disconnected node requests to enter the network again.
In order to reduce the communication complexity caused by the network node number allocation, a fixed node number mode is adopted, namely all the terminal nodes, the repeaters and the coordinators have a unique and fixed node number in the system, and the node number does not change along with the change of the network topology structure.
In order to further reduce the power consumption of the terminal node and reduce the time for waiting for response, a father node (whether a coordinator or not) of the terminal node is adopted to directly reply information, after receiving the response, the terminal node immediately enters a low-power-consumption working mode, does not continuously receive the response from the coordinator, and continuously sends the information to the coordinator by a repeater which sends the reply information.
Compared with the prior art, the invention has the following beneficial effects:
Each node only needs to record the father node number of the node, and does not need to record the child node number of the node, so that the storage cost and complexity of each node are greatly reduced, and a large number of nodes can be accommodated for network access;
The network access process only comprises two steps of requesting and replying, and does not need relaying, so that the cost of network maintenance is extremely low;
when a relay is abnormal, the subnode can immediately request to become the subnode of other nodes without influencing the subnode of the subnode, so that the self-healing capability of the network is excellent
The multiple coordinators can back up each other, and the coordination work prevents one coordinator from being abnormal, which causes network interruption.
Drawings
Fig. 1 is a topology structural diagram of a wireless network of the present invention.
Fig. 2 is a communication topology of the wireless network of the present invention at a certain point in time.
Fig. 3 is a flow chart of the repeater or end node of the present invention entering the network.
Fig. 4 is a flow chart of the repeater of the present invention handling uplink and downlink data relaying.
Fig. 5 is a schematic diagram of the process of blocking communication, loop relaying and re-network entry of the relay node in the wireless network.
Detailed Description
The invention will be further explained with reference to the drawings
the network topology of the wireless network of the present invention is shown in fig. 1. The network includes one or more coordinators, a plurality of relays, and a plurality of terminal nodes. The terminal nodes can communicate with surrounding repeaters or coordinators but cannot communicate with the terminal nodes, and each repeater can communicate with the surrounding repeaters or coordinators;
as shown in fig. 2, a communication topology diagram formed after the repeater and the terminal node complete network entry is shown, and the arrow direction in the diagram indicates the affiliation of the parent node and the child node. The uplink data always finally arrives at the coordinator according to the direction of the arrow; the two coordinators can work simultaneously, are backup to each other, and the relay and the terminal node can automatically determine which coordinator is connected to the network; when one coordinator fails, all end nodes and repeaters may be connected to another coordinator.
The working process of various nodes in the network is as follows:
1) The coordinator and the repeater which has accessed the network keep receiving states, wait for network access requests of other repeaters or terminal nodes, and reply to the node number and the node depth of the coordinator in a random short time after receiving the network access requests;
2) As shown in fig. 3, which is a flowchart of a procedure for a repeater and a terminal node to complete network access, the repeater or the terminal node actively initiates a network access request, receives reply information from a coordinator or a repeater that has accessed the network all the time, compares the information strength and the node depth of the received reply information, and selects the repeater or the coordinator with a lower node depth as its parent node on the premise of ensuring the information strength, thereby joining the network, and all nodes only record the node number of its parent node without recording its child node.
As shown in fig. 4, which is a flow chart of a procedure for a relay to process relay wireless data, after the relay and a terminal node access a network, an uplink message is sent, where the uplink message includes a parent node number of the relay, and after the corresponding parent node receives the message, if the corresponding parent node is a relay, the parent node number of the relay is added to the uplink message and forwarded, so that the message reaches a previous-stage relay, and so on, and finally reaches a coordinator, and the message already includes a relay path through which the uplink message passes this time;
4) After receiving the information of node uplink, the coordinator sends response information and a relay path, after receiving the information, the next-stage relay judges that the information is the information required to be forwarded by itself according to the relay path information, and after modifying the relay path, the information is sent to the next-stage relay, and finally reaches the appointed node, and meanwhile, each time the relay updates the relay depth of the relay according to the relay path therein, so that the real depth of the node caused by the path change of the node at the previous stage is prevented from being different from the recorded depth of the relay.
After one or more times of uplink information of the repeater and the terminal node does not receive responses, the repeater and the terminal node think that the repeater and the terminal node are disconnected, and then a network access request is initiated to reselect a father node.
because the node does not record its own child node, when the node re-accesses the network, it may happen that one or more levels of its child nodes are used as parent nodes, thereby forming a relay loop, and the method for discovering and solving the relay loop is as follows: firstly, a repeater which has accessed the network does not respond to a network access request sent by a father node of the repeater, so that the phenomenon that two repeaters are mutual father nodes can be avoided, secondly, when the repeater forwards uplink data, the repeater judges whether a node number of the repeater exists in an uplink path, namely the repeater is sent or forwarded by the repeater, if so, the repeater considers that loop relaying occurs, the repeater is forced to break, and meanwhile, loop abnormal information is sent, wherein the loop abnormal information comprises all the repeater node numbers in the loop, and other repeaters which receive the information judge that the abnormal information comprises the node number of the repeater, and the repeater is forced to break; and the disconnected node requests to enter the network again.
As shown in fig. 5, when the communication between the repeater R1 and the coordinator is blocked (shown by the dotted line in the left diagram of fig. 5), the repeater R1 reappears for network entry, and in this case, the data sent by the repeater R1 will go through the repeaters R3 and R2 and return to R1, and then the R1 forces itself to be disconnected and sends loop abnormality information including the node number information of R2 and R3 to disconnect R2 and R3, as a case may occur when the byte point of the byte point is used as a parent node to form a relay loop (shown in the diagram of fig. 5); finally, R1, R2 and R3 can form a network structure as shown in the right diagram of FIG. 5 by re-networking.
in order to reduce the communication complexity caused by the network node number allocation, a fixed node number mode is adopted, namely all the terminal nodes, the repeaters and the coordinators have a unique and fixed node number in the system, and the node number does not change along with the change of the network topology structure.
In order to further reduce the power consumption of the terminal node and reduce the time for waiting for response, a father node (whether a coordinator or not) of the terminal node is adopted to directly reply information, after receiving the response, the terminal node immediately enters a low-power-consumption working mode, does not continuously receive the response from the coordinator, and continuously sends the information to the coordinator by a repeater which sends the reply information.
Claims (5)
1. A wireless ad hoc network communication method, wherein a node in a wireless ad hoc network communication network comprises one or more coordinators and a plurality of repeaters, and comprises a plurality of terminal nodes; all nodes only record the node numbers of self father nodes, do not need to record self child nodes, and work in the following way:
1) The coordinator and the relays which have accessed the network keep receiving states, the relays which are to be accessed to the network and the terminal nodes actively initiate network access requests, after the coordinator and all the relays which have accessed to the network receive the requests, the node numbers and the relay depths of the relays are replied in a random short time, and the relays or the terminal nodes select one relay or the coordinator from the received reply data as a father node of the relay or the coordinator, so that the relay or the terminal nodes are accessed to the network;
2) after the repeater and the terminal node access the network, sending uplink information, wherein the uplink information comprises a node number and a father node number of the repeater and the corresponding father node receives the information and adds the father node number of the repeater to the uplink information and forwards the uplink information if the corresponding father node is the repeater, so that the information reaches the upper-level repeater, and by analogy, the information finally reaches the coordinator and contains a transfer path passed by the uplink;
3) After receiving the information of node uplink, the coordinator sends response information and a transfer path, after receiving the information, the next-stage repeater judges that the information is the information required to be forwarded according to the transfer path information, and after modifying the transfer path, the information is sent to the next-stage repeater, and finally reaches the appointed node; meanwhile, the relay updates the relay depth of the relay according to the relay path in each time;
4) after one or more times of uplink information of the repeater and the terminal node does not receive responses, the repeater and the terminal node think that the repeater and the terminal node are disconnected, and then a network access request is initiated to reselect a father node.
2. The wireless ad hoc network communication method according to claim 1, wherein the repeater and the end node decide themselves to which coordinator to connect in the network, and when one coordinator fails, all the end nodes and the repeaters can connect to the other coordinator.
3. the wireless ad hoc network communication method according to claim 1, wherein the repeater does not respond to a network access request from its parent node, and when the repeater forwards uplink data, it determines whether there is a node number in an uplink path, if so, it considers that loop relaying has occurred, and forces itself to be disconnected, and at the same time, it sends loop abnormal information, which includes all repeater node numbers in the loop, and other repeaters that receive the information, and forces itself to be disconnected, if it determines that the abnormal information includes a node number of their own; and the disconnected node requests to enter the network again.
4. The wireless ad hoc network communication method according to claim 1, wherein a fixed node number is adopted, that is, all the end nodes, repeaters and coordinators have a unique and fixed node number in the system, and the node number does not change with the change of the network topology.
5. The wireless ad hoc network communication method according to claim 1, wherein the parent node of the terminal node directly replies to the message, the terminal node immediately enters a low power consumption operation mode after receiving the reply, and does not continue to receive the reply from the coordinator, and the relay that sends the reply message continues to send the message to the 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 CN105873169A (en) | 2016-08-17 |
| CN105873169B true 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) |
Families Citing this family (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 |
| CN107454619B (en) * | 2017-07-18 | 2020-06-16 | 深圳市盛路物联通讯技术有限公司 | Wireless sensor network repeater exception handling method and device |
| CN109922512A (en) * | 2017-12-12 | 2019-06-21 | 华为技术有限公司 | A kind of relay system cut-in method and device |
| CN111130613A (en) * | 2018-10-31 | 2020-05-08 | 珠海格力电器股份有限公司 | Terminal node equipment, relay control method and device and wireless communication networking |
| CN112533264B (en) * | 2020-11-10 | 2022-04-19 | 烽火通信科技股份有限公司 | Method and device for realizing networking scene mode |
| CN112737939B (en) * | 2020-12-15 | 2023-07-25 | 安徽继远软件有限公司 | Network self-healing method and network self-healing system based on Internet of things cooperative communication |
| 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 |
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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105873169A (en) | 2016-08-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105873169B (en) | Wireless ad hoc network communication method | |
| EP2076839B1 (en) | Power management system for a field device on a wireless network | |
| CN105210417B (en) | The system and method communicated for controlling network external equipment to equipment | |
| RU2316125C2 (en) | Method and device for finding adjacent units within piconet communication system | |
| CN101690042B (en) | Apparatus and method of generating and maintaining orthogonal connection identifications (cids) for wireless networks | |
| CN109565738B (en) | System and method for efficient connection establishment and communication for power sensitive devices | |
| CN101690041B (en) | Apparatus and method of generating and maintaining orthogonal connection identifications (cids) for wireless networks | |
| CN105827282A (en) | Bluetooth equipment networking method and device and Bluetooth equipment | |
| CN109672708B (en) | Communication method, device and system | |
| WO2015151423A1 (en) | Wireless communication method | |
| EP3446513B1 (en) | System and method for relay device discovery | |
| CN107852589A (en) | The instruction on the scene of neighborhood aware network data link | |
| Lee et al. | Wi-Fi direct based mobile ad hoc network | |
| Kale et al. | An overview of manet ad hoc network | |
| CN108200624B (en) | LPWAN-based hybrid network networking communication method with automatic network access function | |
| CN112752226B (en) | Method and system for Bluetooth low-power network configuration | |
| CN110739987A (en) | Low-voltage power line broadband carrier communication system | |
| Wu et al. | On multipacket reception based neighbor discovery in low-duty-cycle wireless sensor networks | |
| Uemura et al. | ACooperative BROADCASTING METHOD FOR A SENSOR NETWORK | |
| JP6195245B2 (en) | Mobile ad hoc network architecture and communication method of mobile ad hoc network architecture | |
| US11646962B1 (en) | Zero overhead efficient flooding (ZOEF) oriented hybrid any-cast routing for mobile ad hoc networks (MANET) | |
| CN113840261B (en) | Low-delay high-reliability communication terminal, redundant communication method and system and storage medium | |
| Mannan et al. | Mesh network-based device-to-device negotiation system for energy management | |
| KR100957740B1 (en) | Energy-Efficient Topology Control Method based on Location Awareness for Wireless Sensor Networks | |
| Nomasaki et al. | A Control Method for Transmission Timing of Control Packets to Prevent the Concentration of Control Packets for Bluetooth MANETs |
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 |