CN107426767B - Dynamic network access method suitable for business imbalance - Google Patents

Dynamic network access method suitable for business imbalance Download PDF

Info

Publication number
CN107426767B
CN107426767B CN201710452249.XA CN201710452249A CN107426767B CN 107426767 B CN107426767 B CN 107426767B CN 201710452249 A CN201710452249 A CN 201710452249A CN 107426767 B CN107426767 B CN 107426767B
Authority
CN
China
Prior art keywords
node
probability
transmission probability
network
delay
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
Application number
CN201710452249.XA
Other languages
Chinese (zh)
Other versions
CN107426767A (en
Inventor
陈娟
郑学强
彭来献
赵文栋
张磊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
PLA University of Science and Technology
Original Assignee
PLA University of Science and Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by PLA University of Science and Technology filed Critical PLA University of Science and Technology
Priority to CN201710452249.XA priority Critical patent/CN107426767B/en
Publication of CN107426767A publication Critical patent/CN107426767A/en
Application granted granted Critical
Publication of CN107426767B publication Critical patent/CN107426767B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/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
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • 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/10—Flow control between communication endpoints
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18—Negotiating wireless communication parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/06—Testing, supervising or monitoring using simulated traffic

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A dynamic network access method suitable for service unbalance is provided, when considering network node dynamic change and network node load unbalance, the number of neighbor nodes and network node historical data are applied, the influence of time slot idle rate and time delay is considered, and the sending probability of the network node is adjusted.

Description

Dynamic network access method suitable for business imbalance
Technical Field
The invention relates to a channel access method in a data chain, in particular to a channel access method which can be adopted under the conditions of dynamic change of network nodes and unbalanced network node load in LINK-16, and particularly relates to a dynamic network access method suitable for unbalanced service.
Background
At present, a Link-16 data chain system is widely applied to the army in the America army and the army in the North province, has the characteristics of confidentiality, large capacity, interference resistance and the like, and is a universal data chain system for the three army. Link-16 uses a Time Division Multiple Access (TDMA) method, and the Time slots adopt a pre-planned fixed allocation mode. This allocation scheme, although simple, lacks flexibility in that the time slots cannot be dynamically adjusted once allocated, and the time slots already allocated cannot be recycled unless the network is redesigned.
The existing data chain needs to plan time slots allocated to each communication platform through a network according to combat missions, and has the disadvantages of large workload, long planning period and high requirement on the professional of users. In large-scale communication, the number of timeslots is tight, and timeslot planning is very important. However, for medium and small-scale wars or ordinary training, the number of network nodes is small and the time slots are sufficient, the planning work is complicated and time-consuming, the communication application of the data link is greatly restricted, and the combat efficiency is influenced. In an actual communication application scenario, the load of each access platform is different according to tactical requirements, for example, the load of an early warning airplane is much larger than that of a general airplane. Therefore, the research on the channel access method when the network node dynamically changes and the load is unbalanced is significant.
Disclosure of Invention
The invention aims to provide a dynamic network access method suitable for service imbalance aiming at the defects of the prior art. When the dynamic change of the network node and the unbalanced load of the network node are considered, the number of the neighbor nodes and the historical data of the network node are applied, the influence of the idle rate and the time delay of the time slot is considered, and the sending probability of the network node is adjusted, so that the conditions of low delivery rate and high time delay of the network node with large load can be avoided, and the fairness of a data chain system is further improved.
The technical scheme of the invention is as follows:
a dynamic network access method suitable for service imbalance comprises the following specific steps:
the method comprises the following steps: initialization-setting of maximum traffic delay DmaxThe terminal history data parameter B is 0, the maximum value K of the terminal history data parameter B, and the initial transmission probability p of the network nodei(t) 1/N, where N is the number of network users;
step two: counting the average service delay D of the current nodeavgIt is compared with the set maximum service delay DmaxComparing, if the average transmission delay of the received packet is larger than the maximum delay of the node, reducing the sending probability of the node, otherwise, increasing the sending probability of the node, calculating the sending probability adjustment step quantity delta p,
Figure BDA0001322772140000021
Figure BDA0001322772140000022
step three: adopting the following formula to transmit the probability p of the service of the network node i at the time ti(t) adjusting to obtain the adjusted service occurrence probability pi’(t)；
pi’(t)＝pi(t)+Δp
Step four: adjusting historical data parameters B of the network nodes, if the parameters B satisfy { (queue is empty)&&(random number)<1/N)&&(B<K) B, increasing step 1; if satisfy { (queue is not empty)&&(1/N<Random number<1-(1-1/N)B)&&(B>0) B decreases step 1;
step five: calculating the sending probability p of the network node i at the moment t +1i(t+1)；
Figure BDA0001322772140000031
In step one of the present invention, slot idle rate p 'is considered in setting adjustment step amount'idle(t) when the slot vacancy is greater than 0.3, the transmission probability is increased, and when the slot vacancy is less than 0.25, the transmission probability is decreased, i.e. the transmission probability is decreased
Figure BDA0001322772140000032
Wherein not decreasing when the transmission probability is less than 0.001 and not increasing when the transmission probability is greater than 0.95 is a constraint of the transmission probability itself.
In step two of the present invention, the average packet delay DavgThe average time delay of the received packets is estimated by adopting a moving average method, and the specific calculation method is historical packet time delay and current packet time delay DpacketWeighted sum of, i.e. Davg＝0.9×Davg+0.1×DpacketWherein the current packet delay DpacketRefers to the interval between the time of transmission and the time of reception of a packet.
In step two of the present invention, the time slot idle rate is defined as the probability of time slot idle, i.e. there is no node in a time slotThe probability of transmitting data is that for a broadcast network with N nodes, if the transmission probability of each node is 1/N, the idle rate of the time slot is (1-1/N)N. (monotonically increasing with increasing N, when N is 2, the idle rate is 0.25, and by the time N tends to infinity, the idle rate tends to e-10.36. Considering that the number of general network nodes is not too large when a data chain is randomly used, the load is concentrated on a few nodes, and the number of equivalent network nodes is less, therefore, the idle rate range is set to be 0.25-0.3. When the idle rate is less than 0.25, the transmission probability is not increased any more, and when the idle rate is greater than 0.3, the transmission probability is not decreased any more. )
In the fourth step of the present invention, the random number is a number in the interval (0,1) randomly generated at each judgment.
The invention has the beneficial effects that:
the invention provides a dynamic network access method suitable for unbalanced service, aiming at the problems of poor time slot pre-planning and fairness of LINK-16 in consideration of dynamic change of network nodes and unbalanced network node load. The invention uses the number of the neighbor nodes and the historical data of the network nodes, considers the influence of the idle rate and the time delay of the time slot and adjusts the sending probability of the network nodes, thereby avoiding the conditions of small delivery rate and large time delay of the heavy-load network nodes and further improving the fairness of a data link system.
Drawings
FIG. 1 is a topology block diagram of a network node;
fig. 2 is a relationship between different load node delays of the shma protocol and network loads under the condition that the load of each node is unknown;
fig. 3 is a relationship between the time delay of different load nodes and the network load according to the method of the present invention under the condition that the load of each node is unknown.
FIG. 4 is a relationship between delivery rates of different load nodes of the SHUMA protocol and network load under the condition that the load of each node is unknown;
fig. 5 is a relationship between delivery rates of different load nodes and network load according to the method of the present invention under the condition that the load of each node is unknown.
Detailed Description
The invention is further described below with reference to the figures and examples.
A dynamic network access method suitable for service imbalance comprises the following specific steps:
the method comprises the following steps: initialization-setting of maximum traffic delay DmaxThe terminal history data parameter B is 0, the maximum value K of the terminal history data parameter B, and the initial transmission probability p of the network nodei(t) 1/N, where N is the number of network users.
Step two: counting the average time delay D of the current serviceavgComparing it with the maximum service time delay, if the average transmission time delay of the received packet is greater than the maximum time delay of the node, then reducing the sending probability of the node, otherwise, increasing the sending probability of the node. The transmission probability adjustment step amount ap is calculated,
Figure BDA0001322772140000051
in setting the adjustment step amount, the slot idle rate p 'is considered'idle(t) when the slot vacancy is greater than 0.3, the transmission probability is increased, and when the slot vacancy is less than 0.25, the transmission probability is decreased, i.e. the transmission probability is decreased
Figure BDA0001322772140000052
Wherein not decreasing when the transmission probability is less than 0.001 and not increasing when the transmission probability is greater than 0.95 is a constraint of the transmission probability itself.
Step three: adopting the following formula to transmit the probability p of the service of the network node i at the time ti(t) adjusting to obtain the adjusted service occurrence probability pi’(t)；
pi’(t)＝pi(t)+Δp；
Step four: adjusting historical data parameters B of the network nodes, if the parameters B satisfy { (queue is empty)&&(random number)<1/N)&&(B<K) B, increasing step 1; if satisfy { (queue is not empty)&&(1/N<Random number<1-(1-1/N)B)&&(B>0) B decreases step 1;
step five: calculating the sending probability p of the network node i at the moment t +1i(t+1)；
Figure BDA0001322772140000061
In the specific implementation:
taking the LINK-16 data chain system as an example, a specific calculation process of the dynamic network access method applicable to service imbalance is given.
The simulation parameters are as follows:
1. the simulation time is 100000 time slots, wherein the time slot length is 7.8125 ms;
2. maximum delay of service is Dmax＝800ms；
3. The node historical data parameter B is equal to 0, and the maximum value K of the terminal historical data parameter B is equal to 1000;
4. initial transmission probability p of a network nodei(t)＝0.1；
5. The network load G is 0.5 frame/sec, the load weights of the ten network nodes are [ 101022111111 ], and the loads of the ten nodes are shown in the following table
Figure BDA0001322772140000062
Figure BDA0001322772140000071
6. The node number N of the full-communication network is 10, the channel transmission distance is 300 km, each node is randomly distributed in the range of 200km by 200km, the generated network node positions are shown in the following table,
node numbering X coordinate (Km) Y coordinate (km)
0 54.628132 61.165197
1 181.957457 95.919675
2 132.364879 166.039003
3 101.944029 85.695975
4 153.276162 14.246040
5 179.583117 120.755638
6 39.936522 191.662343
7 96.444594 138.853114
8 131.510361 123.496200
9 148.857082 35.145116
In this embodiment, after 100000 simulation, the time delay and delivery rate of three exemplary nodes No. 0, No. 2, and No. 4 are shown in the following table.
Figure BDA0001322772140000072
Figure BDA0001322772140000081
In order to compare the dynamic network access method applicable to load imbalance with the existing method, the comparison of the network node delivery rate, time delay and other performances is described below with the simulation result.
The simulation condition is 10 network nodes. Fig. 2 and fig. 4 show the relationship between the time delay and the delivery rate of three network nodes with load weights of 10, 2, and 1 and the network load under the condition that the load of each node is unknown, and it can be seen that the delivery rate of a small-load node is high and the time delay is small, but the delivery rate of a large-load node is low and the time delay is large, and the fairness of the protocol is poor. Fig. 3 and fig. 5 show the relationship between the time delay and the delivery rate of three network nodes with load weights of 10, 2 and 1 and the network load under the condition that the load of each node is unknown, and it can be seen that the time delay and the delivery rate of the three types of nodes are not different greatly, and the fairness is better.
The parts not involved in the present invention are the same as or can be implemented using the prior art.

Claims (4)

1. A dynamic network access method suitable for business imbalance is characterized by comprising the following specific steps:
the method comprises the following steps: initialization-setting of maximum traffic delay DmaxThe terminal history data parameter B is 0, the maximum value K of the terminal history data parameter B, and the initial transmission probability p of the network nodei(t) 1/N, where N is the number of network users;
step two: counting the average service delay D of the current nodeavgIt is compared with the set maximum service delay DmaxComparing, if the average time delay D of the received packet serviceavgMaximum service time delay D larger than the nodemaxIf so, reducing the transmission probability of the node, otherwise, increasing the transmission probability of the node, calculating the adjustment step quantity delta p of the transmission probability,
Figure FDA0002633854310000011
step three: adopting the following formula to transmit the probability p of the service of the network node i at the time ti(t) adjusting to obtain the adjusted service transmission probability pi’(t)；
pi’(t)＝pi(t)+Δp
Step four: adjusting historical data parameters B of the network nodes, if the parameters B satisfy { (queue is empty)&&(random number)<1/N)&&(B<K) B, increasing step 1; if satisfy { (queue is not empty)&&(1/N<Random number<1-(1-1/N)B)&&(B>0) B decreases step 1;
step five: calculating the sending probability p of the network node i at the moment t +1i(t+1)；
Figure FDA0002633854310000012
In the first step, the time slot idle rate p 'is considered when setting the adjustment step amount'idle(t) when the slot vacancy is greater than 0.3, the transmission probability is increased, and when the slot vacancy is less than 0.25, the transmission probability is decreased, i.e. the transmission probability is decreased
Δp＝0
Figure FDA0002633854310000021
Wherein not decreasing when the transmission probability is less than 0.001 and not increasing when the transmission probability is greater than 0.95 is a constraint of the transmission probability itself.
2. The method as claimed in claim 1, wherein in step two, the average delay D of the packets isavgThe average time delay of the received packets is estimated by adopting a moving average method, and the specific calculation method is historical packet time delay and current packet time delay DpacketWeighted sum of, i.e. Davg＝0.9×Davg+0.1×DpacketWherein the current packet delay DpacketRefers to the interval between the time of transmission and the time of reception of a packet.
3. The dynamic network access method for traffic imbalance according to claim 1, wherein in the second step, the timeslot vacancy rate is defined as the probability of timeslot vacancy, i.e. the probability of no node transmitting data in a timeslot, and for a broadcast network with N nodes, if the transmission probability of each node is 1/N, the timeslot vacancy rate is (1-1/N)N。
4. The dynamic network access method for traffic imbalance according to claim 1, wherein in the fourth step, the random number is a number in the interval (0,1) randomly generated at each judgment.
CN201710452249.XA 2017-06-15 2017-06-15 Dynamic network access method suitable for business imbalance Active CN107426767B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710452249.XA CN107426767B (en) 2017-06-15 2017-06-15 Dynamic network access method suitable for business imbalance

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710452249.XA CN107426767B (en) 2017-06-15 2017-06-15 Dynamic network access method suitable for business imbalance

Publications (2)

Publication Number Publication Date
CN107426767A CN107426767A (en) 2017-12-01
CN107426767B true CN107426767B (en) 2020-12-15

Family

ID=60428125

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710452249.XA Active CN107426767B (en) 2017-06-15 2017-06-15 Dynamic network access method suitable for business imbalance

Country Status (1)

Country Link
CN (1) CN107426767B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111600747B (en) * 2020-04-27 2022-09-09 北京机电工程研究所 Data link simulation model

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103546377B (en) * 2013-10-14 2016-06-08 南京邮电大学 A kind of Delay Tolerant Network data transmission method based on improving transmission probability estimation
CN104579764A (en) * 2014-12-26 2015-04-29 中国电子科技集团公司第二十研究所 Dynamic data link resource allocation method based on shared time slot pools

Also Published As

Publication number Publication date
CN107426767A (en) 2017-12-01

Similar Documents

Publication Publication Date Title
WO2020187208A1 (en) Information indication method and device, and data transmission system
EP1213869A1 (en) Dynamic reverse link rate limit algorithm for high data rate system
US20130070696A1 (en) Network Side Device and Method for Transmitting Configuration Information of Pathloss Power Threshold Thereof
CN111541508B (en) LoRaWAN spread spectrum factor distribution method based on short-term DER and optimal load
CN107872900B (en) Satellite channel S-ALOHA access system and method supporting differentiated services
KR20130041748A (en) Apparatus and method for transmitting/receiving data in communication system
CN101577938B (en) Method and system for wireless mesh network congestion control and base stations
CN107426767B (en) Dynamic network access method suitable for business imbalance
CN105682195A (en) Energy saving power control method of wireless network based on C-RAN architecture
CN103533628B (en) A kind of downlink power distributing method
Xu et al. A priority differentiated and multi-channel MAC protocol for airborne networks
CN109104320B (en) Method for improving communication network capacity
CN100426929C (en) Channel bandwidth dynamic configuration method for synchronous code division multiple access system
Kim et al. Adaptive transmission opportunity scheme based on delay bound and network load in IEEE 802.11 e wireless LANs
Tian et al. A novel MAC protocol of wireless LAN with high throughput and fairness
CN108200602B (en) Multi-address access method based on load perception in wireless ad hoc network
CN113630901A (en) Dynamic multi-priority self-adaptive back-off algorithm in heterogeneous wireless network
KR101421570B1 (en) Fairness Enhancement Scheme for Multimedia Traffic in IEEE 802.11e Wireless LANs
Vijay et al. Quality of Service Improvements in IEEE 802.11 AX Wi-Fi
CN101340264A (en) Method and system for optimal allocation of uplink transmission power in communication networks
Yazdani et al. A fair access mechanism based on TXOP in IEEE 802.11 e wireless networks
Zheng et al. Analysis and research on a new data link mac protocol
Lin et al. Transmission power control for large scale industrial applications in low power and lossy networks
Zhang et al. End-to-end maxmin fairness in multihop wireless networks: Theory and protocol
Costa et al. An admission control mechanism to handle real-time traffic in IEEE 802.11 networks in open communication environments

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant