CN109617812A - A kind of RPL method for routing, device and network topology based on greed insertion - Google Patents
A kind of RPL method for routing, device and network topology based on greed insertion Download PDFInfo
- Publication number
- CN109617812A CN109617812A CN201910083664.1A CN201910083664A CN109617812A CN 109617812 A CN109617812 A CN 109617812A CN 201910083664 A CN201910083664 A CN 201910083664A CN 109617812 A CN109617812 A CN 109617812A
- Authority
- CN
- China
- Prior art keywords
- node
- coordinate
- routing
- neighbor
- neighbor node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/20—Hop count for routing purposes, e.g. TTL
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of RPL method for routing, device and network topology based on greed insertion, method includes the following steps: for each node c in network topology: obtaining data packet to be transmitted；Wherein, the IPv6 extended head of the data packet preserves the coordinate C of destination node dd；The extended head is parsed, the coordinate C of the destination node d is therefrom extractedd；The coordinate C of neighbor node i is successively obtained from the routing table of itselfi；Wherein, for each node, routing table is stored with the coordinate of its neighbor node；According to the coordinate C of node c itselfcWith the coordinate C of destination node ddDistance d (Cc,Cd) and each neighbor node i coordinate CiTo the coordinate C of destination node ddDistance d (Ci,Cd), get the neighbor node i nearest away from the destination node d；And the data packet is transmitted to the nearest neighbor node i.Implement the present invention, the efficiency and scalability of routing can be improved.
Description
Technical field
The present invention relates to network technique field, more particularly to a kind of RPL method for routing based on greed insertion, device and
Network topology.
Background technique
RPL (IPv6Routing Protocol for Low-Power and Lossy Networks) works at IP layers,
It is ROLL (Routing over Low-power and Lossy Network) working group exclusively for 6LoWPAN (IPv6-
Based LowPowerWireless PersonalAreaNetworks) agreement and design a kind of standardized Routing Protocol, fit
For low-power consumption, easily loss, the storage and processing limited network environment of ability.6LoWPAN agreement is located at link layer protocol
Between IEEE802.15.4 and network layer IPv6, the data conversion between link layer and network layer protocol is completed, wireless biography is realized
Sensor network interconnects with next generation network IPv6's.RPL agreement has been lost for low-power consumption, data in 6LoWPAN
The problem of the standard solution that proposes, though be widely used in wireless personal area network, Internet of Things at present still in the draft stage
The multiple fields such as net.
RPL is a kind of distance vector routing protocol, belongs to reactiver outing.Network topology is divided into multiple RPL examples
It (Instance), may include one or more DODAG (Destination-Oriented in each RPL example
DirectedAcyclic Graph), each RPL example and DODAG have an ID, and the two uniquely indicates a DODAG.
RPL routing is using DODAG as the basic unit of routing.DODAG is a directed acyclic using objective function as measurement building
Figure, root node is usually border routing, referred to as LBR (LLN Border Router).The each non-root node of DODAG is at least
There is the directed edge for being directed toward its father node, there is likely to be a plurality of directed edges for some nodes, are respectively directed on multiple DODAG
Node, but only select one of them as father node when routing.Substantially DODAG can regard a kind of tree as in routing and open up
It flutters.
RPL supports three kinds of modes to communicate:
Multipoint-to-point: the communication of all nodes in LLN network in a device network a to central node；
It is point-to-multipoint: all node communications of the central node to a device network in LLN network；
Point-to-point: the communication of network node to node.
For the communication for realizing three kinds of modes, routed and two kinds of routing modes of downstream routing using uplink.By being based on
Three kinds of control messages (DIS, DIO, DAO) of ICMPv6 realize DODAG construction and Route establishment.
Detailed process is as follows:
Uplink routing is established automatically in DODAG building.Firstly, root node passes through DIO (DODAG Information
Object) message broadcasts the information of DODAG, includes root node Rank in DIO.Secondly, the neighbor node of root node receives DIO
Afterwards, it according to objective function (OF, Objective Function), calculates the Rank of oneself and decides whether that the DODAG is added.Again
Secondary, if neighbor node, which determines, is added the DODAG, there are two kinds of situations:, will be to it if (1) neighbor node is non-leaf nodes
Neighbor node continues to broadcast DIO message；(2) if neighbor node is leaf node, DIO message is not broadcasted.Finally, receiving DIO
The neighbor node of message repeats above step, until all nodes for receiving DIO message are leaf node.By walking above
Suddenly, each node establishes the path for arriving root node naturally, supports the communication of multipoint-to-point.
Downstream routing needs special building.Node, which determines, to be added after DODAG, and sending first to its father node includes its road
By DAO (DODAG Destination Advertisement Object) message of the information such as prefix, prefix validity period.Father's section
After point receives DAO message, according to the difference of storage mode, point three kinds of situation discussion: (1) memory module, father node save the road
By information, and DAO message is continued to issue its father node, until root node, ancestral's node each in this way saves a arrive should
The routing iinformation of node；(2) non-memory mode, father node do not save routing iinformation, are transmitted to root node, root node directly up
After receiving DAO message, it is saved in a paths of the node.(3) memory module is mixed, this mode is the knot of first two mode
It closes, on from the node to root node path, not all node all has storage capacity, and therefore, only selected section node stores
Routing information, segmentation are routed using source.By above step, each node can find one directly or by root node and arrive it
The path of descendant node.According to different situations, downstream routing is realized a little by way of forwarded hop-by-hop, source routing or both mixing
To multi-point.
Uplink routing and downstream routing combine common support point to point link.Under non-memory mode, pass through root section between node
Point establishes connection；Under memory module, connection is established by public ancestral's node between node.
To optimize RPL routing plan, a variety of improved methods are successively proposed.For point to point link, pressure is stored to mitigate
Router efficiency is improved, P2P-RPL proposes Proactive routing scheme, and node does not preselect storage routing iinformation, but on-demand in origin node
Destination node is found by the way of similar DODAG building, destination node returning response data packet simultaneously records the path.
GeoRank proposes a kind of improvement project routed based on GPS coordinate, GPS coordinate is used for greedy routing, to improve road
By efficiency and scalability.To support point-to-multipoint broadcast communication, MPL sends number by water flooding in a multicast domain
Time delay and propagation efficiency are adjusted according to message and control message, and by trickle algorithm (TrickleAlgorithm).
Existing RPL Routing Protocol and its improvement project are primarily present three aspect disadvantages:
(1) router efficiency is low
DODAG is the core of RPL routing, and data packet is forwarded along DODAG.Since DODAG is substantially a kind of tree,
Leading to routed path is the path on setting, and is far longer than the shortest route path of entire topology.Especially under non-memory mode,
Only root node saves downstream routing information, and all point to point links are required through root node, and router efficiency is further disliked
Change.
(2) routing scalability is insufficient
RPL scalability is mainly reflected in routing table scale.Although compared to its average road of traditional distance vector routing protocol
It is substantially reduced by table scale, but part of nodes still needs to save a large amount of routing iinformations.For non-memory mode, root node need to be saved in
The source-routed information of all nodes, i.e., whole routing information；For memory module, the institute of subtree where upper layer node need to save it
There is the routing iinformation of node；For mixed mode, all nodes of subtree where upper layer node saves it in the form that source routes
Routing iinformation.
(3) improved method is not perfect
RPL improved method multi-pass crosses the promotion for sacrificing performance on the one hand to exchange on the other hand performance for.Although P2P-RPL
It improves router efficiency, reduces routing storage, but pathfinding process is itself is a time-consuming process, while interim DODAG
Building may cause great deal of nodes participation, generates mass communication data packet, on the one hand consumes node energy, on the other hand produce
New expansible problem.GeoRank lacks specific implementation using GPS coordinate and greed routing, and routing table scale is effectively dropped
It is low, but not can guarantee 100% routing success rate, GPS coordinate lacks useful effect under the environment such as building, mountainous region.MPL is increased
Broadcast is supported, improves router efficiency, but the selection of Trickle algorithm parameter improper will directly affect propagation delay and node energy
Consumption.
The main reason for leading to disadvantages mentioned above includes two aspects: (1) RPL routing is routed based on DODAG, and DODAG is being routed
Shi Benzhi is a kind of tree topology, and data packet is only forwarded along tree, and the side in non-DODAG topology is difficult in routing
It is used, causes router efficiency low；(2) RPL, which is routed, belongs to distance vector routing protocol, each in distance vector routing protocol
Node is all saved in the routing iinformation of other nodes, although RPL tree topology has contained the routing iinformation of uplink routing,
For downstream routing, upper layer node still needs to save the routing iinformation of all lower level nodes, causes to route scalability deficiency.
Summary of the invention
In view of this, it is an object of the invention to a kind of RPL method for routing, device and nets based on greed insertion of proposition
Network topology, can improve the efficiency and scalability of routing.
The embodiment of the invention provides a kind of RPL method for routing based on greed insertion, include the following steps:
For each node c in network topology:
Obtain data packet to be transmitted；Wherein, the IPv6 extended head of the data packet preserves the coordinate of destination node d
Cd；
The extended head is parsed, the coordinate C of the destination node d is therefrom extractedd；
The coordinate C of neighbor node i is successively obtained from the routing table of itselfi；Wherein, for each node, routing table
It is stored with the coordinate of its neighbor node；
According to the distance d (C of node c to destination node dc,Cd) and each neighbor node i to destination node d distance d
(Ci,Cd), get the nearest neighbor node i of the destination node d；And
The data packet is transmitted to the nearest neighbor node i.
Preferably, further includes:
Network topology is embedded into metric space by greed insertion, to distribute measurement for each node in network topology
Coordinate in space；Wherein, after topological greed is embedded into metric space, the routing table of each node only saves its neighbor node
Coordinate.
It is that each node distributes a Bit String, section by prefix trees preferably for each node in network topology
The coordinate of point is the level ratio that the Bit String of all nodes is constructed according to hierarchical relationship on from root node to the node path
Spy's string.
Preferably, the routing table of each node obtains in the following way:
Repeat the steps of each node until in traverses network topology:
Present node is after the coordinate for getting itself, the message packet for being DIO to its neighbor node transmission types；Its
In, the initial coordinate of root node is by root node itself original allocation；The message packet includes Flags field；Wherein, Lin Jujie
After point receives the message packet of the present node, judge whether to select present node for father node；If neighbor node does not select
Selecting the present node is father node, then is proceeded as follows according to the Flags field of the message packet: if Flags field
It is 0, illustrates that the coordinate of the present node does not change, then with no treatment, and directly returns to the DIO- of first state
ACK message informs that the present node has been received by message packet；If Flags field is 1, illustrate the present node coordinate hair
Variation has been given birth to, then has returned to the DIO-ACK message of the second state, has requested the present node to send updated coordinate, and save
To the routing table of itself；If neighbor node selects the present node for father node, the DIO-ACK for responding the third state disappears
Breath；
If the present node receives the DIO-ACK message of the first state of neighbor node transmission, with no treatment；
If receiving the DIO-ACK message of the second state of neighbor node transmission, the coordinate of itself is encapsulated into DEM, and Flag is set
After being set to 0, DEM is returned into neighbor node；If receiving the DIO-ACK message of the third state of neighbor node transmission, root
It is embedded in scheme according to prefix, generates a Bit String for neighbor node, and the coordinate of node itself is encapsulated into DEM together with Bit String
Message, Flag is set as 1, and DEM message is returned to the neighbor node；Wherein, the neighbor node receives DEM message,
Check the Flag field of DEM message；Wherein, if Flag is 0, directly node coordinate is saved or is updated in routing table；If
Flag is 1, then the coordinate of neighbor node oneself is obtained according to node coordinate, Bit String.
Preferably, the distance d (C according to node c to destination node dc,Cd) and each neighbor node i to target section
Distance d (the C of point di,Cd), it gets the nearest neighbor node i of the destination node d and specifically includes:
Calculate separately the coordinate C of present node ccTo the coordinate C of destination node ddDistance d (Cc,Cd) and neighbours' section
The coordinate C of point iiTo the coordinate C of destination node ddDistance d (Ci,Cd), and calculate the difference D of the twoi=d (Cc,Cd)-d(Ci,
Cd)；
All neighbor node i of the present node c are traversed, difference corresponding with each neighbor node i is obtained；
Using the corresponding neighbor node i of maximum difference as the next-hop node of present node c.
Preferably, the structure of the extended head includes following field: next header fields, extended head length, source
Node coordinate, source coordinate mask, destination node coordinate, coordinates of targets mask；
The extended head then is being parsed, destination node C is extracted described indCoordinate before, further includes:
Whether the type for checking next header fields of extended head is predefined type.
Preferably, the first state is expressed as 0x00, and second state is expressed as 0x01, and the third state indicates
For 0x02.
Preferably, the neighbor node judges whether to select the present node for father node according to preassigned；It is described
Preassigned is determined by objective function, DAG attribute and local customized strategy.
The embodiment of the invention also provides a kind of RPL route devices based on greed insertion, comprising:
Data packet acquiring unit, for obtaining data packet to be transmitted；Wherein, the IPv6 extended head of the data packet is protected
There is the coordinate C of destination node dd；
Resolution unit therefrom extracts the coordinate C of the destination node d for parsing the extended headd；
Neighbor node acquiring unit, for successively obtaining the coordinate C of neighbor node i from the routing table of itselfi；Wherein,
For each node, routing table is stored with the coordinate of its neighbor node；
Nearest-neighbors node acquiring unit, for the distance d (C according to node c to destination node dc,Cd) and each neighbour
Occupy node i to destination node d distance d (Ci,Cd), get the nearest neighbor node i of the destination node d；And
Data packet transmission unit, for the data packet to be transmitted to the nearest neighbor node i.
The embodiment of the invention also provides a kind of network topologies, including multiple nodes, wherein each node includes memory
And processor, computer program and routing table are stored in the memory, and the computer program can be by the place
It manages device to execute, to realize such as the above-mentioned RPL method for routing based on greed insertion.
The present invention is based on greed insertions and greed routing to optimize RPL routing, and greedy telescopiny and RPL are routed
DODAG construction process natural fusion, fusion cost are low；Meanwhile it based on IPv6 Protocol Design and realizing RPL greed and is routed through
Journey, the routing table of each node need to only save neighbor node coordinate, can make full use of non-tree side in greedy routing procedure, ensure that
Routing scalability and efficiency are effectively promoted.
Detailed description of the invention
In order to illustrate more clearly of technical solution of the present invention, attached drawing needed in embodiment will be made below
Simply introduce, it should be apparent that, the accompanying drawings in the following description is only some embodiments of the present invention, general for this field
For logical technical staff, without creative efforts, it is also possible to obtain other drawings based on these drawings.
Fig. 1 is a kind of flow diagram for the RPL method for routing based on greed insertion that first embodiment of the invention provides.
Fig. 2 is another process signal for the RPL method for routing based on greed insertion that first embodiment of the invention provides
Figure.
Fig. 3 is the data structure diagram that DEM controls message.
Fig. 4 is the flow diagram of DODAG building and greed insertion.
Fig. 5 is the flow diagram for the RPL route device based on greed insertion that second embodiment of the invention provides.
Fig. 6 is the network topology schematic diagram that second embodiment of the invention provides.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
Fig. 1 and Fig. 2 is please referred to, first embodiment of the invention provides a kind of RPL method for routing based on greed insertion, packet
Include following steps:
For each node c in network topology:
S101 obtains data packet to be transmitted；Wherein, the IPv6 extended head of the data packet preserves destination node d
Coordinate Cd。
Specifically, in the present embodiment, if the present node c is source node, the data packet can be uploaded by user
It generates and is generated by source node by certain operation.If the present node c is not source node, in general, the data packet is
By upper hop node-node transmission.
In the present embodiment, according to the message format of IPv6 agreement it is found that next head (Next can be passed through
Header) field increases the extended head information of IPv6.Therefore, the present embodiment increases next head of a scheduled type
Field (such as 0x8f) saves source node and destination node coordinate by IPv6 extended head.The field packet that extension header structure includes
It includes: next header fields (8bits), extended head length (8bits), source node coordinate (32bits can also be changed to elongated),
Source coordinate mask (32bits), destination node coordinate (32bits), coordinates of targets mask (32bits).
It should be noted that in above-described embodiment, the digit of each field can be arranged and without being limited thereto according to actual needs.
In the present embodiment, the node c first checks next header fields type after receiving the data packet,
If type is predefined type (such as 0x8f), S102 is entered step, otherwise, is handled according to other Routing Protocols.
S102, parses the extended head, therefrom extracts the coordinate C of the destination node dd。
S103 successively obtains the coordinate C of neighbor node i from the routing table of itselfi；Wherein, for each node, road
The coordinate of its neighbor node is stored with by table.
In the present embodiment, the coordinate for first generating each node is needed first.The present embodiment is opened up network by greed insertion
It flutters and is embedded into metric space, to distribute a coordinate in metric space for each node in network topology.Topological greed is embedding
Enter to after metric space, each node only needs the coordinate for saving neighbor node as route table items.When routing, present node according to
Coordinate distance avidly selects the next-hop node nearest away from destination node, this process of repetition can find the node that achieves the goal
Greedy path.Greed insertion property can guarantee when data packet reaches any non-destination node, can find the next of greed
Hop node.Therefore, the routing plan based on greed insertion can guarantee 100% routing success rate, be effectively reduced routing table scale,
Greedy path also ensures high usage route simultaneously.
Specifically, the process of greed insertion can be divided into two steps: (1) proposing spanning tree from topology；(2) spanning tree is coveted
The heart is embedded into metric space.Wherein, (1) step is similar with RPL routing construction DODAG process, therefore, can construct with DODAG
Journey blends.(2) step this programme is using prefix trees as metric space, using prefix insertion as specific greedy insertion side
The coordinate frame of method, prefix insertion is clear, and length is expansible, and having document proves that in the case where power law is 2~3 topologys, coordinate is long
Degree is O (log2(n)) bit, and experiment effect is much better than theoretical value.
Wherein, when carrying out prefix insertion, a Bit String is distributed for each node, the coordinate of node is from root node
The level Bit String that the Bit String of all nodes is constructed according to hierarchical relationship on to the node path.Such as from root node to a certain
The Bit String of node is respectively 0,01,110, then the node coordinate is/0/01/110.If while there are weight, before Bit String
In addition side right value, such as/(2) 0/ (1) 01/ (3) 110.The prefix insertion of spanning tree is considered as based on before spanning tree building
Sew the process of tree, only needs primary top-down tree traversal can be completed, therefore, the process of greed insertion can also be dissolved into naturally
In DODAG building.
It should be noted that the configuration mode of Bit String can configure according to actual needs, the present invention is not specifically limited.
In the present embodiment, DODAG building and greed insertion control message by RPL and realize.It is one that RPL, which controls message,
The infomational message for the ICMPv6 that kind Type value is 155 distinguishes different types of control message, specific control message by Code field
It is stored in Base field.Since spanning tree extraction of the invention and telescopiny are blended with DODAG building process, because
This, the present invention deletes unnecessary DAO and DAO-ACK message, improves DIO message, and propose two kinds of new message types
DIO-ACK,DEM(DODAG EMbedding),DCD(DODAG CoorDinate).Wherein, DIO message has used reserved field
Flags indicates situation of change when node coordinate and preceding primary transmission DIO.0 indicates that the node coordinate does not change, and 1 indicates node
Coordinate changes.When each node sends first DIO message to another node, initial Flags is set as 1.
DIO-ACK message is the response message of DIO message, continues to use DAO-ACK message format.DIO-ACK type of message
Type continues to use the original value 155 of RPL, and message code Code is set as 0x04.DIO-ACK with DAO-ACK message Base field
Structure is similar, but the DIO-ACK message is without including NODE PREFIX information.Meanwhile the meaning of the two Status field is different,
The Status field of DIO-ACK includes three types:
0x00 expression has received DIO message, but with no treatment；
0x01 expression has received DIO message, waits DEM message to be received, information needed for generating node coordinate with acquisition；
0x02 expression has received DIO message, DEM message to be received is waited, to obtain neighbor coordinate.
DEM returns to the message of different content according to the type of message of DIO-ACK.The Code field of DEM message is arranged to
0x05.The specific structure is shown in FIG. 3 for the Base field of DEM.Wherein, RPLInstanceID, VersionNumber, DODAGID
It is identical as existing RPL control message effect.Flag length is 2 bits, can be discussed in two kinds of situation: when DIO-ACK message status
When for 0x02, DEM message Flag is that 00, Bitstring field is meaningless, that is, is returned only to coordinate；When DIO-ACK message status is
When 0x01, DEM message Flag is that 01, Bitstring field is significant, and Coordinate is node coordinate of giving out a contract for a project, and Mask is to sit
Mask is marked, for dividing the hierarchical structure of coordinate.
As shown in figure 4, Fig. 4 shows the process of DODAG building and greed insertion.Wherein,
1, for each present node c, in the coordinate C for obtaining itselfcIt afterwards, is DIO's to neighbor node i transmission types
DIO message.For root node, the coordinate of itself need to be initialized.
After 2. neighbor node i receives the DIO message of present node c, judged whether to replace father node according to certain standard,
Specific standards can be determined by objective function, DAG attribute and local customized some strategies；
If 3-1. neighbor node i selection is changed without father node, according to the Flags field of DIO message, there are two types of selections:
If a. Flags field is 0, illustrates that the coordinate of present node c does not change, then with no treatment, directly return
The state of returning is the DIO-ACK message of 0x00, informs that present node c has been received by DIO message；
If b. Flags field is 1, illustrate that the coordinate of present node c has sent variation, then returns to the DIO- that state is 0x01
ACK message, request other side sends updated coordinate, and saves the coordinate C of neighbor node iiAs route table items.
If 3-2. neighbor node i selects replacement, present node c is father node, responds the DIO-ACK that state is 0x02 and disappears
Breath；
If 4-1.a. present node c receives the DIO-ACK message of the 0x00 state of neighbor node i transmission, any place is not made
Reason；
If b. root node receives the DIO-ACK message of the 0x01 state of neighbours' transmission, coordinate is encapsulated into DEM message,
Flag is set as 0, and DEM message is returned to neighbor node.
4-2. present node c receives the DIO-ACK message of the 0x02 state of neighbor node i transmission, then is mentioned according to front
And prefix be embedded in scheme, generate a Bit String for neighbor node i, the Bit String of the Bit String and other neighbor nodes i are not
Together, and by the coordinate C of present node ccIt is encapsulated into DEM message together with Bit String, Flag is set as 1, and DEM message is returned to
Neighbor node i.
5. neighbor node i receives DEM message, the Flag information of DEM message is checked, handle in two kinds of situation: if a. Flag
It is 0, then directly by the coordinate C of present node ccIt saves or updates in routing table；If b. Flag is 1, according to present node c's
Coordinate Cc, Bit String and side right value (if any) obtain the coordinate C of node oneselfi。
In the present embodiment, after the node in whole network topology is carried out above-mentioned steps, it can realize DODAG structure
It builds and greed is embedded in, so that each node obtains the coordinate of itself and is stored with the coordinate of its neighbor node.
S104, according to the distance d (C of node c to destination node dc,Cd) and each neighbor node i to destination node d's
Distance d (Ci,Cd), get the nearest neighbor node i of the destination node d.
Specifically:
Firstly, calculating separately the coordinate C of present node c respectivelycTo the coordinate C of destination node ddDistance d (Cc,Cd), with
And the coordinate C of neighbor node iiTo the coordinate C of destination node ddDistance d (Ci,Cd), and calculate the difference D of the twoi=d (Cc,
Cd)-d(Ci,Cd)。
Then, all neighbor node i of the present node c are traversed, difference corresponding with each neighbor node i is obtained.
Finally, using the corresponding neighbor node i of maximum difference as the next-hop node of present node c.
It will be apparent that difference maximum illustrates that neighbor node i distance objective node d is nearest, therefore as next
Hop node can improve the efficiency of routing.
In addition, it should be noted that, if the present node c judges that destination node d, can be direct in its routing table
Using destination node d as next-hop node.
The data packet is transmitted to the nearest neighbor node by S105.
The present embodiment has the following beneficial effects:
1. prefix insertion is selected to be used for RPL routing optimality, improves existing RPL control message format and function, design are new
RPL control message, realize greed insertion and DODAG construction process natural fusion, fusion cost it is small, communication complexity with
DODAG maintains an equal level；
2. realizing the RPL greed routing based on coordinate on IPv6 protocol basis, each node need to only save local routing
Information, and make full use of tree while and when non-tree routed, greed routing success rate 100%, at the same ensure that routing efficiently and
It is expansible.
Referring to Fig. 5, second embodiment of the invention additionally provides a kind of RPL route device based on greed insertion, comprising:
Data packet acquiring unit 210 is used for data packet acquiring unit, for obtaining data packet to be transmitted；Wherein, described
The IPv6 extended head of data packet preserves the coordinate C of destination node dd；
Resolution unit 220 therefrom extracts the coordinate C of the destination node d for parsing the extended headd；
Neighbor node acquiring unit 230, for successively obtaining the coordinate C of neighbor node i from the routing table of itselfi；Its
In, for each node, routing table is stored with the coordinate of its neighbor node；
Nearest-neighbors node acquiring unit 240, for the distance d (C according to node c to destination node dc,Cd) and it is each
Distance d (the C of neighbor node i to destination node di,Cd), get the nearest neighbor node i of the destination node d；And
Data packet transmission unit 250, for the data packet to be transmitted to the nearest neighbor node i.
Referring to Fig. 6, third embodiment of the invention additionally provides a kind of network topology, including multiple nodes, wherein each
Node includes memory and processor, and computer program and routing table, the computer journey are stored in the memory
Sequence can be executed by the processor, to realize such as the above-mentioned RPL method for routing based on greed insertion.
Wherein, as shown in fig. 6, by executing the above-mentioned RPL method for routing based on greed insertion, it can be achieved that from node A
To the greed routing of node B.
Wherein, illustratively, the computer program can be divided into one or more units, one or more
A unit is stored in the memory, and is executed by the processor, to complete the present invention.One or more of units
It can be the series of computation machine program instruction section that can complete specific function, the instruction segment is for describing the computer program
Implementation procedure in node.
The node may include, but are not limited to processor, memory.It will be understood by those skilled in the art that the signal
Figure is only the example of node, and the not restriction of structure paired node may include than illustrating more or fewer components or group
Close certain components or different components, for example, the node can also include input-output equipment, it is network access equipment, total
Line etc..
Alleged processor can be central processing unit (Central Processing Unit, CPU), can also be it
His general processor, digital signal processor (Digital Signal Processor, DSP), specific integrated circuit
(Application Specific Integrated Circuit, ASIC), ready-made programmable gate array (Field-
Programmable GateArray, FPGA) either other programmable logic device, discrete gate or transistor logic,
Discrete hardware components etc..General processor can be microprocessor or the processor is also possible to any conventional processor
Deng the control centre of the node utilizes the various pieces of various interfaces and the entire node of connection.
The memory can be used for storing the computer program and/or module, and the processor is by operation or executes
Computer program in the memory and/or module are stored, and calls the data being stored in memory, described in realization
The various functions of node.The memory can mainly include storing program area and storage data area, wherein storing program area can deposit
Application program (such as sound-playing function, image player function etc.) needed for storing up operating system, at least one function etc.；Storage
Data field, which can be stored, uses created data (such as audio data, phone directory etc.) etc. according to mobile phone.In addition, memory can
It can also include nonvolatile memory, such as hard disk, memory, plug-in type hard disk, intelligence to include high-speed random access memory
Energy storage card (SmartMedia Card, SMC), secure digital (Secure Digital, SD) card, flash card (Flash
Card), at least one disk memory, flush memory device or other volatile solid-state parts.
Wherein, if the unit that the node integrates is realized in the form of SFU software functional unit and as independent product pin
It sells or in use, can store in a computer readable storage medium.Based on this understanding, the present invention realizes above-mentioned
All or part of the process in embodiment method can also instruct relevant hardware to complete by computer program, described
Computer program can be stored in a computer readable storage medium, which, can be real when being executed by processor
The step of existing above-mentioned each embodiment of the method.Wherein, the computer program includes computer program code, the computer journey
Sequence code can be source code form, object identification code form, executable file or certain intermediate forms etc..It is described computer-readable
Medium may include: any entity or device, recording medium, USB flash disk, mobile hard that can carry the computer program code
Disk, magnetic disk, CD, computer storage, read-only memory (ROM, Read-Only Memory), random access memory
(RAM, Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium etc..It needs to illustrate
It is that the content that the computer-readable medium includes can be fitted according to the requirement made laws in jurisdiction with patent practice
When increase and decrease, such as in certain jurisdictions, according to legislation and patent practice, computer-readable medium does not include electric carrier wave letter
Number and telecommunication signal.
It should be noted that the apparatus embodiments described above are merely exemplary, wherein described be used as separation unit
The unit of explanation may or may not be physically separated, and component shown as a unit can be or can also be with
It is not physical unit, it can it is in one place, or may be distributed over multiple network units.It can be according to actual
It needs that some or all of the modules therein is selected to achieve the purpose of the solution of this embodiment.In addition, device provided by the invention
In embodiment attached drawing, the connection relationship between module indicate between them have communication connection, specifically can be implemented as one or
A plurality of communication bus or signal wire.Those of ordinary skill in the art are without creative efforts, it can understand
And implement.
The above is a preferred embodiment of the present invention, it is noted that for those skilled in the art
For, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also considered as
Protection scope of the present invention.
Claims (10)
1. a kind of RPL method for routing based on greed insertion, which comprises the steps of:
For each node c in network topology:
Obtain data packet to be transmitted；Wherein, the IPv6 extended head of the data packet preserves the coordinate C of destination node dd；
The extended head is parsed, the coordinate C of the destination node d is therefrom extractedd；
The coordinate C of neighbor node i is successively obtained from the routing table of itselfi；Wherein, for each node, routing table is stored with
The coordinate of its neighbor node；
According to the distance d (C of node c to destination node dc,Cd) and each neighbor node i to destination node d distance d (Ci,
Cd), get the nearest neighbor node i of the destination node d；And
The data packet is transmitted to the nearest neighbor node i.
2. the RPL method for routing according to claim 1 based on greed insertion, which is characterized in that further include:
Network topology is embedded into metric space by greed insertion, to distribute metric space for each node in network topology
In coordinate；Wherein, after topological greed is embedded into metric space, the routing table of each node only saves the seat of its neighbor node
Mark.
3. the RPL method for routing according to claim 2 based on greed insertion, which is characterized in that in network topology
Each node, be that each node distributes a Bit String by prefix trees, the coordinate of node is from root node to the node
The level Bit String that the Bit String of all nodes is constructed according to hierarchical relationship on path.
4. the RPL method for routing according to claim 3 based on greed insertion, which is characterized in that the routing of each node
Table obtains in the following way:
Repeat the steps of each node until in traverses network topology:
Present node is after the coordinate for getting itself, the message packet for being DIO to its neighbor node transmission types；Wherein, root
The initial coordinate of node is by root node itself original allocation；The message packet includes Flags field；Wherein, neighbor node connects
After the message packet for receiving the present node, judge whether to select present node for father node；If neighbor node does not select institute
Stating present node is father node, then is proceeded as follows according to the Flags field of the message packet: if Flags field is 0,
Illustrate that the coordinate of the present node does not change, then with no treatment, and the DIO-ACK for directly returning to first state disappears
Breath, informs that the present node has been received by message packet；If Flags field is 1, illustrate that the present node coordinate is become
Change, then return to the DIO-ACK message of the second state, requests the present node to send updated coordinate, and save to itself
Routing table；If neighbor node selects the present node for father node, the DIO-ACK message of the third state is responded；
If the present node receives the DIO-ACK message of the first state of neighbor node transmission, with no treatment；If connecing
The DIO-ACK message for receiving the second state of neighbor node transmission, then be encapsulated into DEM for the coordinate of itself, and Flag is set as 0
Afterwards, DEM is returned into neighbor node；If the DIO-ACK message of the third state of neighbor node transmission is received, according to prefix
Insertion scheme generates a Bit String for neighbor node, and the coordinate of node itself is encapsulated into DEM message together with Bit String,
Flag is set as 1, and DEM message is returned to the neighbor node；Wherein, the neighbor node receives DEM message, checks
The Flag field of DEM message；Wherein, if Flag is 0, directly node coordinate is saved or is updated in routing table；If Flag is
1, then the coordinate of neighbor node oneself is obtained or updated according to node coordinate, Bit String.
5. each module RPL method for routing described in claim 1 based on greed insertion, which is characterized in that described according to node c
To the distance d (C of destination node dc,Cd) and each neighbor node i to destination node d distance d (Ci,Cd), it gets described
Destination node d nearest neighbor node i is specifically included:
Calculate separately the coordinate C of present node ccTo the coordinate C of destination node ddDistance d (Cc,Cd) and neighbor node i
Coordinate CiTo the coordinate C of destination node ddDistance d (Ci,Cd), and calculate the difference D of the twoi=d (Cc,Cd)-d(Ci,Cd)；
All neighbor node i of the present node c are traversed, difference corresponding with each neighbor node i is obtained；
Using the corresponding neighbor node i of maximum difference as the next-hop node of present node c.
6. the RPL method for routing according to claim 1 based on greed insertion, which is characterized in that the extended head
Structure includes following field: next header fields, extended head length, source node coordinate, source coordinate mask, destination node seat
Mark, coordinates of targets mask；
The extended head then is being parsed, before the coordinate that destination node d is extracted described in, further includes:
Whether the type for checking next header fields of extended head is predefined type.
7. the RPL method for routing according to claim 4 based on greed insertion, which is characterized in that the first state table
It is shown as 0x00, second state is expressed as 0x01, and the third state is expressed as 0x02.
8. the RPL method for routing according to claim 4 based on greed insertion, which is characterized in that the neighbor node root
Judge whether to select the present node for father node according to preassigned；The preassigned by objective function, DAG attribute and
Local customized strategy determines.
9. a kind of RPL route device based on greed insertion characterized by comprising
Data packet acquiring unit, for obtaining data packet to be transmitted；Wherein, the IPv6 extended head of the data packet is preserved
The coordinate C of destination node dd；
Resolution unit therefrom extracts the coordinate C of the destination node d for parsing the extended headd；
Neighbor node acquiring unit, for successively obtaining the coordinate C of neighbor node i from the routing table of itselfi；Wherein, for every
A node, routing table are stored with the coordinate of its neighbor node；
Nearest-neighbors node acquiring unit, for the distance d (C according to node c to destination node dc,Cd) and each neighbours section
Distance d (the C of point i to destination node di,Cd), get the nearest neighbor node i of the destination node d；And
Data packet transmission unit, for the data packet to be transmitted to the nearest neighbor node i.
10. a kind of network topology, which is characterized in that including multiple nodes, wherein each node includes memory and processing
Device is stored with computer program and routing table in the memory, and the computer program can be executed by the processor,
To realize the RPL method for routing based on greed insertion as described in claim 1 to 8 any one.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910083664.1A CN109617812B (en) | 2019-01-29 | 2019-01-29 | Greedy embedding-based RPL routing method and device and network topology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910083664.1A CN109617812B (en) | 2019-01-29 | 2019-01-29 | Greedy embedding-based RPL routing method and device and network topology |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109617812A true CN109617812A (en) | 2019-04-12 |
| CN109617812B CN109617812B (en) | 2021-04-23 |
Family
ID=66020939
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910083664.1A Active CN109617812B (en) | 2019-01-29 | 2019-01-29 | Greedy embedding-based RPL routing method and device and network topology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109617812B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111654445A (en) * | 2020-07-10 | 2020-09-11 | 清华大学 | Data packet transmission method, information processing method, node device and medium |
| CN112153670A (en) * | 2019-06-28 | 2020-12-29 | 北方工业大学 | Energy-saving data aggregation method for wireless sensor network |
| CN116016336A (en) * | 2022-12-30 | 2023-04-25 | 郑州中科集成电路与系统应用研究院 | HRPL-based high-efficiency inter-node communication method |
| CN116501691A (en) * | 2023-06-27 | 2023-07-28 | 北京燧原智能科技有限公司 | Automatic layout method and device of interconnection system, electronic equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130215942A1 (en) * | 2012-02-22 | 2013-08-22 | Cisco Technology, Inc. | Application-aware dynamic bit-level error protection for modulation-based communication |
| CN103619045A (en) * | 2013-11-21 | 2014-03-05 | 中国科学院信息工程研究所 | Route establishing method and system of low-consumption lossy network |
| US20150319084A1 (en) * | 2012-09-28 | 2015-11-05 | Cisco Technology, Inc. | Routing messages in a computer network using deterministic and probalistic source routes |
| CN107612743A (en) * | 2017-10-11 | 2018-01-19 | 深圳天珑无线科技有限公司 | Network topology information acquisition method and method for repairing route |
| CN108768736A (en) * | 2018-06-05 | 2018-11-06 | 中国人民解放军国防科技大学 | Optimization method of hybrid service function chain embedding cost |
| CN108965128A (en) * | 2018-07-11 | 2018-12-07 | 常州工程职业技术学院 | A kind of DODAG building optimization algorithm based on RPL agreement |
-
2019
- 2019-01-29 CN CN201910083664.1A patent/CN109617812B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130215942A1 (en) * | 2012-02-22 | 2013-08-22 | Cisco Technology, Inc. | Application-aware dynamic bit-level error protection for modulation-based communication |
| US20150319084A1 (en) * | 2012-09-28 | 2015-11-05 | Cisco Technology, Inc. | Routing messages in a computer network using deterministic and probalistic source routes |
| CN103619045A (en) * | 2013-11-21 | 2014-03-05 | 中国科学院信息工程研究所 | Route establishing method and system of low-consumption lossy network |
| CN107612743A (en) * | 2017-10-11 | 2018-01-19 | 深圳天珑无线科技有限公司 | Network topology information acquisition method and method for repairing route |
| CN108768736A (en) * | 2018-06-05 | 2018-11-06 | 中国人民解放军国防科技大学 | Optimization method of hybrid service function chain embedding cost |
| CN108965128A (en) * | 2018-07-11 | 2018-12-07 | 常州工程职业技术学院 | A kind of DODAG building optimization algorithm based on RPL agreement |
Non-Patent Citations (3)
| Title |
|---|
| YANBIN SUN，ET. AL: ""Greedy Embedding Strategy for Dynamic Graphs Based on Spanning Tree"", 《ICCCS 2018：CLOUD COMPUTING AND SECURITY》 * |
| 孙彦斌，等: ""基于贪心嵌入的几何路由可扩展问题研究"", 《智能计算机与应用》 * |
| 孙彦斌: ""面向ICN的可扩展名字路由机理研究"", 《中国博士学位论文全文数据库信息科技辑》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112153670A (en) * | 2019-06-28 | 2020-12-29 | 北方工业大学 | Energy-saving data aggregation method for wireless sensor network |
| CN112153670B (en) * | 2019-06-28 | 2023-05-05 | 北方工业大学 | Energy-saving data aggregation method for wireless sensor network |
| CN111654445A (en) * | 2020-07-10 | 2020-09-11 | 清华大学 | Data packet transmission method, information processing method, node device and medium |
| CN116016336A (en) * | 2022-12-30 | 2023-04-25 | 郑州中科集成电路与系统应用研究院 | HRPL-based high-efficiency inter-node communication method |
| CN116016336B (en) * | 2022-12-30 | 2024-04-23 | 郑州中科集成电路与系统应用研究院 | HRPL-based efficient inter-node communication method |
| CN116501691A (en) * | 2023-06-27 | 2023-07-28 | 北京燧原智能科技有限公司 | Automatic layout method and device of interconnection system, electronic equipment and storage medium |
| CN116501691B (en) * | 2023-06-27 | 2023-09-22 | 北京燧原智能科技有限公司 | Automatic layout method and device of interconnection system, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109617812B (en) | 2021-04-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109617812A (en) | A kind of RPL method for routing, device and network topology based on greed insertion | |
| CN1327667C (en) | Multicast route in AD-HOC network | |
| Misra et al. | An ant swarm-inspired energy-aware routing protocol for wireless ad-hoc networks | |
| CN108112049A (en) | A kind of wireless sensor network efficiency optimization cluster-dividing method based on gam algorithm | |
| CN105246117B (en) | A kind of implementation method of the energy-saving routing protocol suitable for mobile wireless Sensor Network | |
| CN103986661B (en) | A kind of multicast route method for supporting network code | |
| CN108696438A (en) | The retransmission method and device of BIER messages | |
| CN107579758A (en) | A kind of two-way alternate communication method based on G3 PLC | |
| Jia et al. | A BUS‐aided RSU access scheme based on SDN and evolutionary game in the Internet of Vehicle | |
| CN106941447A (en) | Free space optical network routing method based on Ants model | |
| Cao et al. | uCast: Unified connectionless multicast for energy efficient content distribution in sensor networks | |
| Sutariya et al. | A survey of ant colony based routing algorithms for manet | |
| Upadhyay et al. | Comparison and performance analysis of reactive type DSR, AODV and proactive type DSDV routing protocol for wireless mobile ad-hoc network, using NS-2 simulator | |
| CN107181775A (en) | Route selection method and routing arrangement in content center network | |
| Zheng et al. | Up-and-down routing through nested core-periphery hierarchy in mobile opportunistic social networks | |
| CN101237412B (en) | Packet delivery and route selection method | |
| Qadir et al. | Localized minimum-latency broadcasting in multi-radio multi-rate wireless mesh networks | |
| Al Sharah et al. | Trade-off between Energy Consumption and Transmission Rate in Mobile Ad-Hoc Network | |
| Ilyas et al. | A survey on the fundamental and advanced mobile ad hoc network routing protocols | |
| Johnson | QoS improvement in MANET using self organized balanced optimization | |
| Garcia-Luna-Aceves et al. | A new approach to on-demand loop-free routing in networks using sequence numbers | |
| Shi et al. | A Shapley value-based forwarding strategy in Information-Centric Networking | |
| Brandl et al. | An efficient source initiated on-demand data forwarding scheme for wireless sensor networks | |
| Samyal et al. | Comparision of MOFO drop policy with new efficient buffer management policy | |
| Brandl et al. | A simple pheromone based on-demand routing protocol for wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |