Data routing method for mobile opportunistic network based on delivery rate constraint

A mobile opportunistic network and data routing technology, applied in data exchange networks, digital transmission systems, transmission systems, etc., can solve the problem of wireless channel instability without considering node mobility, data routing methods to shorten network lifetime, and data delivery rates. There are no guarantees and other problems to achieve the effect of extending the network lifetime, reducing the number of data broadcasts, and saving energy consumption

Active Publication Date: 2018-05-04
SHAANXI NORMAL UNIV
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Among them, the data routing method based on optimization first evaluates the surrounding neighbor nodes and selects the optimal relay node according to a certain standard and transmits the data to the node. The optimization standard of this method often has certain limitations, and because The mobility of nodes can easily lead to the shortcomings of local optimality and global poorness; the method based on energy balance often only considers the remaining energy of the current node and surrounding neighbor nodes, and generally selects the node with more remaining energy in the neighbor nodes, while Without considering the mobility of nodes and the instability of wireless channels

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
  • Data routing method for mobile opportunistic network based on delivery rate constraint
  • Data routing method for mobile opportunistic network based on delivery rate constraint
  • Data routing method for mobile opportunistic network based on delivery rate constraint

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0077] In the disclosed method, the nodes in the mobile opportunistic network can move at any time, and only when two nodes meet (that is, the distance between the two nodes is within their wireless coverage range) can data transmission be performed; each node can generate data packets , The meta-information of the generated data packet includes the delivery rate requirement, TTL, and destination area of ​​the data packet. Among them, the delivery rate demand value is equal to the delivery rate constraint value when the data packet is generated. Nodes will consume a certain amount of energy when sending and receiving data. Each node can understand its own remaining energy in real time, and will fail as the energy is exhausted and move out of the network; the TTL value of the data packet will automatically decrease over time Small, until it is reduced to 0, the data packet becomes invalid and is moved out of the node cache. Moreover, time is divided into infinitely repeating cy...

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 disclosure relates to a data routing method for a mobile opportunistic network based on delivery rate constraint. The data routing method for the mobile opportunistic network based on the deliveryrate constraint ensures the delivery rate requirements of a data packet through cooperation of a plurality of nodes; data broadcast is carried out only when the surrounding neighbor nodes can complete the certain data delivery rate requirements; otherwise, a better neighbor node met in the future is waited to reduce the times of the data broadcast, thereby prolonging the network lifetime. Throughsetting that only one node has the ability to forward the data again after each time of the data broadcast, the number of packet copies is effectively limited, and the energy consumption is saved; meanwhile, the influence of wireless channel quality on data reception rate is considered after each time of the data broadcast; the next hop forwarding node is selected from the neighbor nodes that successfully receive the packet, therefore, the number of data retransmission times can be effectively reduced; and the advantage of improving the delivery rate brought by all the nodes that receive thepackets is fully used to prolong the lifetime of the network.

Description

technical field [0001] The present disclosure relates to the fields of opportunistic networks and mobile opportunistic networks, in particular, a routing method for transmitting data to a specific geographical area in a mobile-oriented opportunistic network under the condition of satisfying delivery rate constraints. Background technique [0002] At present, there are many challenges to realize the efficient data transmission mechanism of mobile opportunistic networks, mainly including: (for simplicity, users, nodes and mobile smart devices will be used interchangeably in the following) First, the energy of nodes (that is, the battery power of devices) is often limited , and it needs to consume a certain amount of energy when sending and receiving data, which limits its data transmission capability and affects the lifetime of the entire network. Secondly, the way a device node transmits data is wireless broadcasting, which often faces changing wireless channel quality, which...

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/10H04W40/18H04L12/733H04L12/725H04W40/12H04W40/14H04L45/122
CPCH04L45/20H04L45/302H04W40/10H04W40/18H04W40/14H04W40/12Y02D30/70
Inventor 王小明赵若男张立臣郝飞王亮李鹏林亚光
Owner SHAANXI NORMAL 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