Trust-based on-demand multipath vector routing algorithm of Ad Hoc network

A multi-path and routing technology, applied in the direction of wireless communication, electrical components, etc., can solve the problems of the balance of transmission rate and overhead, scalability problems, and fixed network environment, etc., to achieve the credibility of the monitoring path , The evaluation process is simple and efficient, and the effect of strong scalability

Inactive Publication Date: 2013-05-22
SHANDONG UNIV
View PDF2 Cites 17 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] At present, there are not many schemes for evaluating path credibility in the field of self-organizing networks, and most studies assume that the network environment is fixed or slowly moving, and only focus on the direct credibility of nodes.
In the face of path credibility, most protocols have inherent serious flaws. Some protocols use a global algorithm, and the convergence speed decreases exponentially with the increase in the number of nodes. The scalability problem is serious; some protocols can efficiently deal with black boxes or malicious The node loses packets according to the same packet loss rate for all neighbor nodes, but does not fully c

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
  • Trust-based on-demand multipath vector routing algorithm of Ad Hoc network
  • Trust-based on-demand multipath vector routing algorithm of Ad Hoc network
  • Trust-based on-demand multipath vector routing algorithm of Ad Hoc network

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0072] Example 1 explains the routing maintenance mechanism, such as Figure 7 . Assume that source node 0 has established two link-disjoint paths 01235 and 04265 to destination node D. In the initial state, the latter path is more credible, so it is selected as the forwarding path by the source node. At a certain moment, node 6 defected and randomly discarded the packets transmitted from node 2. After a short period of time, node 2's evaluation of 6 has become lower than the threshold value of 0.26. When the next data packet arrives at node 2, node 2 finds that the next hop is 6 according to the previous hop query path precursor table, and node 6 is a malicious node, thus triggering a path error. Node 2 puts the problem path and other path information whose next hop is node 6 into the path error message, and sends the data packet to the upstream node 4 in unicast. After node 4 receives it, it deletes the relevant problem path, and sends a path error message to the path pre...

example 2

[0073] Example 2 describes another common situation, such as Figure 8. The above example is multiple paths of the same source / destination node pair, while the second example is different paths of different node pairs. Nodes 1 and 2 in the figure are source nodes, and node 6 is a common destination node. The routing table in the normal state is as shown in the figure, and the current nodes 1 and 2 both use the path 3456 to transmit data. And when node 5 defected, after a short period of time, neighbor 4 detected that node 5 defected, and after encountering the data packet sent upstream, node 4 started the path error mechanism to unicast and send it to node 3. Node 3 unicasts to source nodes 1 and 2, but these paths have no predecessors at this time, so they are no longer forwarded. If node 1 wants to send data again, it needs to reroute the request, and node 2 automatically switches to the path passing through node 7.

[0074] Therefore, using the route maintenance mechani...

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 trust-based on-demand multipath vector routing algorithm of an Ad Hoc network The trust-based on-demand multipath vector algorithm of the Ad Hoc network includes that simple and practical credible theories are utilized to improve and expand an AOMDV (Ad Hoc On-demand Multipath Distance Vector) routing protocol, and the packet loss rate is used as a measurement of credibility to establish a credible multipath, so that the data transfer rate is greatly increased. Meanwhile, the path maintenance system is added based on the original route maintenance, and the original route error broadcast is changed to the wrong path unicast, so that the maintenance overhead of trusted paths is reduced. According to the Ad Hoc network trust-based on-demand multipath vector routing algorithm, a balance is found between the transmission rate and the network overhead, and the quality of service is substantially improved due to the fact that the trust-based on-demand multipath vector routing algorithm of the Ad Hoc network is verified by an NS2 simulation testing and a field testing.

Description

technical field [0001] The invention relates to an on-demand multi-path vector routing algorithm, in particular to a trust-based on-demand multi-path vector routing algorithm in an Ad Hoc network. Background technique [0002] Mobile Ad Hoc network is a self-organizing and reconfigurable wireless network with strong environmental adaptability. Each node is equal in status, and the node can act not only as a host, but also as a router, forwarding packets for surrounding neighbor nodes. MANET network has a wide range of applications in distributed collaborative systems such as military, disaster relief, and environmental monitoring. In mobile ad hoc networks, due to the random movement of nodes, limited resources, unreliable links and channels, and imperfect anti-intrusion systems, traditional multi-path routing protocols are difficult to adapt to the needs of modern applications. [0003] In the Ad Hoc network, there are various forms of attacks such as selective delivery 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/04
Inventor 贾智平鞠雷曲传浩颜冲
Owner SHANDONG 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