CN100493088C - Method for applying cooperative enhancement mechanism to adhoc network - Google Patents
Method for applying cooperative enhancement mechanism to adhoc network Download PDFInfo
- Publication number
- CN100493088C CN100493088C CNB2005100864974A CN200510086497A CN100493088C CN 100493088 C CN100493088 C CN 100493088C CN B2005100864974 A CNB2005100864974 A CN B2005100864974A CN 200510086497 A CN200510086497 A CN 200510086497A CN 100493088 C CN100493088 C CN 100493088C
- Authority
- CN
- China
- Prior art keywords
- node
- selfish
- fame
- central server
- network
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
A method of applying cooperation reinforcement mechanism on ab hoc network includes confirming newly joined node reputation initial value of network , monitoring each node behavior and detecting attack from bad node for obtaining their final reputation through evaluation system , confirming node creditability as per its reputation and confirming that node is selfish node if its reputation is lower than threshold , isolating it out from network and informing this to neighbour node , enabling selfish node to increase its reputation through cooperation for joining itself in mobile ab hoc network again .
Description
Affiliated technical field
The present invention relates to a kind of method of 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.
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.
Buchegger and Le Boudec have proposed " the fair dynamic ad hoc network C ONFIDANT (Cooperation Of Nodes:Fairness In Dynamic Ad-hoc NeTworks) of realization of node cooperation ", by observing or the report several types is attacked and detected malicious node, just can get around the node of these delinquencies during the node route and isolate them.
CONFIDANT is based on an expansion of DSR Routing Protocol.DSR belongs to the on-demand routing protocol based on source routing, its course of work is as follows: when node S when node D sends data, it checks at first whether buffer memory exists the not out of date route to destination node, if exist, then directly use available route, otherwise startup route finding process, be that source node S sends route request information (RREQ), all receive that the node of RREQ will put into source routing to the node identification of oneself, and be transmitted to neighbor node, unless they had before received this message.When RREQ message arrives destination node D or has the intermediate node that arrives the destination node route, can send route replies message (RREP) to S, the counter-rotating routing iinformation that will comprise source routing in this message, if because the factor of asymmetric link, RREP can not arrive source node, and then D or this intermediate node can start a route requests of returning the source end.After source node is received one or above route, it will select a path that sends as data according to qualifications, if link failure, intermediate node can not be to next node for data forwarding, it will send an error message to source node, and the source end will change route, avoids the link through losing efficacy.
The CONFIDANT system mainly is made up of four parts, i.e. monitor, popularity system, trust manager and path management device.Monitor be mainly used to observe, write down node route and before change one's profession to whether unusual, if they have reason to be sure of that there is abnormal behaviour in a certain neighbor node, they can take corresponding action when own route and preceding commentaries on classics, and warn other nodes by sending ALARM message; The popularity system monitors the popularity evaluation that the behavior situation of neighbor node has been done according to node; Whether trust manager is mainly used to adjudicate the ALARM that receives credible, the path management device then can be regulated corresponding behavior according to the fame of node, and selfish node taken action, promptly in routing procedure, isolate this node, the grouping that perhaps same uncooperative this node is sent, the perhaps preceding ALARM that changes about relevant this node.
The shortcoming of CONFIDANT mainly is that anti-spoofing attack ability is extremely low, and is because it is a popularity system based on detection, just meaningful when popularity only keeps identity constant for each node.
Summary of the invention
In order to overcome the deficiency of existing technology, the invention provides a kind of method of cooperative enhancement mechanism of the ad of being applied to hoc network, solve ad hoc network selfish node problem.
The technical solution adopted for the present invention to solve the technical problems is:
The present invention proposes a kind of ad hoc network cooperation and strengthen mechanism based on trusted central server and neighbours' monitoring.
The Routing Protocol that adopts among the present invention is DSR (DSR) agreement, and a common problem that strengthens safety approach based on the cooperation of fame is exactly the node identity problems, and when node was frequently changed identity, the popularity system was just nonsensical to it.Therefore introduced the central server trusty that links to each other with the Internet network among the present invention, central server provides authentication capability and preserves the identity of each node, this identity is corresponding with the identity of the real world that can verify, also can store the corresponding selfish record of each user (identity) when realizing authentication in addition.
The method that cooperation of the present invention strengthens security mechanism comprises closely-related 4 process steps:
Step 1, popularity initial value design are used for determining the new node popularity initial value that adds network;
Step 2, neighbours' cooperation monitoring and popularity evaluation, each nodes ' behavior also detects the attack from bad node in the monitoring network, and calculates the final comprehensive popularity of node through evaluation system according to the fame that neighbours' monitoring obtains;
Step 3, to the reaction mechanism of selfish node, the confidence level of node is determined in evaluation according to popularity, when the node fame is lower than threshold value (referring generally to value is negative value), assert that then it is a selfish node, it is isolated in outside the network, and notice neighbor node or trusted central server;
The incentive mechanism of step 4, selfish node, selfish node should be able to be by cooperation increasing comprehensive popularity evaluation of estimate, and join again in the mobile Ad hoc network.
The invention has the beneficial effects as follows,
1, by introducing the comprehensive fame that weighted factor is weighed node in neighbours' monitoring and the evaluation system, set up new node popularity and estimated mechanism.
2, by the trust center server is set, make node when frequently changing identity, can not obtain interests, solved crisis of identity problem.
3, adopted incentive mechanism to encourage selfish node to regain the trust of other nodes by cooperation.
4, the ad hoc cooperative enhancement mechanism of the present invention's proposition can make node not need tamper resistant hardware, and equipment complexity reduces, and can effectively solve identity problems.
5, by the management of trusted central server, can remedy managerial some shortcomings among the mobile ad hoc, and keep the autonomous characteristics of mobile ad hoc network agile, be a kind of very practical method.
6, the introduction of comprehensive popularity evaluation and incentive mechanism has guaranteed the fairness of network.
Description of drawings
The present invention is further described below in conjunction with drawings and Examples.
Fig. 1, based on the cooperation enhanced system structure of trusted central server and neighbours monitoring;
Fig. 2, program flow diagram.
Embodiment
In Fig. 1, cooperation enhanced system structure based on trusted central server (Server) and neighbours' monitoring, formed by a trusted central server and a group node, these nodes should have the interface that inserts wide area cellular network, for example, can send data from the GPRS network reception or to GPRS network.Can be linked into the Internet network by wide area cellular network, thereby insert trusted central server (hereinafter to be referred as central server) identity verification, other nodes can be to the popularity record of central server inquiry about certain node (user).
Step 1, carry out the popularity initial value design of node;
When a new node A will add mobile ad hoc network, at first to central server, carry out log in registration and authentication, central server inserts by the wide-area wireless network interface of node, can be by the management of wide area cellular operator or service broker merchant's management.New node A can set up with the neighbor node B of A by Hello message and get in touch (can be one or more, the neighbor node of A has B, C and D as shown in Figure 1, is example with the Node B) here.B can query node self in the fame table of storage whether relevant for the fame r of node A
A, and not out of date, can adopt popularity initial value r if having
0=r
AIf do not have, B can inquire about its popularity record by the wide-area wireless network interface to central server according to the unique identifier (identity) of A, whether central server then has bad " previous conviction " according to the popularity record queries node A of this locality storage, just send to the popularity initial value of negative value of B if having, if not storage then send 0 value as initial value as new node A.
Step 2, neighbours' cooperation monitoring and popularity evaluation;
Behind the popularity initial value design of node, this node will be used in ad hoc, in this process, can take similar " house dog " such mechanism to survey the node of delinquency.When a network node (B, observer) needs its neighbor node of monitoring (A, the person of being monitored) that network function (route or packet forward) is realized situation, will activate monitoring equipment, in the temporary buffer of B monitoring equipment, stored monitoring expected results e
r(f), actual observation o as a result and relatively
r(f) whether consistent with it.If consistent, illustrate that the function of monitoring has been executed correctly, monitoring equipment will empty buffer and enter idle condition, wait for next function monitoring; If be not executed correctly, buffer will keep e
r(f) certain hour exceeds time range and also is not performed, and then observed result is a negative value.By the detection evaluation of estimate of neighbor networks, can upgrade the popularity evaluation of estimate of B to A.
The popularity evaluation comprises subjective popularity evaluation and indirect popularity evaluation method.Each node is all stored a popularity table, comprises the node unique identifier, collect recently about subjective popularity of node and the indirect fame that provides of other nodes in the recent period.
Subjective popularity evaluation is meant the fame that is calculated by observer B, and only upgrades in sending the RREQ request message.Because some disadvantaged node may be because energy shortage causes " selfishness " behavior in the network, at this moment just can not resemble to treat the malice selfish node these indivedual " selfishness " nodes are got rid of outside network, must give correct popularity evaluation of estimate.So B will so also can avoid the false monitoring result that causes because of link down to the more weights of observation in the past in the calculating of the subjective fame of moment t.The general formula that calculates subjective popularity evaluation is
The popularity evaluation is meant that B collects the indirect fame about A of coming in time t from the RREP response message indirectly, if write down the node identifier of A among the RREP, and then indirect fame
Add 1, the renewal of its value is only relevant with the RREP response message.Since indirectly the popularity evaluation can only get on the occasion of, deliberately gang up the popularity of slandering certain behavior normal node so can prevent a plurality of malicious nodes.
Comprehensive popularity evaluation may be defined as
w
1And w
2Be respectively the weight of subjective popularity and indirect popularity.
By neighbours' cooperation monitoring and popularity evaluation, can on function, distribute different weights, thereby draw more accurate popularity evaluation of estimate.
Step 3, to the reaction mechanism of selfish node;
Reaction mechanism is meant the action that node is taked selfish node, when the node A fame that draws through comprehensive popularity evaluation in the Node B is lower than threshold value (referring generally to value is negative value), can assert that it is a selfish node, it is isolated in outside the network, do not consider path when being route and grouping transmission, and send the ALARM alert message notice trusted central server that has added the Node B signature through this node A.For the ALARM message from node, central server must check that the starting resource of ALARM to determine the trusted degree, therefore can adopt similar Pretty Good Privacy (PGP) key management and checking.Central server can be provided with the utmost points such as several trusts to node, for example, do not know, do not have, edge and fully.When central server calculates ALARM validity, it can check the reliability rating of all additional identification signatures, and calculate weighted value about ALARM validity, and to trust signature such as two edges and can be equivalent to one and trust signature fully, weight can be adjusted according to actual conditions.The purpose of doing is so also slandered behavior normal node " calumny " attack in order to prevent that malicious node from ganging up.Finally, after central server had been confirmed the validity of ALARM, it can be made as selfish node with node A.
The selfish node record of central server also is free restriction, t at the appointed time
1In, if other nodes come query node A popularity initial value then can obtain negative value, thereby make selfish node be subjected to " punishment ".Overshoot time t
1, will make zero the initial fame of selfish node.
The incentive mechanism of step 4, selfish node;
In order to encourage selfish node to join in the network cooperation, increased incentive mechanism among the present invention, prevent that selfish node from being repelled outside network forever by other nodes.For t at the appointed time
1Interior selfish node if it wants to join again in the mobile Ad hoc network by cooperation, can allow neighbor node give one of selfish node and investigate t in period
2(t
2＜t
1), in investigation period, neighbor node can allow selfish node participate in route and transmit grouping, but does not transmit grouping from selfish node (be selfish node only be other people service); Before finishing in investigation period, if neighbor node give the comprehensive fame of selfish node can become on the occasion of, then it can be treated as normal node, and provide the packet forward service for it.
By said process, can be implemented in the ad hoc network effective isolation to selfish node, simultaneously by increasing incentive mechanism, give the selfish node chance of correcting one's mistakes to selfish node, guarantee the fairness of network.
Claims (5)
1. method that is applied to the cooperative enhancement mechanism of ad hoc network, it is characterized in that: adopt the ad hoc network cooperation of trusted central server and neighbours monitoring to strengthen mechanism, the trusted central server links to each other with the Internet network, the identity that authentication capability is provided and preserves each node, this identity is corresponding with the identity of the real world that can verify, also stores the corresponding selfish record of each user identity simultaneously; Comprise 4 following steps:
Step 1, comprehensive popularity initial value design are used for determining the new comprehensive popularity initial value of node that adds network;
Step 2, neighbours' cooperation monitoring and popularity evaluation, each nodes ' behavior and detect attack from bad node and obtain subjective fame in the monitoring network about certain node, and calculate the final comprehensive fame of node through evaluation system according to the indirect fame that neighbours' cooperation monitoring obtains;
Step 3, to the reaction mechanism of selfish node, determine the confidence level of node according to comprehensive fame, when the comprehensive fame of node is lower than threshold value, assert that then it is a selfish node, it is isolated in outside the network, and notice neighbor node or trusted central server;
The incentive mechanism of step 4, selfish node, selfish node increases comprehensive fame by cooperation, and joins again in the mobile Ad hoc network.
2. a kind of method that is applied to the cooperative enhancement mechanism of ad hoc network according to claim 1, new node A it is characterized in that: when will add mobile ad hoc network, at first to central server, carry out log in registration and authentication, central server inserts by the wide-area wireless network interface of node
New node A sets up by the one or more B of the neighbor node of Hello message and A and gets in touch, B can the comprehensive fame table of query node self storage in whether relevant for the comprehensive fame r of node A
A, and not out of date, can adopt popularity initial value r if having
0=r
AIf do not have, B can inquire about its selfish record by the wide-area wireless network interface to central server according to the unique identifier of A, whether central server then has bad " previous conviction " according to the selfish record queries node A of this locality storage, just send to the popularity initial value of negative value of B if having, if not storage then send 0 value as initial value as new node A.
3. a kind of method that is applied to the cooperative enhancement mechanism of ad hoc network according to claim 2 is characterized in that: survey the node of delinquency, stored monitoring expected results e in the temporary buffer of B monitoring equipment
r(f), actual observation o as a result and relatively
rWhether (f) consistent with it, if consistent, monitoring equipment will empty buffer and enter idle condition, wait for next function monitoring; If inconsistent, buffer will keep e
r(f) certain hour, it is also inconsistent to exceed time range, and then observed result is a negative value.
4. a kind of method that is applied to the cooperative enhancement mechanism of ad hoc network according to claim 1 and 2, it is characterized in that: send the ALARM alert message notice trusted central server that has added the Node B signature, for ALARM message from node, central server adopts key management and checking, check the reliability rating of all additional identification signatures, calculate weighted value about ALARM validity;
The selfish node of central server is recorded in overshoot time t
1The time, just the initial fame of selfish node is made zero.
5. a kind of method that is applied to the cooperative enhancement mechanism of ad hoc network according to claim 1 and 2 is characterized in that: t at the appointed time
1In, neighbor node gives one of selfish node and investigates t in period
2If, the comprehensive fame that neighbor node gives selfish node can become on the occasion of, then it can be treated as normal node, and provide the packet forward service for it.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100864974A CN100493088C (en) | 2005-09-23 | 2005-09-23 | Method for applying cooperative enhancement mechanism to adhoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100864974A CN100493088C (en) | 2005-09-23 | 2005-09-23 | Method for applying cooperative enhancement mechanism to adhoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1741527A CN1741527A (en) | 2006-03-01 |
| CN100493088C true CN100493088C (en) | 2009-05-27 |
Family
ID=36093740
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100864974A Expired - Fee Related CN100493088C (en) | 2005-09-23 | 2005-09-23 | Method for applying cooperative enhancement mechanism to adhoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100493088C (en) |
Families Citing this family (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100448232C (en) * | 2006-04-30 | 2008-12-31 | 北京交通大学 | Method of fair cooperative enhancement mechanism for ad hoc network |
| CN100426755C (en) * | 2006-11-06 | 2008-10-15 | 吉林大学 | Kernel devices of credible network |
| CN100566251C (en) | 2007-08-01 | 2009-12-02 | 西安西电捷通无线网络通信有限公司 | A kind of trusted network connection method that strengthens fail safe |
| JP4827972B2 (en) * | 2007-09-28 | 2011-11-30 | 日本電信電話株式会社 | Network monitoring device, network monitoring method, and network monitoring program |
| CN101170410B (en) * | 2007-09-29 | 2010-08-04 | 华中科技大学 | A method and device for enhancing Ad hoc network security and cooperation mechanism |
| CN101309217B (en) * | 2008-07-11 | 2011-05-18 | 北京航空航天大学 | Network multipath routing method based on AD HOC on basis of bidirectional rerouting |
| CN101420379B (en) * | 2008-11-14 | 2011-06-22 | 北京航空航天大学 | Low consumption multi-path routing method for mobile ad hoc network |
| CN101442413B (en) * | 2008-12-22 | 2011-04-06 | 西安交通大学 | Method for detecting ad hoc network helminth based on neighbor collaborative monitoring |
| CN101765230B (en) * | 2008-12-24 | 2012-11-21 | 华为技术有限公司 | Method and device for transmitting user communication data in wireless mesh network |
| CN101635719B (en) * | 2009-08-28 | 2012-07-04 | 中兴通讯股份有限公司 | Method and system for dynamically adjusting internet user access priority |
| CN101902463B (en) * | 2010-04-22 | 2013-01-16 | 国家无线电监测中心检测中心 | Access control method of sensor network applied to mobile user and system thereof |
| CN101895889A (en) * | 2010-08-13 | 2010-11-24 | 深圳市兆讯达科技实业有限公司 | Method for detecting black hole attack in wireless ad hoc network |
| CN102026173A (en) * | 2010-12-03 | 2011-04-20 | 北京航空航天大学 | Cooperation enhancement method for resisting selfish behavior of node |
| CN104221321A (en) | 2012-03-31 | 2014-12-17 | 诺基亚公司 | Method and apparatus for secured social networking |
| EP2909964B1 (en) | 2012-10-17 | 2019-04-24 | Nokia Technologies Oy | Method and apparatus for providing secure communications based on trust evaluations in a distributed manner |
| PT106891A (en) * | 2013-04-16 | 2014-10-16 | Univ Da Beira Interior Museu De Lanifícios | METHOD OF DATA COOPERATION FOR APPLICATIONS AND SERVICES IN MOBILE DEVICES IN WIRELESS NETWORKS |
-
2005
- 2005-09-23 CN CNB2005100864974A patent/CN100493088C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1741527A (en) | 2006-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100493088C (en) | Method for applying cooperative enhancement mechanism to adhoc network | |
| Velloso et al. | Trust management in mobile ad hoc networks using a scalable maturity-based model | |
| Yu et al. | Trust mechanisms in wireless sensor networks: Attack analysis and countermeasures | |
| Huang et al. | A UAV-assisted ubiquitous trust communication system in 5G and beyond networks | |
| Abd El-Moghith et al. | Towards designing a trusted routing scheme in wireless sensor networks: A new deep blockchain approach | |
| Chatterjee et al. | STACRP: a secure trusted auction oriented clustering based routing protocol for MANET | |
| Li et al. | A hierarchical account-aided reputation management system for large-scale MANETs | |
| Vijayakumar et al. | Fuzzy logic–based jamming detection algorithm for cluster‐based wireless sensor network | |
| Labraoui et al. | Reactive and adaptive monitoring to secure aggregation in wireless sensor networks | |
| Sen | Reputation-and trust-based systems for wireless self-organizing networks | |
| Chakrabarti et al. | Intention aware misbehavior detection for post-disaster opportunistic communication over peer-to-peer DTN | |
| CN105682096A (en) | Internet of things credible route selection method and system based on AGV and reputation system | |
| Sen | A survey on reputation and trust-based systems for wireless communication networks | |
| Khedim et al. | Dishonest recommendation attacks in wireless sensor networks: A survey | |
| Anusha et al. | A new trust-based mechanism for detecting intrusions in MANET. | |
| Naseer | Reputation system based trust-enabled routing for wireless sensor networks | |
| Louta et al. | A survey on reputation-based cooperation enforcement schemes in wireless ad hoc networks | |
| Balakrishnan et al. | Trust management in mobile ad hoc networks | |
| Ali et al. | Wireless Sensor Networks Routing Attacks Prevention with Blockchain and Deep Neural Network. | |
| Vijayan et al. | Trust management approaches in mobile adhoc networks | |
| Khan et al. | DTMS: A Dual Trust-based Multi-level Sybil Attack Detection Approach in WSNs | |
| Samaras et al. | On intrusion detection in opportunistic networks | |
| Mani et al. | Mitigating selfish behavior in mobile ad hoc networks: a survey | |
| Vamsi et al. | Trust and reputation aware geographic routing method for wireless ad hoc networks | |
| Oluoch | A theoretical framework for trust management in vehicular 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: 20090527 Termination date: 20110923 |