RPL (IPv6Routing Protocol for Low-Power and Lossy Networks) routing methods and device based on greedy embedding and network topology

Abstract

The invention discloses RPL (IPv6 Routing Protocol for Low-Power and Lossy Networks) routing methods and device based on greedy embedding and a network topology. The method comprises the following steps of for each node c in the network topology, obtaining a to-be-transmitted data packet, wherein a coordinate Cd of a target node d is stored in an IPv6 extension header of the data packet; analyzingthe extension header, and extracting the coordinate Cd of the target node d; obtaining coordinates Ci of neighbor nodes i in turn from own routing table, wherein for each node, the coordinates of theneighbor nodes are stored in the routing table; obtaining the neighbor node i nearest to the target node d according to the distance d (Cc, Cd) from own coordinate Cc of the node c to the coordinateCd of the target node d, and the distance d (Ci, Cd) from the coordinate Ci of each neighbor node i to the coordinate Cd of the target node d; and transmitting the data packet to the nearest neighbornode i. Through application of the method, the device and the network topology, routing efficiency and extensibility can be improved.

Description

technical field [0001] The invention relates to the field of network technology, in particular to a greedy embedding-based RPL routing method, device and network topology. Background technique [0002] RPL (IPv6Routing Protocol for Low-Power and Lossy Networks) works at the IP layer. It is a standardized routing protocol designed by the ROLL (Routing over Low-power and Lossy Network) working group for the 6LoWPAN (IPv6-based LowPowerWireless PersonalAreaNetworks) protocol. , suitable for network environments with low power consumption, vulnerability to loss, and limited storage and processing capabilities. The 6LoWPAN protocol is located between the link layer protocol IEEE802.15.4 and the network layer IPv6, completes the data conversion between the link layer and the network layer protocol, and realizes the interconnection between the wireless sensor network and the next generation network IPv6. The RPL protocol is a standard solution to the problems of low power consumpt...

AI Technical Summary

Problems solved by technology

Especially in non-storage mode, only the root node saves downlink routing information, and all point-to-point communications need to pass through the root node, further deteriorating routing efficiency

[0017] (2) Insufficient routing scalability

[0019] (3) The improvement method is not perfect

Although P2P-RPL improves routing efficiency and reduces routing storage, the pathfinding process itself is a time-consuming process. At the same time, the construction of temporary DODAG may cause a large number of nodes to participate and generate a large number of communication packets. On the one hand, it consumes node energy and on the other hand. Aspects generate new scalability problems

GeoRank uses GPS coordinates and greedy routing, lacks specific implementation, and the size of the routing table is effectively reduced, but it cannot guarantee a 100% routing success rate, and GPS coordinates are not effective in environments such as buildings and mountains

MPL adds broadcast support to improve routing efficiency, but improper selection of Trickle algorithm parameters will directly affect propagation delay and node energy consumption

[0021] The main reasons for the above shortcomings include two aspects: (1) RPL routing is based on DODAG routing. DODAG is essentially a tree-structured topology during routing. Data packets are only forwarded along the tree-shaped structure. Edges on non-DODAG topologies are routed It is difficult to be used, resulting in low routing efficiency; (2) RPL routing belongs to the distance vector routing protocol, each node in the distance vector routing protocol saves the routing information to other nodes, although the RPL tree topology already contains Routing information, but for downlink routing, the upper node still needs to save the routing information of all lower nodes, resulting in insufficient routing scalability

Images