Opportunity network routing method based on social utility degree mechanism

A utility and social technology, applied in the field of opportunistic network routing based on social utility mechanism, can solve problems such as large transmission delay, and achieve the effect of reducing delivery delay, reducing control overhead, and good environmental adaptability

Inactive Publication Date: 2018-09-14
HARBIN ENG UNIV
View PDF4 Cites 15 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The Spray And Wait algorithm selects the next hop of the message everywhere, resulting in a large transmission delay

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
  • Opportunity network routing method based on social utility degree mechanism
  • Opportunity network routing method based on social utility degree mechanism
  • Opportunity network routing method based on social utility degree mechanism

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment approach 1

[0026] An opportunistic network routing method based on social utility mechanism. In the opportunistic network routing protocol based on social utility, two nodes predict the next hop of information transmission according to the utility of the time interval between encounters with the message destination node. As a decision basis, the relay node with a higher social ranking is selected as the next hop, and the number of message copies is dynamically allocated according to the social utility of the node, so as to optimize the routing and forwarding process. Specifically, the message delivery process of the routing algorithm based on social utility mainly includes the following implementation steps.

[0027] Step 1: The source node in the network generates an initial copy of the message, and first determines whether the node encountered by the source node is its destination node. If yes, send the message directly to the destination node, and then delete other copies of the messa...

Embodiment approach 2

[0047] The difference between the second specific implementation method and the first specific implementation method lies in the calculation of social utility in step 2. Nodes move in the network, and the encounter frequency between nodes obeys a power law distribution. That is, the more social nodes encounter the more nodes and the more frequently they meet, it can be considered that the number of node encounters obeys the Poisson process. We calculate the probability of encounters between nodes according to a Poisson process.

[0048] Poisson process probability that nodes i and j meet

[0049] Assuming that the node carrying the message is i, the destination node is d, and the meeting node is j, then the utility degree between node i and node d is defined as:

[0050]

[0051] The difference between this embodiment and the first embodiment lies in the message management method in step 13 and step 14. The form of a message in the network mainly has three states: gene...

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 an opportunity network routing method based on a social utility degree mechanism, relating to the technical field of network routing and proposing an opportunity network routing method based on social utility degree for the social performance of node movement in the network. During the encounter time interval utility copy phase, a source node copies the message to the bestcandidate node according to the utility of its encounter history information with the candidate node. During the time-to-live replication phase, the node copies the message to the candidate node basedon the remaining lifetime of the message. During the social ranking replication phase, nodes are replicated based on utility rankings. The scheme considers the encounter time interval utility betweennodes, and selects nodes with better delivery potential to forward messages, thereby improving the delivery performance of the route. In addition, according to the social ranking utility of the node,the number of copies of the messages is dynamically allocated, so that the node with high utility assumes more forwarding tasks, thereby balancing network overhead.

Description

technical field [0001] The invention relates to the technical field of network routing, in particular to an opportunistic network routing method based on a social utility degree mechanism. Background technique [0002] Opportunistic network / Delay-Tolerant Networking (DTN, Delay-Tolerant Networking) is a recently emerging network system, also known as delayed network, constrained network, fault-tolerant network and opportunistic network. There is no pre-designed path between the source node and the destination node of the opportunistic network. It spreads information through the encounter opportunities brought about by the irregular movement of nodes and the collision between nodes, which is the tolerance of delay and split. Sexual self-organizing network. The delay-tolerant network has its own unique routing mode to achieve communication, using the "store-carry-forward" transmission method. Because the delay-tolerant network can deal with the problems of long-term delay an...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H04W40/02H04W40/04H04W40/22
CPCH04W40/02H04W40/04H04W40/22
Inventor 王桐汤孟博周永哲曹越王希波
Owner HARBIN ENG UNIV
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap