CN114449614B - Efficient access method for mobile ad hoc network with double-layer architecture - Google Patents
Efficient access method for mobile ad hoc network with double-layer architecture Download PDFInfo
- Publication number
- CN114449614B CN114449614B CN202111501678.4A CN202111501678A CN114449614B CN 114449614 B CN114449614 B CN 114449614B CN 202111501678 A CN202111501678 A CN 202111501678A CN 114449614 B CN114449614 B CN 114449614B
- Authority
- CN
- China
- Prior art keywords
- time slot
- network
- node
- matrix
- nodes
- 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
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/08—Access restriction or access information delivery, e.g. discovery data delivery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/309—Measuring or estimating channel quality parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/309—Measuring or estimating channel quality parameters
- H04B17/318—Received signal strength
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/309—Measuring or estimating channel quality parameters
- H04B17/336—Signal-to-interference ratio [SIR] or carrier-to-interference ratio [CIR]
-
- 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/0231—Traffic management, e.g. flow control or congestion control based on communication conditions
- H04W28/0236—Traffic management, e.g. flow control or congestion control based on communication conditions radio quality, e.g. interference, losses or delay
-
- 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
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
-
- 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
Abstract
The invention relates to a high-efficiency access method for a mobile ad hoc network with a double-layer architecture, which comprises the following steps: s1: acquiring an application scene of a network and initializing network parameters; s2: according to the application scene, determining the nodes of the network, wherein the nodes of the network comprise trunk nodes and common nodes; s3: dividing the priority of the nodes to obtain a node priority matrix, and carrying out time slot allocation on the nodes to obtain an initial time slot allocation matrix; s4: optimizing the time slot allocation of the nodes by adopting a sparrow search algorithm according to the node priority matrix and the initial time slot allocation matrix to obtain an optimal time slot allocation matrix; s5: and performing time slot allocation on each node in the network according to the optimal time slot allocation matrix, and accessing the network according to a time slot allocation result. The access method can meet the service requirements of different nodes in various scenes, can adapt to the requirements of topology change in a high-dynamic scene, and has the advantages of simple realization and high transmission reliability.
Description
Technical Field
The invention belongs to the field of wireless network access, and particularly relates to a high-efficiency access method for a mobile ad hoc network with a double-layer architecture.
Background
In recent years, with the rapid development of communication network technology, there is an increasing demand for efficient dynamic fast networking, and solutions for fast access networks in dynamic scenarios are continuously presented. Compared with the traditional communication network, the mobile self-organizing network has the most remarkable characteristics of no center, each node in the network can work as a transmitting node or a forwarding node, and the mobile self-organizing network supports multi-hop transmission and has the outstanding advantages of rapid arrangement, strong destroy resistance and the like.
Because the mobility of the nodes in the mobile ad hoc network is strong, the network topology can change rapidly, and the nodes in the network can access/exit the network at any time, in order to ensure that the nodes in the network can access the network rapidly and efficiently, a new topology structure is formed, and scholars propose a plurality of access protocols which can be summarized into the following categories: contention-type access protocol, planning-type access protocol, and hybrid-type access protocol.
The typical competition protocols are ALOHA and CSMA/CD protocols, the ALOHA protocol does not monitor the channel state, and the ALOHA protocol transmits the message, so that the method has great randomness, and the collision probability is extremely high under the scene of large number of nodes and large traffic, so that the access efficiency is seriously reduced. The CSMA/CD protocol is an improved protocol based on ALOHA, a channel monitoring and back-off mechanism is added, the efficiency is improved, but after the network load is increased, different nodes transmit data simultaneously to cause more conflicts, so that the network performance is seriously reduced. Therefore, it is not suitable for mobile ad hoc network
The access protocol of the planning class adopts a communication synchronization mode, the mapping of the time slot and the node determines the access authority to the channel, the requirement on the synchronization of the time slot is higher, the flexibility is lower, the flow load can not be dynamically adapted, and the method is not suitable for the mobile self-organizing network with unbalanced flow.
The hybrid access protocol is based on a contention-based and a planning-based access protocol, typical hybrid access protocols being TDMA/CSMA, ADAPT and AGENT, etc. However, the implementation difficulty of the hybrid access protocol is higher than that of the two protocols, and the problem of how to simultaneously realize efficient contention and time slot allocation is mainly solved.
The above access methods have advantages, but are not suitable for being applied to a mobile ad hoc network with a double-layer architecture, can not efficiently ensure the time delay of accessing/exiting the network, can not cope with the problem of rapid change of network topology, especially conflict is aggravated when the traffic volume of competing access protocols is increased, network performance is greatly discounted, and the practicability of the mixed access protocols is not strong, so that the mixed access protocols can not be applied to the mobile ad hoc network on a large scale.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a high-efficiency access method for a mobile ad hoc network with a double-layer architecture. The technical problems to be solved by the invention are realized by the following technical scheme:
the invention provides a high-efficiency access method for a mobile ad hoc network of a double-layer architecture, which comprises the following steps:
s1: acquiring an application scene of a network and initializing network parameters;
s2: determining nodes of a network according to the application scene, wherein the nodes of the network comprise trunk nodes and common nodes;
s3: dividing the priority of the nodes to obtain a node priority matrix, and performing time slot allocation on the nodes to obtain an initial time slot allocation matrix;
s4: optimizing the time slot allocation of the node by adopting a sparrow search algorithm according to the node priority matrix and the initial time slot allocation matrix to obtain an optimal time slot allocation matrix;
s5: and performing time slot allocation on each node in the network according to the optimal time slot allocation matrix, and accessing the network according to a time slot allocation result.
In one embodiment of the invention, the network adopts a double-layer architecture, comprising a backbone network and an access network, wherein all backbone nodes in the network form the backbone network, and each backbone node and adjacent common nodes form the access network.
In one embodiment of the invention, in said S1,
the application scene of the network comprises cities, plain and hills;
the network parameters comprise the number ratio of the trunk nodes to the common nodes, the maximum iteration times, the link quality threshold value and the time slot number.
In one embodiment of the present invention, the S2 includes:
calculating to obtain a node link quality evaluation matrix V, sorting element values in the node link quality evaluation matrix V from large to small, setting a node corresponding to a larger element value as the trunk node and a node corresponding to a smaller element value as the common node according to the quantity ratio of the trunk node to the common node,
wherein V is k Representing parameter matrixes corresponding to different parameters, k representing the number of parameters and s k Weights representing different parameter matrices;
the parameters include ambient electromagnetic environment, perceived environmental noise floor, signal strength, signal-to-noise ratio, and link quality indication.
In one embodiment of the present invention, the S3 includes:
s31: dividing the priority of each node according to the type of the bearing service of each node and the message transmission quality requirement corresponding to each bearing service to obtain the node priority matrix;
s32: and according to the number of the nodes and the number of the time slots, carrying out random time slot allocation on the nodes to obtain an initial time slot allocation matrix, wherein each node is allocated to at least one time slot in one time frame.
In one embodiment of the present invention, in said S31,
the bearing service types comprise voice service, text service, instruction service, video stream service and image service;
the higher the message transmission quality requirement is, the higher the priority corresponding to the bearing service is;
the priority of the trunk node is higher than that of the common node.
In one embodiment of the present invention, the S4 includes:
s41: judging whether cross-network access of a common node exists between access networks of the network;
s42: if not, updating the time slot allocation matrix according to the following formula to obtain an updated time slot allocation matrix,
where t represents the current iteration number, i=1, 2,3., n, n represents the number of nodes in the network, j=1, 2,3., d, d represents the number of slots in the time frame, X i,j Representing the allocation result of the ith node in the jth time slot, item max Represents the maximum iteration number, alpha E (0, 1)]Represents a random number, R.epsilon.0, 1]Representing early warning value, ST epsilon [0.5,1 ]]Representing the security value, Q representing a random number subject to a normal distribution, L representing a 1×d matrix in which each element in the matrix is all 1, F X Representing a node priority matrix;
if so, updating the time slot allocation matrix according to the following formula to obtain an updated time slot allocation matrix,
wherein X is p Time slot allocation matrix X representing current optimum of common node worst Representing the current global worst-case slot allocation matrix, A + ＝A T (AA T ) -1 A represents a 1×d matrix, wherein each element is randomly assigned a value of 1 or-1;
s43: judging whether the updated time slot distribution matrix is better than the time slot distribution matrix before updating, if so, taking the updated time slot distribution matrix as a new time slot distribution matrix, otherwise, reserving the time slot distribution matrix before updating;
s44: and adding 1 to the iteration number, and repeating the steps S41-S43 until the iteration number reaches the maximum iteration number, so as to obtain the optimal time slot allocation matrix.
In one embodiment of the present invention, in said S43,
and judging the time slot distribution matrix before and after updating according to the time slot conflict probability, wherein if the time slot conflict probability of the time slot distribution matrix after updating is smaller, the time slot distribution matrix after updating is superior to the time slot distribution matrix before updating, and vice versa.
Compared with the prior art, the invention has the beneficial effects that:
1. according to the high-efficiency access method for the double-layer architecture mobile ad hoc network, the nodes in the network are prioritized according to the characteristic that the network topology of the double-layer architecture mobile ad hoc network is frequently changed, and the node time slot allocation is optimized by adopting a sparrow search algorithm according to the obtained node priority matrix, so that the transmission efficiency is higher after the nodes are accessed into the network.
2. The high-efficiency access method for the mobile ad hoc network with the double-layer architecture can meet the service requirements of different nodes in various scenes, can adapt to the requirements of topology change in a high-dynamic scene, and is simple to realize and high in transmission reliability.
3. The high-efficiency access method for the mobile ad hoc network with the double-layer architecture has low dependence on hardware, and greatly reduces the requirements on hardware facilities in the operation process.
The foregoing description is only an overview of the present invention, and is intended to be implemented in accordance with the teachings of the present invention, as well as the preferred embodiments thereof, together with the following detailed description of the invention, given by way of illustration only, together with the accompanying drawings.
Drawings
Fig. 1 is a schematic diagram of a high-efficiency access method for a mobile ad hoc network with a dual-layer architecture according to an embodiment of the present invention;
fig. 2 is a flowchart of a method for efficient access to a mobile ad hoc network with a dual-layer architecture according to an embodiment of the present invention;
FIG. 3 is a network topology diagram of a dual layer architecture provided by an embodiment of the present invention;
FIG. 4 is a flow chart of slot allocation optimization provided by an embodiment of the present invention;
FIG. 5 is a graph showing average transmission delay versus number of different nodes according to an embodiment of the present invention;
fig. 6 is a comparison result of average transmission success rates under different numbers of nodes according to an embodiment of the present invention;
fig. 7 is a comparison result of channel utilization at different node numbers according to an embodiment of the present invention.
Detailed Description
In order to further explain the technical means and effects adopted by the invention to achieve the preset aim, the following describes in detail an efficient access method for a mobile ad hoc network with a double-layer architecture according to the invention with reference to the attached drawings and the detailed description.
The foregoing and other features, aspects, and advantages of the present invention will become more apparent from the following detailed description of the preferred embodiments when taken in conjunction with the accompanying drawings. The technical means and effects adopted by the present invention to achieve the intended purpose can be more deeply and specifically understood through the description of the specific embodiments, however, the attached drawings are provided for reference and description only, and are not intended to limit the technical scheme of the present invention.
Example 1
Referring to fig. 1 and fig. 2 in combination, fig. 1 is a schematic diagram of a high-efficiency access method for a mobile ad hoc network with a double-layer architecture according to an embodiment of the present invention; fig. 2 is a flowchart of a high-efficiency access method for a mobile ad hoc network with a dual-layer architecture according to an embodiment of the present invention. As shown in the figure, the high-efficiency access method for a mobile ad hoc network with a dual-layer architecture of the present embodiment includes:
s1: acquiring an application scene of a network and initializing network parameters;
in this embodiment, the application scenario of the network includes cities, plain and hills; the network parameters include the number ratio of the trunk node to the common node, the maximum iteration number, the link quality threshold and the number of time slots.
S2: according to the application scene, determining the nodes of the network, wherein the nodes of the network comprise trunk nodes and common nodes;
in this embodiment, the entire network is built up from a plurality of mobile devices. It should be noted that, the services completed by different nodes in the network are different, and mainly include scout cruising, environment monitoring, target searching, accurate hitting, relay communication, target tracking, etc. According to task demands of different nodes, nodes in the network are distinguished and divided into a trunk node and a common node.
Specifically, referring to fig. 3, fig. 3 is a network topology diagram of a dual-layer architecture provided in an embodiment of the present invention, where in this embodiment, the network adopts a dual-layer architecture, including a backbone network and an access network, where all backbone nodes in the network form the backbone network, and each backbone node and adjacent common nodes form the access network.
Further, in the present embodiment, the backbone node and the normal node are distinguished by the following operations. Specifically, a node link quality evaluation matrix V is obtained through calculation, element values in the node link quality evaluation matrix V are ordered from large to small, a node corresponding to a larger element value is set as a trunk node, a node corresponding to a smaller element value is set as a common node according to the quantity ratio of the trunk node to the common node,
wherein V is k Representing parameter matrixes corresponding to different parameters, k representing the number of parameters and s k Weights representing different parameter matrices;
in this implementation, the parameters include ambient electromagnetic environment, perceived ambient noise floor, signal strength, signal-to-noise ratio, and link quality indication.
Optionally, the number ratio of the trunk nodes to the common nodes is set to be 1:4 or 3:7, and the number of the trunk nodes and the common nodes is determined by adopting an upward rounding method.
S3: dividing the priority of the nodes to obtain a node priority matrix, and carrying out time slot allocation on the nodes to obtain an initial time slot allocation matrix;
specifically, S3 includes:
s31: dividing the priority of the nodes according to the type of the bearing service of each node and the message transmission quality requirement corresponding to each bearing service to obtain a node priority matrix;
in this embodiment, the bearer service types include a voice service, a text service, an instruction service, a video stream service, and an image service; the higher the message transmission quality requirement is, the higher the priority corresponding to the bearer service is; in general, the service priorities are in order from high to low: video stream > image > voice > instruction > text. The priority of the trunk node is higher than that of the common node.
It should be noted that, the node priority changes correspondingly with the service priority carried by the mobile device.
S32: according to the number of nodes and the number of time slots, carrying out random time slot allocation on the nodes to obtain an initial time slot allocation matrix, wherein each node is allocated to at least one time slot in one time frame.
Specifically, the node priority division is specifically described by taking setting 8 nodes and 8 priorities as examples, wherein the priority numbers are 1-8, 1 is highest and 8 is lowest, and elements in different nodes in the same time slot are different to obtain a node priority table as shown in table 1 in order to avoid collision between a backbone node and a common node.
Table 1 node priority table
The key factor of the node obtaining time slot in the access competition process is the node priority, the priority table can be changed along with the change of the node service in the network operation process, and the change interval is determined along with the change interval of the bearing service.
When time slot conflicts occur in the network due to the same priority of the nodes, the nodes generating the conflicts are set with a secondary priority to divide new priorities, and time slots are divided according to the new secondary priorities.
Optionally, the node with collision resends the frame carrying the random number, the random number range is 1-100, and the random numbers generated by different nodes are different, by sorting and comparing the sizes of the carried random numbers, the node sub-priority is higher as the random number is larger, otherwise, the node sub-priority is smaller, so that a new sub-priority is generated; and (3) re-dividing the time slots of the nodes generating the conflict through the secondary priority, thereby solving the problem of time slot conflict caused by the same priority of the nodes.
S4: optimizing the time slot allocation of the nodes by adopting a sparrow search algorithm according to the node priority matrix and the initial time slot allocation matrix to obtain an optimal time slot allocation matrix;
in this embodiment, the nodes of the network include a trunk node and a common node, and the priority of the trunk node is higher than that of the common node in the initial stage of network construction. In order to make node priority-based TDMA have a more efficient time slot allocation mechanism, a sparrow search algorithm is used to optimize the time slot allocation mechanism in the network. In order to avoid the situation that the access method based on the node priority can not access the network for a long time when the node with low priority is in use, one node is required to be at least allocated to one time slot in one time frame, and the node with high node priority can occupy a plurality of time slots, so that the node hierarchy is presented.
Assuming that the number of nodes in the network is n, d time slots (d is equal to or greater than n) exist in each time frame, the length of each time slot is tau, each node is represented by a sparrow, and the transient time slot allocation result of the node is represented by a position matrix of the sparrow:
where n represents the number of nodes in the network and d represents the number of time slots in the time frameAmount, X Z Representing a time slot matrix formed by trunk nodes, X P Representing a time slot matrix of common nodes.
Then the priority values of all nodes can be expressed as follows:
wherein F is X Represents a node priority matrix, f represents a node priority value, f (X Z ) Representing a priority matrix of backbone nodes, f (X P ) Representing a priority matrix composed of common nodes of the trunk.
Specifically, referring to fig. 4 in combination, fig. 4 is a flowchart of slot allocation optimization according to an embodiment of the present invention, as shown in the drawing, in this embodiment, S4 includes:
s41: judging whether cross-network access of a common node exists between access networks of the network;
specifically, when a certain common node in the network moves to the vicinity of another backbone node, the common node will access the new access network, i.e. the cross-network access involving the common node.
S42: if not, updating the time slot allocation matrix according to the following formula to obtain an updated time slot allocation matrix,
where t represents the current iteration number, i=1, 2,3., n, n represents the number of nodes in the network, j=1, 2,3., d, d represents the number of slots in the time frame, X i,j Representing the allocation result of the ith node in the jth time slot, item max Represents the maximum iteration number, alpha E (0, 1)]Represents a random number, R.epsilon.0, 1]Representing early warning value, ST epsilon [0.5,1 ]]Representing the security value, Q representing a random number subject to a normal distribution, L representing a 1×d matrix in which each element in the matrix is all 1, F X Representing a node priority matrix.
In this embodiment, the early warning value and the security value are both obtained when determining the network application scenario, where R is the ratio of the number of "discoverers" in the "sparrow" group in the whole population, and is used to predict whether a time slot conflict occurs in the network, and the security value is set to 0.9 in general. A backbone node with higher priority in the network can preempt slots preferentially, has more slot selection range than a normal node,
if R < ST, the backbone node can freely select a plurality of time slot access, wherein the time slot conflict does not exist in the network. If R.gtoreq.ST, it indicates that a slot conflict occurs in the network and the message is sent to other nodes in the network, at which time all nodes in the network need to reallocate slots.
If so, updating the time slot allocation matrix according to the following formula to obtain an updated time slot allocation matrix,
wherein X is p Time slot allocation matrix X representing current optimum of common node worst Representing the current global worst-case slot allocation matrix, A + ＝A T (AA T ) -1 A represents a 1 xd matrix in which each element is randomly assigned a value of 1 or-1.
When i > n/2, the ith common node with lower priority is not allocated to the time slot, and then iteration is needed again until the time slot is obtained.
S43: judging whether the updated time slot distribution matrix is better than the time slot distribution matrix before updating, if so, taking the updated time slot distribution matrix as a new time slot distribution matrix, otherwise, reserving the time slot distribution matrix before updating;
specifically, in S43,
and judging the time slot distribution matrixes before and after updating according to the time slot conflict probability, and if the time slot conflict probability of the time slot distribution matrix after updating is smaller, the time slot distribution matrix after updating is better than the time slot distribution matrix before updating, and vice versa.
That is, the slot allocation matrix is updated for each iterationTime slot collision probability generated in the network +.>Estimate if->Then represent->Is superior to->
Optionally, the time of the transmission information in the network is collected and analyzed by a transmission time information conflict detection method, and the time slot conflict probability in the network is predicted and obtained.
S44: and adding 1 to the iteration number, and repeating the steps S41-S43 until the iteration number reaches the maximum iteration number, so as to obtain the optimal time slot allocation matrix.
S5: and performing time slot allocation on each node in the network according to the optimal time slot allocation matrix, and accessing the network according to a time slot allocation result.
It should be noted that, when a node is accessed or exited in the network, or when the priority of the node in the network changes, the reassignment needs to be re-optimized for the network slot allocation mechanism according to the change of the corresponding node parameter.
According to the high-efficiency access method for the double-layer architecture mobile ad hoc network, the characteristics of frequent network topology change of the double-layer architecture mobile ad hoc network are combined, the nodes in the network are prioritized, and the node time slot allocation is optimized by adopting a sparrow search algorithm according to the obtained node priority matrix, so that the transmission efficiency is higher after the nodes are accessed into the network. The method can meet the service requirements of different nodes in various scenes, can adapt to the requirements of topology change in a high-dynamic scene, and is simple to realize and high in transmission reliability.
Example two
The effect of the high-efficiency access method for the mobile ad hoc network with the double-layer architecture in the first embodiment is explained through a simulation experiment.
Simulation parameters
The application scene is a square area with 30km and 30km, the number of nodes is 10-50, the node moving speed is set to be 10-100 m/s, the single-hop communication distance between the nodes is 5-10 km, the service priority number is 8, the moving mode of the nodes is random movement, namely, after the nodes move for a certain distance in one direction, the nodes randomly select another direction to continue moving.
Simulation results
In this embodiment, the access method of the present invention, that is, the TDMA access method optimized by the Sparrow Search Algorithm (SSA), is compared with the network performance parameters of the pure TDMA access method. Referring to fig. 5 to fig. 7, fig. 5 is a graph showing average transmission delay comparison results for different numbers of nodes according to an embodiment of the present invention; fig. 6 is a comparison result of average transmission success rates under different numbers of nodes according to an embodiment of the present invention; fig. 7 is a comparison result of channel utilization at different node numbers according to an embodiment of the present invention. As can be seen from fig. 5, compared with the original TDMA protocol, the optimized SSA-TDMA has lower average transmission delay under the condition of larger number of nodes, and effectively reduces the end-to-end transmission delay. Fig. 6 shows that both protocols have a decreasing trend in data transmission success rate in the network with increasing number of nodes, but the transmission success rate of SSA-TDMA is significantly higher than TDMA, indicating that the probability of network collision is reduced to some extent by optimization. Fig. 7 shows that the optimized SSA-TDMA protocol fully utilizes limited time slot resources, avoids the situation of low time slot utilization rate caused by uneven traffic load, and improves the channel utilization rate to a certain extent.
The high-efficiency access method for the double-layer architecture mobile ad hoc network has low dependence on hardware, and greatly reduces the requirements on hardware facilities in the operation process
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that an article or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in an article or apparatus that comprises the element.
The foregoing is a further detailed description of the invention in connection with the preferred embodiments, and it is not intended that the invention be limited to the specific embodiments described. It will be apparent to those skilled in the art that several simple deductions or substitutions may be made without departing from the spirit of the invention, and these should be considered to be within the scope of the invention.
Claims (7)
1. The high-efficiency access method for the mobile ad hoc network with the double-layer architecture is characterized by comprising the following steps of:
s1: acquiring an application scene of a network, and initializing network parameters, wherein the network parameters comprise a quantity ratio of a trunk node to a common node, the maximum iteration number, a link quality threshold value and the number of time slots;
s2: determining nodes of a network according to the application scene, wherein the nodes of the network comprise trunk nodes and common nodes;
s3: dividing the priority of the nodes to obtain a node priority matrix, and performing time slot allocation on the nodes to obtain an initial time slot allocation matrix;
s4: optimizing the time slot allocation of the node by adopting a sparrow search algorithm according to the node priority matrix and the initial time slot allocation matrix to obtain an optimal time slot allocation matrix; the step S4 comprises the following steps:
s41: judging whether cross-network access of a common node exists between access networks of the network;
s42: if not, updating the time slot allocation matrix according to the following formula to obtain an updated time slot allocation matrix,
where t represents the current iteration number, i=1, 2,3 …, n, n represents the number of nodes in the network, j=1, 2,3 …, d represents the number of slots in the time frame, X i,j Representing the allocation result of the ith node in the jth time slot, item max Represents the maximum iteration number, alpha E (0, 1)]Represents a random number, R.epsilon.0, 1]Representing early warning value, ST epsilon [0.5,1 ]]Representing the security value, Q representing a random number subject to a normal distribution, L representing a 1×d matrix in which each element in the matrix is all 1, F X Representing a node priority matrix;
if so, updating the time slot allocation matrix according to the following formula to obtain an updated time slot allocation matrix,
wherein X is p Time slot allocation matrix X representing current optimum of common node worst Representing the current global worst-case slot allocation matrix, A + ＝A T (AA T ) -1 A represents a 1×d matrix, wherein each element is randomly assigned a value of 1 or-1;
s43: judging whether the updated time slot distribution matrix is better than the time slot distribution matrix before updating, if so, taking the updated time slot distribution matrix as a new time slot distribution matrix, otherwise, reserving the time slot distribution matrix before updating;
s44: adding 1 to the iteration number, and repeating the steps S41-S43 until the iteration number reaches the maximum iteration number, so as to obtain the optimal time slot allocation matrix;
s5: and performing time slot allocation on each node in the network according to the optimal time slot allocation matrix, and accessing the network according to a time slot allocation result.
2. The efficient access method for a dual-layer architecture mobile ad hoc network according to claim 1, wherein said network adopts a dual-layer architecture comprising a backbone network and an access network, wherein all backbone nodes in the network form said backbone network, and each backbone node and adjacent common nodes form said access network.
3. The efficient access method for a two-tier architecture-oriented mobile ad hoc network according to claim 1, wherein in said S1, the application scenario of the network includes city, plain and hills.
4. The efficient access method for a mobile ad hoc network with a dual layer architecture according to claim 3, wherein said S2 comprises:
calculating to obtain a node link quality evaluation matrix V, sorting element values in the node link quality evaluation matrix V from large to small, setting a node corresponding to a larger element value as the trunk node and a node corresponding to a smaller element value as the common node according to the quantity ratio of the trunk node to the common node,
wherein V is k Representing parameter matrixes corresponding to different parameters, k representing the number of parameters and s k Weights representing different parameter matrices;
the parameters include ambient electromagnetic environment, perceived environmental noise floor, signal strength, signal-to-noise ratio, and link quality indication.
5. The efficient access method for a mobile ad hoc network with a dual layer architecture according to claim 3, wherein said S3 comprises:
s31: dividing the priority of each node according to the type of the bearing service of each node and the message transmission quality requirement corresponding to each bearing service to obtain the node priority matrix;
s32: and according to the number of the nodes and the number of the time slots, carrying out random time slot allocation on the nodes to obtain an initial time slot allocation matrix, wherein each node is allocated to at least one time slot in one time frame.
6. The method for efficient access to a two-tier architecture mobile ad hoc network of claim 5, wherein in said S31,
the bearing service types comprise voice service, text service, instruction service, video stream service and image service;
the higher the message transmission quality requirement is, the higher the priority corresponding to the bearing service is;
the priority of the trunk node is higher than that of the common node.
7. The method for efficient access to a two-tier architecture mobile ad hoc network of claim 1, wherein in said S43,
and judging the time slot distribution matrix before and after updating according to the time slot conflict probability, wherein if the time slot conflict probability of the time slot distribution matrix after updating is smaller, the time slot distribution matrix after updating is superior to the time slot distribution matrix before updating, and vice versa.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111501678.4A CN114449614B (en) | 2021-12-09 | 2021-12-09 | Efficient access method for mobile ad hoc network with double-layer architecture |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111501678.4A CN114449614B (en) | 2021-12-09 | 2021-12-09 | Efficient access method for mobile ad hoc network with double-layer architecture |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114449614A CN114449614A (en) | 2022-05-06 |
| CN114449614B true CN114449614B (en) | 2023-10-17 |
Family
ID=81362908
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111501678.4A Active CN114449614B (en) | 2021-12-09 | 2021-12-09 | Efficient access method for mobile ad hoc network with double-layer architecture |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114449614B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20020087611A (en) * | 2001-05-15 | 2002-11-23 | 김영철 | System for scheduling dynamic slot assignment using neural network in a wireless communication network |
| CN105873217A (en) * | 2016-05-19 | 2016-08-17 | 西安电子科技大学 | Multi-factor STDMA (space time division multiple access) based dynamic time slot allocation method for self-organized network |
| CN105873219A (en) * | 2016-05-30 | 2016-08-17 | 西安电子科技大学 | GASE based TDMA wireless Mesh network resource allocation method |
| CN108430108A (en) * | 2018-02-13 | 2018-08-21 | 西安电子科技大学 | Based on concurrently collection multiple-objection optimization slot allocation method, wireless network control system |
| CN111970044A (en) * | 2020-08-15 | 2020-11-20 | 哈尔滨工业大学（威海） | Satellite network time slot allocation and routing planning method based on Lagrange relaxation |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2433677A (en) * | 2005-10-31 | 2007-06-27 | Israel Aircraft Ind Ltd | Medium access control (MAC) method and system for dynamic time slot allocation and QoS priority access in a mobile ad hoc network (MANET) |
| US20110164527A1 (en) * | 2008-04-04 | 2011-07-07 | Mishra Rajesh K | Enhanced wireless ad hoc communication techniques |
-
2021
- 2021-12-09 CN CN202111501678.4A patent/CN114449614B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20020087611A (en) * | 2001-05-15 | 2002-11-23 | 김영철 | System for scheduling dynamic slot assignment using neural network in a wireless communication network |
| CN105873217A (en) * | 2016-05-19 | 2016-08-17 | 西安电子科技大学 | Multi-factor STDMA (space time division multiple access) based dynamic time slot allocation method for self-organized network |
| CN105873219A (en) * | 2016-05-30 | 2016-08-17 | 西安电子科技大学 | GASE based TDMA wireless Mesh network resource allocation method |
| CN108430108A (en) * | 2018-02-13 | 2018-08-21 | 西安电子科技大学 | Based on concurrently collection multiple-objection optimization slot allocation method, wireless network control system |
| CN111970044A (en) * | 2020-08-15 | 2020-11-20 | 哈尔滨工业大学（威海） | Satellite network time slot allocation and routing planning method based on Lagrange relaxation |
Non-Patent Citations (3)
| Title |
|---|
| Jae Seang Lee ; Yoon-Sik Yoo.Group Connectivity-Based UAV Positioning and Data Slot Allocation for Tactical MANET.IEEE.2020,全文. * |
| 一种冲突最小化的移动Ad-Hoc网络拓扑未知动态TDMA协议;姚志强;盛孟刚;尹俊勋;;湘潭大学自然科学学报(第04期);全文 * |
| 一种改进的动态TDMA时隙分配算法研究;秦茜;;无线电工程(第12期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114449614A (en) | 2022-05-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kasana et al. | Fuzzy-based channel selection for location oriented services in multichannel VCPS environments | |
| EP1460809A2 (en) | Layer module for medium access control protocol of a mobile station in a mobile ad hoc network and corresponding method | |
| CN111818465B (en) | Internet of vehicles self-adaptive multi-hop broadcasting system and method | |
| CN111711666A (en) | Internet of vehicles cloud computing resource optimization method based on reinforcement learning | |
| CN112512121A (en) | Radio frequency spectrum dynamic allocation method and device based on reinforcement learning algorithm | |
| CN108024231B (en) | vehicle-mounted network data transmission energy consumption optimization method and system | |
| CN114024639B (en) | Distributed channel allocation method in wireless multi-hop network | |
| CN103618674B (en) | A united packet scheduling and channel allocation routing method based on an adaptive service model | |
| Miri et al. | Improving resources in internet of vehicles transportation systems using markov transition and TDMA protocol | |
| CN105007586A (en) | Two-factor based self-adaptive contention window adjusting method for SMAC protocol of wireless sensor network | |
| CN102549987B (en) | A method for controlling the admission of a flow to a network and a network | |
| CN113573419A (en) | Multi-hop network channel access method considering multi-priority service | |
| CN114449614B (en) | Efficient access method for mobile ad hoc network with double-layer architecture | |
| CN102098230B (en) | Resource scheduling method based on time and space correlation in vehicle communication | |
| Chang et al. | Adaptive hierarchical polling and cost-based call admission control in IEEE 802.16 WiMAX networks | |
| CN108055667B (en) | Cognitive vehicle network combined routing and resource allocation method | |
| CN108650698B (en) | Opportunity network data forwarding method | |
| Boukhalfa et al. | Performance evaluation of an active signaling based time-slot scheduling scheme for connected vehicles | |
| Ouni et al. | Enhanced EDCA with deterministic transmission collision resolution for real-time communication in vehicular ad hoc networks | |
| CN114585103B (en) | Intelligent channel access control method for service perception | |
| CN114916087A (en) | Dynamic spectrum access method based on India buffet process in VANET system | |
| Deng et al. | Distributed resource allocation based on timeslot reservation in high-density VANETs | |
| CN114501650A (en) | Time slot resource allocation method, equipment and storage medium | |
| KR20080086112A (en) | Routing method of ad-hoc network | |
| Ahmed et al. | A QoS-aware scheduling with node grouping for IEEE 802.11 ah |
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 |