CN100448232C - Method of fair cooperative enhancement mechanism for ad hoc network - Google Patents
Method of fair cooperative enhancement mechanism for ad hoc network Download PDFInfo
- Publication number
- CN100448232C CN100448232C CNB2006100780259A CN200610078025A CN100448232C CN 100448232 C CN100448232 C CN 100448232C CN B2006100780259 A CNB2006100780259 A CN B2006100780259A CN 200610078025 A CN200610078025 A CN 200610078025A CN 100448232 C CN100448232 C CN 100448232C
- Authority
- CN
- China
- Prior art keywords
- node
- route
- energy
- network
- neighbor
- 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.)
- Expired - Fee Related
Links
Images
Classifications
-
- Y—GENERAL 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
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The present invention relates to a method of a fair cooperative intensifying mechanism applied to an ad hoc network. By a system of neighbor cooperative monitoring and credit evaluation, the present invention effectively punishes selfish nodes and intensifies the cooperation of nodes; when the residual energy of the nodes at the hot points is not enough, the present invention can protect the nodes in routing, namely, routes through the nodes at the hot points can be prevented from being selected, and thus, the working time of the nodes at the hot points is prolonged, and the survival time of the whole network is also prolonged, so the total throughput of the network is enhanced, and the fairness of the network is guaranteed. A trust mechanism is established by parameters such as credit values, on-line time, etc., and the nodes only protect trusty neighbor nodes with low energy on routes.
Description
Technical field
The present invention relates to a kind of method of fair cooperative enhancement mechanism of the ad of being applied to hoc network.The present invention is applicable to the wireless network application, is particularly useful for wireless ad hoc network application field.
Background technology
Mobile ad hoc network (MANET) is the provisional network that does not rely on any static infrastructure, adopt the self-organizing mode to communicate, ad Hoc network has obtained the extensive concern of international academic community and industrial quarters at present, and obtaining more and more widely application, become the important directions that mobile communication technology advances, and will in the communication technology in future, occupy critical role.But, be necessary between the node to support mutually and help and to be given to impact point before the packet data package because each mobile node wireless transmission distance is limited.When critical network functions such as execution packet forward and route, ad hoc network node is fly-by-night.Certainly, during some minority is used,, have network management mandate general, that trusted, but it needs tamper resistant hardware to realize important management function as military network and Intranet.And in the open environment as MANET, the general mandate of supervising the network does not exist, so any node of ad hoc network all may threaten the reliability of basic functions such as route.
Ad hoc network with have infrastructure (as the base station) network different, its basic network function (as packet forward and route) can be realized by all enabled nodes in the network.This just needs cooperating with each other between all nodes, and especially lack energy content of battery resource in the environment resemble MANET, thereby the novel node bad behavior at ad hoc network has just occurred, and we are called " the selfish behavior of node " behavior of this shortage cooperation.Usually, a selfish node can not want to adopt active attack directly to destroy other nodes (main because consider that from the energy consumption angle cost of active attack is higher), but it only is used for the communication of oneself in order to guarantee the energy content of battery, can be by not participating in Routing Protocol simply or not carrying out the operate as normal that packet forward (being also referred to as black hole attack) is destroyed network.Consider from another point of view, during the grouping of Ad hoc forwarded,, generally all adopt the scale of measurement of minimum hop count as route no matter adopt which kind of Routing Protocol.Some node in the network may become hotspot location under these circumstances.These are in the node of hotspot location owing to transmit big and other nodes of the possibility of data, therefore the energy consumption of hotspot location node is generally fast than node (for example being in the node of the network boundary) energy consumption of non-hotspot location, when the depleted of energy of certain hot node in the network, may cause that network is divided into several parts, make network topological diagram become a unconnected graph, cause the quick decline of network performance, even cause network paralysis, each node can't be communicated by letter normally.Hot node faces two selections in this case, or becomes " selfish node ", or energy depletes very soon, and these all are unfavorable for the fair cooperation of network.
The selfish behavioral problem of node has caused researcher's attention recently.In MANET, strengthen cooperative mechanism and can be divided into two classes: the first kind is based on currency, and second class has been used the native monitoring technology.System's realization based on currency is very simple, but need depend on anti-tamper hardware.The major defect of this method is that to set up the transaction of ideal money less feasible in reality system.Cooperative security scheme based on native monitoring provides more suitably selfish issue-resolution, monitors its local neighbours by each node among the MANET, and assessment is made in the behavior of neighbor node.Based on evaluation criteria, selfish node can isolate from network gradually.The major defect of this research method is the security mechanism that lacks relevant recognition network node, and any selfish node just can be hidden cooperative enhancement mechanism by the identity that changes it and get away with.But in the node cooperative enhancement mechanism that has proposed at present, all do not consider hot node energy consumption problem, just lack the combination that network energy is consumed fairness and node cooperation enhancing.
Summary of the invention
In order to overcome the deficiency of existing technology, the invention provides a kind of method of fair cooperative enhancement mechanism of the ad of being applied to hoc network, solve ad hoc network selfish node and energy consumption fairness problem.
The technical solution adopted for the present invention to solve the technical problems is:
The present invention proposes a kind of fair cooperative enhancement mechanism of ad hoc network based on node energy and neighbours' monitoring.
The Routing Protocol that adopts among the present invention is improved DSR (DSR) agreement, and promptly intermediate node can be made Route Selection to the different neighbor node of energy value.Consider when the dump energy of the node that be in hotspot location not for a long time, can carry out certain protection when the route for hot node, prolong the operating time of hot node, thereby the life span that has prolonged whole network has improved the total throughout of network.To consider that in addition some malicious node may make a false report the energy content of battery, pretend to be hot node to avoid punishment to its selfish behavior.This can solve by the mechanism of breaking the wall of mistrust, and other information of utilizing popularity information in the popularity system that cooperation strengthens and node by its neighbor node are only carried out certain protection on the route to hot node trusty as the judgement foundation of trusting.
The method that fair cooperation of the present invention strengthens security mechanism comprises following plurality of processes step:
Step 1, neighbor node determine the net time, each node all to write down its neighbor node in the net time, as one of judgment condition of node trust mode;
Step 2, neighbours' cooperation monitoring and popularity evaluation, each nodes ' behavior and detection are from the attack of bad node in the monitoring network, behavior by the fame evaluation node, when the node fame is lower than threshold value, assert that then it is a selfish node, it is isolated in outside the network, and the notice neighbor node, also can be trust mode in addition " popularity " this judgment condition is provided;
Step 3, the pattern that breaks the wall of mistrust are carried out route protection, according to fame, claim at parameter decisions such as net times whether the low neighbor node of energy can trust, and node only carries out certain protection on the route to its low-yield neighbor node trusty.
The invention has the beneficial effects as follows,
1, set up trusted mechanism, the fame by obtaining in neighbours monitoring and the popularity evaluation system, the net time as predicate node foundation trusty, make a false report the energy content of battery and escape problem thereby can solve the malicious node utilization its selfish behavior punishment.
2, the popularity mechanism of having considered node energy is in the punishment selfish node, carries out protection on the route to being in hotspot location and node trusty, and the life span that has prolonged network has improved the total throughout of network.
3, the good node of the behavior that is in hotspot location is protected, thereby guaranteed the fairness of network.
Description of drawings
The present invention is further described below in conjunction with drawings and Examples.
There is the network topology structure of hot node in Fig. 1;
Fig. 2 network is by the topological structure after cutting apart;
Fig. 3 faith mechanism and route protection.
Embodiment
Step 1, neighbor node are determined the net time;
For determine neighbor node in the net time, each node is broadcast transmission HELLO message periodically, and the information that interconnects with adjacent node is provided.The life span TTL of HELLO message is made as 1, makes this transmission of news be limited between sending node and the adjacent node.
If the time of node periodic broadcast HELLO message is T, then the broadcasting of HELLO message can be divided into two kinds of situations:
1) as if the grouping that does not need in T time interior nodes to send, then sends HELLO message separately
2) if in T time interior nodes the grouping that need to send is arranged, then HELLO message joins in the grouping and sends together, after the neighbor node of receiving grouping reads HELLO message, on request grouping is handled again.
A node is received the HELLO message of neighbor node at every turn, and then this neighbor node that this node write down just correspondingly adds 1 in the net time.When surpass certain hour (＞3T) also do not receive HELLO message, think that then neighbor node leaves.
Step 2, neighbours' cooperation monitoring and popularity evaluation;
The popularity of neighbor node is defined as follows in the popularity system: a kind of simple defining that is incorporated herein node popularity.Suppose that nodes X is the neighbours of node N, before definition popularity, define two variable R F earlier
N(X) and HF
N(X), implication is as follows:
RF
N(X) (Request-for-Forwarding): node N has been transferred to the sum that neighbor node X requires the grouping of X forwarding.
HF
N(X) (Has-Forwarded): the sum of the grouping of having transmitted by nodes X that monitors by node N.
If RF
N(X) and HF
N(X) these two values are known by neighbours' cooperation monitoring, and node N just can calculate the fame of neighbor node X and is so
R
N(X)＝HF
N(X)/RF
N(X)。
0≤R as can be known
NAnd R (X)≤1,
N(X) value is more near 1, and it is good more then to show in the behavior of node N nodes X, and ideal situation is to equal 1, if R
N(X)=1, show that then nodes X transmitted the grouping that all need its to transmit.
If threshold value is θ
1(0＜θ
1＜1), if the node fame that calculates less than threshold value θ
1, assert that then this node is selfish node, wherein θ
1Value be to set according to the concrete condition of network and to the specific requirement of network performance, visible in different networks θ
1Value also be different.When the resource of most of node in the network is all hanged down than abundance or to performance index requirements, θ
1It is smaller relatively that value can be set; And all compare nervous or to whole performance index requirements when higher when the resource of most of node in the network, θ
1It is big relatively that value can be set.
For being judged as selfish neighbor node, they are transmitted by other node refusals as the meeting in group that source node produces, and have limited the communication of selfish node thus.
Step 3, the pattern that breaks the wall of mistrust are carried out route protection;
Trust mode is used for judging to claim whether the low neighbor node of energy can trust, only when claiming that the low neighbor node of own energy is trusted, just can carry out certain protection on the route to such node.
Trust mode can be described as: neighbor node (fame is in the net time).Claim that the low neighbor node of own energy can be trusted when satisfying arbitrary condition of following 2 kinds of conditions:
1) fame＞θ
1, at net time＞T
22) fame＞θ
2, at net time＞T
1Requirement to the parameter value selection: 0＜θ
1＜θ
2＜θ
3≤ 1,0＜T
1＜T
2
Specific explanations is: condition 1 for fame be not very high, just surpass the neighbor node of selfish node threshold value, require it longer in the net time; Condition 2 requires its fame higher for not being very long neighbor node in the net time.
If hot node is P, the neighbor node of P is H, and P is not the node that newly adds network, network topology as shown in Figure 1, and establish H and read at a time that the data about P are fame θ in the trust mode, in the net time T, then H judges whether P is that process trusty is as follows:
If θ＜θ
1P is selfish and trustless so
Otherwise (if θ＜θ
2
If (T＞T
2P trusted so
Otherwise P is trustless)
Otherwise (if T＞T
1P trusted so
Otherwise P is trustless))
In order to carry out protection on the route to the bigger neighbor node of energy consumption, promptly reduce as far as possible be transmitted to it by this neighbor node and destination node be not its grouping, this just need improve present DSR Routing Protocol.With following simple ad hoc network is the improvement that example explanation DSR Routing Protocol need be done: intermediate node can be made Route Selection to the different node of energy value.
Network topological diagram such as accompanying drawing 1, source node are S, and destination node is D, and S-H-P-D is two different routes from source node S to destination node D with S-H-A-B-D.
Because the jumping figure of route S-H-P-D lacks than the jumping figure of route S-H-A-B-D; so the grouping according to present DSR Routing Protocol from source node S to destination node D all is to select article one route; and other source nodes are (as C; E etc.) grouping also can be transmitted via P; in this case; P is exactly a hot node; its energy can very fast consumption light; at this moment network is split into several parts (as accompanying drawing 2); can not communicate by letter normally; be not wish the worst result that occurs; if by the neighbor node H of hot node P P is carried out on the route to a certain degree protection, will avoid this result's appearance.
P adds the low message of energy value of oneself in replying to the route replies information of H, to add the residual energy value of oneself simultaneously, can select the route at the more node place of dump energy to transmit grouping according to energy value so that there is not only a node claim when energy is low.H judges P according to the data in the trust mode, if P is trusty, H is not included the routing iinformation of H-P-D when replying to the route replies information of S so, and only the routing iinformation of H-A-B-D is replied to S, to D, the energy consumption of hot node P will obtain alleviation to a certain degree with the route transmission of S-H-A-B-D in the grouping of S like this.
Can summarize by top example, if will in the cooperation enhanced scheme, consider the energy of node, in steps to the improvement of DSR Routing Protocol:
1) node can be told the energy of neighbor node oneself low, ask the neighbor node protection by the mode of additional own residual energy value in route replies information more after a little while in dump energy; And the protection of whether this node being carried out on the route is to be judged by trust mode by neighbor node, node trusty is carried out route protection, and fly-by-night node is not protected.
2) only exist under the situation of a route for arriving destination node,, when its energy is low, it is not carried out route protection no matter whether node can trust.
3) for there being plural node to claim that all own energy is low, and under the situation all trusty, if there are other available routes, then select not have the route of the low node of energy, if there is no other route is then all claimed at these and is selected the route at the higher relatively node place of residual energy value to carry out transmission packets in low node of energy.
The flow chart of faith mechanism and route protection is seen accompanying drawing 3.If P is a hot node in the ad hoc network, H is the neighbor node of P.Node P by one section at net after the time, energy can consume a lot, if P finds its energy residue seldom, P can add the energy value of oneself in replying to the route replies information of H, and claims that own energy is low.H judges P according to the data in the trust mode; if P is fly-by-night; then do not consider to protect the route of P; if P is trusty; then H searches and whether has the alternative route that arrives the destination; if there is no; the energy value of claiming of then also not considering P hangs down information; if there is alternative route; and do not exist on the alternative route and need the low-yield node of other trusteds of route protection equally; though perhaps there is low-yield node, the energy value of P is lower, just more needs to be subjected to route protection; H will not included through the routing iinformation of P when replying to the route replies information of its neighbor node so; and only report alternative routing iinformation, grouping is through substituting route transmission, makes the energy consumption of hot node P obtain to a certain degree alleviation.Have low-yield node Q if substitute on the route, Q is lower than the energy value of P, and then the Q node more needs protection, and at this moment, H can ignore the information that P claims that energy is low too, carries out route replies according to the minimum hop count principle.
Though not considering the popularity mechanism of node energy can punish selfish node effectively, strengthen the node cooperative, but owing to got rid of the route of selfish node, make that behavior is good and be in the energy consumption of node of hotspot location faster, network will be paralysed after energy consumption finishes.Pass through said process; considered that the popularity mechanism of node energy can carry out protection on the route, the life span that has prolonged network to being in hotspot location and node trusty in the punishment selfish node; improve the total throughout of network, guaranteed the fairness of network.
Claims (2)
1. a method that is applied to the fair cooperative enhancement mechanism of ad hoc network is characterized in that: comprise the steps:
Step 1, neighbor node determine the net time, each node all to write down its neighbor node in the net time, as one of judgment condition of node trust mode;
Step 2, neighbours' cooperation monitoring and popularity evaluation, the bad selfish behavior of each node in the monitoring network, behavior by the fame evaluation node, when the node fame is lower than threshold value, assert that then it is a selfish node, it is isolated in outside the network, and the notice neighbor node, also provide " popularity " this judgment condition in addition for trust mode;
Step 3, the pattern that breaks the wall of mistrust, carry out route protection, according to fame, judge to claim whether the low neighbor node of energy can trust at the net time parameter, node only carries out protection on the route to its low-yield neighbor node trusty.
2. a kind of method that is applied to the fair cooperative enhancement mechanism of ad hoc network according to claim 1 is characterized in that:
1) node can be told the energy of neighbor node oneself low, ask the neighbor node protection by the mode of additional own residual energy value in route replies information more after a little while in dump energy; And the protection of whether this node being carried out on the route is to be judged by trust mode by neighbor node, node trusty is carried out route protection, and fly-by-night node is not protected;
2) only exist under the situation of a route for arriving destination node,, when its energy is low, it is not carried out route protection no matter whether node can trust;
3) for there being plural node to claim that all own energy is low, and under the situation all trusty, if there are other available routes, then select not have the route of the low node of energy, if there is no other route is then all claimed at these and is selected the route at the higher relatively node place of residual energy value to carry out transmission packets in low node of energy.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100780259A CN100448232C (en) | 2006-04-30 | 2006-04-30 | Method of fair cooperative enhancement mechanism for ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100780259A CN100448232C (en) | 2006-04-30 | 2006-04-30 | Method of fair cooperative enhancement mechanism for ad hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1832459A CN1832459A (en) | 2006-09-13 |
| CN100448232C true CN100448232C (en) | 2008-12-31 |
Family
ID=36994463
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100780259A Expired - Fee Related CN100448232C (en) | 2006-04-30 | 2006-04-30 | Method of fair cooperative enhancement mechanism for ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100448232C (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101170410B (en) * | 2007-09-29 | 2010-08-04 | 华中科技大学 | A method and device for enhancing Ad hoc network security and cooperation mechanism |
| CN101969647B (en) * | 2010-09-10 | 2013-03-06 | 南京邮电大学 | Trust model-based cooperative communication method in mobile self-organized network |
| CN102026173A (en) * | 2010-12-03 | 2011-04-20 | 北京航空航天大学 | Cooperation enhancement method for resisting selfish behavior of node |
| CN102857922B (en) * | 2012-09-21 | 2015-06-17 | 北京航空航天大学 | Detection method for selfish node of wireless multi-hop network based on percolation theory |
| CN104838676B (en) * | 2012-12-06 | 2018-05-29 | 富士通株式会社 | Communicator, system and communication means |
| CN106060890B (en) * | 2016-07-29 | 2019-10-22 | 北京智芯微电子科技有限公司 | A kind of path selecting method and device based on reputation value |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1741527A (en) * | 2005-09-23 | 2006-03-01 | 北京交通大学 | Method for applying cooperative enhancement mechanism to adhoc network |
-
2006
- 2006-04-30 CN CNB2006100780259A patent/CN100448232C/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1741527A (en) * | 2005-09-23 | 2006-03-01 | 北京交通大学 | Method for applying cooperative enhancement mechanism to adhoc network |
Non-Patent Citations (6)
| Title |
|---|
| core:a collaborative reputation mechanism to enforce nodecooperation in mobile ad hoc network. Pietro Michiardi,Refik Molva.communications and multimedia security conference. 2002 |
| core:a collaborative reputation mechanism to enforce nodecooperation in mobile ad hoc network. Pietro Michiardi,Refik Molva.communications and multimedia security conference. 2002 * |
| Mitigating routing misbehavior in mobile ad hoc networks. Sergio Marti,T. J. Giuli, Kevin Lai and Mary Baker.Proceedings of the 6th annual international conference on Mobile computing and networking. 2000 |
| Mitigating routing misbehavior in mobile ad hoc networks. Sergio Marti,T. J. Giuli, Kevin Lai and Mary Baker.Proceedings of the 6th annual international conference on Mobile computing and networking. 2000 * |
| 一种解决ad hoc网络中自私节点安全问题的方法. 吴昊，郑志彬.电子学报，第33卷第12A期. 2005 |
| 一种解决ad hoc网络中自私节点安全问题的方法. 吴昊，郑志彬.电子学报，第33卷第12A期. 2005 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1832459A (en) | 2006-09-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Subahi et al. | Packet Drop Battling Mechanism for Energy Aware Detection in Wireless Networks. | |
| Mahmood et al. | A hybrid trust management heuristic for VANETs | |
| CN100493088C (en) | Method for applying cooperative enhancement mechanism to adhoc network | |
| CN100448232C (en) | Method of fair cooperative enhancement mechanism for ad hoc network | |
| Kukreja et al. | Power aware malicious nodes detection for securing MANETs against packet forwarding misbehavior attack | |
| Mohammadi et al. | Defending against flooding attacks in mobile ad-hoc networks based on statistical analysis | |
| Li et al. | A hierarchical account-aided reputation management system for large-scale MANETs | |
| Bala et al. | An enhanced intrusion detection system for mobile ad-hoc network based on traffic analysis | |
| Nandi et al. | An optimized and hybrid energy aware routing model for effective detection of flooding attacks in a manet environment | |
| Hatware et al. | Detection of misbehaving nodes in ad hoc routing | |
| Roy et al. | BHIDS: a new, cluster based algorithm for black hole IDS | |
| Guo et al. | HEAD: a hybrid mechanism to enforce node cooperation in mobile ad hoc networks | |
| Al-Shakarchi et al. | A survey of selfish nodes detection in MANET: solutions and opportunities of research | |
| Rebahi et al. | SAFE: Securing pAcket Forwarding in ad hoc nEtworks | |
| Balakrishnan et al. | Packet drop attack: A serious threat to operational mobile ad hoc networks | |
| Sherif et al. | Detection and Isolation of Selfish Nodes in MANET Using Collaborative Contact-Based Watchdog with Chimp-AODV | |
| Srividya et al. | A trusted approach for prediction of data link failure and intrusion detection in wireless sensor networks | |
| Yu-Quan et al. | A new routing protocol for efficient and secure wireless sensor networks | |
| Rajesh et al. | Multilevel trust architecture for mobile adhoc networks based on context-aware | |
| Subha et al. | Adaptive fuzzy logic inspired path longevity factor-based forecasting model reliable routing in MANETs | |
| Ghandar et al. | Performance analysis of observation based cooperation enforcement in ad hoc networks | |
| Chou et al. | Mitigating routing misbehavior in Dynamic Source Routing protocl using trust-based reputation mechanism for wireless ad-hoc networks | |
| Niaz et al. | Discovering Non-Cooperating Nodes by Means of Learning Automata in the Internet of Things | |
| Shah et al. | A survey of various energy efficient secure routing approaches for wireless ad-hoc networks | |
| Venkataraman et al. | Security in ad hoc networks: An extension of dynamic source routing in mobile ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20081231 Termination date: 20110430 |