CN110121199B - Opportunistic network data forwarding method based on node role association degree - Google Patents
Opportunistic network data forwarding method based on node role association degree Download PDFInfo
- Publication number
- CN110121199B CN110121199B CN201910337594.8A CN201910337594A CN110121199B CN 110121199 B CN110121199 B CN 110121199B CN 201910337594 A CN201910337594 A CN 201910337594A CN 110121199 B CN110121199 B CN 110121199B
- Authority
- CN
- China
- Prior art keywords
- node
- role
- nodes
- types
- time slot
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an opportunistic network data forwarding method based on node role association degree, which comprises the following steps: s1, distinguishing role types to which nodes belong at different moments, and selecting the most matched role type for the nodes; s2, calculating the association degree between different node role types; and S3, forwarding data according to the correlation calculation result. The invention fully considers the difference of meeting opportunities among nodes with different role types, effectively improves the efficiency of data forwarding and reduces the cost of data forwarding. The calculation scheme of the node role association degree provided by the invention can calculate the association degrees of different role types according to the encounter duration and encounter frequency among nodes of different role types, and determine whether to forward data to corresponding nodes or not according to the association degrees, so that the overall universality of the scheme is strong, and the use and popularization values are high.
Description
Technical Field
The invention relates to a data forwarding method, in particular to an opportunistic network data forwarding method based on node role association degree, and belongs to the technical field of wireless self-organizing networks.
Background
In recent years, with the rapid development of communication network technology and the continuous increase of related hardware level, communication networks have gradually covered the aspects of people's daily life, and data exchange based on the communication networks has become more frequent.
Modern communication networks are essentially links that physically connect isolated devices to exchange information from person to person, person to computer, and computer to computer, and are designed primarily for the purpose of resource sharing and communication.
In the practical application of communication networks, it has been found that data cannot be transmitted over the communication network when the communication infrastructure is damaged or fails. For the problem, a solution which is common in the industry at present is to complete data forwarding by adopting an opportunistic forwarding manner. However, since the communication links are mostly intermittently connected during opportunistic forwarding, the main goal of opportunistic forwarding is to increase the delivery rate of data. However, in the currently existing technology, the disadvantages of low data delivery rate and high transmission delay caused by high data forwarding cost generally exist. And because the encounter opportunities among the nodes are closely related to the role types of the nodes in the network, the data is preferentially forwarded to the neighbor nodes with high role association with the target node, and the data forwarding efficiency can be effectively improved.
In summary, how to provide a novel opportunistic network data forwarding method based on the prior art to overcome many defects in the prior art as much as possible is a common research target of those skilled in the art.
Disclosure of Invention
In view of the above-mentioned drawbacks in the prior art, an object of the present invention is to provide an opportunistic network data forwarding method based on node role association, which includes the following steps:
s1, distinguishing role types of nodes at different moments, and selecting the most matched role type for the nodes;
s2, calculating the association degree between different node role types;
and S3, forwarding data according to the correlation calculation result.
Preferably, S1 specifically comprises the following steps:
s11, equally dividing the time period T into x time slots, wherein the length of each time slot is
Assuming that there are m area types (p) in a network deployment area 1 ,p 2 ,…,p m ) Each region belonging to one of themThe type of the seed region is selected,
let the coordinate of the t-th time slot node i be loc (i) (t) The area type of the area where the node i is currently located is denoted as P (loc (i) (t) ) And has P (loc (i) (t) )∈(p 1 ,p 2 ,…,p m )；
S12, setting y different node role types, wherein the role types of the nodes are respectively expressed as (K) 1 ,K 2 ,…,K y ) Recording the best matching role type of the node i in the t-th time slot as C (i, t), and calculating the node role type with the most attribution times in the previous h time slots, wherein the calculation formula is
Wherein, β (i, τ, K) n ) Indicating whether the node i belongs to the type K at the Tth time slot n The calculation formula is
Preferably, S2 specifically includes the following steps:
s21, setting two types of role types as K 1 、K 2 In the t-th time slot, the character type K 1 Contains w nodes (a) 1 ,a 2 ,…,a w ) Role type K 2 Contains z nodes (b) 1 ,b 2 ,…,b z ) For role type K 1 A certain node a in i In the time slot and (b) 1 ,b 2 ,…,b z ) Expressed as the total length of the theoretical encounter
S22, mixing a i With a certain attribution K 2 Node b of class j The actual encounter duration of this time slot is denoted as T r (a i ,b j T), then a) i And K 2 The sum of the time lengths of the node-like encounters is
S23, calculating K 1 Class node and K 2 Theoretical maximum total encounter duration TT of class node s (K 1 ,K 2 ) The calculation formula is
Then in the t-th time slot, K 1 Class node and K 2 Actual total encounter duration TT of class node r (K 1 ,K 2 T) is represented by
In the t-th time slot, K 1 Class and K 2 The degree of temporal association of a class is expressed as
S24, calculating K 1 Class and K 2 The correlation degree of the encounter frequency between the classes is calculated by the formula
Wherein, M (a) i ,K 2 T) denotes a in the t-th time slot i Encounter attribution as K 2 The number of nodes of a class;
s25, calculating K 1 And K 2 The degree of association of the role types is calculated by the formula
Wherein, alpha and beta represent preset parameters.
Preferably, in S2, each different time slot needs to calculate the association degree between different role types, and the calculation process of each time slot is independent.
Preferably, S3 specifically includes the following steps:
s31, screening and determining nodes with fixed moving routes, and improving the data receiving priority of the nodes;
and S32, forwarding the data.
Preferably, S31 specifically includes the following steps:
if the target node encounters the fixed mobile route node in the previous h time slots, the type of node is determined as the node with the fixed mobile route, the data receiving priority of the type of node is increased to the highest, and the data is preferentially forwarded to the type of node.
Preferably, S32 specifically includes the following steps:
s321, in each time slot, a node carrying data firstly acquires the role types of peripheral neighbor nodes, selects a node with a larger role type association degree with a target node for forwarding, and continuously updates the role type association degree in the node moving process;
s322, when the node carrying the data meets the fixed moving route node, judging whether the fixed moving route node meets the target node in the previous h time slots, if so, preferentially forwarding the data to the node with the fixed moving route;
and S323, repeating the data forwarding process in each time slot until the message is forwarded to the target node.
Preferably, in S32, the message records the carried time during carrying, and when the propagation time length of the message is longer than the preset time length, the message content is automatically deleted.
Compared with the prior art, the invention has the advantages that:
the opportunistic network data forwarding method based on the node role association degree fully considers the difference of meeting opportunities among nodes with different role types, effectively improves the efficiency of data forwarding and reduces the cost of data forwarding. The calculation scheme of the node role association degree provided by the invention can calculate the association degrees of different role types according to the encounter duration and the encounter frequency among nodes of different role types, and determine whether to forward data to corresponding nodes or not according to the association degrees, so that the overall universality of the scheme is strong, and the scheme has high use and popularization values.
Meanwhile, the invention also provides reference for other related problems in the same field, can be expanded and extended on the basis of the reference, is applied to other related technical schemes in the aspect of communication network data transmission, and has very wide application prospect.
The following detailed description of the embodiments of the present invention is provided in connection with the accompanying drawings for illustrating the embodiments of the present invention so that the technical solutions of the present invention can be understood and appreciated more easily.
Drawings
FIG. 1 is a schematic flow diagram of the process of the present invention;
fig. 2 is a diagram of an example of opportunistic network data forwarding based on node role association.
Detailed Description
The invention discloses an opportunistic network data forwarding method based on node role association degree, which is further described below by combining with embodiments of specific schemes, and it should be understood that the embodiments are only used for illustrating the invention and are not used for limiting the scope of the invention.
Specifically, as shown in fig. 1, the opportunistic network data forwarding method based on the node role association degree of the present invention includes the following steps:
s1, distinguishing role types of the nodes at different moments, and selecting the most matched role type for the nodes.
S1 specifically comprises the following steps:
s11, equally dividing the time period T into x time slots, wherein the length of each time slot is
Assuming that there are m area types (p) in a network deployment area 1 ,p 2 ,…,p m ) Each region belonging to one of the region types,
let the coordinate of the t-th time slot node i be loc (i) (t) Then the area in which node i is currently located and the type of the area can be based on loc (i) (t) Obtaining the area type of the area where the node i is currently positioned, and recording the area type as P (loc (i) (t) ) And has P (loc (i) (t) )∈(p 1 ,p 2 ,…,p m )；
S12, setting y different node role types, wherein the role types of the nodes are respectively expressed as (K) 1 ,K 2 ,…,K y ) The role type of the node is determined by the area type of the area where the node is located and the current time slot, the best matching role type of the node i in the t time slot is recorded as C (i, t), the node role type with the most attribution times in the previous h time slots is calculated, and the calculation formula is as follows
Wherein, β (i, τ, K) n ) Indicating whether the node i belongs to the type K at the Tth time slot n The calculation formula is
And S2, calculating the association degree between different node role types.
S2 specifically comprises the following steps:
s21, setting two types of role types as K 1 、K 2 In the t-th time slot, the role type K 1 In which w nodes (a) are included 1 ,a 2 ,…,a w ) Role type K 2 Contains z nodes (b) 1 ,b 2 ,…,b z )，For role type K 1 A certain node a in i In the time slot and (b) 1 ,b 2 ,…,b z ) Expressed as the total length of the theoretical encounter
According to the formula, the theoretical total encounter duration has no relation with the time slot t, but belongs to the K by the current time 2 The number of nodes of a class.
S22, mixing a i With a certain attribution K 2 Node b of class j The actual encounter duration of this time slot is denoted as T r (a i ,b j T), then a) i And K 2 The sum of the time lengths of the class node encounters is
S23, calculating K 1 Class node and K 2 Theoretical maximum total encounter duration TT of class node s (K 1 ,K 2 ) The calculation formula is
Then in the t-th time slot, K 1 Class node and K 2 Actual total encounter duration TT of class node r (K 1 ,K 2 And t) is represented by
In the t-th time slot, K 1 Class and K 2 The time relevance of a class may represent a ratio of an actual duration to a theoretical duration, expressed as
S24, calculating K 1 Class and K 2 The correlation degree of the encounter frequency between the classes is calculated by the formula
Wherein, M (a) i ,K 2 T) denotes a in the t-th time slot i Encounter attribution as K 2 The number of nodes of a class;
s25, calculating K 1 And K 2 The degree of association of the role types is calculated by the formula
Wherein, alpha and beta represent preset parameters. By analogy, the association degree between all different role types can be obtained.
It should be noted that, in S2, each different time slot needs to calculate the association degree between different role types, and the calculation process of each time slot is independent.
And S3, forwarding data according to the correlation calculation result.
S3 specifically comprises the following steps:
s31, screening and determining nodes with fixed moving routes, and improving the data receiving priority of the nodes.
For some special nodes, due to the life habits or occupational laws of the node carriers (usually people or vehicles), the nodes will move according to a certain fixed route in a specific period (for example, buses run according to a fixed route, security guards in a cell have a fixed patrol route, and sanitation guards have a fixed clean route). The invention considers the role of the nodes in data forwarding, if the target node meets the fixed moving route node in the previous h time slots, the nodes are determined as the nodes with the fixed moving route, the data receiving priority of the nodes is improved to the highest level, and the data is preferentially forwarded to the nodes. Therefore, the uncertainty of movement of other nodes after receiving the data can be effectively reduced, and the delivery rate of the data is improved.
And S32, forwarding the data.
S321, in each time slot, a node carrying data firstly acquires the role types of peripheral neighbor nodes, selects a node with a higher role type association degree with a target node for forwarding, and continuously updates the role type association degree in the node moving process;
s322, when the node carrying the data meets the fixed moving route node, judging whether the fixed moving route node meets the target node in the previous h time slots, if so, preferentially forwarding the data to the node with the fixed moving route;
and S323, repeating the data forwarding process in each time slot until the message is forwarded to the target node.
It should be noted that, in S32, the message will record the carried time of the message in the carrying process, and when the propagation time of the message is longer than a preset time (specifically, the propagation time may be determined according to the application requirement and the network storage capacity), the message content is automatically deleted, so as to reduce the storage pressure of the node, and avoid that the outdated data is still propagated in the opportunistic network, which results in unnecessary occupation of network resources.
The following describes a scheme of the present invention with reference to the accompanying drawings, and fig. 2 is an exemplary diagram of opportunistic network data forwarding based on node role association, where the number of copies forwarded once is set to 2, where case 1 indicates that a node with a high degree of association with a target node role type is selected for forwarding when a fixed mobile route node is not encountered, and case 2 indicates that a node recently encountered with the target node, that is, a node with a fixed mobile route exists around the node, preferentially forwards, and then selects a node with a high degree of association with a target node role type for forwarding. It should be noted that, the darker the filling color of the node in the graph indicates the greater the association degree of the role type with the target node.
By combining the above technical description and the accompanying drawings, it can be known that the opportunistic network data forwarding method based on the node role association degree fully considers the difference of meeting opportunities between nodes with different role types, effectively improves the data forwarding efficiency, and reduces the data forwarding cost. The calculation scheme of the node role association degree provided by the invention can calculate the association degrees of different role types according to the encounter duration and the encounter frequency among nodes of different role types, and determine whether to forward data to corresponding nodes or not according to the association degrees, so that the overall universality of the scheme is strong, and the scheme has high use and popularization values.
Meanwhile, the invention also provides reference for other related problems in the same field, can be expanded and extended on the basis of the reference, is applied to other related technical schemes in the aspect of communication network data transmission, and has very wide application prospect.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein, and any reference signs in the claims are not intended to be construed as limiting the claim concerned.
Furthermore, it should be understood that although the present description refers to embodiments, not every embodiment may contain only a single embodiment, and such description is for clarity only, and those skilled in the art should integrate the description, and the embodiments may be combined as appropriate to form other embodiments understood by those skilled in the art.
Claims (5)
1. An opportunistic network data forwarding method based on node role association degree is characterized by comprising the following steps:
s1, distinguishing role types of nodes at different moments, and selecting the most matched role type for the nodes, wherein the method specifically comprises the following steps:
s11, equally dividing the time period T into x time slots, wherein the length of each time slot is
There are m area types (p) in the network deployment area 1 ,p 2 ,…,p m ) Each region belonging to one of the region types,
let the coordinate of the t-th time slot node i be loc (i) (t) The area type of the area where the node i is currently located is denoted as P (loc (i) (t) ) And has P (loc (i) (t) )∈(p 1 ,p 2 ,…,p m )；
S12, setting y different node role types, wherein the role types of the nodes are respectively expressed as (K) 1 ,K 2 ,…,K y ) Recording the best matching role type of the node i in the t-th time slot as C (i, t), and calculating the node role type with the most attribution times in the previous h time slots, wherein the calculation formula is
Wherein, β (i, τ, K) n ) Indicating whether the node i belongs to the type K at the Tth time slot n The calculation formula is
S2, calculating the association degree among different node role types, and specifically comprising the following steps:
s21, setting two types of role types, and respectively recording the two types of role types as K 1 、K 2 In the t-th time slot, the role type K 1 Contains w nodes (a) 1 ,a 2 ,…，a w ) Role type K 2 Contains z nodes (b) 1 ,b 2 ,…,b z ) For role type K 1 A certain node a in (2) i In the time slot and (b) 1 ,b 2 ,…,b z ) Expressed as the total length of the theoretical encounter
S22, mixing a i With a certain attribution K 2 Node b of class j The actual encounter duration of this time slot is denoted as T r (a i ,b j T), then a) i And K 2 The sum of the time lengths of the node-like encounters is
S23, calculating K 1 Class node and K 2 Theoretical maximum total encounter duration TT of class node s (K 1 ,K 2 ) The calculation formula is
Then in the t-th time slot, K 1 Class node and K 2 Actual total encounter duration TT of class nodes r (K 1 ,K 2 T) is represented by
In the t-th time slot, K 1 Class and K 2 The degree of temporal association of a class is expressed as
S24, calculating K 1 Class and K 2 The correlation degree of the encounter frequency between the classes is calculated by the formula
Wherein, M (a) i ,K 2 And t) denotes a in the t-th slot i Encounter attribution as K 2 The number of nodes of a class;
s25, calculating K 1 And K 2 The degree of association of the role types is calculated by the formula
Wherein alpha and beta represent preset parameters;
s3, forwarding data according to the correlation calculation result, and specifically comprising the following steps:
s321, in each time slot, a node carrying data firstly acquires the role types of peripheral neighbor nodes, selects a node with a larger role type association degree with a target node for forwarding, and continuously updates the role type association degree in the node moving process;
s322, when the node carrying the data meets the fixed moving route node, judging whether the fixed moving route node meets the target node in the previous h time slots, if so, preferentially forwarding the data to the node with the fixed moving route;
and S323, repeating the data forwarding process at each time slot until the message is forwarded to the target node.
2. The opportunistic network data forwarding method based on node role association degree according to claim 1, characterized in that: in S2, each different time slot needs to calculate the association between different role types, and the calculation process of each time slot is independent.
3. The opportunistic network data forwarding method based on node role association degree according to claim 1, wherein S3 specifically comprises the following steps:
s31, screening and determining nodes with fixed moving routes, and improving the data receiving priority of the nodes;
and S32, forwarding the data.
4. The opportunistic network data forwarding method based on node role association degree according to claim 3, wherein the step S31 specifically includes the following steps:
if the target node encounters the fixed mobile route node in the previous h time slots, the type of node is determined as the node with the fixed mobile route, the data receiving priority of the type of node is increased to the highest, and the data is preferentially forwarded to the type of node.
5. The opportunistic network data forwarding method based on node role association according to claim 4, wherein in S32, in the process of carrying the message, the carried time of the message is recorded, and when the propagation duration is longer than the preset duration, the message content is automatically deleted.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910337594.8A CN110121199B (en) | 2019-04-25 | 2019-04-25 | Opportunistic network data forwarding method based on node role association degree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910337594.8A CN110121199B (en) | 2019-04-25 | 2019-04-25 | Opportunistic network data forwarding method based on node role association degree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110121199A CN110121199A (en) | 2019-08-13 |
| CN110121199B true CN110121199B (en) | 2023-03-07 |
Family
ID=67521499
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910337594.8A Active CN110121199B (en) | 2019-04-25 | 2019-04-25 | Opportunistic network data forwarding method based on node role association degree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110121199B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112584353B (en) * | 2020-12-09 | 2022-07-15 | 重庆邮电大学 | Vehicle-mounted terminal V2X message filtering and forwarding system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103079259A (en) * | 2012-12-13 | 2013-05-01 | 北京信息科技大学 | Mobile opportunity network gateway selection method based on node social attribute |
| CN108183865A (en) * | 2017-12-31 | 2018-06-19 | 南京邮电大学 | A kind of opportunistic network retransmission method based on node location cosine similarity |
| CN108650698A (en) * | 2018-05-03 | 2018-10-12 | 南京邮电大学 | A kind of opportunistic network data retransmission method |
| CN109151951A (en) * | 2018-08-09 | 2019-01-04 | 中软电科智能技术有限公司 | A kind of data interactive method of multifrequency centralized network networking |
-
2019
- 2019-04-25 CN CN201910337594.8A patent/CN110121199B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103079259A (en) * | 2012-12-13 | 2013-05-01 | 北京信息科技大学 | Mobile opportunity network gateway selection method based on node social attribute |
| CN108183865A (en) * | 2017-12-31 | 2018-06-19 | 南京邮电大学 | A kind of opportunistic network retransmission method based on node location cosine similarity |
| CN108650698A (en) * | 2018-05-03 | 2018-10-12 | 南京邮电大学 | A kind of opportunistic network data retransmission method |
| CN109151951A (en) * | 2018-08-09 | 2019-01-04 | 中软电科智能技术有限公司 | A kind of data interactive method of multifrequency centralized network networking |
Non-Patent Citations (4)
| Title |
|---|
| 一种基于区域朋友关系的机会路由算法;郭东岳等;《计算机科学》;20170315;第105-109页 * |
| 一种基于节点位置余弦相似度的机会网络转发算法;朱坤等;《计算机科学》;20181215;全文 * |
| 机会网络中基于社会关系的数据转发机制研究;孙国霞;《 中国优秀硕士学位论文全文数据库 信息科技辑》;20150515;正文第4章 * |
| 融合社会关系的机会网络有效数据转发策略;严晔晴等;《计算机科学与探索》;20180908;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110121199A (en) | 2019-08-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TWI222296B (en) | Monitoring link quality in a mobile ad hoc network | |
| Jain et al. | Geographical routing using partial information for wireless ad hoc networks | |
| Gao et al. | On exploiting transient social contact patterns for data forwarding in delay-tolerant networks | |
| CN109547351B (en) | Routing method based on Q learning and trust model in Ad Hoc network | |
| CN101356771A (en) | Radio communication device and self-organization routing route information acquiring method | |
| CN101873273A (en) | Routing forwarding method, routing node and wireless communication network | |
| CN109309620B (en) | Lightweight heterogeneous network clustering method facing edge calculation | |
| JP2007325261A (en) | Method of establishing route | |
| CN108900996A (en) | A kind of wireless sensor network data transmission method based on the double-deck fuzzy algorithmic approach | |
| CN112188467B (en) | Terminal discovery method based on user attributes | |
| CN101951658A (en) | Mobile self-networking Internet gateway routing selection method based on path quality perception | |
| CN110121199B (en) | Opportunistic network data forwarding method based on node role association degree | |
| CN107801226A (en) | Based on node society similitude and the central data forwarding method of individual and device | |
| CN108401274B (en) | Data transmission method of opportunity network | |
| JP6190477B2 (en) | Paging method and paging apparatus | |
| CN107040884A (en) | A kind of mobile ad hoc network data transmission method based on neighborhood strong connectedness | |
| Wang et al. | Cluster maintenance in mobile ad-hoc networks | |
| CN109327821A (en) | A kind of message propagating method of combination car networking vehicle sociability | |
| CN106102148B (en) | A kind of base station dormancy method and device | |
| CN110417572B (en) | Method for predicting message transfer node based on target node meeting probability | |
| CN111757443A (en) | Node dormancy method, system, terminal device and computer readable storage medium | |
| Asokan et al. | An approach for reducing the end-to-end delay and increasing network lifetime in mobile adhoc networks | |
| CN111800876B (en) | Frame configuration method based on reinforcement learning and working in eLAA | |
| CN109041163A (en) | A kind of mobile ad hoc network data forwarding method based on social characteristics | |
| KR102134182B1 (en) | Metohd and apparatus for centralized link based scheduling to supporrt directional transmission in wireless mesh network |
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 |