CN104010003B - Permeation method for improving Sybil node importance rapidly - Google Patents
Permeation method for improving Sybil node importance rapidly Download PDFInfo
- Publication number
- CN104010003B CN104010003B CN201410271658.6A CN201410271658A CN104010003B CN 104010003 B CN104010003 B CN 104010003B CN 201410271658 A CN201410271658 A CN 201410271658A CN 104010003 B CN104010003 B CN 104010003B
- Authority
- CN
- China
- Prior art keywords
- node
- nodeid
- activenodes
- sybil
- live
- 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.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a permeation method for improving Sybil node importance rapidly, and aims to provide a method which can rapidly improve indegree of Sybil nodes in a Kademlia network and the Sybil node importance. According to the technical scheme, permeated nodes are divided into multiple groups according to distance, nodes in each group are ranked according to the activity degree, and active node precedence and remote node precedence are achieved; the Sybil node allows more other nodes to have access to itself with the help of a node with a high activity degree by being the neighbor of the node with the high activity degree, and therefore more opportunities for improving the indegree are obtained; the Sybil node is recommended to the other nodes frequently by a remote node by being the neighbor of the remote node, and more opportunities for improving the indegree are obtained. The whole permeation method is implemented again every other permeation period. By the adoption of the permeation method, the Sybil node importance is improved rapidly, and the influences of the Kademlia network on the Sybil node importance are overcome effectively.
Description
Technical field
The present invention relates to a kind of permeating method of sybil node, it is a kind of fast lifting sybil node in kademlia net
The method of importance in network.
Background technology
The former finger of sybil node has the single entity node of multiple identities, at present generally by the dummy node in network all
Referred to as sybil node.For the sybil node in kademlia network, its importance is mainly reflected in become how many sections
The neighbor node of point, i.e. the in-degree size of this sybil node.The quick importance improving sybil node, contributes to utilizing
Sybil node is more, active situation that is more efficiently knowing great deal of nodes in network, thus in quick discovery and containment network
Rogue activity provide technical support.
Kademlia agreement is a kind of typical dht (distributed hash table, distributed Hash table) agreement, extensively
General for building extensive, pure distributed p2p (peer to peer) network, such as electric donkey, bittorrent etc..Kademlia gives
Each node distributes a unique, random mark, i.e. nodeid, distributes a similar mark for each object, that is,
Objectid (is also called key).These id are usually used sha-1 this hash function to generate, and the distance between id adopts
Measured with XOR.
In kademlia network, each object is stored in nodeid closest on the k node of its objectid.k
General value is 20.
The routing table of each kademlia node is made up of l (l is equal to the number of bits of node identification) individual chained list, each chain
Table is referred to as one " k-bucket ", arrives the XOR distance of oneself in interval [2 for recording in networki,2i+1) (i is k-bucket
Sequence number, 0≤i ＜ l) in neighbor node information, every information is with tlv triple ＜ ip address, udp port numbers, nodeid ＞
Form represents and stores.Kademlia agreement specifies, k-bucket length is with k as the upper limit.Whenever kademlia node receives
From the message of other nodes, it just according to the ＜ ip address in this message sending node to oneself XOR distance and message,
Udp port numbers, updating the record in k-bucket, this is referred to as piggybacking (piggybacking) to nodeid ＞ information.L
K-bucket forms the routing table of a kademlia node, and therefore routing table is also referred to as " k-buckets ".In one routing table
L k-bucket is distinguished by continuous sequence number i.
Kademlia agreement is by a kind of four rpc (remote process call, remote procedure call are orders) group
Become, its title is ping, store, find_node, find_value respectively, and their work is as follows:
Ping: whether online for detecting a node；
Store: one node of instruction stores a ＜ key, value ＞ couple, in order to the data acquisition in future.Key is
Object hashed value, i.e. objectid, value are real data object (or its index)；
Find_node: with id as parameter, the recipient of find_node rpc is with ＜ ip address, udp port numbers, nodeid
The form of ＞ returns his the known k node nearest from target id；
Find_value: with key as parameter, find the corresponding value of key.
P2p web crawlers refers to the software system for obtaining each nodal information and its topological structure in p2p network.This
Plant software system and iteratively send particular message to the known node in p2p network, obtain new node；Repeat to new
Node send particular message it is possible to obtain the topological structure of whole network and each nodal information.P2p web crawlers can
For obtaining nodal information and the topological structure of kademlia network.
At present it is not yet found that for p2p network, being intended to improve the sybil node permeating method of sybil node importance
Other open achievements in research.
Content of the invention
The technical problem to be solved in the present invention is: is difficult to quickly, fully penetrate into for current sybil node
In kademlia network, enter other node route lists, and then the problem of the larger importance of generation as much as possible, propose a kind of
Make the method that sybil node high-effective penetrating enters kademlia network.The method can fast lifting sybil node exist
In-degree in kademlia network, thus the importance of fast lifting sybil node.
For solving above-mentioned technical problem, technical scheme is as follows:
In order that sybil node can overcome the impact that kademlia dynamic is brought during lifting importance,
Whole permeating method is implemented once again every some hours (as 6 hours).Implement every time to be referred to as an infiltration cycle, and use t
Which infiltration cycle record is currently.In order to quickly and efficiently lift importance, this method will be oozed always according to distance
Node is divided into multiple marshallings (representing group number with g) thoroughly, and according to active degree, marshalling interior nodes is ranked up, and realizes active section
Point is preferential and remote node is preferential.Become the neighbours of high liveness node, sybil node just can be by this high liveness section
Point allows more other node visits to it, thus obtaining the more chances improving in-degree.Become the neighbours of remote node,
Sybil node just more frequently can be recommended other nodes by this remote node, thus obtaining the more multimachine improving in-degree
Meeting.
Concrete technical scheme is:
The first step, arranges infiltration cycle count value t=1, and packet numbering g=l, l identify (i.e. for kademlia network node
Nodeid number of bits), live-vertex list activenodes (0) of initial time is sky (null), activenodes
T () is live-vertex list during t-th infiltration cycle, the element in list is live-vertex information, and item number is t-th infiltration
Live-vertex number n in cyclet, each list item includes tetra- domains of ip, udpport, nodeid, active, and ip represents active section
The ip address of point, udpport refers to the udp port numbers of live-vertex, and nodeid is the node identification of live-vertex, and active represents
The active degree value of live-vertex, can be dynamically updated.
Second step, is obtained using p2p web crawlers (such as increase income emule client-side program, nutch, crawler4j etc.)
Ip, udpport, nodeid information of kademlia t-th infiltration cycle live-vertex list activenodes (t) of network.
3rd step, calculates the active value of each live-vertex in activenodes (t) successively it is assumed that activenodes
Arbitrary list item q (0≤q≤n in (t)t- 1) corresponding ip, udpport, nodeid information is ipq、udpportq、nodeidq,
Then circular is as follows:
3.1) make q=0；
3.2) for the list item q in activenodes (t), if containing list item ＜ ip in activenodes (t-1)q,
udpportq,nodeidq, active_old ＞, then the list item q in activenodes (t) is ＜ ipq,udpportq,
nodeidq, active_old+1 ＞；If not containing this list item in activenodes (t-1), that is, node identification is nodeidq
Live-vertex be for the first time to occur in live-vertex list, then the list item q in activenodes (t) is ＜ ipq,
udpportq,nodeidq, 1 ＞；
3.3) q=q+1；
3.4) judge whether q is equal to nt, if equal to, then turn the 4th step, otherwise, turn 3.2).
4th step, by n in activenodes (t)tThe nodeid value of the individual node nodeid value with sybil node successively
Carry out XOR, obtain ntIndividual XOR distance, and according to the XOR distance value obtaining to the n in activenodes (t)tIndividual list item enters
Row marshalling, by XOR distance [2j,2j+1) in the range of node compile as jth (0≤j≤l-1) group, then the number organized into groups is l
(because marshalling rule is similar with the k-bucket differentiating method of kademlia node route list, the number of marshalling is equal to k-
To the traversal organized into groups, the number l) of bucket, by showing that every group of nodes are designated as σt(0≤σt≤nt).
5th step, organizes into groups to l, resets the σ of each group according to active value descendingtIndividual list item, obtains l descending and resets
Marshalling afterwards.
6th step, g=g-1.
7th step, from the beginning of the first node of g group, sybil node sends ping to all nodes of this group successively and detects life
Order.According to the incidentally more New Policy of kademlia network, it is saturated after node receives ping order, by sybil node
Nodeid value and the nodeid value of itself carry out XOR, and determine the k-bucket of sybil node according to this XOR value, if this
Have vacant position in k-bucket, just sybil node is saved in this k-bucket as neighbor node, thus improving sybil section
The in-degree of point.
8th step, if g=0, executes the 9th step；Otherwise, turn the 6th step.
9th step, setting timer is m hour.This is for interval m hour, and m typically takes 6；
Tenth step, intermittently 5 seconds.
11st step, judges whether to receive exit instruction: is to turn the 14th step；Otherwise turn the 12nd step.
12nd step, judges whether that timer terminates: is to turn the 13rd step；No, turn the tenth step.
13rd step, t=t+1, turn second step.
14th step, terminates.
Following technique effect can be reached using the present invention:
By fourth, fifth and seven setting in step, preferentially remote node and high liveness node are permeated, permissible
Greatly improve sybil node via these nodes enter more other node route lists chance, such that it is able to fast lifting its
In-degree.By the setting in the nine, the ten, 13 steps, periodically permeated, can effectively be overcome kademlia network dynamic
Property to sybil node importance impact it is ensured that sybil node can have higher in-degree all the time.Quick raising sybil node
Importance, contribute to using sybil node is more, active situation that is more efficiently knowing great deal of nodes in network, thus being
Rogue activity in quick discovery and containment network provides technical support.
Brief description
Fig. 1 is the general flow chart of the present invention.
Specific embodiment
Fig. 1 is the general flow chart of the present invention:
The first step, arranges infiltration cycle count value t=1, packet numbering g=l, the live-vertex list of initial time
Activenodes (0) is null.
Second step, obtains the t-th infiltration cycle live-vertex list of kademlia network using p2p web crawlers
Ip, udpport, nodeid information of activenodes (t).
3rd step, calculates n in activenodes (t) successivelytThe active value of individual live-vertex is it is assumed that activenodes
Arbitrary list item q (0≤q≤n in (t)t- 1) corresponding ip, udpport, nodeid information is ipq、udpportq、nodeidq.
4th step, by n in activenodes (t)tThe nodeid value of the individual node nodeid value with sybil node successively
Carry out XOR, and according to the XOR distance value obtaining to the n in activenodes (t)tIndividual list item is organized into groups, by XOR away from
From [2j,2j+1) in the range of node compile as jth (0≤j≤l-1) group, then the number organized into groups is l, by the traversal to marshalling
Show that every group of nodes are designated as σt(0≤σt≤nt).
5th step, organizes into groups to l, resets the σ of each group according to active value descendingtIndividual list item.
6th step, g=g-1.
7th step, from the beginning of the first node of g group, sybil node sends ping to all nodes of this group successively and detects life
Order.According to the incidentally more New Policy of kademlia network, being saturated after node receives ping order, if according to it
It is free in the k-bucket of node that the nodeid value of nodeid value sybil node carries out being saturated of the distance determination that XOR obtains
Sybil node is just saved in this k-bucket, thus improving the in-degree of sybil node by position as neighbor node.
8th step, if g=0, executes the 9th step；Otherwise, turn the 6th step.
9th step, setting timer is m hour.This is for interval m hour, and m typically takes 6；
Tenth step, intermittently 5 seconds.
11st step, judges whether to receive exit instruction: is to turn the 14th step；Otherwise turn the 12nd step.
12nd step, judges whether that timer terminates: is to turn the 13rd step；No, turn the tenth step.
13rd step, t=t+1, turn second step.
14th step, terminates.
Claims (2)
1. a kind of permeating method for fast lifting sybil node importance is it is characterised in that comprise the following steps:
The first step, arranges infiltration cycle count value t=1, and packet numbering g=l, l identify nodeid for kademlia network node
Number of bits, live-vertex list activenodes (0) of initial time is sky, and activenodes (t) is t-th infiltration
Live-vertex list during the cycle, the element in list is live-vertex information, and item number is the active section in t-th infiltration cycle
Points nt, each list item includes tetra- domains of ip, udp port, nodeid, active, and ip represents the ip address of live-vertex, udp
Port refers to the udp port numbers of live-vertex, and nodeid is the node identification of live-vertex, and active represents the active of live-vertex
Degree value；
Second step, obtains the t-th infiltration cycle live-vertex list of kademlia network using p2p web crawlers
Ip, udp port, nodeid information of activenodes (t)；
3rd step, calculates the active value of each live-vertex in activenodes (t) successively, and circular is as follows:
3.1) make q=0；
3.2) for the list item q in activenodes (t), if containing list item ＜ ip in activenodes (t-1)q,udp
portq,nodeidq, active_old ＞, ipq、udp portq、nodeidqIt is respectively list item q pair in activenodes (t)
Ip, udp port, nodeid information answered, then the list item in activenodes (t) is ＜ ipq,udp portq,nodeidq,
Active_old+1 ＞；If not containing this list item in activenodes (t-1), that is, node identification is nodeidqActive section
Point is to occur in live-vertex list for the first time, then the list item q in activenodes (t) is ＜ ipq,udpportq,
nodeidq, 1 ＞；
3.3) q=q+1；
3.4) judge whether q is equal to nt, if equal to, then turn the 4th step, otherwise, turn 3.2)；
4th step, by n in activenodes (t)tThe nodeid value of individual node carries out different successively with the nodeid value of sybil node
Or, obtaining ntIndividual XOR distance, and according to the XOR distance value obtaining to the n in activenodes (t)tIndividual list item is compiled
Group, by XOR distance [2j,2j+1) in the range of node compile as jth group, then the number organized into groups is l, by the traversal to marshalling
Show that every group of nodes are designated as σt, 0≤j≤l-1,0≤σt≤nt；
5th step, organizes into groups to l, resets the σ of each group according to active value descendingtIndividual list item, after obtaining l descending rearrangement
Marshalling；
6th step, g=g-1；
7th step, from the beginning of the first node of g group, sybil node sends ping probe command to all nodes of this group successively；Root
According to the incidentally more New Policy of kademlia network, be saturated after node receives ping order, by the nodeid value of sybil node with
The nodeid value of itself carries out XOR, and determines the k-bucket of sybil node according to this XOR value, if in this k-bucket
Have vacant position, then sybil node is saved in this k-bucket as neighbor node；The routing table of each kademlia node by
L chained list composition, each chained list is referred to as one " k-bucket ", arrives the XOR distance of oneself in interval for recording in network
[2i,2i+1) in neighbor node information, every information is with tlv triple ＜ ip address, udp port numbers, nodeid ＞ form table
Show and store, i is the sequence number of k-bucket, 0≤i ＜ l；
8th step, if g=0, executes the 9th step；Otherwise, turn the 6th step；
9th step, setting timer is m hour；
Tenth step, intermittently 5 seconds；
11st step, judges whether to receive exit instruction: is to turn the 14th step；Otherwise turn the 12nd step；
12nd step, judges whether that timer terminates: is to turn the 13rd step；No, turn the tenth step；
13rd step, t=t+1, turn second step；
14th step, terminates.
2. as claimed in claim 1 a kind of permeating method for fast lifting sybil node importance it is characterised in that institute
State m and take 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410271658.6A CN104010003B (en) | 2014-06-18 | 2014-06-18 | Permeation method for improving Sybil node importance rapidly |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410271658.6A CN104010003B (en) | 2014-06-18 | 2014-06-18 | Permeation method for improving Sybil node importance rapidly |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104010003A CN104010003A (en) | 2014-08-27 |
| CN104010003B true CN104010003B (en) | 2017-02-01 |
Family
ID=51370497
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410271658.6A Active CN104010003B (en) | 2014-06-18 | 2014-06-18 | Permeation method for improving Sybil node importance rapidly |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104010003B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104378426B (en) * | 2014-11-14 | 2018-06-12 | 中国电子科技集团公司第二十九研究所 | A kind of load-balancing method for real time information dissemination system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101145929A (en) * | 2007-08-09 | 2008-03-19 | 复旦大学 | A P2P stream media VoD system for IPV6 environment |
| CN103067521A (en) * | 2013-01-08 | 2013-04-24 | 中国科学院声学研究所 | Distributed-type nodes and distributed-type system in a crawler cluster |
-
2014
- 2014-06-18 CN CN201410271658.6A patent/CN104010003B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101145929A (en) * | 2007-08-09 | 2008-03-19 | 复旦大学 | A P2P stream media VoD system for IPV6 environment |
| CN103067521A (en) * | 2013-01-08 | 2013-04-24 | 中国科学院声学研究所 | Distributed-type nodes and distributed-type system in a crawler cluster |
Non-Patent Citations (2)
| Title |
|---|
| 《一种针对P2P网络优化的Kademlia路由算法》;杨丞，张刚林，刘光灿，王路露;《微电子学与计算机》;20090930;第26卷(第9期);全文 * |
| 基于kademlia协议的高生存性P2P僵尸网络;朱俊虎，李鹤帅，王清贤，邱菡;《计算机应用》;20130501;第33卷(第5期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104010003A (en) | 2014-08-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20060029007A1 (en) | Ad hoc network topology discovery | |
| Cancela et al. | Polynomial-time topological reductions that preserve the diameter constrained reliability of a communication network | |
| CN102164369A (en) | Method for broadcast authentication of wireless sensor network based on automaton and game of life | |
| CN104010003B (en) | Permeation method for improving Sybil node importance rapidly | |
| CN103813372B (en) | A kind of wireless sensor network management method based on IPv6 | |
| CN107179954A (en) | A kind of distributed community network method for secret protection of holding node accessibility | |
| Drees et al. | Churn-and dos-resistant overlay networks based on network reconfiguration | |
| CN104038547B (en) | Method for effectively resolving multi-Sybil node penetration conflict in P2P network | |
| CN101741867B (en) | Method for capturing node information in BitTorrent network | |
| CN104579805A (en) | A novel network traffic identifying method | |
| RU2016124953A (en) | METHOD FOR MASKING THE STRUCTURE OF A COMMUNICATION NETWORK | |
| Zhou et al. | An efficient and scalable pairwise key pre-distribution scheme for sensor networks using deployment knowledge | |
| Alam | A survey on blockchain and internet of things | |
| Huang et al. | A backbone-aware topology formation (BATF) scheme for ZigBee wireless sensor networks | |
| Aneeth et al. | Energy-efficient communication in wireless sensor network for precision farming | |
| Jabbar et al. | Modeling the message alternative routes in a large scale wireless sensor network | |
| JP5857791B2 (en) | Communication device | |
| CN106332214B (en) | Data directional transmission method and system | |
| Kurhinen et al. | Modelling mobile encounter networks | |
| Nicol et al. | Simulation analysis of virtual geographic routing | |
| Al-Nabhan et al. | Distributed algorithm for connected dominating set construction in sensor networks | |
| CN104994557A (en) | Clustering algorithm based on dynamic grids and data fusion | |
| Wang et al. | On the characteristics of the worm infection family tree | |
| Patra et al. | Modified rumor routing for wireless sensor networks | |
| Emimajuliet et al. | Defending Collaborative Attacks in MANETs Using Modified Cooperative Bait Detection Scheme |
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 |