CN113133081A - Energy-saving transmission method for wireless ad hoc network - Google Patents
Energy-saving transmission method for wireless ad hoc network Download PDFInfo
- Publication number
- CN113133081A CN113133081A CN202110430423.7A CN202110430423A CN113133081A CN 113133081 A CN113133081 A CN 113133081A CN 202110430423 A CN202110430423 A CN 202110430423A CN 113133081 A CN113133081 A CN 113133081A
- Authority
- CN
- China
- Prior art keywords
- node
- communication
- central control
- wireless
- hoc network
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- 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
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an energy-saving transmission method for a wireless ad hoc network, which comprises the wireless ad hoc network with a central control node, and comprises the following steps: 1) the method comprises the steps that a central control node of the wireless ad hoc network obtains neighbor node routing tables of all communication nodes, and routing information of the whole wireless ad hoc network is obtained through analysis and calculation; 2) when the residual electric quantity of the communication node is lower than a preset electric quantity threshold or the average throughput of the communication node is lower than a preset throughput threshold in a preset time window, sending a dormancy application to a central control node; 3) after receiving the dormancy application of the communication node, the central control node judges whether the communication node is a necessary communication node or whether an alternative node exists, and if the communication node is a non-necessary node, the dormancy application of the communication node is allowed. The invention reduces energy consumption by making nodes with low transmission capacity and low electric quantity sleep under the condition of not influencing network transmission function.
Description
Technical Field
The invention relates to the field of wireless communication, in particular to a wireless ad hoc network energy-saving transmission method.
Background
The wireless ad hoc network is a novel wireless network architecture completely different from a traditional wireless cellular network, and comprises a temporary autonomous network of a plurality of communication nodes. The nodes in the network are all peer-to-peer, each communication node is provided with a wireless transceiving device and has the functions of transmitting, forwarding and receiving, so that any two nodes in the network can communicate through a direct link or a multi-hop link. Compared with the traditional cellular network, the wireless ad hoc network does not need to depend on infrastructure, has the advantages of flexible and simple networking, high network reliability, large coverage range and the like, and is widely applied to the fields of public safety, military battlefields, post-disaster reconstruction, emergency tasks and the like.
According to different network designs, the wireless ad hoc network comprises two situations of a central node and a non-central node. In a wireless ad hoc network with a central node, the central node is responsible for topology management, frequency selection, timing synchronization and the like of the whole network, is in a decision and management position, and other communication nodes are configured by receiving some system messages broadcasted by the central node. In a wireless ad hoc network without a central node, all communication nodes are in equal positions and independently determine adopted configuration, resources and the like. After all communication nodes in the network go through a large amount of message interaction and games, the whole network tends to converge. In an actual wireless ad hoc network, in order to quickly converge the network, a central node is usually not completely cancelled, a communication node is temporarily assigned as the central node, and the central node is cancelled after the whole network is stabilized.
Wireless ad hoc networks are widely used in temporary emergency environments, which lack basic power supply facilities on one hand, and on the other hand, emergency services require rapid network deployment, so that it is difficult to supply power in a wired manner. Meanwhile, the wireless ad hoc network node has the characteristics of high integration level and small volume, so that a rechargeable battery is usually used for energy supply. If the wireless ad hoc network node cannot work due to energy exhaustion, problems such as network topology change and route reestablishment can be caused, and in a serious case, the network part can be disconnected, so that network communication is interrupted. Therefore, how to save the energy of the node without affecting the function is an important problem in designing the wireless ad hoc network node.
In order to prolong the lifetime of the network, existing wireless networks typically employ a terminal or node dormancy scheme. For example, LTE (Long Term Evolution ) systems employ a Discontinuous Reception (DRX) power saving scheme. In the DRX scheme, when the terminal is in idle state, there is no RRC (Radio Resource Control) connection and no dedicated Resource of the user, and the paging channel and the broadcast channel are mainly listened to.
Disclosure of Invention
In order to solve the above problems in the prior art, an object of the present invention is to provide an energy-saving transmission method for a wireless ad hoc network, which solves the problem that network transmission time is limited due to insufficient power supply of a wireless ad hoc network node, and prolongs the lifetime of the network by using an energy-saving transmission scheme.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows:
a wireless ad hoc network energy-saving transmission method comprises a wireless ad hoc network with a central control node, and comprises the following steps:
1) the method comprises the steps that a central control node of the wireless ad hoc network obtains neighbor node routing tables of all communication nodes, and routing information of the whole wireless ad hoc network is obtained through analysis and calculation;
2) when the residual electric quantity of the communication node is lower than a preset electric quantity threshold or the average throughput of the communication node is lower than a preset throughput threshold in a preset time window, a dormancy application is sent to the central control node by the communication node which is not the central control node;
in the wireless ad hoc network, nodes which carry out dormancy are divided into the two situations, for the first situation, when the residual electric quantity of a communication node is lower than a preset electric quantity threshold, in order to avoid sudden network interruption caused by the exhaustion of the electric quantity of the node, the communication node provides dormancy application to a central control node, so that the central control node can deal with the network interruption situation in advance; for the second case, a time window is preset, the average throughput of the communication nodes is counted, if the average throughput is lower than a preset throughput threshold, in order to reduce the energy consumption of the communication nodes with low efficiency, the communication nodes propose a dormancy application to a central control node, and the central control node transfers transmission data to other alternative communication nodes;
3) after receiving a dormancy application of a communication node, a central control node judges whether the communication node is a necessary communication node or whether an alternative node exists, if the communication node is an unnecessary node, the dormancy application of the communication node is allowed, if the communication node is a necessary node, the alternative node exists according to the routing information of the wireless ad hoc network in the step 1), and the dormancy application of the communication node is allowed or refused according to the judgment result;
4) the central control node sends a feedback signaling to the communication node which sends the dormancy application in the step 2) to inform whether the communication node can carry out dormancy, under the condition that the communication node is allowed to carry out dormancy application and a substitute node exists, the central control node sends a wakeup signaling to the substitute node, meanwhile, the central control node informs other communication nodes in the network of the information of the dormancy node and the substitute node through broadcast information, the other communication nodes update own adjacent node routing tables according to the broadcast information, and the states of the dormancy node or the substitute node can be identified in the adjacent node routing tables;
5) the communication node receives a feedback signaling which is sent by the central control node and allows dormancy in a time slot # n, and then the communication node starts dormancy from the time slot # n + k (k >0) until receiving a wake-up signaling;
6) and 3) the substitute node receives the awakening signaling sent by the central control node in the time slot # n, and the substitute node is switched to an awakening state in the time slot # n + k-1 at the latest.
Preferably, step 1) comprises the steps of:
1-1): all communication nodes in the wireless ad hoc network can acquire own adjacent nodes by sending discovery signals, each communication node establishes an adjacent node routing table, and the adjacent node routing table comprises the node ID and the state of the adjacent node;
1-2): all communication nodes send own adjacent node routing tables to a central control node, the adjacent node routing tables of the central control node can be directly sent to the central control node, and other communication nodes in the wireless ad hoc network send the adjacent node routing tables to the central control node in a multi-hop relay transmission mode;
1-3): after the central control node acquires the adjacent node routing tables of all the communication nodes, the routing information among all the nodes is acquired through cross analysis.
Preferably, the route information refers to all transmission routes between any two communication nodes.
Preferably, the dormant application in step 2) includes a remaining power of the communication node or an average throughput counted in a preset period of time.
Preferably, the necessary node in step 3) refers to a communication node that must be passed when the other two communication nodes in the network communicate.
Preferably, if the communication node which sends out the dormancy application in step 3) is a necessary node, the method for judging whether the alternative node exists is that if other dormant communication nodes exist in the network and can replace the necessary node, all dormant communication nodes which meet the conditions and the necessary node form a set, and the central control node preferentially selects the communication node with the highest residual electric quantity from the set as the alternative node of the necessary node; if a plurality of communication nodes with the same residual capacity exist, the communication node with the highest average throughput is preferentially selected as a substitute node of a necessary node, if other dormant communication nodes do not exist in the network and can substitute the necessary node, or the node selected according to the judging mode is still the necessary node, the dormancy application of the communication node is rejected, otherwise, the central node allows the dormancy application of the communication node.
Preferably, in step 5) and step 6), if the signaling transmission time between the communication node and the central control node is less than the signaling transmission time between the substitute node and the central control node, the k value is greater than or equal to the sum of the difference of the signaling transmission times and the time required for the substitute node to wake up.
Compared with the prior art, the invention has the following beneficial effects:
1. the invention reduces energy consumption by making nodes with low transmission capacity and low electric quantity sleep under the condition of not influencing network transmission function.
2. The invention prolongs the survival time of the network by reducing energy consumption, improves the efficiency of the network, reduces the operation and maintenance investment of the network and improves the competitiveness of the product.
3. The invention prolongs the service online time by reducing energy consumption, and can bring obvious economic benefit and social benefit due to the particularity of the using scene of the wireless ad hoc network.
Drawings
Fig. 1 is a DRX flow diagram of an LTE system according to the present invention;
FIG. 2 is a diagram of a first embodiment of a wireless ad hoc network;
fig. 3 is a schematic diagram of a wireless ad hoc network according to a second embodiment (including a sleeping node);
Detailed Description
The present invention will now be further described with reference to specific examples, which are intended to illustrate only some, but not all, embodiments of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In order to simply and clearly illustrate the scheme of the present invention, as shown in fig. 2, in a wireless ad hoc network case, the network includes seven nodes a to G, assuming that node a is a central control node, nodes B to G are communication nodes, and a routing table between each node is shown in fig. 2.
According to the DRX flow diagram of the LTE system shown in fig. 1, nodes a to G respectively transmit discovery signals in allocated time slots, and when one node transmits a discovery signal, other nodes receive and detect the discovery signal. For example, node C transmits a discovery signal, nodes A, B and D-G receive and detect the discovery signal, and if the receiving node detects the discovery signal, i.e., the detected discovery signal power is above a predetermined threshold, node C is a neighbor node of the receiving node. As can be known from fig. 3, if the node C is a neighbor node of the node B, D, E, the node B, D, E establishes its own neighbor node routing table, and stores the ID of the node C in the neighbor node routing table. By analogy, all nodes can know own adjacent nodes and establish an adjacent node routing table. The neighbor node routing table also contains node states considering that the nodes have two states of dormancy and awakening.
After all the nodes establish the adjacent node routing table, the information in the adjacent node routing table is sent to the central control node A. Wherein, the nodes B and D are adjacent nodes of the central control node A, and directly send the information in the adjacent node routing table to the central control node A. And the other nodes are adjacent nodes of the node A which is not centrally controlled, and the information in the adjacent node routing table is required to be transmitted to the node A through relay transmission of the other nodes. For example, the node F sends the information in its own neighbor node routing table to the central control node a by means of two-hop transmission through relay transmission of the node D. Note that, when transmitting through multi-hop, the transmitted information needs to contain ID information of the source node.
After the central control node A acquires the adjacent node routing tables of the communication nodes B to G, the transmission path between any two communication nodes can be acquired through cross analysis. For example, the transmission path between communication nodes D and E includes D-C-E and D-F-E.
Assuming that the average throughput calculated by the communication node C is lower than a preset throughput threshold or the remaining power of the communication node C is lower than a preset power threshold in a preset time window, the communication node C sends a sleep application signaling to the central control node a through relay transmission of the communication node B or D. The signaling contains a statistical average throughput or remaining capacity. And the central control node A receives the dormancy application signaling, and judges whether the communication node C is a necessary node. Since the communication node C is not a node through which the other two communication nodes have to pass when performing data transmission, the central control node allows the communication node C to sleep.
As shown in fig. 3, if the communication node F is already in the dormant state, the communication link between the communication node F and the neighboring node is disconnected. At this time, after receiving the sleep application signaling of the communication node C, the central control node a finds that the communication node C is a necessary node for the communication node E to perform data transmission with another communication node. After determining that the communication node C is a necessary node, the central control node finds that the communication node F which has been dormant is an alternative node, and combines the communication nodes C and F into a set.
The central control node A compares the residual electric quantity of the communication nodes C and F, and the communication node with the lower residual electric quantity is used as a dormant node. If the residual capacities of the two nodes are the same, the central control node A further compares the average throughputs of the two nodes, and the communication node with lower average throughput is used as a dormant node. Considering that the communication node F may be dormant due to the average throughput being lower than the preset throughput threshold, and the remaining power thereof may be higher than the preset power threshold and the communication node C, the communication node F may serve as a substitute node for the communication node C, in which case the central control node a runs the dormancy application of the communication node C. And if the central control node A still judges that the communication node F is a dormant node, refusing the dormant application of the communication node C.
And after the judgment is completed, the central control node A sends a feedback instruction to the communication node C to inform the communication node C to carry out dormancy or continue working. If the communication node C is allowed to sleep, the central control node A simultaneously sends a wake-up instruction to the communication node F, and the communication node F is woken up to end the sleep state and establish network connection. Meanwhile, the central control node A broadcasts the information that the communication node C is dormant and the communication node F is awakened to other communication nodes B, D, E and G, and other communication nodes update the adjacent node routing table. For example, the communication nodes B, D and E update the state of the communication node C in the neighbor node routing table to sleep, and the communication nodes D, E and G update the state of the communication node F in the neighbor node routing table to wake.
Assuming that the communication node C receives the feedback signaling of allowing the sleep sent by the central control node in the time slot # n, the communication node C starts the sleep from the time slot # n + k (k >0), and disconnects the network connection with the communication nodes B, D and E. Meanwhile, suppose that the communication node F receives the wakeup signaling sent by the central control node in the time slot # n, the communication node F switches to the wakeup state in the time slot # n + k-1 at the latest, and establishes the network connection with the communication nodes D, E and G, so that when the communication node C sleeps, other communication nodes can transmit data through the communication node F.
Since the link hops from the central control node a to the communication node C are the same as the link hops from the central control node a to the communication node F, the value k is taken to ensure that the communication node F can wake up and establish network connection. Assuming that the number of hops from the central control node a to the communication node C is less than the number of hops from the central control node a to the communication node C by N hops, the value of k is at least the sum of the time required for N-hop transmission and the time for ensuring that the communication node F can wake up and establish network connection.
The neighbor routing table of communication node D is shown in table 1.
| Adjacency point ID | Neighbor node status |
| A | Wake-up |
| C | Wake-up |
| F | Dormancy |
| G | Wake-up |
TABLE 1
Therefore, the terminal can be dormant in a period of time, and the physical downlink control channel is stopped being monitored. The processor inside the terminal will turn off the receiver and put itself into a low power sleep mode. In a wireless sensor network or a wireless ad hoc network, on one hand, different functions are designed according to different application scenes, and some unnecessary functions are removed to save energy. On the other hand, a dedicated routing protocol is designed to improve energy efficiency and a dedicated technique is employed. In practical applications, the node sleep is usually realized by reducing the idle listening time of the node through a Media Access Control (MAC) protocol. On this basis, therefore, studies have been made on various MAC routing protocols, such as a routing protocol based on the minimum number of pieces.
Although the present invention has been described with reference to a preferred embodiment, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (7)
1. A wireless ad hoc network energy-saving transmission method comprises a wireless ad hoc network with a central control node, and is characterized by comprising the following steps:
1) the method comprises the steps that a central control node of the wireless ad hoc network obtains neighbor node routing tables of all communication nodes, and routing information of the whole wireless ad hoc network is obtained through analysis and calculation;
2) when the residual electric quantity of the communication node is lower than a preset electric quantity threshold or the average throughput of the communication node is lower than a preset throughput threshold in a preset time window, a dormancy application is sent to the central control node by the communication node which is not the central control node;
3) after receiving a dormancy application of a communication node, a central control node judges whether the communication node is a necessary communication node or whether an alternative node exists, if the communication node is an unnecessary node, the dormancy application of the communication node is allowed, if the communication node is a necessary node, the alternative node exists according to the routing information of the wireless ad hoc network in the step 1), and the dormancy application of the communication node is allowed or refused according to the judgment result;
4) the central control node sends a feedback signaling to the communication node which sends the dormancy application in the step 2) to inform whether the communication node can carry out dormancy, under the condition that the communication node is allowed to carry out dormancy application and a substitute node exists, the central control node sends a wakeup signaling to the substitute node, meanwhile, the central control node informs other communication nodes in the network of the information of the dormancy node and the substitute node through broadcast information, the other communication nodes update own adjacent node routing tables according to the broadcast information, and the states of the dormancy node or the substitute node can be identified in the adjacent node routing tables;
5) the communication node receives a feedback signaling which is sent by the central control node and allows dormancy in a time slot # n, and then the communication node starts dormancy from the time slot # n + k (k >0) until receiving a wake-up signaling;
6) and 3) the substitute node receives the awakening signaling sent by the central control node in the time slot # n, and the substitute node is switched to an awakening state in the time slot # n + k-1 at the latest.
2. The wireless ad hoc network energy-saving transmission method according to claim 1, wherein: the step 1) comprises the following steps:
1-1): all communication nodes in the wireless ad hoc network can acquire own adjacent nodes by sending discovery signals, each communication node establishes an adjacent node routing table, and the adjacent node routing table comprises the node ID and the state of the adjacent node;
1-2): all communication nodes send own adjacent node routing tables to a central control node, the adjacent node routing tables of the central control node can be directly sent to the central control node, and other communication nodes in the wireless ad hoc network send the adjacent node routing tables to the central control node in a multi-hop relay transmission mode;
1-3): after the central control node acquires the adjacent node routing tables of all the communication nodes, the routing information among all the nodes is acquired through cross analysis.
3. A wireless ad hoc network power saving transmission method according to claims 1 and 2, characterized in that: the routing information refers to all transmission routes between any two communication nodes.
4. The wireless ad hoc network energy-saving transmission method according to claim 1, wherein: the dormant application in step 2) includes the remaining power of the communication node or the average throughput counted in a preset period of time.
5. The wireless ad hoc network energy-saving transmission method according to claim 1, wherein: the necessary node in step 3) refers to a communication node that must be passed when the other two communication nodes in the network communicate.
6. The wireless ad hoc network energy-saving transmission method according to claim 1, wherein: if the communication node sending the dormancy application in the step 3) is a necessary node, judging whether a replaceable node exists or not, if other dormant communication nodes exist in the network and can replace the necessary node, forming a set by all dormant communication nodes meeting the conditions and the necessary node, and preferentially selecting the communication node with the highest residual electric quantity from the set by the central control node as the replacement node of the necessary node; if a plurality of communication nodes with the same residual capacity exist, the communication node with the highest average throughput is preferentially selected as a substitute node of a necessary node, if other dormant communication nodes do not exist in the network and can substitute the necessary node, or the node selected according to the judging mode is still the necessary node, the dormancy application of the communication node is rejected, otherwise, the central node allows the dormancy application of the communication node.
7. The wireless ad hoc network energy-saving transmission method according to claim 1, wherein: in step 5) and step 6), if the signaling transmission time between the communication node and the central control node is less than the signaling transmission time between the substitute node and the central control node, the k value is greater than or equal to the sum of the difference of the signaling transmission time and the time required for waking up the substitute node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110430423.7A CN113133081B (en) | 2021-04-21 | 2021-04-21 | Energy-saving transmission method for wireless ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110430423.7A CN113133081B (en) | 2021-04-21 | 2021-04-21 | Energy-saving transmission method for wireless ad hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113133081A true CN113133081A (en) | 2021-07-16 |
| CN113133081B CN113133081B (en) | 2023-03-24 |
Family
ID=76778569
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110430423.7A Active CN113133081B (en) | 2021-04-21 | 2021-04-21 | Energy-saving transmission method for wireless ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113133081B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114389726A (en) * | 2022-01-18 | 2022-04-22 | 即刻雾联科技(北京)有限公司 | Intelligent networking method, system and storage medium based on edge device |
| CN117528601A (en) * | 2024-01-05 | 2024-02-06 | 深圳市烽云技术有限公司 | Wireless ad hoc network communication method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103327586A (en) * | 2013-05-29 | 2013-09-25 | 东南大学 | Synchronous method for wireless sensor network node dormancy low power consumption protocol |
| CN105453662A (en) * | 2013-07-12 | 2016-03-30 | 康维达无线有限责任公司 | Neighbor discovery to support sleepy nodes |
| CN112040528A (en) * | 2020-09-10 | 2020-12-04 | 无锡职业技术学院 | Method for selecting control node of wireless ad hoc network center |
-
2021
- 2021-04-21 CN CN202110430423.7A patent/CN113133081B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103327586A (en) * | 2013-05-29 | 2013-09-25 | 东南大学 | Synchronous method for wireless sensor network node dormancy low power consumption protocol |
| CN105453662A (en) * | 2013-07-12 | 2016-03-30 | 康维达无线有限责任公司 | Neighbor discovery to support sleepy nodes |
| CN112040528A (en) * | 2020-09-10 | 2020-12-04 | 无锡职业技术学院 | Method for selecting control node of wireless ad hoc network center |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114389726A (en) * | 2022-01-18 | 2022-04-22 | 即刻雾联科技(北京)有限公司 | Intelligent networking method, system and storage medium based on edge device |
| CN117528601A (en) * | 2024-01-05 | 2024-02-06 | 深圳市烽云技术有限公司 | Wireless ad hoc network communication method and device |
| CN117528601B (en) * | 2024-01-05 | 2024-03-26 | 深圳市烽云技术有限公司 | Wireless ad hoc network communication method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113133081B (en) | 2023-03-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9386504B2 (en) | Energy-efficient network protocol and node device for sensor networks | |
| KR100584446B1 (en) | Method for controlling operation mode of mobile terminal in broadband wireless access communication system | |
| Yang et al. | A wakeup scheme for sensor networks: Achieving balance between energy saving and end-to-end delay | |
| US8320288B2 (en) | Communication system, communication apparatus and communication method, and computer program | |
| US7356561B2 (en) | Adaptive sleeping and awakening protocol for an energy-efficient adhoc network | |
| Pham et al. | An adaptive mobility-aware MAC protocol for sensor networks (MS-MAC) | |
| EP2171929B1 (en) | Path selection and power management in mesh networks | |
| KR100689550B1 (en) | method for transmitting hello packet MANET | |
| US20070242634A1 (en) | Method and apparatus for message transmission within a communication system | |
| CN113133081B (en) | Energy-saving transmission method for wireless ad hoc network | |
| CN112040528B (en) | Method for selecting control node of wireless ad hoc network center | |
| WO2016008218A1 (en) | Wireless ad hoc network, center node, dynamic selection method and storage medium | |
| KR20070116399A (en) | Method and system for controlling the sleep mode for power saving in a wireless mesh network | |
| Paruchuri et al. | Energy aware routing protocol for heterogeneous wireless sensor networks | |
| Gunasekaran et al. | Xlrp: Cross layer routing protocol for wireless sensor networks | |
| CN114374639B (en) | LoRa-Mesh networking method based on air wake-up and mobile terminal networking method | |
| Balachandran et al. | Adaptive sleeping and awakening protocol (ASAP) for energy efficient adhoc sensor networks | |
| CN113543203B (en) | Communication resource allocation and communication node awakening method | |
| Abid et al. | Collision free communication for energy saving in wireless sensor networks | |
| GB2468065A (en) | Energy-efficient network protocol and node device for sensor networks | |
| KR20080095697A (en) | Method on wake-up scheduling of sensor nodes in multihop sensor networks | |
| Kacsó et al. | MAC protocol design requirements for mobility-aware wireless sensor networks | |
| Vergados et al. | An Energy Efficiency Scheme for Wireless Sensor Networks | |
| Sathyamanagalam | Topology control using efficient power management | |
| KR100770878B1 (en) | Method for establishing Routing path IN Mobile Ad hoc Network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |