CN104967562B - A kind of method for routing between internet of things equipment node - Google Patents

A kind of method for routing between internet of things equipment node Download PDF

Info

Publication number
CN104967562B
CN104967562B CN201510232819.5A CN201510232819A CN104967562B CN 104967562 B CN104967562 B CN 104967562B CN 201510232819 A CN201510232819 A CN 201510232819A CN 104967562 B CN104967562 B CN 104967562B
Authority
CN
China
Prior art keywords
node
device node
skeleton
edge device
internet
Prior art date
Application number
CN201510232819.5A
Other languages
Chinese (zh)
Other versions
CN104967562A (en
Inventor
彭凯
冯文顺
陈凯
张先愉
王学
徐万彪
李俊峰
Original Assignee
武汉光发科技有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 武汉光发科技有限公司 filed Critical 武汉光发科技有限公司
Priority to CN201510232819.5A priority Critical patent/CN104967562B/en
Publication of CN104967562A publication Critical patent/CN104967562A/en
Application granted granted Critical
Publication of CN104967562B publication Critical patent/CN104967562B/en

Links

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THIR OWN ENERGY USE
    • Y02D50/00Techniques for reducing energy consumption in wire-line communication networks
    • Y02D50/30Techniques for reducing energy consumption in wire-line communication networks by selective link activation in bundled links

Abstract

The invention discloses the method for routing between a kind of internet of things equipment node, comprise the following steps:Step 1: obtaining the whole edge device node of Internet of Things, the edge device node of whole is divided into multiple edge device node sets according to cut-point;Step 2: forming skeleton access path, skeleton is formed;Step 3: Internet of Things is layered according to skeleton device node, determine first path;Step 4: the data of source device node issue are routed to up to purpose equipment node using first path;It is long that the method for the present invention can solve routed path in conventional method, device node energy expenditure is uneven, the consumption of equipment component node energy is too fast and the problem of cause Internet of Things life cycle short, and provided with the second path being used for parallel to first path, the problem of avoiding causing Internet of Things to be paralysed due to the second path routing failure, realize the efficient progress of route, the harmony of energy expenditure is improved, extends the life cycle of whole Internet of Things.

Description

A kind of method for routing between internet of things equipment node

Technical field

The present invention relates to a kind of method for routing, and in particular to the method for routing between a kind of internet of things equipment node.

Background technology

In Internet of Things, route is that information is delivered to the activity of purpose equipment node from source device node, in Internet of Things Very important effect is played in information transfer, typically in routing procedure, information is by being passed between node and node It is defeated, and in existing method for routing, generally have that routed path is long, and some device node energy expenditures are excessive, and some set Slave node energy expenditure is smaller, and the device node for causing energy expenditure excessive is easily paralysed, and that causes whole Internet of Things can not be just Often work, namely life cycle are short so that route can not be carried out efficiently.

The content of the invention

It is an object of the invention to which the method for routing between a kind of internet of things equipment node can be provided, can solve tradition Routed path is long in method, and device node energy expenditure is uneven, the consumption of equipment component node energy is too fast and causes Internet of Things The problem of life cycle is short, the efficient progress of route is realized, extend the life cycle of whole Internet of Things, and provided behind at least The advantages of illustrating.

A further object of the invention is in the case where information is unable to reach purpose equipment node via the second path, is changed It is transmitted along first path, so as to reach purpose equipment node, avoids, due to the paralysis in the second path, causing whole Internet of Things Can not working for net, realizes the efficient progress of route, improves the harmony of energy expenditure, so as to further whole Internet of Things Life cycle.

Technical scheme provided by the invention is:

A kind of method for routing between internet of things equipment node, comprises the following steps:

Step 1: the whole edge device node of Internet of Things is obtained, by the edge device node of whole according to cut-point point For multiple edge device node sets, wherein, using all edge device nodes between two neighboring cut-point as one Individual edge device node set;

Step 2: determine that the nearest border minimum with each internal unit node hop count distance is set respectively using flooding approach Slave node, and record, if two nearest edge device nodes be present and be belonging respectively to different borders in an internal unit node Device node set, then the internal unit node is skeleton device node, determines all skeleton device nodes and connects, and is formed Skeleton access path, form skeleton;

Step 3: being layered Internet of Things according to skeleton device node, each layer includes a skeleton device node, it is determined that with Each is not as the minimum nearest skeleton device node of the miscellaneous equipment node hop count distance of skeleton device node, if this sets There is a nearest skeleton device node in slave node, the device node point is layered where the skeleton device node recently, If the device node has multiple skeleton device nodes recently, by the device node point in multiple skeleton equipment recently It is layered where any one in node, is layered where determining source device node and purpose equipment node respectively and is set positioned at source Other layerings between being layered where layering where slave node and purpose equipment node, determine described on the skeleton access path The of the skeleton device node being layered where the skeleton device node of layering to the purpose equipment node where source device node One path;

Step 4: the data of source device node issue route to the skeleton equipment section with layering where the source device node Point, the skeleton device node of layering where the purpose equipment node is routed to using first path, is calculated by Di Jiesitela Method tries to achieve the skeleton device node of layering where purpose equipment node to the first shortest path of purpose equipment node, the data Purpose equipment node is reached along first shortest path.

Preferably, in the method for routing between described internet of things equipment node, before the step 4, in addition to Lower step:

A, the first hop count distance between the skeleton device node of layering where determining source device node and source device node, It is the with skeleton device node hop count distance to choose in being layered where each skeleton device node in the first path Any one internal unit node a of one hop count distance, and connect parallel to the first path the second path;

B, the data are route along second path, reach the inside corresponding with layering where purpose equipment node Device node a, and try to achieve the corresponding internal unit node a of purpose equipment node place layering using Dijkstra's algorithm and arrive Second shortest path of purpose equipment node, data are passed to purpose equipment node then along second shortest path;

If c, the data successfully arrive at purpose equipment node, the step 4 is not performed;

If the data can not successfully arrive at purpose equipment node, the step 4 is performed.

Preferably, in the method for routing between described internet of things equipment node, wherein, the acquisition thing in the step 1 The edge device node for whole of networking, is concretely comprised the following steps:

S1, any one device node in Internet of Things is chosen, confirmed using flooding approach with device node hop count distance most Big device node, and as the first edge device node;

S2, any two equipment section minimum with the first edge device node hop count distance is chosen using flooding approach Point, confirm the shortest path between described two device nodes, and using the device node on the shortest path as the second side Boundary's device node;

S3, the first edge device node and the second boundary device node form the whole edge device of Internet of Things Node, the edge device node be the first edge device node with it is any one in the second boundary device node It is individual;

S4, repeating said steps S1 and step S2, until the quantity of edge device node reaches all devices number of nodes 1%.

Preferably, in the method for routing between described internet of things equipment node, the utilization flooding approach in the step 2 The nearest edge device node minimum with each internal unit node hop count distance is determined respectively, is concretely comprised the following steps:

A, allocation boundary ID, equipment are distinguished for each described edge device node set and the edge device node Node ID, all edge device nodes are released news simultaneously using flooding approach, and the information includes border ID, device node ID and jump Number ID;

B, when internal unit node n receives this information for the first time, judge and preserve it with issuing the edge device section of this information Point m hop count distance;

C, repeating said steps A, if the hop count distance between edge device node m and internal unit node n is than inside Hop count distance between the nearest edge device node and the internal unit node n that are once recorded before device node n is big, then protects It is constant to hold the nearest edge device nodal information once recorded before internal unit node n;

If the hop count distance between edge device node m and internal unit node n before internal unit node n than once remembering Hop count between nearest edge device node and internal unit the node n of record then preserves internal unit node n nearest one apart from small The nearest edge device nodal information of secondary record;

If hop count distance between edge device node m and internal unit node n with before internal unit node n once Hop count between the nearest edge device node and internal unit node n of record then preserves internal unit section apart from equal simultaneously The information of the last records of point n and the preceding nearest edge device node once recorded;

D, repeating said steps A and step C, until all internal unit node n update nearest edge device node Information.

Preferably, in the method for routing between described internet of things equipment node, confirming the method for the cut-point includes Following steps:

For Arbitrary Boundaries device node p, its discrete curvature ρpCalculate as follows:

ρp=maxH=1 ..., HMh(p)/2H

Wherein, Mh(p) for be H with edge device node P hop count distances any two edge device node between most Big hop count distance, h=1,2 ... H;

Work as ρpDuring less than threshold value, using edge device node p as cut-point.

Preferably, in the method for routing between described internet of things equipment node, the threshold value is 0.45-0.55.

Preferably, in the method for routing between described internet of things equipment node, H=3 or 4.

The present invention comprises at least following beneficial effect:Can solve that routed path is long in conventional method, device node energy The problem of measuring consumption inequality, the consumption of equipment component node energy is too fast and causing Internet of Things life cycle short, realize the height of route Effect is carried out, and extends the life cycle of whole Internet of Things;And it is unable to reach purpose equipment node via the second path in data In the case of, change and be transmitted along first path, so as to reach purpose equipment node, avoided due to the paralysis of a routed path Paralysis, can not working for whole Internet of Things is caused, realize the efficient progress of route, the harmony of energy expenditure is improved, so as to enter The life cycle of the whole Internet of Things of one step.

Brief description of the drawings

The flow chart of method for routing of the Fig. 1 between internet of things equipment node of the present invention.

Embodiment

The present invention is described in further detail below in conjunction with the accompanying drawings, to make those skilled in the art with reference to specification text Word can be implemented according to this.

As shown in figure 1, the present invention provides the method for routing between a kind of internet of things equipment node, comprise the following steps:

S110 (step 1), the whole edge device node of Internet of Things is obtained, by the edge device node of whole according to dividing Cutpoint is divided into multiple edge device node sets, wherein, by all edge device nodes between two neighboring cut-point As an edge device node set;

Internet of Things be by some equipment communication with one another connect, and can mutually phase control associate equipment, then each sets It is standby during communication with one another, how to be communicated between equipment all as a device node in Internet of Things, how to cause Tongxu Efficiency maximizes, and turning into one needs to solve the problems, such as, has both wished that path was shorter in communication, and one device node of hope Do not taken excessively, therefore inventor has found, all these device nodes in Internet of Things can be divided into two kinds first:It is a kind of It is boundary node, one kind is internal node, and boundary node is the device node positioned at Internet of Things boundary, its determination mode, both Directly determined by the attribute of equipment or arrived by what some algorithms were estimated, remove edge device section Node outside point, we are referred to as internal node.Boundary point is split first, the purpose of segmentation is to find skeleton Node, inventor have found:Data are transmitted by the skeleton stage, can realize that the resource of each node averagely utilizes relatively, without The load of some device nodes can be allowed excessive.

S120 (step 2), determined respectively using flooding approach and minimum nearest of each internal unit node hop count distance Edge device node, and record, if two nearest edge device nodes be present and be belonging respectively to difference in an internal unit node Edge device node set, then the internal unit node is skeleton device node, determines all skeleton device nodes and company Connect, form skeleton access path, form skeleton;

An internal unit node, judgement and the closest nearest edge device node of its hop count are arbitrarily chosen, so Require no knowledge about the absolute location information of device node, it is only necessary to know that the relative jump of the boundary node and the internal node recently Number distance, it is possible to it is determined that the nearest edge device node minimum with each internal unit node hop count distance, avoids equipment The consuming of energy, is advantageous to improve load equilibrium during the confirmation position of node geo;

S130 (step 3), according to skeleton device node Internet of Things being layered, each layer includes a skeleton device node, So it is layered clearer and more definite so that the path of follow-up data transfer becomes apparent from, so as to ensure that the transmission of follow-up data can have The not disorderly progress of bar, it is determined that with each not as the minimum nearest bone of the miscellaneous equipment node hop count distance of skeleton device node Slave node is set up, if the device node has a nearest skeleton device node, by the device node point in the nearest bone Layering where setting up slave node, if the device node has multiple skeleton device nodes recently, the device node point is existed It is layered where any one in multiple skeleton device nodes recently;

So may insure no matter the internal node how many nearest skeleton device node, the node can be carried out Clearly be layered, layering where determining source device node and purpose equipment node respectively and where source device node layering with Other layerings between being layered where purpose equipment node, determine where the source device node to divide on the skeleton access path The first path of the skeleton device node of layering, the first via where the skeleton device node of layer to the purpose equipment node Footpath is located on the skeleton access path, efficiently can clearly carry out data transfer;

S140 (step 4), the data of source device node issue route to the skeleton with layering where the source device node Device node, the skeleton device node of layering where the purpose equipment node is routed to using first path, here both can be with It is the skeleton device node that layering where the purpose equipment node is routed to along the first path, can is along flat again The skeleton device node of row layering where other paths of the first path are routed to the purpose equipment node, passes through enlightening First shortest path of the skeleton device node of layering to purpose equipment node where Jie Sitela algorithms try to achieve purpose equipment node Footpath, the data reach purpose equipment node along first shortest path, so along the first Shortest path routing, can subtracted The loss of energy in few routing procedure, improve the life cycle of Internet of Things.

It is further comprising the steps of before the step 4 in method for routing between described internet of things equipment node:

First between S150 (a), the skeleton device node for determining to be layered where source device node and source device node jumps Number distance, choose in being layered where each skeleton device node in the first path with the skeleton device node hop count away from From for any one internal unit node a with a distance from the first hop count, and connect parallel to the first path the second path;

S160 (b), the data are route along second path, are reached corresponding with layering where purpose equipment node Internal unit node a, and tried to achieve using Dijkstra's algorithm and corresponding internal unit be layered where purpose equipment node Data are passed to purpose equipment by node a to the second shortest path of purpose equipment node then along second shortest path Node;

If c, the data successfully arrive at purpose equipment node, the step 4 is not performed;

If the data can not successfully arrive at purpose equipment node, the step 4 is performed.

Data are positioned at the first path on the skeleton access path along before being route in step 4, Data are route via the second path parallel to first path, the skeleton equipment section in first path can be greatly reduced The load of point, reduces its energy expenditure, because the skeleton device node on script skeleton access path connects different borders and set Slave node set, it is necessary to the energy ratio of consumption it is common internal unit node it is more, and if energy expenditure is excessive too fast, will accelerate Its depleted of energy;Gone wrong in the second path, data along the second path can not route to purpose equipment node when, then use First path, so greatly improve the success rate of data route.

In method for routing between described internet of things equipment node, wherein, the acquisition Internet of Things in the step 1 is whole Edge device node, concretely comprise the following steps:

S1, any one device node in Internet of Things is chosen, confirmed using flooding approach with device node hop count distance most Big device node, and as the first edge device node;

S2, any two equipment section minimum with the first edge device node hop count distance is chosen using flooding approach Point, confirm the shortest path between described two device nodes, and using the device node on the shortest path as the second side Boundary's device node;

S3, the first edge device node and the second boundary device node form the whole edge device of Internet of Things Node, the edge device node be the first edge device node with it is any one in the second boundary device node It is individual;

S4, repeating said steps S1 and step S2, until the quantity of edge device node reaches all devices number of nodes 1%.

The first edge device node of outermost is first determined, is determined and its hop count distance further according to the first edge device node Nearest device node, as the second boundary device node, these are so required no knowledge about as the second boundary device node The absolute location information of device node, it is only necessary to know that its relative hop count distance with first device node, avoid the second side The consuming of energy, is advantageous to improve load balancing, improves the life of Internet of Things during the geographical confirmation position of boundary's device node Cycle.

In method for routing between described internet of things equipment node, the utilization flooding approach in the step 2 determine respectively with The minimum nearest edge device node of each internal unit node hop count distance, is concretely comprised the following steps:

A, allocation boundary ID, equipment are distinguished for each described edge device node set and the edge device node Node ID, all edge device nodes are released news simultaneously using flooding approach, and the information includes border ID, device node ID and jump Number ID;

B, when internal unit node n receives this information for the first time, judge and preserve it with issuing the edge device section of this information Point m hop count distance;

C, repeating said steps A, if the hop count distance between edge device node m and internal unit node n is than inside Hop count distance between the nearest edge device node and the internal unit node n that are once recorded before device node n is big, then protects It is constant to hold the nearest edge device nodal information once recorded before internal unit node n;

If the hop count distance between edge device node m and internal unit node n before internal unit node n than once remembering Hop count between nearest edge device node and internal unit the node n of record then preserves internal unit node n nearest one apart from small The nearest edge device nodal information of secondary record;

If the hop count distance between edge device node m and internal unit node n before internal unit node n with once remembering Hop count between the nearest edge device node and internal unit node n of record then preserves internal unit node n apart from equal simultaneously The information of the last time record and the preceding nearest edge device node once recorded;

D, repeating said steps A and step C, until all internal unit node n update nearest edge device node Information.

Can so ensure nearest edge device nodal information that each internal unit node preserves be it is accurate, so as to for The efficient transmission of follow-up data provides guarantee, and in the process, each device node is required for necessarily being operated, energy Amount consumption is more balanced, is advantageous to improve the life cycle of Internet of Things.

In method for routing between described internet of things equipment node, confirm that the method for the cut-point comprises the following steps:

For Arbitrary Boundaries device node p, its discrete curvature ρpCalculate as follows:

ρp=maxH=1 ..., HMh(p)/2H

Wherein, Mh(p) for be H with edge device node P hop count distances any two edge device node between most Big hop count distance, h=1,2 ... H;

Work as ρpDuring less than threshold value, using edge device node p as cut-point, now skeletal extraction effect is preferable, on skeleton Branch road it is less.

In method for routing between described internet of things equipment node, the threshold value is 0.45-0.55, and result of the test shows to work as When the threshold value is 0.45-0.55, the edge device node of whole is split using cut-point now, skeletal extraction effect Fruit is preferable, and the branch road on skeleton is less.

In method for routing between described internet of things equipment node, H=3 or 4, result of the test shows to work as H=3 or 4, skeleton Extraction effect is preferable, and the branch road on skeleton is less.

The present invention provides a kind of method for routing of novel Internet of Things, and methods described uses the route side based on network skeleton Method, this method do not need the positional information of physical equipment, routing decision localization, can reach extraordinary load balancing effect. Purpose, which is to improve, provides shorter routed path, more excellent load-balancing performance, has to different network topology models Robustness, greatly prolong the life cycle of Internet of Things and ensure to route successfully.

The method for routing of the Internet of Things based on skeleton, comprises the following steps:

A. network boundary is obtained.Part boundary node is obtained by flooding approach first, then passes through coupling part border Method obtains all boundary node of network;

B. network skeleton is obtained.First, the boundary node of Internet of Things is divided into multiple borders according to cut-point;Then, root Have what the node on two nearest borders was belonging respectively to different boundary whether to identify skeleton node according to node, pass through connecting framework Node, build the skeleton of Internet of Things;Finally, it is named by nomenclature scheme to network node.

C. the route based on skeleton.Source node goes to route along the parallel path of skeleton, until including identical skeleton node During the node of information, skeleton node is reached along minimal path tree, it is final for the shortest path tree of root then along skeleton node To destination node.

If can not successfully be route for step c route, using the method being route along skeleton line.

Using the method for routing based on skeleton, it is not necessary to know the positional information of node, rely only on local message, just It can ensure that the success rate of route 100% and proof load be balanced.

Therefore the invention has the advantages that:

A greatly improves the routing performance and life cycle of Internet of Things;

B realizes simple and convenient, and energy expenditure is low during operation;

C performances on router operating system and load balancing index are very good.

1. randomly choosing a node P first in network N, then flooded, find the node Q farthest from P, then Q For the boundary node of network.Segment boundary node B (N) can be obtained by such mode.Then by local flooding approach, look for The shortest path gone out between the most adjacent nodes of boundary node B (N), the node in these paths is also labeled as boundary node, passed through This mode, all boundary nodes of network can be obtained.

2. pair each boundary node, the discrete curvature of each boundary node is calculated by formula (1).

ρp=maxH=1 ..., HMh(p)/2h (1)

Mh(p) it is maximum hop count distance of two nodes in node p h hop neighbors.Our experiences show that H=3 Or when 4, it is very good for most result.Work as ρp(our experiment demonstrates that being 0.45- during less than each threshold value It is proper between 0.55), border is layered several sections using node p as cut-point, these cut-points, we give each section of side Boundary distributes a border ID.

3. each boundary node is initialized as containing an Information ID, what affiliated border ID passed through with the information transfer Hop count.When boundary node carries out flooding information simultaneously, after internal node receives information, if information comes from boundary node, ratio is certain The most short boundary node preserved is also remote, directly throws away.If information from boundary node than the nearest border that currently preserves Node is also near, then updates nearest boundary node information.If information from boundary node than currently preserve nearest border section Point then preserves the information of the two boundary nodes apart from equal simultaneously.After flooding, each internal node knows its Nearest boundary node situation.If the nearest boundary node of internal node, on different borders, the internal node is middle joint Point.Axis node is connected by way of locally flooding and forms coarse skeleton, is optimized by beta pruning, finally obtains accurate bone Frame;

Wherein, beta pruning optimize the step of be;Flooding is utilized from the skeleton node b minimum with Arbitrary Boundaries node hop count distance Method releases news, and internal node receives the information;

If internal node k received this information, without any operation;

If internal node k did not receive this information, and internal node k is skeleton node, then marks inside this Node k is father's node, and is forwarded, and otherwise, internal node k, abandons the information;

For other internal nodes in Internet of Things, above step is repeated, until all coarse skeleton nodes all receive The information of flooding approach issue is utilized from skeleton node b,

Above rule constantly is repeated, when all coarse skeleton nodes all have received from boundary node k's Information is flooded, then stops flooding, thus generates the skeletal tree T (b) using boundary node b as root node, skeletal tree T's (b) Node is coarse skeleton node.The tree node for claiming to have two or more adjacent coarse skeleton node turns into middle node Point, and other tree nodes are referred to as leaf node.Skeleton between leaf node and nearest intermediate node forms skeleton line segment. If the interstitial content of skeleton line segment is very little, less than the threshold value of agreement, it is evident that skeleton line segment reflection is not sensor network Prevailing topology feature, it is believed that this is skeleton branches caused by noise, it may be considered that is deleted.

4. its nearest boundary node of each nodes records, nearest skeleton node, and it to skeleton it is relative away from From.

5. shortest path of the skeleton node on skeleton corresponding to source node p and destination node q first, is found out in a network S;Then, go to route along the parallel paths of S, have identical corresponding skeleton node with destination node q until reaching;Finally, edge Shortest path tree of the root on skeleton and reach destination node q.

6., can be with the following method when using above-mentioned routing failure in order to improve router operating system ability:Source node P is routed to the nearest skeleton node x (p) of p, is routed to the nearest skeleton node x (q) of destination node then along skeleton line, most Afterwards destination node q is routed to from x (q).

Although embodiment of the present invention is disclosed as above, it is not restricted in specification and embodiment listed With it can be applied to various suitable the field of the invention completely, can be easily for those skilled in the art Other modification is realized, therefore under the universal limited without departing substantially from claim and equivalency range, it is of the invention and unlimited In specific details and shown here as the legend with description.

Claims (6)

1. the method for routing between a kind of internet of things equipment node, it is characterised in that comprise the following steps
Step 1: obtain the whole edge device node of Internet of Things, the edge device node of whole is divided into according to cut-point more Individual edge device node set, wherein, using all edge device nodes between two neighboring cut-point as a side Boundary's device node set;
Step 2: determine the nearest edge device section minimum with each internal unit node hop count distance respectively using flooding approach Point, and record, if two nearest edge device nodes be present and be belonging respectively to different edge devices in an internal unit node Node set, then the internal unit node is skeleton device node, determines all skeleton device nodes and connects, and forms skeleton Access path, form skeleton;
Step 3: being layered Internet of Things according to skeleton device node, each layer includes a skeleton device node, it is determined that with it is each The individual nearest skeleton device node minimum not as the miscellaneous equipment node hop count distance of skeleton device node, if the equipment section A nearest skeleton device node be present in point, by the device node point layering where the skeleton device node recently, if There are multiple skeleton device nodes recently in the device node, then by the device node point in multiple skeleton device nodes recently In any one where be layered, layering where determining source device node and purpose equipment node respectively and positioned at source device section Other layerings between being layered where layering where point and purpose equipment node, determine that the source is set on the skeleton access path The first via of the skeleton device node of layering where the skeleton device node of layering to the purpose equipment node where slave node Footpath;
Step 4: the data of source device node issue route to the skeleton device node with layering where the source device node, The skeleton device node of layering where the purpose equipment node is routed to using first path, is asked by Dijkstra's algorithm The skeleton device node of layering where purpose equipment node to purpose equipment node the first shortest path, the data along First shortest path reaches purpose equipment node;
It is further comprising the steps of before the step 4:
A, the first hop count distance between the skeleton device node of layering where determining source device node and source device node, chooses Being jumped with skeleton device node hop count distance for first in being layered where each skeleton device node in first path Number distances any one internal unit node a, and connect parallel to the first path the second path;
B, the data are route along second path, reach the internal unit corresponding with layering where purpose equipment node Node a, and corresponding internal unit node a is layered to purpose where trying to achieve purpose equipment node using Dijkstra's algorithm Second shortest path of device node, data are passed to purpose equipment node then along second shortest path;
If c, the data successfully arrive at purpose equipment node, the step 4 is not performed;
If the data can not successfully arrive at purpose equipment node, the step 4 is performed.
2. the method for routing between internet of things equipment node as claimed in claim 1, it is characterised in that wherein, the step 1 In obtain the whole edge device node of Internet of Things, concretely comprise the following steps:
S1, any one device node in Internet of Things is chosen, confirmed and device node hop count distance maximum using flooding approach Device node, and as the first edge device node;
S2, any two device node minimum with the first edge device node hop count distance is chosen using flooding approach, really The shortest path recognized between described two device nodes, and using the device node on the shortest path as the second boundary equipment Node;
S3, the first edge device node and the second boundary device node form the whole edge device section of Internet of Things Point, the edge device node are the first edge device node and any one in the second boundary device node;
S4, repeating said steps S1 and step S2, until the quantity of edge device node reaches all devices number of nodes 1%.
3. the method for routing between internet of things equipment node as claimed in claim 2, it is characterised in that the profit in the step 2 Determine the nearest edge device node minimum with each internal unit node hop count distance, specific steps respectively with flooding approach For:
A, allocation boundary ID, device node are distinguished for each described edge device node set and the edge device node ID, all edge device nodes are released news simultaneously using flooding approach, and the information includes border ID, device node ID and hop count ID;
B, internal unit node n is for the first time when receiving this information, judges and preserves itself and the edge device node m's that issues this information Hop count distance;
C, repeating said steps A, if the hop count distance between edge device node m and internal unit node n is than internal unit Hop count distance between the nearest edge device node and the internal unit node n that are once recorded before node n is big, then in holding The nearest edge device nodal information once recorded before portion device node n is constant;
If hop count distance between edge device node m and internal unit node n before internal unit node n than once recording Hop count between edge device node and internal unit node n then preserves the last notes of internal unit node n apart from small recently The nearest edge device nodal information of record;
If hop count distance between edge device node m and internal unit node n before internal unit node n with once recording It is nearest then to preserve internal unit node n apart from equal simultaneously for hop count between edge device node and internal unit node n recently The once information of record and the preceding nearest edge device node once recorded;
D, repeating said steps A and step C, until all internal unit node n update nearest edge device nodal information.
4. the method for routing between internet of things equipment node as claimed in claim 3, it is characterised in that confirm the cut-point Method comprises the following steps:
For Arbitrary Boundaries device node p, its discrete curvature ρpCalculate as follows:
ρp=maxH=1 ..., HMh(p)/2H
Wherein, Mh(p) for be H with edge device node P hop count distances any two edge device node between maximum hop count Distance, h=1,2 ... H;
Work as ρpDuring less than threshold value, using edge device node p as cut-point.
5. the method for routing between internet of things equipment node as claimed in claim 4, it is characterised in that the threshold value is 0.45- 0.55。
6. the method for routing between internet of things equipment node as claimed in claim 5, it is characterised in that H=3 or 4.
CN201510232819.5A 2015-05-08 2015-05-08 A kind of method for routing between internet of things equipment node CN104967562B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510232819.5A CN104967562B (en) 2015-05-08 2015-05-08 A kind of method for routing between internet of things equipment node

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510232819.5A CN104967562B (en) 2015-05-08 2015-05-08 A kind of method for routing between internet of things equipment node

Publications (2)

Publication Number Publication Date
CN104967562A CN104967562A (en) 2015-10-07
CN104967562B true CN104967562B (en) 2017-11-10

Family

ID=54221509

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510232819.5A CN104967562B (en) 2015-05-08 2015-05-08 A kind of method for routing between internet of things equipment node

Country Status (1)

Country Link
CN (1) CN104967562B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10536211B2 (en) * 2016-10-14 2020-01-14 Huawei Technologies Co., Ltd. Mobile device relay service for reliable internet of things
CN107018546A (en) * 2017-04-12 2017-08-04 广东工业大学 A kind of method of clustering routing in manufacture Internet of Things

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101355496A (en) * 2008-08-12 2009-01-28 武汉大学 Multi-hop clustering route protocol initiated by base station
CN101489293A (en) * 2009-02-27 2009-07-22 重庆邮电大学 Wireless sensor network routing scheduling method based on energy consumption balance policy
CN101815287A (en) * 2010-03-11 2010-08-25 北京交通大学 Wireless sensor network routing method and system based on tree network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101355496A (en) * 2008-08-12 2009-01-28 武汉大学 Multi-hop clustering route protocol initiated by base station
CN101489293A (en) * 2009-02-27 2009-07-22 重庆邮电大学 Wireless sensor network routing scheduling method based on energy consumption balance policy
CN101815287A (en) * 2010-03-11 2010-08-25 北京交通大学 Wireless sensor network routing method and system based on tree network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
MAP: Medial Axis Based Geometric Routing in Sensor Networks;Jehoshua Bruck,Jie Gao;《mobicom"05 proceedings of the 11th annual international conferrence on mobile computing and networking》;20050828;全文 *
无线传感器网络的拓扑特征提取与应用研究;刘文平;《硕士学位论文》;20130516;正文第14页-第21页 *

Also Published As

Publication number Publication date
CN104967562A (en) 2015-10-07

Similar Documents

Publication Publication Date Title
EP3041169B1 (en) Network cost optimization
JP5973570B2 (en) Implementation of OSPF in a split architecture network
CN103354988B (en) For calculating the system and method for the point-to-point label switched path through multiple territory
CN104333511B (en) Determine the method, apparatus and system of service transmission path
US8848544B2 (en) Event correlation using network data flow simulation over unmanaged network segments
CN105049350A (en) Segment routing - egress peer engineering (SP-EPE)
US7099286B1 (en) Method and system for finding shared risk diverse paths
CN100454830C (en) Method for realizing path computation in network domain
US6882627B2 (en) Methods and apparatus for selecting multiple paths taking into account shared risk
EP2842278B1 (en) Three stage folded clos optimization for 802.1aq
CN104219145B (en) Network system and method for routing
US8934490B2 (en) Accelerated MAC address resolution for IPv6 traffic with IS-IS protocol
CN101313528B (en) Multi-domain route computation method and system
CN103379032B (en) The acquisition methods and device, sub-route computational entity of cross-domain end-to-end route
CN100512209C (en) Method for solving resource conflict in distribution route counting
CN103051565B (en) A kind of architecture system and implementation method of grade software defined network controller
CN103190126B (en) Communication system, control device, packet forwarding path control method and program
CN105379196B (en) Method, system and computer storage medium for the routing of fault-tolerant and load balance
CN106063203A (en) Software defined networking (SDN) specific topology information discovery
US7603481B2 (en) Dynamic routing through a content distribution network
CN105743795A (en) Point-to-multipoint path computation for wide area network optimization
EP0423053B1 (en) Method of using cached partial trees in computing a path in a data communication network
EP1416685B1 (en) Enriched tree for a content distribution network
CN104113482B (en) The methods, devices and systems of flow table renewal
US7334047B1 (en) Method and system for selective link state advertisement blocking over a data network area

Legal Events

Date Code Title Description
PB01 Publication
C06 Publication
SE01 Entry into force of request for substantive examination
C10 Entry into substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20190816

Address after: 430070 A7 Exhibition Center, 858, hi tech Avenue, East Lake Development Zone, Wuhan, Hubei, China

Patentee after: WUHAN LUOJIA WEIYE TECHNOLOGY CO., LTD.

Address before: 430040 No. 6, No. 3 Haikou Road, Jinshan Avenue, Wuhan City, Hubei Province

Patentee before: Wuhan Guangfa Technology Co., Ltd.

TR01 Transfer of patent right