Minimum-cost-path-based mobile random D2D network data query method

A network data and query method technology, applied in the field of computer networks, can solve the problems of low path overhead, unawareness, high retrieval cost of data and data providers, and achieve the effect of the lowest path overhead and the least path overhead

Inactive Publication Date: 2016-12-21
BEIJING INSTITUTE OF TECHNOLOGYGY
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

But this kind of server is unavailable in the mobile random D2D network, everyone's handheld device must perform distributed data storage and calculation
[0007] 3. Unknown or inaccurate expertise: When a node sends a data request, it usually does not realize which nodes have enough expertise to answer the data request, because building a P2P network like data and data providers Retrieval is too expensive
[0008] At present, data query methods based on the characteristics of mobile random D2D network data query and with low path overhead need to be studied

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Minimum-cost-path-based mobile random D2D network data query method
  • Minimum-cost-path-based mobile random D2D network data query method
  • Minimum-cost-path-based mobile random D2D network data query method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0028] Embodiment 1. A mobile random D2D network data query method based on a minimum overhead path. The method performs routing according to the following steps for a newly generated data request in a D2D network:

[0029] Step 1. The carrier node carrying the data request encounters an encounter node, and judges whether the encounter node is a data provider. If so, the routing ends. Otherwise, calculate the k-hop reachable expertise of the carrier node and the encounter node. Among them, only when the encountering node has the professional knowledge of the professional field to which the data request belongs, can it become a data provider, and the professional knowledge of the meeting node can be judged here.

[0030] Step 2. According to the k-hop reachable professional knowledge of the carrying node and the encountering node calculated in step 1, on this basis, calculate the ability of the carrying node and the encountering node's help data request to find the data providin...

Embodiment 2

[0043] The basic idea of ​​the data query method of Embodiment 2 and Embodiment 1 is as follows: use the historical information of node encounters in the network to calculate the reachable expertise of k hops between every two nodes, and assume node v in the routing process i There is a data request Mq and at some point it encounters node v j And the node does not carry Mq. first node v i and node v j They will exchange each other's contact rate table, and then calculate their own k-hop reachable professional knowledge, and on this basis, calculate the ability of the two to help the data request to find the data provider node, and select the ability after comparison The larger node, thus determining the node v i Whether to forward the data request Mq to node v j .

[0044] In order to verify that the data request forwarding strategy proposed by the present invention can achieve a higher success rate of data request reply in the mobile random D2D network, the following con...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a minimum-cost-path-based mobile random D2D network data query method. For a data request newly generated in a D2D network, routing is carried out. To be specific, a data request carrying node meets a meeting node; whether the meeting node is a data provider is determined; if so, the data request is sent to the meeting node and routing is completed; otherwise, the professional knowledge that k hops of the carrying node and the meeting node can reach is calculated respectively; capabilities, for helping the data request find a data providing node, of the carrying node and the meeting node are calculated respectively and the carrying node routes the data request to one, with the higher capability, of the carrying node and the meeting node based on the capabilities, wherein the one with the higher capability of the carrying node and the meeting node is used as a new carrying node; and according to a delay budget of real-time data request updating, if the delay budget is not reduced to zero, the process is repeated; and otherwise, routing is completed. With the method, a data success recovery rate in the network can be kept to be at a high level; and the overall network path cost is minimized.

Description

technical field [0001] The invention belongs to the technical field of computer networks, and in particular relates to a data query method of a mobile random D2D network based on a minimum overhead path. Background technique [0002] The vast majority of today's wireless communication systems operate in the sub-3 GHz microwave spectrum, which is therefore experiencing severe shortages and has become a crowded and limited resource. To meet the challenge of a 1000-fold increase in mobile bandwidth traffic, millimeter-scale microwave bandwidth operating at 20 to 300 GHz is considered to be the most promising candidate for the next-generation cellular system (5G). While the use of millimeter-scale microstrips addresses the urgent need for more wireless spectrum, it also brings a new set of unique technical challenges, such as severe line loss and unwanted coverage holes. Based on this, mobile user equipment direct transmission (Device-to-Device Communication) is considered as a...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04W40/18H04L12/733H04L12/721H04L45/122
CPCH04L45/14H04L45/20H04W40/18
Inventor 刘杨夏元清李凡王昱邓志红吴宏毅
Owner BEIJING INSTITUTE OF TECHNOLOGYGY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products