CN113709809B - Mobile ad hoc network broadcasting method based on cooperative communication - Google Patents
Mobile ad hoc network broadcasting method based on cooperative communication Download PDFInfo
- Publication number
- CN113709809B CN113709809B CN202110936181.9A CN202110936181A CN113709809B CN 113709809 B CN113709809 B CN 113709809B CN 202110936181 A CN202110936181 A CN 202110936181A CN 113709809 B CN113709809 B CN 113709809B
- Authority
- CN
- China
- Prior art keywords
- node
- time slot
- competition
- nodes
- broadcast
- 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.)
- Expired - Fee Related
Links
- 238000004891 communication Methods 0.000 title claims abstract description 19
- 238000000034 method Methods 0.000 title claims abstract description 14
- 230000005540 biological transmission Effects 0.000 claims abstract description 30
- 230000008859 change Effects 0.000 claims abstract description 5
- 238000003491 array Methods 0.000 claims description 7
- 230000008901 benefit Effects 0.000 abstract description 7
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 abstract description 5
- 230000001351 cycling effect Effects 0.000 abstract description 2
- 230000008569 process Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 238000002716 delivery method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0289—Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/08—Access restriction or access information delivery, e.g. discovery data delivery
- H04W48/10—Access restriction or access information delivery, e.g. discovery data delivery using broadcasted information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0833—Random access procedures, e.g. with 4-step access
- H04W74/0841—Random access procedures, e.g. with 4-step access with collision treatment
- H04W74/085—Random access procedures, e.g. with 4-step access with collision treatment collision avoidance
-
- 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)
- Computer Security & Cryptography (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a mobile ad hoc network broadcasting method based on cooperative communication, and belongs to the field of wireless ad hoc networks. The invention divides the broadcast scheme into a competition phase, a message control phase and a data transmission phase, in the competition phase, a broadcast network based on CSMA competition protocol is utilized to flood a small amount of competition messages by using the transmission advantage when the task load is light, and the broadcast authority is distributed; in the message control stage, the time slot allocation of the nodes is completed by utilizing a time slot allocation algorithm in combination with cooperative communication; in the data transmission stage, the advantages of cooperative communication in data transmission are utilized, and a TDMA time slot allocation algorithm is combined, so that the nodes can fully utilize channel resources to transmit data, mutual competition among the nodes for the channel resources is avoided, a large amount of data is transmitted, and the network load and the transmission success rate are improved while the control overhead is effectively reduced. The invention solves the problem of network dynamic topology change caused by node movement in the ad hoc network by periodically cycling the three stages. The broadcasting scheme of the invention can realize the broadcasting with low control overhead, high load and high delivery rate in the ad hoc network.
Description
Technical Field
The invention belongs to the field of wireless ad hoc networks, and mainly relates to a mobile ad hoc network broadcasting method based on multi-node cooperative communication.
Background
Mobile ad hoc networks (MANETs) are wireless, multi-hop, ad hoc mobile communication networks that do not rely on a fixed infrastructure and can be quickly established at any time and place. Each node in the network has the functions of data receiving and data sending while being relatively independent; the nodes can move freely, and the network topology structure changes dynamically; the high degree of cooperation between nodes and the distributed and parallel operation of the nodes makes the network highly robust and fault tolerant. The mobile ad hoc network has a plurality of advantages, is originally applied to the military field, and is widely applied to the environments separated from a backbone network, such as field communication, rescue and emergency rescue, a wireless sensor network and the like.
Broadcasting is a process in which a single node sends data to all other nodes in a network, and in a mobile ad hoc network, broadcasting is an important information delivery method, such as finding a specific node in the network, notifying all nodes, and the like. Currently, broadcast communication schemes in a mobile ad hoc network can be classified into three types according to their transmission mechanisms: a broadcast scheme based on simple flooding, a broadcast scheme based on probabilistic forwarding, and a broadcast scheme based on reliable forwarding.
The following documents describe several typical broadcast algorithm schemes in current mobile ad hoc networks:
[1]X.M.Zhang,E.B.Wang,J.J.Xia and D.K.Sung,"A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks,"in IEEE Transactions on Mobile Computing,vol.12,no.3,pp.424-433,March 2013,doi:10.1109/TMC.2011.277.
[2]Khabbazian M,Blake I F,Bhargava V K.Local broadcast algorithms in wireless ad hoc networks:reducing the number of transmissions[J].IEEE Trans.on Mobile Computing,2012,11(3):402-413。
in the broadcast scheme of the mobile autonomous network, a scheme based on simple flooding is that each node in the network forwards data once after receiving the data, and the simple flooding causes a broadcast storm, so that a large amount of data redundancy, channel competition and transmission collision are caused. The transmission of wireless signals has a broadcasting characteristic in space, and the broadcasting of one node can cover a plurality of nodes at the same time, so that the broadcasting of a plurality of nodes is redundant. Document [1] proposes a scheme NCPR based on probability forwarding, in which a node in a network collects one-hop neighbor node information by periodically exchanging HELLO messages, and acquires two-hop neighbor information by sending an RREQ message. The NCPR scheme defines two parameters of extra coverage rate and connectivity coefficient of a node in a network, calculates parameter values through two-hop neighbor information, further calculates the data forwarding probability of the node, and reduces data redundancy in the broadcasting process by reducing the forwarding probability of the node, so that the network performance is improved. Document [2] proposes a broadcast LBA based on reliable forwarding, in the scheme, a node also needs to maintain two-hop neighbor information, when the node sends data, a node that needs to forward data for a next hop needs to be specified according to the two-hop neighbor information, the specified node needs to forward the received data, and other nodes that are not specified automatically determine whether to forward the data according to an algorithm. The LBA scheme reduces data redundancy during broadcast by minimizing nodes participating in forwarding while ensuring broadcast coverage.
The above broadcast scheme mainly has the following problems:
1) The network needs to acquire information of two-hop nodes, and the mobile nature of the mobile ad hoc network can cause the network topology to change continuously, so that two-hop neighbor information needs to be maintained in time, and a large amount of control overhead is caused.
2) Because a CSMA-based competition protocol is adopted in the broadcasting scheme, a better transmission effect can be achieved when the node density is lower or the task load is lighter, but as the network load is increased, the node density is increased, the competition in the network is intensified, large-area network congestion and packet loss are often caused, and the network congestion and packet loss cause vicious cycles of data retransmission and the like of the nodes, so that the network performance is sharply reduced.
3) Both the broadcast scheme based on the probability forwarding and the broadcast scheme based on the reliable forwarding essentially reduce the redundancy of data by reducing the redundant forwarding of the nodes as much as possible, but at the same time, the problem of node coverage rate is also caused, and the delivery rate of data packets is reduced.
Disclosure of Invention
The invention mainly aims to solve the problems that a large amount of redundant transmission and network congestion can be generated to cause the rapid reduction of network performance under the conditions of high node density and high network load in the existing broadcasting scheme; the invention provides a broadcasting scheme based on cooperative communication.
The technical scheme of the invention is a mobile ad hoc network broadcasting method based on cooperative communication, which comprises the following circulating steps:
A. a competition phase;
B. controlling the message stage;
C. a data transmission stage;
the competition phase comprises the following steps:
(A1) Initializing nodes in a network, setting default parameters of start =0 and end =1, and initializing an array S (v), C (v);
(A2) Clearing arrays S (v) and C (v), wherein nodes with broadcasting requirements generate random numbers alpha between [ start, end ] as competition conditions;
(A3) The method comprises the steps that nodes with broadcasting requirements in a group broadcast and send a competition message containing a node ID and a random number alpha in a competition phase;
(A4) The nodes in the network receive the competition messages, obtain the node IDs and the random numbers alpha in the competition messages, and respectively and correspondingly assign the node IDs and the random numbers alpha to the parameters S i And C i And correspondingly storing the data into arrays S (v) and C (v);
(A5) At the end of the competition phase, the minimum C is selected among the sets C (v) i If the self node ID is equal to the selected C i Corresponding S i If yes, acquiring a broadcast authority, becoming a broadcast node in the period, and setting a parameter start = 1-alpha; otherwise, the node becomes a common node.
(A6) Entering a control message stage;
the control message stage:
(B1) The node initialization parameter time slot count is 0, the initial parameter change period threshold value P is set, if the node is a broadcast node, the self time slot T is defined to be 0; sending a time slot distribution message containing a time slot T, and entering a data transmission stage; the common node waits for time slot allocation;
(B2) If the node receives the time slot distribution message for the first time, distributing the time slot of the node according to the time slot information in the received control message; the specific algorithm is as follows:
T＝(T pre +1)％3
wherein T is pre Is the last hop time slot information contained in the data packet, T is the allocated time slot information,% is the remainder algorithm;
(B3) If the node receives the time slot distribution message again in a period after the self time slot, the type of the self node is changed from a common node to a relay node; otherwise, the type of the self node is changed from the common node to the boundary node;
(B4) Entering a data transmission stage;
the data transmission stage comprises the following steps:
(C1) If the node is a broadcast node, preparing to send a data packet, and broadcasting the data packet when the self time slot T = count%3 is met;
(C2) If the node is a relay node and receives the data packet for the first time, forwarding the data packet when the time slot T = count%3, and if receiving a repeated data packet, discarding the data packet;
(C3) If the node is a boundary node, the node does not carry out any forwarding after receiving the data packet;
(C4) If the time slot count is smaller than the period threshold value P, repeating the steps C1, C2 and C3; if the time slot count is greater than or equal to the period threshold value P, entering a step C5;
(C5) All node types are changed into common nodes, the time slot count is cleared, the time slots of all nodes are clear, and a competition stage A2 is entered.
The phase a algorithm is shown in fig. 2, and the phase B and C algorithm flow chart is shown in fig. 3:
as described above, the invention designs the broadcasting method based on cooperative communication, and compared with the traditional broadcasting algorithm based on channel competition, the broadcasting method has the following advantages:
1. the invention utilizes the transmission advantage of CSMA-based broadcast network under low load, and determines broadcast nodes by broadcasting a small amount of competition messages in the competition stage; by utilizing the TDMA-based cooperative communication algorithm, the nodes can fully utilize channel resources to transmit data, and mutual competition among the nodes for the channel resources is avoided, so that high load of a network can be met, a large amount of data can be transmitted, and the network transmission efficiency is improved.
2. The control message stage in the invention combines with the cooperative communication algorithm, can quickly and effectively complete the time slot distribution process, and effectively overcomes the influence of the node density on the network broadcast.
3. The broadcast algorithm of the invention fully utilizes the space gain brought by cooperative communication, thereby improving the success rate of data packet transmission and effectively improving the network delivery rate.
Drawings
FIG. 1 is a diagram illustrating a contention phase.
Fig. 2 is a schematic diagram of time slot allocation.
Fig. 3 is a flow chart of the contention phase.
Fig. 4 is a flow chart of the control message phase and the data transmission phase.
Detailed Description
Before the technical solution of the present invention is described in detail, the following explanation is given:
1. the competition phase adopts CSMA competition protocol, and the control message phase and the data transmission phase adopt TDMA protocol;
2. by combining modern coding and parameter dithering technologies, the space gain brought by multiple nodes can be fully utilized by cooperative communication, and channel resource competition among the nodes is avoided.
3. Nodes in the mobile ad hoc network default time synchronization.
4. The time slot counting parameter count is automatically added with one every other time slot and is cleared after a period is finished.
To make the objects, technical means and advantages of the present invention more apparent, the present invention will be described in further detail with reference to the following embodiments and the accompanying drawings.
As shown in fig. 1, there are 23 nodes in the ad hoc network, wherein the S1, S2, and S3 nodes have broadcast requirements.
A. A competition stage:
(A1) Nodes in the network are initialized, default parameters of start =0, end =1 are set, and arrays S (v), C (v) are initialized.
(A2) Clearing the arrays S (v), C (v), the nodes S1, S2, S3 with broadcast requirements generating random numbers alpha between [ start, end ] as competition conditions
(A3) Nodes S1, S2 and S3 with broadcasting requirements in the group broadcast and send competition messages containing node IDs and random numbers alpha in a competition phase.
(A4) The nodes in the network receive the competition messages, obtain the node IDs and the random numbers alpha in the competition messages, and respectively assign the node IDs and the random numbers alpha to the parameters S i And C i And stores the arrays S (v) and C (v).
(A5) At the end of the competition phase, the minimum C is selected among the sets C (v) i If self node ID equals S i If the node is a broadcast node in the period, the node becomes a broadcast node, and the parameter start = 1-alpha is set, otherwise, the node becomes a common node, and the parameter start is set to 0. Now, assuming that the random number generated by the node S1 is the minimum, the S1 node obtains the broadcast authority and becomes the broadcast node in the present period, and the other nodes become the common nodes.
After the contention phase is completed, node S1 obtains broadcast rights as shown in fig. 2.
B. Control message phase
(B1) Initializing a parameter period threshold value P, wherein the time slot count of the initialized parameter of the broadcast node S1 is 0, and defining the time slot T of the broadcast node S1 as 0. And sending a time slot distribution message containing the time slot T, and entering a data transmission stage. The regular node waits for a slot assignment.
(B2) If the node receives the time slot distribution message for the first time, the node distributes own time slot according to the time slot information in the received control message. The specific algorithm is as follows:
T＝(T pre +1)％3
wherein T is pre Is the last hop time slot information contained in the data packet, T is the assigned time slot information,% is the remainder algorithm.
(B3) If the node receives the time slot distribution message again in a period after the self time slot, the type of the self node is changed from the common node to the relay node; otherwise, the type of the self node is changed from the common node to the boundary node.
(B4) After entering the data transmission phase and completing the control message phase, as shown in fig. 2, the nodes in the network have already allocated their own time slot information.
C. Data transmission phase
(C1) The node S1 prepares to transmit a packet, and broadcasts the packet when the self-slot T = count%3 is satisfied.
(C2) If the node is a relay node and receives the data packet for the first time, the data packet is forwarded when the time slot T = count%3, and if a duplicate data packet is received, the data packet is discarded.
(C3) If the node is a boundary node, the node does not perform any forwarding after receiving the data packet.
(C4) If the time slot count is smaller than the period threshold value P, repeating the steps C1, C2 and C3; if the slot count is greater than or equal to the period threshold P, go to step C5.
(C5) All node types are changed into common nodes, the time slot count is cleared, each node time slot is cleared, and the competition stage A2 is entered.
The invention is characterized in that:
1. the transmission advantage of the CSMA-based broadcast network under low load is utilized, and a broadcast node is determined by broadcasting a small amount of competition messages in a competition stage; by utilizing the cooperative communication algorithm based on the TDMA, the nodes can fully utilize channel resources to transmit data, and the mutual competition of the channel resources among the nodes is avoided, so that a large amount of data is transmitted, and the network load and the transmission efficiency are improved.
2. The control message stage is combined with a cooperative communication algorithm, so that the time slot allocation process can be rapidly and effectively completed, and the influence of the node density on network broadcasting is effectively overcome.
3. The broadcast algorithm can fully utilize space gain brought by cooperative communication, improve the success rate of data packet transmission and effectively improve the network delivery rate.
4. The broadcast algorithm of the invention solves the problem of network dynamic topology change caused by node movement in the ad hoc network by periodically cycling the three stages.
Claims (1)
1. A mobile ad hoc network broadcasting method based on cooperative communication comprises the following steps:
A. a competition phase;
B. controlling the message stage;
C. a data transmission stage;
the competition phase comprises the following steps:
(A1) Initializing nodes in a network, setting default parameters of start =0 and end =1, and initializing an array S (v), C (v);
(A2) Clearing arrays S (v) and C (v), wherein nodes with broadcasting requirements generate random numbers alpha between [ start, end ] as competition conditions;
(A3) The method comprises the steps that nodes with broadcasting requirements in a group broadcast and send a competition message containing a node ID and a random number alpha in a competition phase;
(A4) The nodes in the network receive the competition messages, obtain the node IDs and the random numbers alpha in the competition messages, and respectively and correspondingly assign the node IDs and the random numbers alpha to the parameters S i And C i And correspondingly storing the data into arrays S (v) and C (v);
(A5) At the end of the competition phase, the minimum value C is selected among the sets C (v) i If the self node ID is equal to the selected C i Corresponding S i If yes, acquiring a broadcast authority, becoming a broadcast node in the period, and setting a parameter start = 1-alpha; otherwise, becoming a common node;
(A6) Entering a message control stage;
the control message stage:
(B1) The node initialization parameter time slot count is 0, the initial parameter change period threshold value P is set, if the node is a broadcast node, the self time slot T is defined to be 0; sending a time slot distribution message containing a time slot T, and entering a data transmission stage; the common node waits for time slot allocation;
(B2) If the node receives the time slot distribution message for the first time, distributing the time slot of the node according to the time slot information in the received control message; the specific algorithm is as follows:
T＝(T pre +1)％3
wherein T is pre Is the last hop time slot information contained in the data packet, T is the allocated time slot information,% is the surplus algorithm;
(B3) If the node receives the time slot distribution message again in a period after the self time slot, the type of the self node is changed from a common node to a relay node; otherwise, the type of the self node is changed from the common node to the boundary node;
(B4) Entering a data transmission stage;
the data transmission stage comprises:
(C1) If the node is a broadcast node, preparing to send a data packet, and broadcasting the data packet when the self time slot T = count%3 is met;
(C2) If the node is a relay node and receives the data packet for the first time, forwarding the data packet when the time slot T = count%3, and if receiving a repeated data packet, discarding the data packet;
(C3) If the node is a boundary node, the node does not carry out any forwarding after receiving the data packet;
(C4) If the time slot count is smaller than the period threshold value P, repeating the steps C1, C2 and C3; if the time slot count is greater than or equal to the period threshold value P, entering a step C5;
(C5) All node types are changed into common nodes, the time slot count is cleared, the time slots of all nodes are clear, and a competition stage A2 is entered.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110936181.9A CN113709809B (en) | 2021-08-16 | 2021-08-16 | Mobile ad hoc network broadcasting method based on cooperative communication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110936181.9A CN113709809B (en) | 2021-08-16 | 2021-08-16 | Mobile ad hoc network broadcasting method based on cooperative communication |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113709809A CN113709809A (en) | 2021-11-26 |
| CN113709809B true CN113709809B (en) | 2023-04-07 |
Family
ID=78653110
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110936181.9A Expired - Fee Related CN113709809B (en) | 2021-08-16 | 2021-08-16 | Mobile ad hoc network broadcasting method based on cooperative communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113709809B (en) |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1662713A1 (en) * | 2004-11-30 | 2006-05-31 | STMicroelectronics Asia Pacific Pte Ltd. | Multi-channel MAC protocol using multi-tone synchronous collision resolution in a mobile ad hoc network |
| CN101005694A (en) * | 2006-01-16 | 2007-07-25 | 清华大学 | Mobility managing method and device for mobile self organized network |
| CN101197826A (en) * | 2007-11-30 | 2008-06-11 | 华南理工大学 | Method for solving problems of multi-jumping wireless self-network grouping concealed terminal and exposed terminal |
| CN101242564A (en) * | 2007-02-05 | 2008-08-13 | 田蕊 | Broadcasting and receiving method for mobile wireless self-organized network message and applied terminal node |
| CN101668311A (en) * | 2009-06-11 | 2010-03-10 | 上海交通大学 | Routing method of mobile Ad Hoc network |
| EP2580935A1 (en) * | 2010-06-10 | 2013-04-17 | Defendec Inc. | Device and method for a multi-hop mobile ad hoc network |
| CN103313293A (en) * | 2013-07-02 | 2013-09-18 | 重庆大学 | Method for controlling stability of capacity of mobile ad-hoc networks |
| CN103379029A (en) * | 2012-04-24 | 2013-10-30 | 华为技术有限公司 | Method, device and system for forwarding routing of content network |
| CN104202777A (en) * | 2014-09-16 | 2014-12-10 | 北京邮电大学 | Augmented Lagrangian-based resource consultation mechanism in MANETs (mobile ad hoc networks) |
| CN105812455A (en) * | 2016-03-07 | 2016-07-27 | 北京邮电大学 | Collaborative download method and device in mobile Ad hoc network |
| CN106793149A (en) * | 2016-12-01 | 2017-05-31 | 南阳师范学院 | A kind of method for lifting mobile ad hoc network quality of service guarantee efficiency |
| CN106879071A (en) * | 2017-02-13 | 2017-06-20 | 电子科技大学 | Wireless Mesh netword low time delay optimization method based on dynamic time slot allocation |
| CN109874162A (en) * | 2019-03-21 | 2019-06-11 | 东南大学 | The hybrid Design of Routing Protocol optimization method of high-altitude high-speed mobile node ad hoc network |
-
2021
- 2021-08-16 CN CN202110936181.9A patent/CN113709809B/en not_active Expired - Fee Related
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1662713A1 (en) * | 2004-11-30 | 2006-05-31 | STMicroelectronics Asia Pacific Pte Ltd. | Multi-channel MAC protocol using multi-tone synchronous collision resolution in a mobile ad hoc network |
| CN101005694A (en) * | 2006-01-16 | 2007-07-25 | 清华大学 | Mobility managing method and device for mobile self organized network |
| CN101242564A (en) * | 2007-02-05 | 2008-08-13 | 田蕊 | Broadcasting and receiving method for mobile wireless self-organized network message and applied terminal node |
| CN101197826A (en) * | 2007-11-30 | 2008-06-11 | 华南理工大学 | Method for solving problems of multi-jumping wireless self-network grouping concealed terminal and exposed terminal |
| CN101668311A (en) * | 2009-06-11 | 2010-03-10 | 上海交通大学 | Routing method of mobile Ad Hoc network |
| EP2580935A1 (en) * | 2010-06-10 | 2013-04-17 | Defendec Inc. | Device and method for a multi-hop mobile ad hoc network |
| CN103379029A (en) * | 2012-04-24 | 2013-10-30 | 华为技术有限公司 | Method, device and system for forwarding routing of content network |
| CN103313293A (en) * | 2013-07-02 | 2013-09-18 | 重庆大学 | Method for controlling stability of capacity of mobile ad-hoc networks |
| CN104202777A (en) * | 2014-09-16 | 2014-12-10 | 北京邮电大学 | Augmented Lagrangian-based resource consultation mechanism in MANETs (mobile ad hoc networks) |
| CN105812455A (en) * | 2016-03-07 | 2016-07-27 | 北京邮电大学 | Collaborative download method and device in mobile Ad hoc network |
| CN106793149A (en) * | 2016-12-01 | 2017-05-31 | 南阳师范学院 | A kind of method for lifting mobile ad hoc network quality of service guarantee efficiency |
| CN106879071A (en) * | 2017-02-13 | 2017-06-20 | 电子科技大学 | Wireless Mesh netword low time delay optimization method based on dynamic time slot allocation |
| CN109874162A (en) * | 2019-03-21 | 2019-06-11 | 东南大学 | The hybrid Design of Routing Protocol optimization method of high-altitude high-speed mobile node ad hoc network |
Non-Patent Citations (2)
| Title |
|---|
| "Cross Media Routing and Clustering Algorithm for Autonomous Marine Systems";Jiannan Ding, Changhu Wang, Meiqiu Jiang, Shuisheng Lin, Haifen;《2021 4th IEEE International Conference on Industrial Cyber-Physical Systems (ICPS) |》;20210705;全文 * |
| "一种基于分簇的新型组播网络";卢玲，王钺，王剑，袁坚;《计算机仿真》;20130430;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113709809A (en) | 2021-11-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108235437B (en) | Wireless mobile self-organizing network channel time slot scheduling and distributing method | |
| Tang et al. | A protocol for topology-dependent transmission scheduling in wireless networks | |
| Chao et al. | Multiple-rendezvous multichannel MAC protocol design for underwater sensor networks | |
| US8050196B2 (en) | Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation | |
| Borgonovo et al. | ADHOC: a new, flexible and reliable MAC architecture for ad-hoc networks | |
| JP6538849B2 (en) | Scheduling algorithm and method for time slotted channel hopping (TSCH) MAC | |
| Kumar et al. | A survey on scheduling algorithms for wireless sensor networks | |
| CN108430111B (en) | Mixed type time slot reservation method in distributed TDMA protocol | |
| CN108093469B (en) | Distributed access method of wireless transmission system based on TDMA | |
| Borgonovo et al. | MAC for ad-hoc inter-vehicle network: services and performance | |
| CN107846706B (en) | Congestion-avoiding code-aware wireless mesh network multi-path routing method | |
| CN106131923B (en) | Networking method of multi-hop network in hybrid access mode and wireless communication equipment | |
| CN110519845B (en) | Unmanned aerial vehicle ad hoc network multi-hop TDMA access method based on time slot auxiliary allocation and use | |
| Liew et al. | A fast, adaptive, and energy-efficient data collection protocol in multi-channel-multi-path wireless sensor networks | |
| CN103428803A (en) | Opportunistic routing method combining with opportunistic network coding | |
| CN101631063B (en) | Competition window adjustment mechanism method and system based on positions and congestion conditions | |
| Chen et al. | Bandwidth-satisfied multicast by multiple trees and network coding in lossy manets | |
| CN106850436B (en) | Mine hybrid wireless mesh network routing method based on virtual potential energy field | |
| CN113596894B (en) | Unmanned aerial vehicle Ad hoc network cooperation time division channel access method based on dynamic relay selection | |
| CN110418389B (en) | Meter reading method of energy metering network | |
| Huang et al. | RC-MAC: A receiver-centric medium access control protocol for wireless sensor networks | |
| Chen et al. | A bandwidth allocation model with high concurrence rate in IEEE802. 16 mesh mode | |
| KR20100049042A (en) | Method of managing transmission within a wireless communications network | |
| CN113709809B (en) | Mobile ad hoc network broadcasting method based on cooperative communication | |
| CN109586834B (en) | Method for assisting automatic selection of time reference |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20230407 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |