CN115001999B - Network state detection method in wireless ad hoc network - Google Patents
Network state detection method in wireless ad hoc network Download PDFInfo
- Publication number
- CN115001999B CN115001999B CN202210614590.1A CN202210614590A CN115001999B CN 115001999 B CN115001999 B CN 115001999B CN 202210614590 A CN202210614590 A CN 202210614590A CN 115001999 B CN115001999 B CN 115001999B
- Authority
- CN
- China
- Prior art keywords
- time
- test
- network
- change
- 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
- 238000001514 detection method Methods 0.000 title abstract description 9
- 238000012360 testing method Methods 0.000 claims abstract description 156
- 238000004364 calculation method Methods 0.000 claims abstract description 9
- 230000005540 biological transmission Effects 0.000 claims description 15
- 238000000034 method Methods 0.000 claims description 5
- 230000001934 delay Effects 0.000 claims description 3
- 230000000977 initiatory effect Effects 0.000 claims description 3
- 238000013215 result calculation Methods 0.000 abstract 1
- 238000005457 optimization Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
A network state detection method in a wireless ad hoc network, comprising the steps of: 1) node identification, 2) network test result calculation, 3) timing time calculation. Has the following characteristics: 1) Node identification acquires IP information; 2) Automatic timing test reduces randomness; 3) Collision avoidance: on the premise that the test task does not generate forwarding conflict, the network quality between any two nodes is detected. The technical effects achieved are as follows: 1) The nodes identify other nodes in the ad hoc network, and automatically generate test tasks for testing, so that a complex flow of manual configuration is avoided; 2) According to the change frequency of the network, the test time among the nodes is optimized, and the timeliness of the test result is further optimized; 3) The node may aggregate the test results in the time period and make a reasonable assessment of the network quality in the time period.
Description
Technical Field
The present invention relates to the field of wireless ad hoc networks, and more particularly, to a network state detection method in a wireless ad hoc network.
Background
In a wireless ad hoc network, in order to obtain the network quality among nodes in the network, in theory, only a network programming technology is generally needed, data packets are sent among the nodes through application layer software, and information such as byte numbers of the data packets is counted, so that the network quality among the nodes is measured.
However, in an actual wireless ad hoc network, because of the number of nodes, if the following problems occur if the nodes are to be manually configured one by one in sequence to complete the test: firstly, the test work becomes complex, and the time spent on manually configuring each node in turn is relatively long; secondly, the test result does not have timeliness, and the network state may have been fluctuated and changed for many times, but the test result still reflects a more stable result; finally, a single one-time test result cannot necessarily accurately reflect the quality of the network.
Thus, a solution to the above problems is being demanded.
Disclosure of Invention
The invention adopts the mode of application layer software realization, and realizes the evaluation of the network quality among nodes through the steps of node identification and the calculation of the timing time of the network test result computer.
The technical scheme of the invention is as follows:
a network state detection method in a wireless ad hoc network, comprising the steps of:
1) Node identification: selecting a certain node to start in a command mode, and operating other nodes in a common mode, wherein all nodes send an online notification message to the appointed multicast IP address, and receiving and analyzing the multicast online notification, and all nodes acquire the IP addresses and the operation states of other nodes respectively and record the IP addresses and the operation states of the other nodes, so that the nodes in the ad hoc network finish the identification work of the other nodes;
2) Calculating a network test result: by setting the timing time, the two nodes can repeatedly execute tasks for several times in a time period, the test results comprise delay, jitter, bandwidth and packet loss rate, the nodes calculate the average value of the test results obtained by each test in the time period, and further calculate the overall network quality in the time period, so that the randomness of the test results is reduced;
3) Timing time calculation: after the one-time test task of the step 2) is completed, comparing and calculating the current test result with the historical test result, recording the time difference between the current fluctuation and the last fluctuation when the current test result shows obvious fluctuation, calculating the average approximate change time again, obtaining the proper next estimated test time, initiating the test between the nodes to be tested when the estimated time arrives, testing a certain node with other nodes for multiple times in a period of time, and evaluating the network quality between the nodes according to the multiple test results.
Preferably, the specific steps of calculating each parameter of the test result in the step 2) are as follows:
when testing the bandwidth (the number of bytes transmitted in unit time) among nodes, adopting a TCP transmission mode to test, wherein a sending party circularly sends byte streams to a receiving party, the receiving party counts the number of bytes received in each unit time during circular receiving, and after the byte streams are received, the number of bytes received in each unit time is averaged to obtain an estimated value of the network bandwidth;
when the delay between the nodes is tested, a UDP transmission mode is adopted for testing, packet header information is inserted into a transmitted UDP data packet, and the transmitting time is recorded; after receiving the data packets, the receiving time is recorded, the sending time of the packet header is analyzed, and the transmission delay of each data packet can be obtained according to the receiving time and the sending time, namely, the delay of each data packet = receiving time-sending time;
jitter between test nodes is completed on the basis of test delay, and jitter refers to the variation degree of transmission delay of each data packet, and average jitter between each received data packet is obtained by accumulating absolute values of differences between delays of adjacent received data packets (jitter= |the delay of the data packet-delay of the previous data packet|);
when testing and estimating packet loss rate among nodes, adopting a UDP transmission mode to test, inserting sequence numbers into packet heads of UDP data packets by a sender, and calculating real-time packet loss rate by a receiver according to the sequence numbers of the received UDP data packets, wherein the calculation method comprises the following steps:
1) If the number of the arrived data packet=the maximum number+1, namely the data packet arrives in sequence, the maximum number is +1;
2) If the number of the arrived data packet is greater than the maximum number +1, namely, the sequence is out of order, the data packet arrives in advance, and the data packet from the data packet starting from the maximum number +1 to the data packet number-1 arriving at present is judged to be lost; the total number of lost data packets plus the difference between the current data packet number and the historical maximum data packet number; the maximum data number is updated to the number of the currently received data packet;
3) If the number of the arrived data packet is less than the maximum number +1, the data packet is out of sequence, and is sent late, and the total number of the lost data packets is-1;
packet loss rate = total number of packets lost/maximum packet number.
The invention has the beneficial effects that:
1. in the invention, the nodes identify other nodes in the ad hoc network, and automatically generate test tasks for testing, so that the complex flow of manual configuration is avoided;
2. according to the change frequency of the network, the test time among the nodes is optimized, and the timeliness of the test result is further optimized;
3. the nodes in the invention can summarize the test results in the time period and reasonably evaluate the network quality in the time period.
Drawings
Fig. 1 is an overall flowchart of an optimization method for joint track and node access in unmanned aerial vehicle auxiliary data acquisition, which is provided by the embodiment of the invention;
fig. 2 is an exemplary diagram of timing calculation in an optimization method of joint trajectory and node access in unmanned aerial vehicle auxiliary data acquisition according to an embodiment of the present invention;
fig. 3 is an overall flowchart illustrating an optimization method for joint trajectory and node access in unmanned aerial vehicle auxiliary data acquisition according to an embodiment of the present invention.
Detailed Description
The present invention will be further described with reference to the accompanying drawings and specific examples so that those skilled in the art may better understand the present invention and practice it, and the embodiments of the present invention are not limited thereto.
As shown in fig. 1, a network state detection method in a wireless ad hoc network includes the steps of:
1) Node identification: selecting a certain node to start in a command mode, and operating other nodes in a common mode, wherein all nodes send an online notification message to the appointed multicast IP address, and receiving and analyzing the multicast online notification, and all nodes acquire the IP addresses and the operation states of other nodes respectively and record the IP addresses and the operation states of the other nodes, so that the nodes in the ad hoc network finish the identification work of the other nodes;
2) Calculating a network test result: by setting the timing time, the two nodes can repeatedly execute tasks for several times in a time period, the test results comprise delay, jitter, bandwidth and packet loss rate, the nodes calculate the average value of the test results obtained by each test in the time period, and further calculate the overall network quality in the time period, so that the randomness of the test results is reduced;
the specific steps of calculating each parameter of the test result in the step 2) are as follows:
when testing the bandwidth (the number of bytes transmitted in unit time) among nodes, adopting a TCP transmission mode to test, wherein a sending party circularly sends byte streams to a receiving party, the receiving party counts the number of bytes received in each unit time during circular receiving, and after the byte streams are received, the number of bytes received in each unit time is averaged to obtain an estimated value of the network bandwidth;
when the delay between the nodes is tested, a UDP transmission mode is adopted for testing, packet header information is inserted into a transmitted UDP data packet, and the transmitting time is recorded; after receiving the data packets, the receiving time is recorded, the sending time of the packet header is analyzed, and the transmission delay of each data packet can be obtained according to the receiving time and the sending time, namely, the delay of each data packet = receiving time-sending time;
jitter between test nodes is completed on the basis of test delay, and jitter refers to the variation degree of transmission delay of each data packet, and average jitter between each received data packet is obtained by accumulating absolute values of differences between delays of adjacent received data packets (jitter= |the delay of the data packet-delay of the previous data packet|);
when testing and estimating packet loss rate among nodes, adopting a UDP transmission mode to test, inserting sequence numbers into packet heads of UDP data packets by a sender, and calculating real-time packet loss rate by a receiver according to the sequence numbers of the received UDP data packets, wherein the calculation method comprises the following steps:
1) If the number of the arrived data packet=the maximum number+1, namely the data packet arrives in sequence, the maximum number is +1;
2) If the number of the arrived data packet is greater than the maximum number +1, namely, the sequence is out of order, the data packet arrives in advance, and the data packet from the data packet starting from the maximum number +1 to the data packet number-1 arriving at present is judged to be lost; the total number of lost data packets plus the difference between the current data packet number and the historical maximum data packet number; the maximum data number is updated to the number of the currently received data packet;
3) If the number of the arrived data packet is less than the maximum number +1, the data packet is out of sequence, and is sent late, and the total number of the lost data packets is-1;
packet loss rate = total number of lost data packets/maximum data packet number, 0-current time is calculated, and the method is applicable to three situations.
3) Timing time calculation: after the one-time test task of the step 2) is completed, comparing and calculating the current test result with the historical test result, recording the time difference between the current fluctuation and the last fluctuation when the current test result shows obvious fluctuation, calculating the average approximate change time again, obtaining the proper next estimated test time, initiating the test between the nodes to be tested when the estimated time arrives, testing a certain node with other nodes for multiple times in a period of time, and evaluating the network quality between the nodes according to the multiple test results.
As shown in fig. 2, step 3) is illustrated by:
the initial state is set as follows:
total number of network quality tests sum_count=0;
time first_test_time=0 for the first test;
the number of changes_count=0 when a network state change is detected;
the last time a network state change was detected is last_change_time=0;
the average time interval of detecting a network state change, average_change_time=0.
The first step, judging whether the current network state changes according to the comparison of the test result of the current test and the test result of the previous test, wherein the judgment basis is as follows:
(1) If the network bandwidth is tested, the change degree of the network bandwidth, delay and jitter is calculated respectively:
the bandwidth measured in the previous test is last_bandwidth;
the jitter measured in the previous test is last_jitter;
the delay measured by the previous test result is last_delay;
the bandwidth, jitter and delay of the test result are respectively as follows
The degree of change in bandwidth is:when the network state is considered to have changed. Otherwise:
only when the delay of the current test and the delay measured by the previous test meet the following conditions:
or when the jitter of the current test and the jitter measured by the previous test meet the following conditions:
the system considers that the current test result has larger change compared with the last test result, and judges that the network state has changed. Otherwise, the network state is considered to be stable. Whether the obtained network state changes or not is judged, the test times and the test results are accumulated, when the test times are 1, the time of the first test is recorded, and the average test result is calculated.
And step two, if the network state is not changed, directly executing the step three. When it is determined that the network state has changed:
(1) This network change is first detected after the system is started, and the following processing is performed on the test record:
change_count=1
last_change_time=current time
average_time = current time-first_test_time
Recording the network change times as 1 time, recording the time interval between the completion time of the test and the first test as the average change time, and recording the completion time of the test as the last network change time.
(2) This time the network change is detected a plurality of times during the time period, the following is performed:
time interval of two changes: time_update = current time-last_change_time
The average interval time for detecting a change is:
change_count=change_count+1
last_change_time=current time
And recording the time interval between the completion time of the test and the last network change time as one network change time, calculating new average change time together with the captured network change times and the average captured network change time, and accumulating the network change times.
Thirdly, predicting the next time of network change according to the calculated network average change time: the system considers that the time of detecting the change of the network cannot represent the time of actually changing the network, and the average change time required to be detected predicts the network state. The time at which the network actually changes is herein considered as a random variable evenly distributed over [0, average change time ].
Taking the expectation of this random variable as the time interval value for predicting the next network change:
timing time t=current timeEtch +t 0 。
If the network state has not changed, a fixed timing interval is added.
The timing time interval is calculated through the steps, so that the terminal with frequent network state change is detected, and the terminal can be tested with the target terminal at higher frequency, thereby obtaining the network state change more rapidly; and the terminal with low change frequency can be tested with the target terminal with lower frequency, thereby saving network resources such as bandwidth and the like.
As shown in fig. 3, an overall flow example of the network state detection method in the wireless ad hoc network is as follows:
on node 1, the program starts in command mode, and on nodes 2-8, the program runs in normal mode.
1) Node identification: after the operation is started, 8 nodes respectively send notification messages to the appointed multicast IP addresses, the nodes 1-8 respectively acquire the running states of the other 7 nodes in the ad hoc network, and the running states are recorded in the node information record table.
2) Performing a test: after the identification between the nodes is completed, the follow-up execution flow of the test task is performed. Firstly, the node 1 acquires IP address information from a node record table, and sequentially initiates test tasks with the nodes 2-8. And the 2-8 nodes receive the test tasks, establish connection, complete the test and measure network parameters such as bandwidth, delay, jitter, packet loss rate and the like between the nodes. Thus, the network quality between the 1 node and the 2-8 nodes can be automatically and dynamically detected. Meanwhile, through one node which is started in a command mode, such as the 1 node, a user can command to perform a test task among other nodes by manually inputting a command, so that the network quality between any pair of nodes, namely 2-8 nodes, can be measured. Thus, the detection of the network quality between any nodes is completed.
3) Calculating timing time: after completing a test task, the program calculates the average change time of the test result according to the past test result of the target node, obtains the proper next estimated test time, and records the next estimated test time in the node information record table.
4) And (3) loop execution: when the estimated time arrives, the node 1 automatically initiates a test with the target node again. In a period of time, the node 1 performs multiple tests with other nodes, and evaluates the network quality among the nodes according to multiple test results.
Specific result examples of testing two nodes in a network state detection method in a wireless ad hoc network are as follows:
and under the self-organizing network (shown in the above diagram) of the full-connected topology of the 8 terminal nodes, selecting two terminal nodes for testing, wherein the test results are shown in the following table.
In the test environment of the self-organizing network with the full-connected topology, the test result obtained by the test scheme is compared with the result measured by the current most mainstream test software Ipref, and the obtained test result is found to be similar. The test scheme is proved to have reliability on test results.
Those of ordinary skill in the art will appreciate that: the drawings are schematic representations of one embodiment only and the flow in the drawings is not necessarily required to practice the invention.
Claims (1)
1. A method for detecting network status in a wireless ad hoc network, comprising the steps of:
1) Node identification: selecting a certain node to start in a command mode, and operating other nodes in a common mode, wherein all nodes send an online notification message to the appointed multicast IP address, and receiving and analyzing the multicast online notification, and all nodes acquire the IP addresses and the operation states of other nodes respectively and record the IP addresses and the operation states of the other nodes, so that the nodes in the ad hoc network finish the identification work of the other nodes;
2) Calculating a network test result: by setting the timing time, the two nodes can repeatedly execute tasks for several times in a time period, the test results comprise delay, jitter, bandwidth and packet loss rate, the nodes calculate the average value of the test results obtained by each test in the time period, and further calculate the overall network quality in the time period, so that the randomness of the test results is reduced;
3) Timing time calculation: after the primary test task of the step 2) is completed, comparing and calculating the current test result with the historical test result, recording the time difference between the current fluctuation and the previous fluctuation when the current test result shows obvious fluctuation, calculating the average approximate change time again, obtaining the proper next estimated test time, initiating a test between the nodes to be tested when the estimated time arrives, testing a certain node with other nodes for multiple times in a period of time, and evaluating the network quality between the nodes according to the multiple test results;
the specific steps of calculating each parameter of the test result in the step 2) are as follows:
testing the bandwidth among nodes, namely, when the number of bytes transmitted in unit time is measured by adopting a TCP transmission mode, the sending party circularly sends byte streams to the receiving party, the receiving party counts the number of bytes received in each unit time during circular receiving, and after the byte streams are received, the number of bytes received in each unit time is averaged to obtain an estimated value of the network bandwidth;
when the delay between the nodes is tested, a UDP transmission mode is adopted for testing, packet header information is inserted into a transmitted UDP data packet, and the transmitting time is recorded; after receiving the data packets, the receiving time is recorded, the sending time of the packet header is analyzed, and the transmission delay of each data packet can be obtained according to the receiving time and the sending time, namely, the delay of each data packet = receiving time-sending time;
jitter among test nodes is completed on the basis of test delay, and the jitter refers to the variation degree of transmission delay of each data packet, and the average jitter among the received data packets is obtained by accumulating absolute values of differences among delays of adjacent received data packets, wherein jitter= |the data packet delay-the previous data packet delay|;
when testing and estimating packet loss rate among nodes, adopting a UDP transmission mode to test, inserting sequence numbers into packet heads of UDP data packets by a sender, and calculating real-time packet loss rate by a receiver according to the sequence numbers of the received UDP data packets, wherein the calculation method comprises the following steps:
1) If the number of the arrived data packet=the maximum number+1, namely the data packet arrives in sequence, the maximum number is +1;
2) If the number of the arrived data packet is greater than the maximum number +1, namely, the sequence is out of order, the data packet arrives in advance, and the data packet from the data packet starting from the maximum number +1 to the data packet number-1 arriving at present is judged to be lost; the total number of lost data packets plus the difference between the current data packet number and the historical maximum data packet number; the maximum data number is updated to the number of the currently received data packet;
3) If the number of the arrived data packet is less than the maximum number +1, the data packet is out of sequence, and is sent late, and the total number of the lost data packets is-1;
packet loss rate = total number of lost packets/maximum packet number;
wherein, step 3) specifically includes:
setting an initial state, including:
total number of network quality tests sum_count=0;
time first_test_time=0 for the first test;
the number of changes_count=0 when a network state change is detected;
the last time a network state change was detected is last_change_time=0;
an average time interval of detecting a change in network state, average_change_time=0;
the first step, judging whether the current network state changes according to the comparison of the test result of the current test and the test result of the previous test, wherein the judgment basis is as follows:
(1) If the network bandwidth is tested, the change degree of the network bandwidth, delay and jitter is calculated respectively:
the bandwidth measured in the previous test is last_bandwidth;
the jitter measured in the previous test is last_jitter;
the delay measured by the previous test result is last_delay;
the bandwidth, jitter and delay of the test result are respectively
The degree of change in bandwidth is:when the network state is considered to be changed; otherwise:
only when the delay of the current test and the delay measured by the previous test meet the following conditions:
or when the jitter of the current test and the jitter measured by the previous test meet the following conditions:
when the test result is changed greatly compared with the last test result, judging that the network state is changed, otherwise, considering that the network state is stable; whether the obtained network state is changed or not is judged, the test times and the test results are accumulated, when the test times are 1, the time of the first test is recorded, and the average test result is calculated;
the second step, if the network state is not changed, directly executing the third step; when it is determined that the network state has changed:
(1) This network change is first detected after the system is started, and the following processing is performed on the test record:
change_count=1
last_change_time=current time
average_time = current time-first_test_time
Recording the network change times as 1 time, recording the time interval between the completion time of the test and the first test time as the average change time, and recording the completion time of the test as the last network change time;
(2) This time the network change is detected a plurality of times during the time period, the following is performed:
time interval of two changes: time_update = current time-last_change_time
The average interval time for detecting a change is:
change_count=change_count+1
last_change_time=current time
Recording the time interval between the completion time of the test and the last network change time as one network change time, calculating new average change time together with the captured network change times and the average captured network change time, and accumulating the network change times;
thirdly, predicting the next time of network change according to the calculated network average change time: the time of the network change is detected, the time of the network change cannot be represented, the network state is predicted by the average change time which is needed to be detected, and the time of the network change is regarded as a random variable which is uniformly distributed on the [0, average change time ];
taking the expectation of this random variable as the time interval value for predicting the next network change:
timing time t=current time +t 0
If the network state has not changed, a fixed timing interval is added.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210614590.1A CN115001999B (en) | 2022-05-31 | 2022-05-31 | Network state detection method in wireless ad hoc network |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210614590.1A CN115001999B (en) | 2022-05-31 | 2022-05-31 | Network state detection method in wireless ad hoc network |
Publications (2)
Publication Number | Publication Date |
---|---|
CN115001999A CN115001999A (en) | 2022-09-02 |
CN115001999B true CN115001999B (en) | 2024-04-02 |
Family
ID=83030973
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202210614590.1A Active CN115001999B (en) | 2022-05-31 | 2022-05-31 | Network state detection method in wireless ad hoc network |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN115001999B (en) |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102045222A (en) * | 2011-01-30 | 2011-05-04 | 重庆思建科技有限公司 | Real-time overall test method of network system |
CN102231898A (en) * | 2011-07-05 | 2011-11-02 | 深圳市融创天下科技股份有限公司 | Network bandwidth self-adaptive QOS (quality of service) transmission method and system and terminal device |
CN103716201A (en) * | 2013-12-12 | 2014-04-09 | 中国科学院信息工程研究所 | Open wireless sensing network performance test method and open wireless sensing network performance test system |
CN110855524A (en) * | 2019-11-18 | 2020-02-28 | 南京富尔登科技发展有限公司 | Method for optimizing network state in DTU distribution automation remote terminal |
JP2020136723A (en) * | 2019-02-13 | 2020-08-31 | 日本電気株式会社 | Communication quality deterioration location estimation device, system, method, and program |
KR20210064721A (en) * | 2019-11-26 | 2021-06-03 | 엘아이지넥스원 주식회사 | Wireless network simulation system and wireless network simulation method |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111212330B (en) * | 2018-11-22 | 2022-02-11 | 华为技术有限公司 | Method and device for determining network performance bottleneck value and storage medium |
US11444831B2 (en) * | 2020-01-17 | 2022-09-13 | Keysight Technologies, Inc. | Methods, systems, and computer readable media for measuring schedule update time for a time aware shaper implementation |
-
2022
- 2022-05-31 CN CN202210614590.1A patent/CN115001999B/en active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102045222A (en) * | 2011-01-30 | 2011-05-04 | 重庆思建科技有限公司 | Real-time overall test method of network system |
CN102231898A (en) * | 2011-07-05 | 2011-11-02 | 深圳市融创天下科技股份有限公司 | Network bandwidth self-adaptive QOS (quality of service) transmission method and system and terminal device |
CN103716201A (en) * | 2013-12-12 | 2014-04-09 | 中国科学院信息工程研究所 | Open wireless sensing network performance test method and open wireless sensing network performance test system |
JP2020136723A (en) * | 2019-02-13 | 2020-08-31 | 日本電気株式会社 | Communication quality deterioration location estimation device, system, method, and program |
CN110855524A (en) * | 2019-11-18 | 2020-02-28 | 南京富尔登科技发展有限公司 | Method for optimizing network state in DTU distribution automation remote terminal |
KR20210064721A (en) * | 2019-11-26 | 2021-06-03 | 엘아이지넥스원 주식회사 | Wireless network simulation system and wireless network simulation method |
Non-Patent Citations (2)
Title |
---|
A testbed for the evaluation of link quality estimators in wireless sensor networks;Nouha Baccour 等;ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010;全文 * |
基于UDP的网络质量监测软件的设计与实现;许子敬;;电脑知识与技术(第32期);全文 * |
Also Published As
Publication number | Publication date |
---|---|
CN115001999A (en) | 2022-09-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN106850337B (en) | Network quality detection method and device | |
US8184553B2 (en) | Method and apparatus for measuring packet transmission quality | |
US8605617B2 (en) | Packet capture system, packet capture method, information processing device, and storage medium | |
US8270309B1 (en) | Systems for monitoring delivery performance of a packet flow between reference nodes | |
US7133368B2 (en) | Peer-to-peer method of quality of service (QoS) probing and analysis and infrastructure employing same | |
US8059541B2 (en) | End-host based network management system | |
US20050232227A1 (en) | Method and apparatus for characterizing an end-to-end path of a packet-based network | |
US7525923B2 (en) | Catprobe | |
US20050243729A1 (en) | Method and apparatus for automating and scaling active probing-based IP network performance monitoring and diagnosis | |
KR101627885B1 (en) | Device and method for computation of channel loss rate and collision loss rate of communication link(s) in a random access network | |
EP3295612B1 (en) | Uplink performance management | |
JP2005533449A (en) | How to calculate send window size | |
CN115001999B (en) | Network state detection method in wireless ad hoc network | |
CN110838950B (en) | Method and device for determining network performance jitter value | |
KR20160131532A (en) | Adaptive Bidirectional Forwarding Detection protocol and equipment for maximizing service availability in network system | |
CN111901237B (en) | Source routing method and system, related device and computer readable storage medium | |
CN110290552B (en) | Method and device for measuring cache depth, storage medium and electronic device | |
JP2020167442A (en) | Operation management device, operation management system, and operation management method | |
Mishra et al. | An analytical cross layer model for multipath tcp (mptcp) | |
CN108574615A (en) | A kind of content transmission method, equipment and system based on multipath MPTCP | |
CN112637055A (en) | Multi-link aggregation method, system and storage medium based on VPN tunnel | |
CN106130822B (en) | Uniformly send the method and system of CCM message | |
KR100772535B1 (en) | Method for controlling congestion of node consisting ad-hoc network and apparatus thereof | |
KR102408248B1 (en) | Diagnostic system for performing diagnostics of network through diagnostic packet matching to service type | |
JP2010124127A (en) | Network diagnostic equipment, network diagnostic method, and program |
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 |