CN106255170B - A kind of movable random D2D network data query method based on minimal-overhead path - Google Patents
A kind of movable random D2D network data query method based on minimal-overhead path Download PDFInfo
- Publication number
- CN106255170B CN106255170B CN201610643355.1A CN201610643355A CN106255170B CN 106255170 B CN106255170 B CN 106255170B CN 201610643355 A CN201610643355 A CN 201610643355A CN 106255170 B CN106255170 B CN 106255170B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- request
- network
- meets
- 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.)
- Expired - Fee Related
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
- H04W40/18—Communication route or path selection, e.g. power-based or shortest path routing based on predicted events
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/20—Hop count for routing purposes, e.g. TTL
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 kind of movable random D2D network data query method based on minimal-overhead path, this method is routed for request of data newly-generated in D2D network: the carrying node of request of data encounters the node that meets, whether the judgement node that meets is data set provider, if request of data is then sent to the node that meets, routing terminates, and otherwise calculates separately the accessibility professional knowledge of k-hop for carrying node and the node that meets；Then the ability that node finds data offer node with node help request of data of meeting that carries is calculated separately, node is carried according to aforementioned capabilities and request of data is routed to carrying node and the side of ability greatly in the node that meets, as new carrying node；Delay budget according to real-time update request of data repeats the above process if delay budget is not reduced to 0, and otherwise routing terminates.This method can make data success response rate in network maintain a higher level and make network entirety path cost minimum.
Description
Technical field
The invention belongs to technical field of the computer network, and in particular to a kind of movable random based on minimal-overhead path
The data query method of D2D network.
Background technique
The current wireless communication system overwhelming majority operates in the microwave spectrum lower than 3GHz, therefore is undergoing serious
Shortage and have changed into a crowded and limited resource.In order to meet the challenge of 1000 times of mobile bandwidth traffic growths, fortune
The capable grade Microwave bandwidth 20 to 300GHz is considered as the most promising candidate of Next generation cellular system (5G).Though
The use of right grade microwave band solves the urgent need for more wireless frequency spectrums, but it also bring it is a series of new
Unique technological challenge, for example serious line loss and it is not intended to the coverage hole seen.Based on this, mobile subscriber equipment is straight
Passing (Device-to-Device Communication) is considered as the method for improving network efficiency and reliability.
Movable random D2D network will not replace the B2D (Base-Station-to-Device) based on communications facility to communicate,
Because movable random D2D network can not clearly support the Primary communication demand of mobile subscriber, such as real-time voice and data to pass
It is defeated.Moreover, mobile subscriber can obtain benefit from the management body of this centralization, for example the data in movable random pass
It is defeated to be distributed with the delay between learning network interior joint.Although cellular base station, which transmits this information, may need very low frequency spectrum benefit
With rate, but if all nodes transmit big data file using B2D communication, cellular base station may be submerged.Movable random
D2D network, the hybrid network for needing licensing as one and exempting from unlicensed spectrum can be regarded as the benefit of traditional B2D communication
It fills, there is its existent value, such as the transmission of audio file in some applications.Minimize concentrate coordinator data transmission for
Support that movable random D2D application is essential.Similar to other communication scenarios in movable random D2D network, data transmission
Yin Qifei interruption connectivity leads to long delay.However, it is this based on movable random D2D data transmission be urgently needed for, no
For no other reason than that low-cost, also as its validity, because of interaction and its social groups and behavior highlights correlations between mobile node,
Therefore data are transmitted to destination for it and provides very big possibility.
Movable random D2D network data query has following some features:
1, random Link connectivity: the connectivity of movable random D2D network is very low, forms a sparse network, section
Point is only connected with each other once in a while.Due to connectivity lax between node, movable random D2D network data transmission is usually to have to prolong
When, but very fortunately, this delay can be tolerated under this application scenarios of data query, because of data query
It is usually insensitive for delay.
2, calculate and store automatically: in online social networks, central server is used to storage and processing user data.
But this server is unable to get in movable random D2D network, everyone handheld device must carry out distribution
Data storage and calculate.
3, unknown or inaccurate professional knowledge: when a node sends a request of data, it is usually not
Arriving which node consciously has enough professional knowledge to answer request of data back and forth, because establishing the data sum number as P2P network
It is too high according to the retrieval cost of supplier.Worse, in practice, a mobile node is difficult to be accurately known that answer is each
The professional degree of the request of data of a classification.It can initialize the professional knowledge of oneself based on the social role of oneself.
Currently, related based on movable random D2D network data query feature, the lesser data query method of path cost
It requires study.
Summary of the invention
In view of this, the present invention provides a kind of network data query side movable random D2D based on minimal-overhead path
Method is a kind of movable random D2D network data query method how the relationship determination data inquiry using between node forwards,
Data success response rate in network can be made to maintain a higher level and make network entirety path cost minimum.
In order to achieve the above object, the technical solution of the present invention is as follows: a kind of movable random D2D based on minimal-overhead path
Network data query method, this method are routed according to the following steps for request of data newly-generated in D2D network:
Step 1: the carrying node of request of data encounters the node that meets, whether the judgement node that meets provides for data
Otherwise person calculates separately the accessibility professional knowledge of k-hop for carrying node and the node that meets if then routing terminates；K is random
The integer value of setting.
Step 2: based on node is carried and the accessibility professional knowledge of k-hop of node of meeting, calculate separately carry node and
The node that meets helps request of data to find data and provides the ability of node, carries node and routes request of data according to aforementioned capabilities
It helps request of data to find the side of the ability of data offer node greatly in node and the node that meets to carrying, generates new carrying
Node.
Step 3: the delay budget according to real-time update request of data, if delay budget is not reduced to 0, repeatedly step
One and step 2, otherwise routing terminates.
Further, for a node v in D2D networki, the accessibility professional knowledge calculation formula of l jump are as follows:
Wherein pi1~piJTo remove v in D2D networkiNode in addition；For node viWith node vjThe real-time probability to meet；The value range of l is [1, k]；
Then node viIt helps request of data to find data and the capacity calculation formula of node is provided are as follows:
Further, for two nodes in D2D network: node viWith node vj, the real-time probability that the two is met is by saving
Point viIt is obtained in middle safeguarded approach frequency table；
Each node in D2D network constructs a timer, building and safeguards that an approach frequency table, timer are pre-
If a timing cycle Δ, if node does not meet with other nodes in time interval Δ, timer expiry；Approach frequency
The real-time probability to meet between the node two-by-two in D2D network is recorded in table.
Its interior joint viWith node vjThe real-time probability to meet is Initial value isIf node viAt it
Node v is encountered in the timing cycle Δ of timerj, thenWhereinFor the value before update；α
For preset parameter, value is between [0,1]；If node viAny node is encountered in the timing cycle Δ of its timer,
Then after timer expiry
The then maintenance mode of approach frequency table are as follows: in step 1, whenever the node v for carrying request of dataiEncounter node vj
When, first determine whether viWhether encountered v beforej, if the v without ifiUpdate and vjAfter the real-time probability to meet, and and vjCarry out phase
Meet the interaction and update of frequency meter.
The utility model has the advantages that
Movable random D2D network data query method based on minimal-overhead path proposed by the invention, according to network
The historical information that interior joint meets portrays the accessibility professional knowledge of the k-hop between nodes, when two sections in network
Point is routed after meeting by comparing the accessibility professional knowledge of its k-hop, so that the node data in network is requested back
Multiple success rate maintains a higher level and makes network entirety path cost minimum.
Detailed description of the invention
Fig. 1 is the stream of the movable random D2D network data query method (k-hop) of the invention based on minimal-overhead path
Cheng Tu；
Fig. 2 describes the performance evaluation of k-hop routing algorithm Yu other DTN data query algorithms.
Specific embodiment
The present invention will now be described in detail with reference to the accompanying drawings and examples.
Embodiment 1, a kind of movable random D2D network data query method based on minimal-overhead path, this method are directed to
Newly-generated request of data in D2D network, is routed according to the following steps:
Step 1: the carrying node for carrying request of data encounters the node that meets, whether the judgement node that meets is data
Otherwise supplier calculates separately the accessibility professional knowledge of k-hop for carrying node and the node that meets if then routing terminates.Its
In only when the node that meets has the professional knowledge of the affiliated professional domain of the request of data can become data set provider, should
Place judges the professional knowledge for the node that meets.
Step 2: the accessibility professional knowledge of k-hop of the carrying node calculated according to step 1 and the node that meets,
Help request of data of calculating carrying node and the node that meets finds data and provides the ability of node, node v on the basis of thisiFoundation
Aforementioned capabilities carry out routing choice；K is the integer value set at random；
Think there is the accessibility professional knowledge (k-hop of a k-hop in network between every two node in the present embodiment
Reachable Expertise), it usesIndicate node viAnswer the professional knowledge for the request of data that classification is c, each node root
The professional knowledge of oneself is initialized according to the social role of oneself.
What professional knowledge reflected is the ability of a nodes answer request of data, but own is not enough to guide data and asks
The transmitting asked.For example, a node may have sufficiently high professional knowledge, but it can not touch data set provider, therefore
This professional knowledge has no very big help.Therefore the present invention proposes the accessibility professional knowledge of k-hop (k-hop Reachable
Expertise), calculate as follows:
Node viL jump accessibility professional knowledge are as follows:
Wherein pi1~piJTo remove v in D2D networkiNode in addition；For node viWith node vjThe real-time probability to meet；The value range of l is [1, k].
Then node viIt helps request of data to find data and the ability of node is provided are as follows:
Node viWith node vjThe real-time probability to meet is by node viIt is obtained in middle safeguarded approach frequency table；
Each node in D2D network constructs a timer, building and safeguards that an approach frequency table, timer are pre-
If a timing cycle Δ, if node does not meet with other nodes in time interval Δ, timer expiry；Approach frequency
The real-time probability to meet between the node two-by-two in D2D network is recorded in table；
Its interior joint viWith node vjThe real-time probability to meet is Initial value isIf node viAt it
Node v is encountered in the timing cycle Δ of timerj, thenWhereinFor the value before update；α
For preset parameter, value is between [0,1]；If node viAny node is encountered in the timing cycle Δ of its timer,
Then after timer expiry
The then maintenance mode of approach frequency table are as follows: in step 1, whenever the node v for carrying request of dataiEncounter node vj
When, first determine whether viWhether encountered v beforej, if the v without ifiUpdate and vjAfter the real-time probability to meet, and and vjCarry out phase
Meet the interaction and update of frequency meter.
Step 3: being repeated according to the delay budget that real-time time updates request of data if delay budget is not reduced to 0
Step 1 and step 2, otherwise routing terminates.
Embodiment 2, the basic thought of 1 data query method of embodiment are as follows: being believed using the history that nodes meet
Breath assumes node v to calculate the accessibility professional knowledge of k-hop between every two node during routingiThere is a number
According to request Mq, sometime it encounter node vjAnd the node does not carry Mq.Node v firstiWith node vjIt can exchange
Mutual approach frequency table (contact rate table), then respectively calculates the accessibility professional knowledge of k-hop of oneself, and
The help request of data for calculating the two on this basis finds data and provides the ability of node, biggish by comparing the ability of selecting
That node, to determine node viWhether request of data Mq is transmitted to node vj。
Higher number can be reached in order to verify request of data forwarding strategy proposed by the present invention in movable random D2D network
Success rate is replied according to request, next content is by simulated program on the basis of real data set to routing of the invention
Strategy is simulated, and is finally compared with more common method for routing other in time delay tolerant network.
In order to test method proposed by the invention in true movable random D2D network, this experiment is utilized
The tracking data set of the Infocom 2006 published on Crawdad.The data set is from participation 2006 in Spain
Carrying within the participant for the Infocom meeting that Barcelona is held continuous four days during conference has function of Bluetooth communication
Some master datas that iMotes is interacted, including interacting member's number of both sides and the initial time and knot of interaction every time
Beam time etc..The training that interacts information as simulation program of 78 conference members in 93 hours is therefrom chosen in this experiment
With the data set of test.
This simulated experiment using in data set since 93600 seconds to the data between 180000 seconds as historical data, use
The other informations such as the approach frequency in network between every two node are obtained in training.It will be since 180000 seconds to 266400 seconds
End this period as the testing time, each method for routing is simulated.For every kind of method for routing, we have attempted net
All possible routing pair in network, i.e. each node attempt other nodes into network and send a data packet, thus
Obtained 6006 source nodes to destination node node pair to be measured.
This experiment compares k-hop data query method and following several data query methods:
1, Gossip: considering a variety of data categories, this node is that the request of data of each classification dynamically distributes a biography
Pass probability.
2, Willingness: each request of data is transmitted according to willingness, and willingness reflects a node
Participate in the degree of transmitting request of data.
3, Spray and Wait: the duplication quantity for fixing each request of data carries out the transmitting of request of data.
4, the transmitting of request of data Social-based: is carried out using the social property of user.
For all data query methods of this experiment simulation, we are using following performance measure standard come to every kind of data
The performance of querying method is compared:
1) transmit success rate: source node has successfully received the case where data and accounts for the percentage for testing total situation.
2) be delayed: all request of data for having successfully received reply, they generate this request of data to receipts from source node
To the average delay of reply.
3) it replys number: for each request of data, obtaining the quantity averagely replied before satisfied reply.
4) cost: all request of data for having successfully received reply, their average number of copies in a network.
Fig. 2 compares the performance indexes of k-hop data request method and other data request methods.It can be with from Fig. 2
Find out that k-hop data request method has higher than Gossip, Willingness, Spray and in several data request methods
The request of data of Wait, Social-based replys success rate, this also demonstrate it is proposed that based on minimal-overhead path
Movable random D2D network data query method when meeting every time by train before come contact rate depict come
Two currently to meet node between the accessibility professional knowledge of k-hop be more reliable, and the k-hop by calculating
Accessibility professional knowledge come determine relaying strategy can be improved request of data in movable random D2D network reply success
Rate.Fig. 2 embodies k-hop data request method in terms of overhead performance index better than other data request methods simultaneously.
To sum up, the movable random D2D network data query method proposed by the invention based on minimal-overhead path, according to
The historical information that nodes meet portrays the accessibility professional knowledge of the k-hop between nodes, when in network two
A node is routed after meeting by comparing the accessibility professional knowledge of its k-hop, so that the node data packet in network
Transmitting success rate maintains a higher level and makes network entirety path cost minimum.
To sum up, the above is merely preferred embodiments of the present invention, it is not intended to limit the scope of the present invention.It is all
Within the spirit and principles in the present invention, any modification, equivalent replacement, improvement and so on should be included in protection of the invention
Within the scope of.
Claims (2)
1. a kind of movable random D2D network data query method based on minimal-overhead path, which is characterized in that this method is directed to
Newly-generated request of data in D2D network, is routed according to the following steps:
Step 1: the carrying node of the request of data encounters the node that meets, whether the judgement node that meets provides for data
Person, if the request of data is then sent to the node that meets, routing terminates, and otherwise calculates separately and carries node and meet
The accessibility professional knowledge of the k-hop of node；K is the integer value set at random；
Step 2: based on the carrying node and the accessibility professional knowledge of k-hop of node of meeting, calculate separately carry node and
The node that meets helps the request of data to find data and provides the ability of node, carries node foundation aforementioned capabilities for the data
Request is routed to the big side of the ability for carrying and the request of data being helped to find data offer node in node and the node that meets,
Generate new carrying node；
Wherein, node viL jump accessibility professional knowledge calculation formula are as follows:
Wherein pi1~piJTo remove v in D2D networkiNode in addition；For node viWith node vjThe real-time probability to meet；The value range of l is [1, k]；
Then node viIt helps the request of data to find data and the capacity calculation formula of node is provided are as follows:
Step 3: the delay budget according to real-time update request of data, if delay budget is not reduced to 0, repeatedly step 1 and
Step 2, otherwise routing terminates.
2. a kind of movable random D2D network data query method based on minimal-overhead path according to claim 1,
It is characterized in that, for two nodes in D2D network: node viWith node vj, the real-time probability that the two is met is by node viMiddle institute
It is obtained in the approach frequency table of maintenance；
Each node in the D2D network constructs a timer, building and safeguards an approach frequency table, the timing
Device presets a timing cycle Δ, if node does not meet with other nodes in time interval Δ, timer expiry；It is described
The real-time probability to meet between the node two-by-two in D2D network is recorded in approach frequency table；
Its interior joint viWith node vjThe real-time probability to meet is Initial value isIf node viIn its timer
Timing cycle Δ in encounter node vj, thenWhereinFor the value before update；α is default
Parameter, value is between [0,1]；If node viAny node is encountered in the timing cycle Δ of its timer, then timing
After device time-out
The then maintenance mode of the approach frequency table are as follows: in the step 1, whenever the node v for carrying the request of dataiIt encounters
Node vjWhen, first determine whether viWhether encountered v beforej, if the v without ifiUpdate and vjAfter the real-time probability to meet, and and vj
Carry out the interaction and update of approach frequency table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610643355.1A CN106255170B (en) | 2016-08-08 | 2016-08-08 | A kind of movable random D2D network data query method based on minimal-overhead path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610643355.1A CN106255170B (en) | 2016-08-08 | 2016-08-08 | A kind of movable random D2D network data query method based on minimal-overhead path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106255170A CN106255170A (en) | 2016-12-21 |
| CN106255170B true CN106255170B (en) | 2019-03-26 |
Family
ID=58078928
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610643355.1A Expired - Fee Related CN106255170B (en) | 2016-08-08 | 2016-08-08 | A kind of movable random D2D network data query method based on minimal-overhead path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106255170B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102984779A (en) * | 2012-12-13 | 2013-03-20 | 北京理工大学 | Routing method for delay tolerant network forwarded on basis of multiple social attributes |
| CN103297343A (en) * | 2013-05-17 | 2013-09-11 | 华中科技大学 | Routing method based on delay tolerant network |
| CN104410999A (en) * | 2014-11-21 | 2015-03-11 | 中国联合网络通信集团有限公司 | Routing method, equipment and system for delay tolerant network |
| CN105307231A (en) * | 2015-11-12 | 2016-02-03 | 天津大学 | Routing implementation method for delay tolerant network based on encounter probability and social analysis |
| CN105450530A (en) * | 2015-12-03 | 2016-03-30 | 北京理工大学 | Mobile random network multicast routing method based on minimum-overhead path |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8774192B2 (en) * | 2011-09-10 | 2014-07-08 | Arnab Das | Methods systems, and devices for robustness improvement in a mobile ad hoc network using reputation-based routing |
-
2016
- 2016-08-08 CN CN201610643355.1A patent/CN106255170B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102984779A (en) * | 2012-12-13 | 2013-03-20 | 北京理工大学 | Routing method for delay tolerant network forwarded on basis of multiple social attributes |
| CN103297343A (en) * | 2013-05-17 | 2013-09-11 | 华中科技大学 | Routing method based on delay tolerant network |
| CN104410999A (en) * | 2014-11-21 | 2015-03-11 | 中国联合网络通信集团有限公司 | Routing method, equipment and system for delay tolerant network |
| CN105307231A (en) * | 2015-11-12 | 2016-02-03 | 天津大学 | Routing implementation method for delay tolerant network based on encounter probability and social analysis |
| CN105450530A (en) * | 2015-12-03 | 2016-03-30 | 北京理工大学 | Mobile random network multicast routing method based on minimum-overhead path |
Non-Patent Citations (1)
| Title |
|---|
| DTN中考虑连接时间的概率路由算法;王贵竹等;《计算机应用》;20110531;第31卷(第5期);全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106255170A (en) | 2016-12-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ivanov et al. | Experimental validation of the ns-2 wireless model using simulation, emulation, and real network | |
| KR100969158B1 (en) | Method of trust management in wireless sensor networks | |
| Rozy et al. | Performance Comparison Routing Protocol AODV, DSDV, and AOMDV with Video Streaming in Manet | |
| Yan et al. | Trust-oriented partner selection in D2D cooperative communications | |
| Lao et al. | A scalable overlay multicast architecture for large-scale applications | |
| Badihi et al. | On the system-level performance evaluation of Bluetooth 5 in IoT: Open office case study | |
| CN110249634A (en) | Ammeter including power line interface He at least one radio frequency interface | |
| Vallati et al. | Analysis of the interplay between RPL and the congestion control strategies for CoAP | |
| Hernández-Orallo et al. | Optimising data diffusion while reducing local resources consumption in opportunistic mobile crowdsensing | |
| Solis et al. | Robust content dissemination in disrupted environments | |
| Li et al. | Data collection and node counting by opportunistic communication | |
| Hossmann et al. | Social network analysis of human mobility and implications for dtn performance analysis and mobility modeling | |
| Bakalis et al. | Performance evaluation of cbr and tcp traffic models on manet using dsr routing protocol | |
| Dimokas et al. | Detecting energy-efficient central nodes for cooperative caching in wireless sensor networks | |
| Hui | A novel qos routing algorithm in wireless mesh networks | |
| CN106255170B (en) | A kind of movable random D2D network data query method based on minimal-overhead path | |
| Kim et al. | Use of contact duration for message forwarding in intermittently connected mobile networks | |
| Wei et al. | CACC: A context-aware congestion control approach in smartphone networks | |
| Stylianopoulos et al. | Continuous monitoring meets synchronous transmissions and in-network aggregation | |
| Bhargavi et al. | A trust based secure routing scheme for MANETS | |
| Sangeetha et al. | Validation Of Blockchain Transactions In Wireless Sensor Networks Using Dense Neural Networks | |
| Li et al. | Interaction based routing algorithm for opportunistic mobile social networks | |
| Patil et al. | Convergence time evaluation of algorithms in MANETs | |
| Ojog et al. | Multi-criteria optimization of wireless connectivity over sparse networks | |
| Shao | Improved energy-efficient routing architecture for traffic management system using a hybrid meta-heuristic algorithm in Internet of vehicles |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190326 Termination date: 20190808 |