CN104901885A - Geographical location information-aided secure route selection method - Google Patents
Geographical location information-aided secure route selection method Download PDFInfo
- Publication number
- CN104901885A CN104901885A CN201510210675.3A CN201510210675A CN104901885A CN 104901885 A CN104901885 A CN 104901885A CN 201510210675 A CN201510210675 A CN 201510210675A CN 104901885 A CN104901885 A CN 104901885A
- Authority
- CN
- China
- Prior art keywords
- node
- value
- trust value
- rreq
- trust
- 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/12—Shortest path evaluation
-
- 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
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/23—Bit dropping
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a geographical location information-aided secure route selection method. According to the method, a trust mechanism and the geographical location information of nodes are combined together; and when a source node needs to forward data packets, a node of which the trust value and two-dimensional future value are superior on the whole is selected from a forward area of the transmission range of the source node and is adopted as a next-hop route forwarding node. With the geographical location information-aided secure route selection method of the invention adopted, defects such as large consumption of network resources and internal malicious nodes attack of an existing method can be eliminated, and reasonable and optimal allocation of the whole network resources can be realized.
Description
Technical field
The invention belongs to network safety filed, particularly in a kind of Ad Hoc network based on the Security routing system of selection that the geographical location information of trusting is auxiliary.
Background technology
In recent years, the security routing research of Ad Hoc network achieves great progress, major part security routing mainly adopts active maintenance routing table or utilizes inundation mode to find route as required, and introduce faith mechanism and effectively resist the malicious attack of internal node to realize Security routing, by contrast, on-demand routing than proactive by the application be more suitable under dynamic topology environment.Differ with dynamic topology and node energy because Ad Hoc network channel resource is limited, make reduction route discovery and maintenance costs become important research content.Therefore, an on-demand routing system of selection safely and effectively will directly affect the most optimum distribution of resources of whole network.
Existing safe on-demand routing protocol mainly takes the forms of broadcasting to send packet, when source node is wanted to connect with destination node, source node is broadcast data packet RREQ in its transmission range first, then neighbor node judging its whether be qualified forward node, if not then packet discard RREQ, if it is connect with source node, this process is repeated until data packets to destination node.Obviously, present node will certainly select the node being positioned at present node negative sense transmission region as intermediate forwarding nodes when selecting down hop forward node, particularly in catenet, will cause the waste that Internet resources are unnecessary like this.The Routing Protocol LAODV that geographical location information is assisted once was suggested to address this problem, but it only have employed horizontal future value and goes to select next-hop node, and longitudinal future value also has impact to the selection of node, in addition, this agreement is easy to cause the malicious attack of selfish node due to the ability not investigating node for data forwarding bag.
How to select the path forwarding data bag that safe and reliable, and the consumption that can reduce Internet resources to greatest extent becomes the important topic in network safety filed.
Summary of the invention
The object of the invention is to solve existing method and there is the problem that the large and malicious node of routing cost attacks, network ruuning situation, the Security routing system of selection that a kind of geographical location information is auxiliary is provided, the geographical location information of faith mechanism and node combines by the method, simultaneously with trust value and future value for weighing the factor, solve existing method network resource consumption amount large, the drawbacks such as inner malicious node attack, achieve the reasonably optimizing configuration of whole Internet resources.
The creativeness of the inventive method is mainly manifested in: expand future value for two-dimentional variable, and combines with trust value, designs the choosing method of new down hop routing forwarding node, obtains the optimal path of present communications, completes the transmission of packet.
The Security routing system of selection that geographical location information provided by the invention is assisted comprises following steps:
The first, source node S broadcast route request packet RREQ in transmission range;
The second, the neighbor node X of source node S
1, X
2x
nafter receiving route request packet RREQ, to judge whether to meet in RREQ the requirement of entrained information, whether in the positive area of S, if so, then trust value C before calculating
x, if not, then packet discard RREQ;
Three, source node S selects C
xthe nodes X of ∈ [λ, 1]
1, X
2x
k, route request packet RREQ as intermediate forwarding nodes, and is passed to forward node X by k≤n
1, X
2x
k, jumping figure adds 1, and wherein λ is for choosing C
xminimum threshold, set flexibly by network concrete condition;
Four, forward node X
1, X
2x
kafter receiving route request packet RREQ, upgrade the positional information of the destination node in route request packet RREQ, now, forward node X
1, X
2x
kbe regarded as the source node of new round Route Selection, repeat first step until data packets is to destination node D, simultaneously, monitoring modular knows the evaluation of estimate of the forwarding behavior of node by supervisory channel, if node successfully forwarded packet, then trust value increases, on the contrary, if node does not have forwarding data bag, so this node is probably malicious node, and corresponding trust value reduces;
If the 5th destination node D receives first route request packet RREQ, wait for τ
dtime to obtain more RREQ, the paths that finally the total trust value of path selection is the highest from mulitpath as final data packet transmission path, wherein, τ
dset according to AODV Routing Protocol parameter and standard.
The form of first step route request packet RREQ of the present invention is:
RREQ (E
r, T
r, L
d, H
max, t
s), wherein, E
rrepresent the primary power of node, T
rrepresent the trust thresholding of node, L
drepresent the positional information of destination node, H
maxrepresent the maximum hop count in path, t
srepresent the settling time of route, source node is selected need judge whether its neighbor node meets the requirement of carry information in packet RREQ during down hop forward node.
Trust value C before second step of the present invention
xcomputational methods be:
1. the direction at selected destination node place is positive direction, be the line l of source node S and destination node D, cross the vertical line l' that S is l, the transmission range of source node S is divided into two regions by l', region in positive direction is just the positive area of S, delimiting positive area to ensure that data packet transmission goes ahead, the consumption of Internet resources can be reduced like this.
2. the neighbor node being positioned at source node S positive area calculates the two-dimentional future value be projected on line l: horizontal future value l
xwith longitudinal future value l
y, that is:
Wherein, X is a neighbor node of source node S, and d represents the distance between source node S and neighbor node X.
3. the comprehensive two-dimentional future value l of neighbor node of source node S positive area is positioned at
xand l
yobtain final future value L
x, L
x=α × l
x+ (1-α) × C × l
y, wherein, α is weight, α ∈ [0,1], and C is constant, final future value L
xlarger hop count is fewer, and the Internet resources of consumption are fewer;
4. in order to prevent the attack of inner malicious node, trust value T is introduced here
xscreening intermediate forwarding nodes, comprehensive trust value T
xwith two-dimentional future value L
xobtain final front trust value C
x, C
x=L
x× T
x, wherein, trust value T
xcomputational methods be: T
x=β × R
x+ (1-β) × Q
x, β is weight, β ∈ [0,1], R
xrepresenting indirect trust values, is the overall estimation value of neighbor node to the behavior evaluation of X of X, Q
xrepresenting direct trust value, is that the behavior of upper hop node to X of X directly observes evaluation of estimate.
The computational methods of the total trust value in the present invention the 5th footpath, step are:
The total trust value in path refers to the product of the trust value of all nodes on path.Such as, hypothesis goal node is at t
sestablish a paths in time, this path the node of process be S, X, Y, Z, D, so, total trust value T in this path
xYZD=T
x× T
y× T
z× T
d.
Advantage of the present invention and good effect
The invention discloses the Security routing system of selection that a kind of geographical location information is auxiliary, the geographical location information of faith mechanism and node combines by the method, when source node needs forwarding data bag, select to meet in the positive area of its transmission range trust value and two-dimentional future value entirety preferably node as down hop routing forwarding node, the invention solves existing method network resource consumption amount large, the drawbacks such as inner malicious node attack, achieve the reasonably optimizing configuration of whole Internet resources.
Accompanying drawing explanation
Fig. 1 is the Security routing system of selection flow chart that a kind of geographical location information disclosed by the invention is assisted;
Fig. 2 is node positive area schematic diagram involved in the present invention;
Fig. 3 is maximum future schematic diagram involved in the present invention;
Fig. 4 is the two-dimentional forward projection schematic diagram of a kind of improvement disclosed by the invention;
Fig. 5 is that destination node geographical location information involved in the present invention upgrades schematic diagram;
Fig. 6 is final routing resource schematic diagram involved in the present invention;
Fig. 7 is that in the embodiment of the present invention, the first hop node selects schematic diagram.
Fig. 8 be in the embodiment of the present invention source node to destination node Path selection schematic diagram.
Fig. 9 is the data packet number normalization comparison diagram of embodiment of the present invention interior joint broadcast;
Figure 10 is the total jumping figure comparison diagram in path in the embodiment of the present invention.
Figure 11 is the total trust value comparison diagram in path in the embodiment of the present invention.
Embodiment
Be described hereinafter with reference to Fig. 1-11 pairs of embodiments of the present invention.
For in Ad Hoc network two from away from node between communication, as shown in Figure 1, real network communication in, three problems must be solved: one is how source node chooses down hop forward node forwarding data bag RREQ; Two is the geographical location information how upgrading destination node; Three is when destination node receives mulitpath, how to choose a good paths transmission of information.
For problem one, source node selects the method for down hop forward node to comprise the following steps:
Step 1, source node be broadcast route request packet RREQ in its transmission range, and the form of packet RREQ is: RREQ (E
r, T
r, L
d, H
max, t
s), wherein, E
rrepresenting the primary power threshold value of node, is set according to the mean value of whole nodes energy, T
rrepresent the trust threshold value of node, we are with T
r=0.5 is boundary, and node trust value is lower than T
rjust think malicious node, L
drepresent the positional information of destination node, the generally application of navigation system node is known the geographical position of oneself becomes possibility, H
maxrepresent the maximum hop count in path, H
maxvalue be determined by the communication radius of network area size and node, t
srepresent the settling time of route, it artificially can be determined according to the actual conditions of network, also can set with reference to the parameter of traditional AODV Routing Protocol.
The neighbor node X of step 2, source node S
1, X
2x
nafter receiving packet RREQ, according to ENERGY E entrained in packet
rwith trust threshold T
rjudge whether neighbor node meets the demands, if met the demands, then continue to judge whether in the positive area of S, Fig. 2 is node positive area schematic diagram, that is: the direction at selected destination node place is positive direction, do the line of source node S and destination node D, be designated as l, cross the vertical line l' that S is l, the transmission range of source node S is divided into two regions by l', region in positive direction is just the positive area of S, region as shown in Fig. 2 solid line.
If step 3 neighbor node meets the demands and in positive area, then calculates front trust value C based on maximum future principle
x, if not, then packet discard RREQ.
1. maximum future principle as shown in Figure 3, and source node S is chosen at horizontal future value l on line l
xmaximum neighbor node as intermediate forwarding nodes, to guarantee that the path found is shortest path, wherein,
x is a neighbor node of source node S, and d represents the distance between source node S and neighbor node X.
2. present invention improves over maximum future principle, change one dimension variable into two-dimentional variable, because if two horizontal future value l of node
xthe same, so source node can select from l more close to node as down hop forward node.Therefore, we introduce longitudinal future value l
y, as shown in Figure 4, wherein,
comprehensive two-dimentional future value obtains the final future value L of neighbor node on l
x, L
x=α × l
x+ (1-α) × C × l
y, wherein, α is weight, and α ∈ [0,1], C is constant, projection value L
xlarger hop count is fewer, and the Internet resources of consumption are fewer;
3. in order to prevent the attack of inner malicious node, trust value T is introduced here
xscreening intermediate forwarding nodes, comprehensively these two factors obtain front trust value C
x, C
x=L
x× T
x, wherein, trust value T
xcomputational methods be: T
x=β × R
x+ (1-β) × Q
x, β is weight, β ∈ [0,1], R
xrepresenting indirect trust values, is the overall estimation value of neighbor node to the behavior evaluation of X of X, Q
xrepresenting direct trust value, is that the behavior of upper hop node to X of X directly observes evaluation of estimate.
Step 4, source node S select C
xthe nodes X of ∈ [λ, 1]
1, X
2x
k, route request packet RREQ as intermediate forwarding nodes, and is passed to forward node X by k≤n
1, X
2x
k, jumping figure adds 1, and wherein λ is for choosing C
xminimum threshold, its value is artificially set by network concrete condition, if distribute in comparatively intensive network environment at network node, for ensureing the low consumption of path safety and Internet resources, the desirable slightly large value of λ, that is: λ>=0.5, if interstitial content is less, for finding an available route, the value of λ can mutually deserved minimizing.
For problem two, the method upgrading destination node geographical location information is:
Due to the mobility of Ad Hoc network node, the geographical location information of destination node is upgraded becomes a necessity.Fig. 5 is destination node updating location information schematic diagram, supposes to there is t in the list of source node S positional information
0the destination node active position information that moment upgrades, if at t
1> t
0moment node S' needs to communicate with node D, then Node B can be sent to the RREP grouping of S' from node D and obtain node D at t
2> t
1the renewal positional information in moment.So when node S is at t
3moment needs communicate with node D, and without available route and t in routing table
3-UT (D) < T, UT (D) represent the updating location information time about node D that node stores, and T represents the effective life span of positional information.Then S by node D at t
0the positional information that moment upgrades is inserted in RREP grouping, when the RREQ grouping that S sends is forwarded to Node B in greedy mode, obviously, by force ageing than in RREQ of the positional information of the node D that Node B stores, then utilize the positional information of renewal to replace respective selection in RREQ.
For problem three, when destination node receives mulitpath, the method choosing final path is:
When destination node D receives first packet, first wait for τ
dif do not had, then destination node sent RREP along original route and transmitted data to source node S to set up a paths to receive more packet time, if there is the packet of unnecessary to arrive, then destination node selects final path according to total trust value of every paths, wherein, and τ
dwith reference to the setting of AODV Routing Protocol parameter and standard.
The total trust value in path refers to the product of the trust value of all nodes on path, and hypothesis goal node is at t
sestablish a paths in time, this path the node of process be S, X, Y, Z, D, so, total trust value T in this path
xYZD=T
x× T
y× T
z× T
d.As shown in Figure 6, hypothesis goal node have received three packet RREQ, namely establishes three paths, respectively: S → X in system of selection
1→ X
2→ X
3→ D, S → Y
1→ Y
2→ D, S → Z
1→ Z
2→ Z
3→ D, and total trust value of three paths is respectively: T
x=0.4096, T
y=0.512, T
z=0.3072, can find out, total trust value in Article 2 path is the highest, and at this time, destination node can select Article 2 path to pass RREP back to set up safest path, that is: a D → Y
3→ Y
2→ Y
1→ S.The wasting of resources situation that multipath route effectively can be avoided causing again initiation path finding process due to path fracture and produce, as shown in Figure 7, if Article 2 path S → Y
1→ Y
2→ Y
3→ D ruptures, and node can send one and accept failed message to destination node, and destination node then can retransfer along Article 1 path RREP, that is: D → X
3→ X
2→ X
1→ S, owing to need not again initiate path finding process, effectively can save Internet resources like this.
The present invention with the Ad hoc network of energy heterogeneous for embodiment is described in detail.Optimum configurations is: network area size is 1000m × 1000m, node number N=55, node communication radius=125m, the highest jumping figure H
max=7, λ=0.3, in having, the node number of low trust value is n, wherein, low trust value node number is [0.67 × n], and their trust value is randomly dispersed in [0,0.3), and middle trust value node number is [0.33 × n], and their trust value is randomly dispersed in [0.3,0.8), the node number with high trust value is 55-n, their trust value is randomly dispersed in [0.8,1), trust threshold value is T=0.5, and primary power threshold value is E
r=0.5, τ
d=3s, node motion speed is v ∈ [0,1] m/s, and each run, node is random distribution in region.
One, source node selects first to jump forward node:
Source node broadcast data packet RREQ (E
r, T
r, L
d, H
max, t
s), neighbor node inquires about oneself routing table after receiving RREQ, see the requirement whether meeting energy and trust value, if meet, continues to judge neighbor node whether in the positive area of source node, if, then calculate C
x, finally, source node selects C
xnode in [0.3,1] is as intermediate forwarding nodes.First jumps forwarder selection schematic diagram as shown in Figure 7, and wherein, the trust value of two selected nodes is respectively: 0.86,0.84, energy value is respectively: 0.62,0.85, and their coordinate figure is respectively (362.98,654.96), (374.87,735.15), C
xvalue be respectively: 0.69,0.32.
Two, source node is to the coordinates measurement of destination node:
Repeat the choosing method of first step, until generate one or more path of source node to destination node, Path selection schematic diagram as shown in Figure 8, because each run node all redistributes, so coordinates measurement figure does not continue Fig. 7, but restart to select, but system of selection is identical.
Three, the data packet broadcast sum caused is set up in path:
Due to method of the present invention by the selectional restriction of node in positive area, and in conjunction with trust value screening intermediate forwarding nodes, the malicious attack of internal node can be avoided, can effectively reduce data packet broadcast quantity again, reduce the consumption degree of Internet resources.The data packet number comparison diagram of node broadcasts as shown in Figure 9, compare with BAR, quantity of broadcast greatly reduces, compare with LAODV, the reason that broadcasting amount is high is: LAODV only selects future to be worth a maximum node as intermediate forwarding nodes at every turn, but LAODV can not prevent the attack of inner malicious node.
Four, the total jumping figure of route:
As shown in Figure 10, the present invention is with reference to final future value L for the total jumping figure comparison diagram in path
xwith trust value T
xselect each to jump forward node, and the mode that BAR directly broadcasts contrasts, jumping figure reduces, and compares with LAODV, and the reason that jumping figure increases is: LAODV chooses horizontal future value l
xmaximum node is as intermediate forwarding nodes, and jumping figure is relatively less.
Five, the final trust value in path:
The total trust value comparison diagram in path as shown in figure 11, BAR chooses intermediate forwarding nodes based on trust value, the present invention select to meet trust value and two-dimentional future value entirety preferably node as down hop routing forwarding node, the total trust value in path is because the present invention have chosen the larger node of two-dimentional future value lower than BAR, that total trust value increases because hop count of the present invention reduces higher than BAR.The present invention is compared with LAODV, and the total trust value in path is always high is because LAODV only selects forward node with reference to future value, does not consider the ability of node for data forwarding bag.
Claims (4)
1. the Security routing system of selection that geographical location information is auxiliary, it is characterized in that, described method comprises following steps:
The first, source node S broadcast route request packet RREQ in transmission range;
The second, the neighbor node X of source node S
1, X
2x
nafter receiving route request packet RREQ, to judge whether to meet in RREQ the requirement of entrained information, whether in the positive area of source node S, if so, then trust value C before calculating
x, if not, then packet discard RREQ;
Three, source node S selects C
xthe nodes X of ∈ [λ, 1]
1, X
2x
k, route request packet RREQ as intermediate forwarding nodes, and is passed to forward node X by k≤n
1, X
2x
k, jumping figure adds 1, and wherein λ is for choosing C
xminimum threshold;
Four, forward node X
1, X
2x
kafter receiving route request packet RREQ, upgrade the positional information of the destination node in route request packet RREQ, now, forward node X
1, X
2x
kbe regarded as the source node of new round Route Selection, repeat first step until data packets is to destination node D, simultaneously, monitoring modular knows the evaluation of estimate of the forwarding behavior of node by supervisory channel, if node successfully forwarded packet, then trust value increases, on the contrary, if node does not have forwarding data bag, so this node is probably malicious node, and corresponding trust value reduces;
If the 5th destination node D receives first route request packet RREQ, wait for τ
dtime to obtain more RREQ, the paths that finally the total trust value of path selection is the highest from mulitpath as final data packet transmission path, wherein, τ
dset according to AODV Routing Protocol parameter and standard.
2. method according to claim 1, is characterized in that, the form of first step route request packet RREQ is:
RREQ (E
r, T
r, L
d, H
max, t
s), wherein, E
rrepresent the primary power threshold value of node, T
rrepresent the trust threshold value of node, L
drepresent the positional information of destination node, H
maxrepresent the maximum hop count in path, t
srepresent the settling time of route, source node is selected need judge whether neighbor node meets the requirement of carry information in route request packet RREQ during down hop forward node.
3. method according to claim 1, is characterized in that, trust value C before described in second step
xcomputational methods be:
1. the direction at selected destination node place is positive direction, be the line l of source node S and destination node D, cross the vertical line l' that S is l, the transmission range of source node S is divided into two regions by l', region in positive direction is just the positive area of S, delimiting positive area to ensure that data packet transmission goes ahead, the consumption of Internet resources can be reduced like this;
2. the neighbor node being positioned at source node S positive area calculates the two-dimentional future value be projected on line l: horizontal future value l
xwith longitudinal future value l
y, that is:
Wherein, X is a neighbor node of source node S, and d represents the distance between source node S and neighbor node X;
3. the comprehensive two-dimentional future value l of neighbor node of source node S positive area is positioned at
xand l
yobtain final future value L
x, L
x=α × l
x+ (1-α) × C × l
y, wherein, α is weight, α ∈ [0,1], and C is constant, final future value L
xlarger hop count is fewer, and the Internet resources of consumption are fewer;
4. in order to prevent the attack of inner malicious node, trust value T is introduced here
xscreening intermediate forwarding nodes, comprehensive trust value T
xwith two-dimentional future value L
xobtain final front trust value C
x, C
x=L
x× T
x, wherein, trust value T
xcomputational methods be: T
x=β × R
x+ (1-β) × Q
x, β is weight, β ∈ [0,1], R
xrepresenting indirect trust values, is the overall estimation value of neighbor node to the behavior evaluation of X of X, Q
xrepresenting direct trust value, is that the behavior of upper hop node to X of X directly observes evaluation of estimate.
4. method according to claim 1, is characterized in that, the computational methods of the 5th total trust value in footpath, step are:
The total trust value in path to refer on a paths through the product of the trust value of node, hypothesis goal node is at t
sestablish a paths in time, this path the node of process be S, X, Y ..., D, so, total trust value T in this path
sD=T
x× T
y× ... × T
d.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510210675.3A CN104901885B (en) | 2015-04-28 | 2015-04-28 | A kind of Security routing system of selection of geographical location information auxiliary |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510210675.3A CN104901885B (en) | 2015-04-28 | 2015-04-28 | A kind of Security routing system of selection of geographical location information auxiliary |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104901885A true CN104901885A (en) | 2015-09-09 |
| CN104901885B CN104901885B (en) | 2018-03-09 |
Family
ID=54034285
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510210675.3A Expired - Fee Related CN104901885B (en) | 2015-04-28 | 2015-04-28 | A kind of Security routing system of selection of geographical location information auxiliary |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104901885B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108124274A (en) * | 2017-12-11 | 2018-06-05 | 重庆邮电大学 | A kind of wireless sensor network security method for routing based on faith mechanism |
| CN109714821A (en) * | 2017-10-23 | 2019-05-03 | 深圳市优必选科技有限公司 | The selection method and device of wireless location ranging base station |
| CN110493847A (en) * | 2019-01-17 | 2019-11-22 | 天津理工大学 | A kind of the determination method and SAODV method for routing of intermediate forwarding nodes |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110170443A1 (en) * | 2010-01-13 | 2011-07-14 | Ronald Gerald Murias | Link sensitive aodv for wireless data transfer |
-
2015
- 2015-04-28 CN CN201510210675.3A patent/CN104901885B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110170443A1 (en) * | 2010-01-13 | 2011-07-14 | Ronald Gerald Murias | Link sensitive aodv for wireless data transfer |
Non-Patent Citations (5)
| Title |
|---|
| CHARLES EDWARD PERKINS ECT.: ""Ad hoc On-Demand Distance Vector (AODV) Routing"", 《IETF RFC》 * |
| 吴克军等: ""一种位置信息辅助的Ad Hoc网络按需距离矢量路由协议"", 《电子学报》 * |
| 吴银锋等: ""基于节点信任值的无线传感器网络安全路由"", 《仪器仪表学报》 * |
| 孙苏等: ""基于信任评估的Ad hoc网络安全路由协议"", 《计算机工程》 * |
| 詹鹏飞等: ""移动Ad hoc 网络AODV 路由协议安全性分析和改进"", 《计算机应用》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109714821A (en) * | 2017-10-23 | 2019-05-03 | 深圳市优必选科技有限公司 | The selection method and device of wireless location ranging base station |
| CN109714821B (en) * | 2017-10-23 | 2020-09-29 | 深圳市优必选科技有限公司 | Method and device for selecting wireless positioning and ranging base station |
| CN108124274A (en) * | 2017-12-11 | 2018-06-05 | 重庆邮电大学 | A kind of wireless sensor network security method for routing based on faith mechanism |
| CN110493847A (en) * | 2019-01-17 | 2019-11-22 | 天津理工大学 | A kind of the determination method and SAODV method for routing of intermediate forwarding nodes |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104901885B (en) | 2018-03-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103476086B (en) | Dynamic multi-path AODV method for routing based on the prediction of node congestion degree | |
| US8559293B2 (en) | Wireless communication apparatus, wireless communication network and method of controlling routing selection | |
| CN111741448B (en) | Clustering AODV (Ad hoc on-demand distance vector) routing method based on edge computing strategy | |
| CN107612914B (en) | Ad Hoc network security trust method based on reference node strategy | |
| CN102131269A (en) | Geographical-position-based routing method in wireless mesh network | |
| CN103856399B (en) | Ad Hoc backup route algorithm based on stability | |
| CN103200643A (en) | Distributed fault-tolerant topology control method based on dump energy sensing | |
| Hussain et al. | Minimizing broadcast expenses in clustered ad-hoc networks | |
| Liu et al. | An efficient load balancing scheme for multi-gateways in wireless mesh networks | |
| CN104349418A (en) | Rapid routing transmission method for data in wireless sensor network facing sudden events | |
| CN104901885A (en) | Geographical location information-aided secure route selection method | |
| CN102781060B (en) | A kind of method, forward node and wireless network realizing route in the wireless network | |
| CN108834100A (en) | A kind of efficient broadcast routing method | |
| Mu et al. | Performance analysis of the ZigBee networks in 5G environment and the nearest access routing for improvement | |
| CN103108372A (en) | Interference sensing cross-layer routing method based on node sending and receiving capacity | |
| CN108768852B (en) | Opportunistic routing method based on multi-copy congestion avoidance in Internet of vehicles | |
| CN102083164A (en) | Method for opportunistic routing of wireless sensor network (WSN) based on energy perception | |
| Abuashour | An efficient Clustered IoT (CIoT) routing protocol and control overhead minimization in IoT network | |
| CN104053208B (en) | Method for routing based on channel distribution, device in wireless self-networking | |
| CN109379283A (en) | Self-organized network communication method, apparatus and ad hoc network based on Internet of Things heterogeneous device | |
| CN102076049B (en) | Routing method based on energy balancing of potential energy field | |
| Liu et al. | Research of QoS-aware routing protocol with load balancing for mobile ad hoc networks | |
| Sultan et al. | Evaluation of energy consumption of reactive and proactive routing protocols in MANET | |
| Jain et al. | Energy efficient local route repair multicast AODV routing schemes in wireless ad hoc network | |
| CN103607748A (en) | Maximum lifetime routing method based on node lifetimes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180309 Termination date: 20200428 |