CN110557294A - PSN (packet switched network) time slicing method based on network change degree - Google Patents
PSN (packet switched network) time slicing method based on network change degree Download PDFInfo
- Publication number
- CN110557294A CN110557294A CN201910913330.2A CN201910913330A CN110557294A CN 110557294 A CN110557294 A CN 110557294A CN 201910913330 A CN201910913330 A CN 201910913330A CN 110557294 A CN110557294 A CN 110557294A
- Authority
- CN
- China
- Prior art keywords
- network
- psn
- change degree
- time
- degree
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
the invention discloses a time slicing method of a PSN (packet Switched network) network based on network change degree, which determines the value range of a time interval according to the characteristics of the PSN network, then traverses the time interval in the range according to the sampling precision of a data set, obtains the corresponding network change degree by using a network change degree calculation method, and finally, network snapshot sequences generated by the time intervals under different network change degrees represent different dynamic characteristics of the network. The invention fully considers the relation of PSN network whole network topology changing along with time, and expresses the changing degree by adopting the network changing degree and constructs a network changing degree-time slice size table, thereby effectively expressing the influence of different time slice sizes on the PSN network after slicing, and providing a certain support for relevant researches such as PSN network link prediction and visual analysis.
Description
Technical Field
The invention relates to the technical field of dynamic networks, in particular to a time slicing method of a PSN (packet switched network) based on network change degree.
Background
Psn (packet Switched Network) is a special Delay Tolerant Network (DTN) that has characteristics of DTN Network and also has partial characteristics of social Network, wherein nodes are portable devices (e.g. bluetooth) carried by mobile users, and since these devices are carried by human, the nodes in the Network have social characteristics, such as mobile model. The network initially provides network services to mobile users in order to enable network communications without end-to-end connectivity. Nowadays, with the rapid development of portable devices, PSN networks are widely used, for example: the communication between the rescue team and the survivors is restored by realizing the PSN in the disaster; when the user downloads the application, the downloading speed is increased by nearby mobile user data; and the data can be transmitted to the gateway in a more convenient and faster way, and the coverage range of the network is improved. The collected PSN network data is usually an interactive time sequence, i.e., each piece of data represents a pair of node pairs and a state value, and the whole network is a linked flow arranged in time sequence. Since a group of network snapshot sequences are used in a general dynamic network research analysis, it becomes necessary to convert the data in the form of the link stream into the network snapshot sequence, and it is not easy to find a suitable conversion method. The invention finds a suitable conversion method by studying the relationship between the dynamic network change degree and the time interval size in the network time slice.
Existing time slicing studies include correlations between variable and non-variable, overlapping and non-overlapping, length, etc. of the slice window size and the apparent network characteristics. In the related art, the time division positions at the time of slicing are determined by methods such as event occurrence, but the time intervals obtained by these methods are not equal in length and do not overlap, and therefore, these methods are not suitable for studies of PSN networks such as link prediction.
Disclosure of Invention
The invention aims to provide a time slicing method of a PSN (packet switched network) based on network change degree, so as to more effectively mine the structural characteristics of a dynamic network under the condition of meeting some researches on the PSN such as link prediction and the like.
The original data set of the PSN network is a dynamic network in a link flow form, and the research object in general dynamic network research is a dynamic network of a group of network snapshot sequences, so that it is very important to convert the dynamic network from a link flow form to a group of network snapshots.
The method comprises the steps of firstly, traversing a given time slice size range to slice a PSN network, converting a link flow type network into a network snapshot type, representing the network snapshot in each time slice by using a three-tuple representation method, then defining a key parameter, namely a network change degree, reflecting the network dynamic change degree according to the characteristic that a dynamic network topological structure changes along with time, calculating the network change degree of adjacent network snapshots by using a defined network change degree formula to form a network change degree vector, carrying out averaging processing on the vector to obtain a network change degree value representing the network dynamic change degree, and finally counting the sizes of all time slices and the corresponding network change degree values by using a network change degree-time slice size table. The specific steps of the whole slicing process are as follows:
And S1, determining the value range and the traversal precision of the time interval according to the characteristics of the PSN network data set and the theory related to the personnel movement.
And S2, taking the value of each time interval in the value range, converting the dynamic network in the form of the link flow into a group of network snapshot sequences, and calculating the change degree of the adjacent network to obtain a group of adjacent network change degree sequences.
and S3, analyzing the change trend of each group of adjacent network change degree sequences according to a time sequence analysis method, and selecting the network change degree sequences with similar change trends according to a given filter.
And S4, obtaining the network change degree of the whole network according to the whole network change degree calculation method for the network change degree sequence selected by the filter.
And S5, generating a slice evaluation table according to the calculated time interval and the corresponding network change degree.
The relevant theories of the characteristics of the PSN network data set and the movement of the person in step S1 are specifically as follows:
(1) all nodes in the PSN network form an integral network, and parameters of wireless transmission equipment carried by personnel in each node are the same, and the transmission radius and the discovery capability are the same.
(2) the nodes in the PSN network are wireless nodes carried by people, and therefore include the characteristics of periodicity of people movement, slow movement speed and the like.
The key parameter, which represents the degree of network change in a short time defined in step S2, that is, the degree of network change in the vicinity, specifically is:
The adjacent network change degree reflects the change condition of the whole network topology in a short time, different calculation methods of the adjacent network change degree have certain influence on describing the change degree of the network, and the formula is as follows:
αi＝f(Nj,Nj+1,…,Nj+n) (1)
Where α i represents the ith neighbor net variation value, f represents the calculation function of the neighbor variation, and the received parameter is the topology matrix of n time slices.
The filter for screening the network change degree sequence with the similar change trend defined in step S3 specifically includes:
the filter is to select a variation sequence with variation characteristics of variation of the same kind of adjacent networks, so that the accuracy of evaluation is improved while the finally generated evaluation table entries are reduced, and the specific characteristics include variance, mean value, stability and the like.
In step S4, the network change degree, which is a key parameter for characterizing the network change degree in the entire data set time range, is specifically:
an index value is needed to evaluate the dynamic change degree of the whole network in the data set, the change degrees of the whole network obtained by different calculation methods are also different, and the calculation formula is as follows:
α＝g(α1,α2,…,αm) (2)
Wherein α represents the corresponding network variation degree of the whole network at the time interval, g represents the calculation function of the network variation degree of the whole network, and the received input is the adjacent network variation degree sequence obtained in claim 4.
The slice evaluation table obtained in step S5 specifically includes:
And generating a slice evaluation table according to different time intervals and corresponding network change degrees, wherein each row of the table is the time interval with the same network change degree, the table items have different time interval sizes, and the number of the table item elements in each row is different. The PSN network in each data set may obtain a slicing evaluation table, and use the result of the slicing evaluation table as a support for selecting an appropriate time interval to slice the network.
compared with the prior art, the method provided by the invention can properly convert the PSN network in the form of the link flow into a group of network snapshot sequences, so that other network research methods taking the network snapshot sequences as research objects have a better research basis, the dynamic characterization effect of the network after slicing under different time intervals is evaluated through the network change degree, and a slice evaluation table is constructed, thereby providing support for the subsequent network research and analysis.
the method is suitable for the dynamic network related researches such as PSN network visual modeling and link prediction data processing, most of existing network analysis and processing technologies cannot be applied to the PSN network in a link flow form, the PSN network needs to be converted into a network snapshot sequence, the process is also called slicing the network to obtain a time slice sequence, and aiming at the problem, a method for representing the network change degree by adopting the network change degree is provided by mining the change relation between network topologies in adjacent time slices, and the network can be sliced more effectively.
the method comprises the steps of firstly, traversing a given time slice size range to slice a PSN network, converting a link flow type network into a network snapshot type, representing the network snapshot in each time slice by using a three-tuple representation method, then defining a key parameter, namely a network change degree, reflecting the network dynamic change degree according to the characteristic that a dynamic network topological structure changes along with time, calculating the network change degree of adjacent network snapshots by using a defined network change degree formula to form a network change degree vector, carrying out averaging processing on the vector to obtain a network change degree value representing the network dynamic change degree, and finally counting the sizes of all time slices and the corresponding network change degree values by using a network change degree-time slice size table. The invention fully considers the relation of PSN network whole network topology changing along with time, and expresses the changing degree by adopting the network changing degree and constructs a network changing degree-time slice size table, thereby effectively expressing the influence of different time slice sizes on the PSN network after slicing, and providing a certain support for relevant researches such as PSN network link prediction and visual analysis.
Drawings
the above and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
FIG. 1 is a diagram of dynamic network link changes in the form of a link flow;
Fig. 2 is a schematic representation of slice evaluation.
Detailed Description
The invention provides a method for time slicing of a PSN network based on network change degree. The method is not simple to properly convert the dynamic network from a link flow form into a network snapshot sequence form, and the dynamic change characteristics of the network can be relatively accurately represented by adopting the network change degree to evaluate the conversion result under different slice sizes. The following further description is made with reference to the drawings and the detailed description.
As shown in fig. 1, G ═ N, E, T > is defined as a network in the form of a link flow, where N is a set of nodes, E is a set of edges, T is a start time and an end time of each edge, and a set DG ═ { G 1, G 2, …, G t } is defined as a set of network snapshot sequences.
S1, network slicing processing: the initial parameter setting in the network slicing needs to be set through the characteristics of the PSN network data set and the characteristics of personnel movement, and in practical application, due to the high dynamic property of the PSN network and the periodicity of the personnel movement, the slicing time range can be selected from days, weeks and the like, and the slicing precision can be selected from seconds or minutes.
s2, calculating the change degree of the adjacent network: the calculation of the adjacent network change degree reflects the change condition of the whole network topology in a short time, different calculation methods of the adjacent network change degree have certain influence on describing the change degree of the network, the network is converted into a network snapshot sequence on the basis of the first step, and then the adjacent network change degree sequence is obtained by applying an adjacent network change degree formula, wherein the formula is as follows:
αi＝f(Nj,Nj+1,…,Nj+n) (3)
Where α i represents the ith neighbor net variation value, f represents the calculation function of the neighbor variation, and the received parameter is the topology matrix of n time slices.
S3, selecting the adjacent network variation degree sequence of the same variation characteristics by using a filter: the filter is to select a variation sequence of variation features having the same neighboring network variation, so as to reduce the finally generated evaluation table entries and improve the accuracy of the evaluation, for example: a variance filter which can select a partial sequence with relatively stable adjacent change degree sequence change; the average filter can select the sequence of the network change degree level under different change degrees, and the like.
s4, calculating the network change degree of the whole network: for a given network, a value is used to evaluate its dynamic change degree, and the change degree of the whole network obtained by the same different calculation method is also different, and its calculation formula is as follows:
α＝g(α1,α2,…,αm) (4)
in the formula, alpha represents the corresponding whole network change degree in the time interval, g function represents the calculation function of the whole network change degree, and the received input is the adjacent network change degree sequence.
S5, generating a slice evaluation table: as shown in fig. 2, a slice evaluation table is generated at different time intervals and corresponding network change degrees, each row of the table is a time interval with the same network change degree, the entries are different in time interval size, and the number of entry elements in each row is different. And then, the influence on network evolution analysis under different network change degrees is found out by adopting the conventional link prediction method, and the generated slice evaluation table can be used for further researching the network evolution of the PSN network after a result is obtained.
the method can properly convert the PSN network in the form of the link flow into a group of network snapshot sequences, so that other network research methods taking the network snapshot sequences as research objects have better research foundation, the dynamic characterization effect of the network after slicing under different time intervals is evaluated through the network change degree, and a slice evaluation table is constructed, thereby providing support for the subsequent network research analysis.
The method is suitable for the dynamic network related researches such as PSN network visual modeling and link prediction data processing, most of existing network analysis and processing technologies cannot be applied to the PSN network in a link flow form, the PSN network needs to be converted into a network snapshot sequence, the process is also called slicing the network to obtain a time slice sequence, and aiming at the problem, a method for representing the network change degree by adopting the network change degree is provided by mining the change relation between network topologies in adjacent time slices, and the network can be sliced more effectively.
The method comprises the steps of firstly, traversing a given time slice size range to slice a PSN network, converting a link flow type network into a network snapshot type, representing the network snapshot in each time slice by using a three-tuple representation method, then defining a key parameter, namely a network change degree, reflecting the network dynamic change degree according to the characteristic that a dynamic network topological structure changes along with time, calculating the network change degree of adjacent network snapshots by using a defined network change degree formula to form a network change degree vector, carrying out averaging processing on the vector to obtain a network change degree value representing the network dynamic change degree, and finally counting the sizes of all time slices and the corresponding network change degree values by using a network change degree-time slice size table. The invention fully considers the relation of PSN network whole network topology changing along with time, and expresses the changing degree by adopting the network changing degree and constructs a network changing degree-time slice size table, thereby effectively expressing the influence of different time slice sizes on the PSN network after slicing, and providing a certain support for relevant researches such as PSN network link prediction and visual analysis.
The above-mentioned embodiments only express one or several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
the above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (6)
1. A time slicing method of PSN network based on network change degree is characterized in that a value range of a time interval is determined according to the characteristics of the PSN network, then the time interval in the range is traversed according to the sampling precision of a data set, the corresponding network change degree is obtained by using a network change degree calculation method, finally, network snapshot sequences generated by the time intervals under different network change degrees represent different dynamic characteristics of the network, and the whole slicing process specifically comprises the following steps:
s1, determining the value range and traversal precision of the time interval according to the characteristics of the PSN network data set and the characteristics of personnel movement;
S2, traversing the time interval size in the value range, taking the value of each time interval, converting the dynamic network in the form of the link flow into a group of network snapshot sequences, and calculating the change degree of the adjacent network to obtain a group of adjacent network change degree sequences;
S3, analyzing the change trend of each group of adjacent network change degree sequences according to a time sequence analysis method, and selecting network change degree sequences with similar change trends according to a defined filter;
S4, obtaining the network change degree of the whole network according to the whole network change degree calculation method for the network change degree sequence selected by the filter;
And S5, generating a slice evaluation table according to the calculated time interval and the corresponding network change degree.
2. The method for time slicing of the PSN network based on network variation as claimed in claim 1, wherein in step S1, determining the span and traversal accuracy of the time interval according to the characteristics of the PSN network data set and the characteristics of the human movement specifically comprises:
(1) All nodes in the PSN form an integral network, and parameters of wireless transmission equipment carried by personnel in each node are the same, and the transmission radius and the discovery capability are the same;
(2) Nodes in the PSN network are wireless nodes carried by people and include the characteristics of periodicity of movement and slow movement speed of people.
3. the method for time-slicing the PSN network based on the network variation degree according to claim 1, wherein in step S2, the neighboring network variation degree represents a key parameter of the network variation degree in a short time, specifically:
the change degree of the adjacent network reflects the change condition of the whole network topology in a short time, and the formula is as follows:
αi＝f(Nj,Nj+1,…,Nj+n)
Where α i represents the ith neighbor net variation value, f represents the calculation function of the neighbor variation, and the received parameter is the topology matrix of n time slices.
4. The method for time-slicing PSN network based on network variation as claimed in claim 1, wherein in step S3, a filter for screening network variation sequences with similar variation trends is defined, the filter selects variation sequences with variation characteristics of homogeneous neighboring network variations, and the accuracy of evaluation is improved while reducing the last generated evaluation table entries.
5. the method for time-slicing PSN network based on network variation as claimed in claim 1, wherein in step S4, the network variation characterizes key parameters of the network variation degree in the whole data set time range, specifically:
and evaluating the dynamic change degree of the network in the whole data set by using an index value, wherein the calculation formula is as follows:
α＝g(α1,α2,…,αm)
in the formula, alpha represents the corresponding whole network change degree in the time interval, g function represents the calculation function of the whole network change degree, and the received input is the adjacent network change degree sequence.
6. the method for time-slicing the PSN network based on the network variation degree of claim 1, wherein the step S5 specifically comprises:
generating a slicing evaluation table by using different time intervals and corresponding network change degrees, wherein each line of the table is the time interval with the same network change degree, the table items are different time interval sizes, the number of the table item elements in each line is different, the PSN network in each data set obtains one slicing evaluation table, and the result of the slicing evaluation table is used as a support for selecting a proper time interval to carry out slicing operation on the network.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910913330.2A CN110557294A (en) | 2019-09-25 | 2019-09-25 | PSN (packet switched network) time slicing method based on network change degree |
| CN202010475542.XA CN111464371B (en) | 2019-09-25 | 2020-05-29 | Time slicing method of PSN (packet switched network) based on network change degree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910913330.2A CN110557294A (en) | 2019-09-25 | 2019-09-25 | PSN (packet switched network) time slicing method based on network change degree |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110557294A true CN110557294A (en) | 2019-12-10 |
Family
ID=68741430
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910913330.2A Pending CN110557294A (en) | 2019-09-25 | 2019-09-25 | PSN (packet switched network) time slicing method based on network change degree |
| CN202010475542.XA Active CN111464371B (en) | 2019-09-25 | 2020-05-29 | Time slicing method of PSN (packet switched network) based on network change degree |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010475542.XA Active CN111464371B (en) | 2019-09-25 | 2020-05-29 | Time slicing method of PSN (packet switched network) based on network change degree |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN110557294A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110261692A1 (en) * | 2010-04-21 | 2011-10-27 | Josep Maria Pujol Serra | Method for balancing loads in mobile wireless ad-hoc networks |
| CN105376105A (en) * | 2014-08-27 | 2016-03-02 | 苏州大数聚信息技术有限公司 | Internet traffic modeling method based on time-sliding window |
| CN106202614A (en) * | 2016-06-24 | 2016-12-07 | 四川大学 | The method that anomalous structure evolution in dynamic network finds |
| CN106664608A (en) * | 2014-07-24 | 2017-05-10 | 日本电气株式会社 | Apparatus and method for data delivery in delay-tolerant network (dtn) |
| US20170257291A1 (en) * | 2016-03-07 | 2017-09-07 | Autodesk, Inc. | Node-centric analysis of dynamic networks |
| CN107276807A (en) * | 2017-06-21 | 2017-10-20 | 中南大学 | A kind of hierarchical network community tree pruning method based on the dynamic tight ness rating in community |
| CN107423814A (en) * | 2017-07-31 | 2017-12-01 | 南昌航空大学 | A kind of method that dynamic network model is established using depth convolutional neural networks |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| ES2568065T3 (en) * | 2014-02-24 | 2016-04-27 | Deutsche Telekom Ag | Method and system for link prediction in mobile computing |
| US10361926B2 (en) * | 2017-03-03 | 2019-07-23 | Nec Corporation | Link prediction with spatial and temporal consistency in dynamic networks |
| CN108923983B (en) * | 2018-07-13 | 2021-01-12 | 南昌航空大学 | Method and device for predicting opportunistic network link and readable storage medium |
| CN108965024B (en) * | 2018-08-01 | 2021-08-13 | 重庆邮电大学 | Virtual network function scheduling method based on prediction for 5G network slice |
| CN108601047B (en) * | 2018-08-02 | 2021-07-16 | 南昌航空大学 | Measurement method of opportunistic network key node |
| CN109120462B (en) * | 2018-09-30 | 2021-07-16 | 南昌航空大学 | Method and device for predicting opportunistic network link and readable storage medium |
| CN109347697B (en) * | 2018-10-10 | 2019-12-03 | 南昌航空大学 | Opportunistic network link prediction method, apparatus and readable storage medium storing program for executing |
-
2019
- 2019-09-25 CN CN201910913330.2A patent/CN110557294A/en active Pending
-
2020
- 2020-05-29 CN CN202010475542.XA patent/CN111464371B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110261692A1 (en) * | 2010-04-21 | 2011-10-27 | Josep Maria Pujol Serra | Method for balancing loads in mobile wireless ad-hoc networks |
| CN106664608A (en) * | 2014-07-24 | 2017-05-10 | 日本电气株式会社 | Apparatus and method for data delivery in delay-tolerant network (dtn) |
| CN105376105A (en) * | 2014-08-27 | 2016-03-02 | 苏州大数聚信息技术有限公司 | Internet traffic modeling method based on time-sliding window |
| US20170257291A1 (en) * | 2016-03-07 | 2017-09-07 | Autodesk, Inc. | Node-centric analysis of dynamic networks |
| CN106202614A (en) * | 2016-06-24 | 2016-12-07 | 四川大学 | The method that anomalous structure evolution in dynamic network finds |
| CN107276807A (en) * | 2017-06-21 | 2017-10-20 | 中南大学 | A kind of hierarchical network community tree pruning method based on the dynamic tight ness rating in community |
| CN107423814A (en) * | 2017-07-31 | 2017-12-01 | 南昌航空大学 | A kind of method that dynamic network model is established using depth convolutional neural networks |
Non-Patent Citations (1)
| Title |
|---|
| 张学佩: "基于3D卷积神经网络的多节点间链路预测方法研究", 《南昌航空大学硕士论文》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111464371A (en) | 2020-07-28 |
| CN111464371B (en) | 2022-09-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kim et al. | Temporal node centrality in complex networks | |
| Erlebach et al. | Optimal bandwidth reservation in hose-model VPNs with multi-path routing | |
| Zhang et al. | Node importance for dynamical process on networks: A multiscale characterization | |
| CN105404648A (en) | Density and closeness clustering based user moving behavior determination method | |
| Cancela et al. | Monte Carlo estimation of diameter-constrained network reliability conditioned by pathsets and cutsets | |
| CN102724078A (en) | End-to-end network flow reconstruction method based on compression sensing in dynamic network | |
| Maccari et al. | On the computation of centrality metrics for network security in mesh networks | |
| Wang et al. | Energy-efficient data gathering in wireless sensor networks with asynchronous sampling | |
| Berkman et al. | Designing a system to synchronize the input signal in a telecommunication network under the condition for reducing a transitional component of the phase error | |
| Scellato et al. | On nonstationarity of human contact networks | |
| Dey et al. | Estimating network link characteristics using packet-pair dispersion: A discrete-time queueing theoretic analysis | |
| CN111464371B (en) | Time slicing method of PSN (packet switched network) based on network change degree | |
| JP2019092125A (en) | Radio resource designing device, radio resource designing method, and program | |
| Borzemski | Internet path behavior prediction via data mining: Conceptual framework and case study. | |
| Iutzeler | Distributed estimation and optimization in asynchronous networks | |
| Murdiyat et al. | Predicting the network throughput of wide area WSN in rural areas | |
| Zufiria et al. | Evolution models for dynamic networks | |
| Cheng | Sampling from large graphs with a reservoir | |
| Zheng et al. | Estimating shortest path length distributions via random walk sampling | |
| Bagona et al. | Fault-tolerant placement of additional mesh nodes in rural wireless mesh networks: A minimum steiner tree based centre of mass with bounded edge length | |
| de Carvalho et al. | Prediction metrics for QoE/QoS in wireless video networks for indoor environmental planning: a Bayesian approach | |
| Yu et al. | Compressed sensing and implicit cooperativity based data gathering algorithm in mobile crowdsensing systems | |
| Pambudi et al. | Modeling and estimating the structure of D2D-based mobile social networks | |
| Imon et al. | EFFECT: An energy efficient framework for data compression in tree-based wireless sensor networks | |
| De Jager et al. | Efficient information valuation and costing for distributed wireless sensor networks |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20191210 |