CN110121199A - Opportunistic network data retransmission method based on node role's degree of association - Google Patents
Opportunistic network data retransmission method based on node role's degree of association Download PDFInfo
- Publication number
- CN110121199A CN110121199A CN201910337594.8A CN201910337594A CN110121199A CN 110121199 A CN110121199 A CN 110121199A CN 201910337594 A CN201910337594 A CN 201910337594A CN 110121199 A CN110121199 A CN 110121199A
- Authority
- CN
- China
- Prior art keywords
- node
- degree
- association
- time slot
- character types
- 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.)
- Granted
Links
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
Present invention discloses a kind of opportunistic network data retransmission methods based on node role's degree of association, include the following steps: S1, distinguish the character types that node is belonged in different moments, select most matched character types for node；The degree of association between S2, the different node character types of calculating；S3, data forwarding is carried out according to calculation of relationship degree result.The present invention substantially envisages the difference for chance of meeting between the node of different role type, effectively improves the efficiency of data forwarding, reduces data forwarding cost.The numerical procedure of the node role's degree of association gone out given in the present invention, it can be according to meeting duration and approach frequency and calculate the degree of association of different role type between different role type node, and determine whether to forward the data to respective nodes with this, the universality of scheme entirety is strong, has very high use and promotional value.
Description
Technical field
The present invention relates to a kind of data forwarding methods, and in particular to a kind of opportunistic network number based on node role's degree of association
According to retransmission method, belong to technical field of wireless self-organizing.
Background technique
In recent years, with the continuous improvement of the fast development of communication network technology and related hardware level, communication network is
The every aspect in people's daily life is gradually covered, the data exchange based on communication network also becomes increasingly frequently.
Modern communication networks be substantially it is a kind of each isolated equipment is subjected to physical connection, thus realize person to person,
The link of information exchange between people and computer and computer and computer, original design intention are exactly to reach resource-sharing
With the purpose of communication.
In the actual application of communication network, it has been found that, when the communications infrastructure is damaged or is broken down,
Data will be unable to be transmitted by communication network.For this problem, more universal solution is to take in the industry at present
The mode of chance forwarding completes data forwarding.However, communication linkage is intermittent connection mostly when due to chance forwarding,
The main target of chance forwarding is to improve the delivery ratio of data.But in the technology of present, generally existing data forwarding
Cost height is sent to that rate is lower and the higher disadvantage of propagation delay time so as to cause data.Again due between node meet chance and it
The character types that undertake in a network it is closely related, therefore high priority data is transmitted to high with destination node role association degree
Neighbor node will effectively improve the forward efficiency of data.
In conclusion how to propose a kind of completely new opportunistic network data retransmission method on the basis of existing technology, to the greatest extent
Possibly overcome many defects in the presence of the prior art, also just becomes the common research mesh of those skilled in that art
Mark.
Summary of the invention
In view of the prior art, there are drawbacks described above, and the purpose of the present invention is to propose to a kind of machines based on node role's degree of association
Meeting network data retransmission method, includes the following steps:
S1, the character types that node is belonged in different moments are distinguished, selects most matched character types for node；
The degree of association between S2, the different node character types of calculating；
S3, data forwarding is carried out according to calculation of relationship degree result.
Preferably, S1 specifically comprises the following steps:
S11, period of time T is divided into x time slot, the length of each time slot is
If there are m area type (p for network deployment region1,p2,…,pm), each region affiliation is in one of region
Type,
The coordinate of t-th of time slot node i is denoted as loc (i)(t), the area type in the currently located region of node i is denoted as P
(loc(i)(t)), and have P (loc (i)(t))∈(p1,p2,…,pm)；
S12, it sets there are y different node character types, the character types of these nodes are expressed as (K1,K2,…,
Ky), it will be denoted as C (i, t), calculated in h time slot before at most in the best match character types of t-th of time slot interior nodes i
Belong to the node character types of number, calculation formula is
Wherein, β (i, τ, Kn) indicate whether node i is attributed to type K in the τ time slotn, its calculation formula is
Preferably, S2 specifically comprises the following steps:
S21, two class character types are set, is denoted as K respectively1、K2, in t-th of time slot, character types K1In include w node
(a1,a2,…,aw), character types K2In include z node (b1,b2,…,bz), for character types K1In a certain node ai
In this time slot and (b1,b2,…,bz) theory total duration of meeting be expressed as
S22, by aiBelong to K with some2The node b of classjT is denoted as in the duration of actually meeting of this time slotr(ai,bj, t), then
aiWith K2Class node the sum of duration of meeting is
S23, K is calculated1Class node and K2The theoretical maximum of class node meets total duration TTs(K1,K2), calculation formula is
Then in t-th of time slot, K1Class node and K2The total duration TT that actually meets of class noder(K1,K2, t) and it is expressed as
In t-th of time slot, K1Class and K2The association in time degree of class is expressed as
S24, K is calculated1Class and K2The approach frequency degree of association between class, calculation formula are
Wherein, M (ai,K2, t) and indicate a in t-th of time slotiIt encounters and is attributed to K2The number of nodes of class；
S25, K is calculated1With K2Between the character types degree of association, calculation formula is
Wherein, α, β indicate parameter preset.
Preferably, in S2, each different time-gap require calculate different role type between the degree of association, and it is each when
The calculating process of gap is independent.
Preferably, S3 specifically comprises the following steps:
S31, screening determine the node that there is fixed mobile route, promote the data receiver priority of this kind of node；
S32, data are forwarded.
Preferably, S31 specifically comprises the following steps:
If destination node once met with the fixation mobile route node in h time slot before, this kind of node is determined
To there is the node of fixed mobile route, the data receiver priority of this kind of node being mentioned to highest, high priority data is transmitted to
This kind of node.
Preferably, S32 specifically comprises the following steps:
S321, in each time slot, the node for carrying data obtains the character types of periphery neighbor node first and chooses
It is forwarded with the biggish node of the destination node character types degree of association, while during node motion, constantly updates role
Type association degree；
S322, when carrying back end and encountering fixed mobile route node, then whether judge fixed mobile route node
It once met with destination node in h time slot before, high priority data was transmitted in the presence of fixed mobile route if once meeting
Node；
S323, exist in each time slot repeated data repeating process, until message terminates after being forwarded to destination node.
Preferably, in S32, message will record it in carrying process and carry the time, propagate duration when it and be greater than in advance
If when duration, message content is automatically deleted.
Compared with prior art, advantages of the present invention is mainly reflected in the following aspects:
A kind of opportunistic network data retransmission method based on node role's degree of association proposed by the invention, fully considers
The difference for chance of meeting between the node of different role type, effectively improves the efficiency of data forwarding, reduces data
Forward cost.Given in the present invention go out node role's degree of association numerical procedure, can according to different role type node it
Between meet duration and approach frequency to calculate the degree of association of different role type, and determine whether to forward the data to phase with this
Node is answered, the universality of scheme entirety is strong, has very high use and promotional value.
Meanwhile the present invention also provides reference for other relevant issues in same domain, can be opened up on this basis
Extension is stretched, and applies in other related art schemes of communication network data transmission aspect, has very wide application prospect.
Just attached drawing in conjunction with the embodiments below, the embodiment of the present invention is described in further detail, so that of the invention
Technical solution is more readily understood, grasps.
Detailed description of the invention
Fig. 1 is method flow schematic diagram of the invention；
Fig. 2 is to forward exemplary diagram based on the associated opportunistic network data of node role.
Specific embodiment
Present invention discloses a kind of opportunistic network data retransmission methods based on node role's degree of association, below with reference to specific
The embodiment of scheme, the present invention is further explained, it should be understood that these embodiments are merely to illustrate the present invention rather than limitation originally
The range of invention.
Specifically, as shown in Figure 1, a kind of opportunistic network data forwarding side based on node role's degree of association of the invention
Method includes the following steps:
S1, the character types that node is belonged in different moments are distinguished, selects most matched character types for node.
S1 specifically comprises the following steps:
S11, period of time T is divided into x time slot, the length of each time slot is
If there are m area type (p for network deployment region1,p2,…,pm), each region affiliation is in one of region
Type,
The coordinate of t-th of time slot node i is denoted as loc (i)(t), then the currently located region of node i and the region
Type can be according to loc (i)(t)It obtains, the area type in the currently located region of node i is denoted as P (loc (i)(t)), and have P
(loc(i)(t))∈(p1,p2,…,pm)；
S12, it sets there are y different node character types, the character types of these nodes are expressed as (K1,K2,…,
Ky), the area type and current time slots that the character types of node are currently located region by it are determined, will be in t-th of time slot
The best match character types of node i are denoted as C (i, t), calculate the node role class at most belonging to number in h time slot before
Type, calculation formula are
Wherein, β (i, τ, Kn) indicate whether node i is attributed to type K in the τ time slotn, its calculation formula is
The degree of association between S2, the different node character types of calculating.
S2 specifically comprises the following steps:
S21, two class character types are set, is denoted as K respectively1、K2, in t-th of time slot, character types K1In include w node
(a1,a2,…,aw), character types K2In include z node (b1,b2,…,bz), for character types K1In a certain node ai
In this time slot and (b1,b2,…,bz) theory total duration of meeting be expressed as
As shown from the above formula, theory meet total duration and time slot t it is irrelevant, but by current home K2The number of nodes of class
Amount is determined.
S22, by aiBelong to K with some2The node b of classjT is denoted as in the duration of actually meeting of this time slotr(ai,bj, t), then
aiWith K2Class node the sum of duration of meeting is
S23, K is calculated1Class node and K2The theoretical maximum of class node meets total duration TTs(K1,K2), calculation formula is
Then in t-th of time slot, K1Class node and K2The total duration TT that actually meets of class noder(K1,K2, t) and it is expressed as
In t-th of time slot, K1Class and K2The association in time degree of class can indicate the ratio of a practical duration and theoretical duration, table
It is shown as
S24, K is calculated1Class and K2The approach frequency degree of association between class, calculation formula are
Wherein, M (ai,K2, t) and indicate a in t-th of time slotiIt encounters and is attributed to K2The number of nodes of class；
S25, K is calculated1With K2Between the character types degree of association, calculation formula is
Wherein, α, β indicate parameter preset.And so on, the degree of association between available all different role types.
It should be noted that each different time-gap requires to calculate the degree of association between different role type in S2, and
The calculating process of each time slot is independent.
S3, data forwarding is carried out according to calculation of relationship degree result.
S3 specifically comprises the following steps:
S31, screening determine the node that there is fixed mobile route, promote the data receiver priority of this kind of node.
Life habit or occupation rule for some special nodes, due to node carrier (usually people or vehicle)
Rule, node can carry out movement in specific period according to certain route, and (such as bus is travelled according to fixed route, in cell
Security personnel have fixed patrol route, sanitationman has fixed cleaning route).This kind of node is considered in the present invention in number
According to the effect in forwarding, if destination node once met with the fixation mobile route node in h time slot before, by this kind of section
Point is determined as the node that there is fixed mobile route, the data receiver priority of this kind of node is mentioned to highest, by high priority data
It is transmitted to this kind of node.So, other nodes can be effectively reduced and receive the uncertainty moved after data, improve number
According to delivery ratio.
S32, data are forwarded.
S321, in each time slot, the node for carrying data obtains the character types of periphery neighbor node first and chooses
It is forwarded with the biggish node of the destination node character types degree of association, while during node motion, constantly updates role
Type association degree；
S322, when carrying back end and encountering fixed mobile route node, then whether judge fixed mobile route node
It once met with destination node in h time slot before, high priority data was transmitted in the presence of fixed mobile route if once meeting
Node；
S323, exist in each time slot repeated data repeating process, until message terminates after being forwarded to destination node.
It should be noted that message will record it in carrying process and carry the time in S32, when it propagates duration
When greater than some preset duration (can specifically be determined according to application demand and network storage capacity), message content is automatically deleted,
To reduce the storage pressure of node, outdated data is avoided still to propagate in opportunistic network, leads to the meaningless occupancy of Internet resources.
The solution of the present invention is illustrated below in conjunction with attached drawing, Fig. 2 is based on the associated opportunistic network number of node role
According to forwarding exemplary diagram, single forwarding copy number is set as 2, wherein and the expression of situation 1 ought not encounter fixed mobile route node,
Selection is forwarded with the high node of the destination node character types degree of association, situation 2 then indicate around to exist in the recent period with destination node phase
The node of chance is the node that there is fixed mobile route, then preferential forwarding, and reselection and the destination node character types degree of association are high
Node forwarding.Show and the character types of destination node pass it should be strongly noted that the Fill Color of figure interior joint is more deeply felt
Connection degree is bigger.
Illustrate in conjunction with above scheme and attached drawing is it is known that proposed by the invention a kind of based on node role's degree of association
Opportunistic network data retransmission method substantially envisages the difference for chance of meeting between the node of different role type, effectively
It improves the efficiency of data forwarding, reduce data forwarding cost.The calculating of the node role's degree of association gone out given in the present invention
Scheme, can be according to meeting duration and approach frequency and calculate the association of different role type between different role type node
Degree, and determine whether to forward the data to respective nodes with this, the universality of scheme entirety is strong, uses and promotes with very high
Value.
Meanwhile the present invention also provides reference for other relevant issues in same domain, can be opened up on this basis
Extension is stretched, and applies in other related art schemes of communication network data transmission aspect, has very wide application prospect.
It is obvious to a person skilled in the art that invention is not limited to the details of the above exemplary embodiments, Er Qie
In the case where without departing substantially from spirit and essential characteristics of the invention, the present invention can be realized in other specific forms.Therefore, no matter
From the point of view of which point, the present embodiments are to be considered as illustrative and not restrictive, and the scope of the present invention is by appended power
Benefit requires rather than above description limits, it is intended that all by what is fallen within the meaning and scope of the equivalent elements of the claims
Variation is included within the present invention, and any reference signs in the claims should not be construed as limiting the involved claims.
In addition, it should be understood that although this specification is described in terms of embodiments, but not each embodiment is only wrapped
Containing an independent technical solution, this description of the specification is merely for the sake of clarity, and those skilled in the art should
It considers the specification as a whole, the technical solutions in the various embodiments may also be suitably combined, forms those skilled in the art
The other embodiments being understood that.
Claims (8)
1. a kind of opportunistic network data retransmission method based on node role's degree of association, which comprises the steps of:
S1, the character types that node is belonged in different moments are distinguished, selects most matched character types for node；
The degree of association between S2, the different node character types of calculating；
S3, data forwarding is carried out according to calculation of relationship degree result.
2. the opportunistic network data retransmission method according to claim 1 based on node role's degree of association, which is characterized in that
S1 specifically comprises the following steps:
S11, period of time T is divided into x time slot, the length of each time slot is
If there are m area type (p for network deployment region1, p2..., pm), each region affiliation in one of area type,
The coordinate of t-th of time slot node i is denoted as loc (i)(t), the area type in the currently located region of node i is denoted as P (loc
(i)(t)), and have P (loc (i)(t))∈(p1, p2..., pm)；
S12, it sets there are y different node character types, the character types of these nodes are expressed as (K1, K2..., Ky),
It will be denoted as C (i, t) in the best match character types of t-th of time slot interior nodes i, calculating at most belongs in h time slot before
The node character types of number, calculation formula are
Wherein, β (i, τ, Kn) indicate whether node i is attributed to type K in the τ time slotn, its calculation formula is
3. the opportunistic network data retransmission method according to claim 1 based on node role's degree of association, which is characterized in that
S2 specifically comprises the following steps:
S21, two class character types are set, is denoted as K respectively1、K2, in t-th of time slot, character types K1In include w node (a1,
a2..., aw), character types K2In include z node (b1, b2..., bz), for character types K1In a certain node aiHerein
Time slot and (b1, b2..., bz) theory total duration of meeting be expressed as
S22, by aiBelong to K with some2The node b of classjT is denoted as in the duration of actually meeting of this time slotr(ai, bj, t), then aiWith K2
Class node the sum of duration of meeting is
S23, K is calculated1Class node and K2The theoretical maximum of class node meets total duration TTs(K1, K2), calculation formula is
Then in t-th of time slot, K1Class node and K2The total duration TT that actually meets of class noder(K1, K2, t) and it is expressed as
In t-th of time slot, K1Class and K2The association in time degree of class is expressed as
S24, K is calculated1Class and K2The approach frequency degree of association between class, calculation formula are
Wherein, M (ai, K2, t) and indicate a in t-th of time slotiIt encounters and is attributed to K2The number of nodes of class；
S25, K is calculated1With K2Between the character types degree of association, calculation formula is
Wherein, α, β indicate parameter preset.
4. the opportunistic network data retransmission method according to claim 1 based on node role's degree of association, it is characterised in that:
In S2, each different time-gap requires to calculate the degree of association between different role type, and the calculating process of each time slot is only
It is vertical.
5. the opportunistic network data retransmission method according to claim 1 based on node role's degree of association, which is characterized in that
S3 specifically comprises the following steps:
S31, screening determine the node that there is fixed mobile route, promote the data receiver priority of this kind of node；
S32, data are forwarded.
6. the opportunistic network data retransmission method according to claim 5 based on node role's degree of association, which is characterized in that
S31 specifically comprises the following steps:
If destination node once met with the fixation mobile route node in h time slot before, this kind of node is determined as depositing
In the node of fixed mobile route, the data receiver priority of this kind of node is mentioned to highest, high priority data is transmitted to this kind of
Node.
7. the opportunistic network data retransmission method according to claim 5 based on node role's degree of association, which is characterized in that
S32 specifically comprises the following steps:
S321, in each time slot, carry data node obtain first periphery neighbor node character types and choose and mesh
The mark biggish node of the node character types degree of association is forwarded, while during node motion, constantly updating character types
The degree of association；
S322, when carrying back end and encountering fixed mobile route node, then judge fixed mobile route node whether at it
It once met with destination node in preceding h time slot, high priority data is transmitted to the section in the presence of fixed mobile route if once meeting
Point；
S323, exist in each time slot repeated data repeating process, until message terminates after being forwarded to destination node.
8. the opportunistic network data retransmission method according to claim 5 based on node role's degree of association, which is characterized in that
In S32, message will record it in carrying process and carry the time, when it, which propagates duration, is greater than preset duration, in message
Appearance 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 true CN110121199A (en) | 2019-08-13 |
| CN110121199B 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112584353A (en) * | 2020-12-09 | 2021-03-30 | 重庆邮电大学 | 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 |
|---|
| 严晔晴等: "融合社会关系的机会网络有效数据转发策略", 《计算机科学与探索》 * |
| 孙国霞: "机会网络中基于社会关系的数据转发机制研究", 《 中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 朱坤等: "一种基于节点位置余弦相似度的机会网络转发算法", 《计算机科学》 * |
| 郭东岳等: "一种基于区域朋友关系的机会路由算法", 《计算机科学》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112584353A (en) * | 2020-12-09 | 2021-03-30 | 重庆邮电大学 | Vehicle-mounted terminal V2X message filtering and forwarding system |
| CN112584353B (en) * | 2020-12-09 | 2022-07-15 | 重庆邮电大学 | Vehicle-mounted terminal V2X message filtering and forwarding system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110121199B (en) | 2023-03-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103929823B (en) | Electric power wireless private network channel access control method based on business classification | |
| CN101217497B (en) | A path selecting method of wireless mesh network | |
| CN102340838B (en) | Medium access control method for prolonging network lifetime in wireless body area network | |
| CN101160863A (en) | Method for routing mobile node in wireless mesh network and the communication system thereof | |
| JP4072917B2 (en) | Packet relay method, communication path setting method, and communication path setting system | |
| CN104469890A (en) | Self-networking method and system for power line carrier and wireless hybrid network | |
| CN105813129A (en) | Resource allocation method based on D2D clustering | |
| CN111835633B (en) | Routing and loop-back preventing method and device in easy mesh networking | |
| CN112738880B (en) | LoRaWAN-based Internet of things communication expansion method and LoRaWAN Internet of things | |
| CN101969680A (en) | Method for realizing routing of wireless mesh network and wireless mesh network node | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| CN105873169A (en) | Wireless ad-hoc network communication method | |
| CN105049347A (en) | Routing method of DTN (Delay Tolerant Network) based on social network task distribution model | |
| CN101951658A (en) | Mobile self-networking Internet gateway routing selection method based on path quality perception | |
| WO2012171362A1 (en) | Method and device for establishing coordinated multi-point transmission cell coordination set | |
| CN109845312A (en) | Data transmission method, device, computer equipment and system | |
| CN101431810A (en) | Cross-layer cooperated routing method supporting multi-speed transmission in Ad Hoc network | |
| CN106686680B (en) | A kind of route optimization system and method for car networking | |
| CN101765178A (en) | Communication method of multi-path router for wireless MESH network | |
| CN102546409B (en) | Method and RB (route bridge) for processing message based on TRILL (Transparent Interconnection of Lots of Links) network | |
| CN107995668A (en) | A kind of optimization network-building method of wireless ad hoc network | |
| CN109510769B (en) | Converged routing system suitable for wide-narrow combined network and method thereof | |
| CN110121199A (en) | Opportunistic network data retransmission method based on node role's degree of association | |
| CN107635235A (en) | A kind of multiband matches somebody with somebody the more radio frequencies of electricity consumption mobile Ad hoc network and method for channel allocation | |
| CN103763735A (en) | Hybrid controller, wireless data communications system, wireless station and corresponding method |
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 |