CN101399778A - Node organizing method and resource discovery method in wireless P2P network - Google Patents
Node organizing method and resource discovery method in wireless P2P network Download PDFInfo
- Publication number
- CN101399778A CN101399778A CNA2008102251901A CN200810225190A CN101399778A CN 101399778 A CN101399778 A CN 101399778A CN A2008102251901 A CNA2008102251901 A CN A2008102251901A CN 200810225190 A CN200810225190 A CN 200810225190A CN 101399778 A CN101399778 A CN 101399778A
- Authority
- CN
- China
- Prior art keywords
- node
- resource
- row
- peer
- query
- 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
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an organization method of nodes in the wireless P2P network and a resource discovery method; the organization method comprises that: every node is at least included in a circle which takes the node IP address hash value as the index and a routing table is established for every circle which comprises the node; the routing tables are used for storing the IP addresses and IP address hash values of the nodes except for the nodes in the circle. The resource discovery method comprises that: an inquiry resource node implements hash conversion on the resource key word to be searched and inquires the forwarding node which is proximal to the hash value of the resource key word in every routing table; and then the forwarding node continues to inquire the forwarding node which is proximal to the hash value of the resource key word in local routing tables until the destination node for storing the resource is found. By adopting the invention, every node is provided with a plurality of circles, thus reducing the network diameter and the average hop count, saving the overhead for maintaining the routing tables in the P2P network and improving the efficiency for discovering the network resource.
Description
Technical field
The present invention relates to communication technical field, relate in particular to the method for organizing and the resource discovery method of node in a kind of wireless peer-to-peer network.
Background technology
Be different from traditional communication service framework, the weakened notion of server of peer to peer technology (P2P Peer-to-peer), thousands of node all is identical resource provider in status and requestor in the network, the relation that has equity between all nodes, the P2P network belongs to the application layer networking, has advantages such as self-organizing, decentralization, extensibility be good.
Simultaneously, continuous development along with wireless communication technology, multi-hop distributed wireless networks (Ad Hoc) has obtained unprecedented attention, the support that it can be at any time, any place does not need the hardware foundation network facilities, build cordless communication network fast, have advantages such as independence, decentralization, extensibility is good.
Because peer-to-peer network, multi-hop distributed wireless MANET have a lot of similitudes, it is respectively the distributed frame pattern that is arranged in network protocol stack application layer and network layer, therefore with the two the direct combination of existing achievement in research, redundancy overhead can occur increases, problems such as resource query efficient reduction need the new P2P searching algorithm of design.In the existing achievement in research, be Chord agreement and the F-Chord protocol suite that carries out improved Fibonacci sequence based on the Chord agreement based on the main resource discovery method of structured p2p network.
Node in the Chord agreement is that the cryptographic Hash according to node IP address is that index value is distributed on the ring of one dimension, each node has the routing table (finger table) of oneself, its list item is the/0 that is positioned at outside this node, the/1, the/2 ... the corresponding relation of node IP address and IP address cryptographic Hash (/ be the end, get 2, the size of node route list is the list item number at the end with 2 promptly for degree).Resource discovery method based on the Chord agreement comprises: when the node of supposing all resource key value correspondences in the Hash space all exists, at first, the query source node is done hash conversion to the respective resources of desired seek, and the query source node is inquired in its routing table the node (finishing the 1st jumps) near this cryptographic Hash again; Then, the node after jumping by the 1st continues in its routing table of inquiry the node (finishing the 2nd jumps) near this cryptographic Hash; So repeatedly, until finding the search purposes node, promptly have the node of the information of desired seek resource, wherein, the maximum hop count of finishing inquiry from the query source node to destination node is called network diameter.
The Chord agreement has been set up a node cycle, its degree that has a node route list is big, network diameter and the bigger defective of average number of hops, cause network to find that the efficient of resource is not high, and under wireless environment, node adds, exits network frequent, network topology change is fast, makes that the expense of peer-to-peer network routing table maintenance is bigger, has more reduced the efficient of network discovery resource.
In addition, the F-Chord protocol suite of Fibonacci sequence, it mainly utilizes routing table that more helps resource lookup of characteristic structure of Fibonacci sequence, and can be by the parameter of Fibonacci sequence the optimizing structure peer-to-peer network major parameter of compromising, as network diameter, degree and average number of hops.
But the F-Chord protocol suite of Fibonacci sequence can't finish a plurality of major parameter of peer-to-peer network the time optimize poor-performing.
Summary of the invention
Embodiments of the invention provide the discover method of resource in a kind of wireless peer-to-peer network, and it is to the discovery efficient height of resource.
Embodiments of the invention provide the method for organizing of node in a kind of wireless peer-to-peer network, comprising:
It is in the ring of index value with the node IP address cryptographic Hash that each node is included in one at least, described each node is that each ring that comprises this node is created a routing table respectively, and described each routing table is stored each node IP address and each the node IP address cryptographic Hash outside this node in its ring.
Embodiments of the invention also provide the discover method of resource in a kind of wireless peer-to-peer network, comprising:
The query source node carries out in inquiry itself has after the hash conversion each routing table and the immediate forward node of resource keyword cryptographic Hash the resource keyword that will search, again in each routing table that itself has by the inquiry of this forward node with the immediate next forward node of resource keyword cryptographic Hash, circulation is until finding the destination node that has described resource.
The technical scheme that is provided by the embodiment of the invention described above as can be seen, it adapts under the ad-hoc network environment, node adds, frequent characteristics exit network, there are many rings to be provided with on each node, reduced network diameter, reduce the average number of hops of query node, saved the expense of peer-to-peer network routing table maintenance, improved the efficient of network discovery resource.
Description of drawings
In order to be illustrated more clearly in the technical scheme of the embodiment of the invention, the accompanying drawing of required use is done to introduce simply in will describing embodiment below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the flow chart of the embodiment of the invention one node organization method;
Fig. 2 is the flow chart of the embodiment of the invention two resource discovery methods;
Fig. 3 is the flow chart of the embodiment of the invention three resource discovery methods;
Fig. 4 is the flow chart of the embodiment of the invention four resource discovery methods;
Fig. 5 will lack the flow chart that node is added into routing table in the embodiment of the invention four resource discovery methods;
Fig. 6 is the schematic diagram of node configuration in the embodiment of the invention;
Fig. 7 is the schematic diagram of each node two ring configuration in the embodiment of the invention;
Fig. 8 is the schematic diagram of each node three ring configuration in the embodiment of the invention;
Fig. 9 is the schematic diagram of each node Fourth Ring configuration in the embodiment of the invention;
Figure 10 is the schematic diagram of each node five rings configuration in the embodiment of the invention;
Figure 11 is the comparison schematic diagram of three rings in the embodiment of the invention, Fourth Ring configuration and Chord agreement, F-Chord agreement degree;
Figure 12 is the comparison schematic diagram of three rings in the embodiment of the invention, Fourth Ring configuration and Chord agreement, F-Chord protocol network diameter;
Figure 13 is the comparison schematic diagram of three rings in the embodiment of the invention, Fourth Ring configuration and Chord agreement, F-Chord agreement average number of hops;
Figure 14 is three rings when 40% node is on peer-to-peer network in the embodiment of the invention, Fourth Ring configuration and the comparison schematic diagram of Chord agreement, F-Chord agreement degree;
Figure 15 is three rings when 40% node is on peer-to-peer network in the embodiment of the invention, Fourth Ring configuration and the comparison schematic diagram of Chord agreement, F-Chord agreement degree;
Figure 16 is three rings when 40% node is on peer-to-peer network in the embodiment of the invention, Fourth Ring configuration and the comparison schematic diagram of Chord agreement, F-Chord agreement degree;
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that is obtained under the creative work prerequisite.
Embodiment one
As shown in Figure 1, the method for organizing of node in a kind of wireless peer-to-peer network comprises:
Step 11 for the different ring of each node configuration: it is in the ring of index value with the node IP address cryptographic Hash that each node is included in one at least, and promptly each node all belongs to a plurality of rings, but each ring not necessarily comprises all nodes in the network;
Create the step 12 of a routing table for each ring: each node is that each ring that comprises this node is created a routing table respectively, and described each routing table is stored each node IP address and each the node IP address cryptographic Hash outside this node in its ring.
As shown in Figure 6, establish the Hash space for 0,1 ..., 2
m-1}, wherein m is an even number, be index value with all node configuration of correspondence with the ascending order of all node IP address cryptographic Hash is that ranks are 2
M/2* 2
M/2Square formation, also be each row, each row node according to cryptographic Hash also with from small to large sequence arrangement.Can know, because each node all belongs to a plurality of rings, the organizational form of each node cycle is not exceeded with two dimensional surface so, can be three-dimensional yet, below the node matrix equation that only distributes with two-dimensional matrix is an example, is convenient to better illustrate the method for organizing of present embodiment node.To have the peer-to-peer network that such node distributes and abbreviate two-dimentional peer-to-peer network as, further be called for short peer-to-peer network that such node encircles setting more for the two-dimentional peer-to-peer network of many rings (multi-ring bi-dimensional, MRBD).
Shown in Fig. 7-10, in described node matrix equation, represent the trend that each encircles with query path for another example, query path of described each ring is to take out first query path that a node is formed, the query path 2 as shown in Fig. 9 and Figure 10 in every row; Or second query path of taking out a node composition in every row, query path 3 as shown in Figure 9 and the query path 4 shown in Figure 10.For the sake of simplicity, among Fig. 7-10, only expressed by node n
1,1Ring, the ring under other nodes is set up with same method, does not do at this and gives unnecessary details.
Query path according to above-mentioned each ring, the routing table of each ring is first routing table of storing described node IP address and node IP address cryptographic Hash according to described first query path on each node, perhaps stores the secondary route table of described IP addresses of nodes and node IP address cryptographic Hash according to described second query path.
For another example shown in Fig. 7-10 2
M/2* 2
M/2Square formation, can know, for any a, b, c, d ∈ 1,2 ..., 2
M/2, n
1,1With
Between shortest path be n
1,1Through n
2,2, n
3,3... to node
The path, finishing this, to inquire about needed jumping figure less, also is that network diameter is less.According to many rings method for organizing of node, can carry out flexible configuration to the quantity and the query path of ring, thereby improve search efficiency like this.
In addition, the respective organization principle of node matrix equation in like manner can get, and does not do and gives unnecessary details.
Therefore, by the ring of each node in the reasonable disposition peer-to-peer network, can optimize network diameter, the average number of hops of query node improves the efficient that network is found resource.
Embodiment two
Shown in Fig. 2, Fig. 6-10, the discover method of resource in a kind of wireless peer-to-peer network, it encircles the peer-to-peer network of configuration based on the foregoing description one described node more, comprising:
The step 14 of query source querying node forward node: the query source node carries out in inquiry itself has after the hash conversion each routing table and immediate first forward node of resource cryptographic Hash the resource keyword that will search, promptly and the shortest node of path between the destination node of storage resources, wherein, internodal path can obtain by the cryptographic Hash of comparison node IP address;
Forward node continues the step 15 of query node: this first forward node continues interior and immediate second forward node of resource keyword cryptographic Hash of each routing table that inquiry itself has, and circulation is until finding the destination node that has described resource.
The discover method of present embodiment resource can be optimized network diameter by many rings of reasonable disposition node, and the average number of hops of query node improves the efficient that network is found resource.
Referring to Figure 11-13, obtain the comparison schematic diagram of three ends of three rings, the configuration of four ends of Fourth Ring and Chord agreement, F-Chord agreement major parameter by l-G simulation test, degree, network diameter and the average number of hops of the routing table of three ring three ends (MRBD-3 (3)), four ends of Fourth Ring (MRBD-4 (4)) method for organizing will be lower than Chord agreement, F-Chord agreement relevant parameters, realized optimization, made the discovery speed of resource improve network.
Embodiment three
As shown in Figure 3, the discover method of resource in a kind of wireless peer-to-peer network, when all described nodes were on peer-to-peer network, it is described based on the foregoing description one be index value with all node configuration of correspondence with the ascending order of all node IP address cryptographic Hash to be that ranks are 2
M/2* 2
M/2The peer-to-peer network of matrix is to select n
1,1Arrive
The node of straight line path query node matrix leading diagonal be example, comprising:
The step 141 of query source querying node forward node: shown in Fig. 6-10, the query source node is made as the node n of first row, one row
1,1, the destination node of resource keyword cryptographic Hash correspondence is n
D_1, d_2The time, query source node n
1,1According to resource keyword cryptographic Hash each routing table that it has is inquired about, select ranks number all less than destination node n
D_1, d_2Ranks number, i.e. i_1≤d_1, i_2≤d_2, and with destination node n
D_1, d_2Between the shortest node of path as first forward node, wherein, internodal path can obtain by the cryptographic Hash of comparison node IP address;
Forward node continues the step 151 of query node: described first forward node is inquired about each routing table that it has according to described resource keyword cryptographic Hash again, selects ranks number all less than destination node n
D_1, d_2Ranks number, i.e. i_1≤d_1, i_2≤d_2, and with destination node n
D_1, d_2Between the shortest node of path as second forward node;
Generally will be by repeatedly seeking forward node, circulation searching is until finding the destination node n that has described resource
D_1, d_2Like this, because node is the organizational form of many rings, from n
1,1Arrive
Can select the leading diagonal n of node matrix equation
1,1Arrive
Straight line path, and do not need pile warp
Or
This paths will reduce path maximum in the network, thereby reduce network diameter.
In above-mentioned steps 141, because node is the organizational form of many rings, so each query source node can be set to the node n of first row, one row
1,1, other nodes on the ring can change its distributing position in matrix accordingly, and are unaffected, are convenient to the destination node that stores resource is inquired about.
Therefore, there are many rings to be provided with on each node, reduced network diameter, reduced the average number of hops of query node, saved the expense of peer-to-peer network routing table maintenance, improved the efficient of network discovery resource.
Referring to Figure 11-13, obtain the comparison schematic diagram of three ends of three rings, the configuration of four ends of Fourth Ring and Chord agreement, F-Chord agreement major parameter by l-G simulation test, degree, network diameter and the average number of hops of the routing table of three ends of three rings, four end of Fourth Ring method for organizing will be lower than Chord agreement, F-Chord agreement relevant parameters, realized optimization, made the discovery speed of resource improve network.
Embodiment four
Shown in Fig. 4, Fig. 6-10, shown in, in the practical application of wireless peer-to-peer network, the node of all value correspondences physical presence all in the Hash space, the destination node of query source node and inquiry may be on same ring, when the described node of part is on peer-to-peer network, owing to there is the node disappearance on the ring of query source node, query requests will be leapt to the node of back, may miss and the nearer destination node of query source hop length, need be in the time of will causing inquiring about some destination node through long path.So will make improvement to the foundation of each node route list, the node of missing is added in the routing table entry, the two-dimentional peer-to-peer network of many rings that the abbreviation part of nodes activates (MRBD for Partial Active nodes, MRBDPA).
When the described node of part is on peer-to-peer network, the discover method of resource in a kind of wireless peer-to-peer network is proposed, be index value with all node configuration of correspondence with the ascending order of all node IP address cryptographic Hash be that ranks are 2
M/2* 2
M/2The peer-to-peer network of matrix is an example, comprise: will lack in step 13 that node is added into routing table, its routing table of query source querying node with the step 142 of the immediate forward node of resource keyword cryptographic Hash and forward node and inquire about in its routing table step 152 with the immediate node of resource keyword cryptographic Hash, specify see as described below:
As shown in Figure 5, the disappearance node is added into the step 13 of routing table:
Add the step 131 of disappearance node for first routing table of query source node: the query source node is made as the node n of first row, one row in the described matrix
1,1, query source node n
1,1Search k capable near source node n
1,1Node n
I (k), j (k), k is the integer more than or equal to 2, as node n
I (k), j (k)Row number less than query source node n
1,1All routing tables in the row number of any one node, perhaps as node n
I (k), j (k)Row number less than query source node n
1,1All routing tables in the row number of any one node, described node is added first routing table of query source node;
Add the step 132 of disappearance node for the secondary route table of query source node: the query source node is the node n of first row, one row in the described matrix
1,1, query source node n
1,1Search in the j row near source node n
1,1Node n
I (k), j (k), j is the integer more than or equal to 2, as node n
I (k), j (k)Row number less than query source node n
1,1All routing tables in the row number of any one node, perhaps node n
I (k), j (k)Row number less than query source node n
1,1All routing tables in the row number of any one node, described node is added the secondary route table of query source node;
Be circulated to the step 133 of finish adding the disappearance node: circulation searching to k greater than the row of the minimum of the node of row minimum in the secondary route table of query source node number, and circulation searching to k greater than the row of the minimum of the node of row minimum in first routing table of query source node number, finish to add the disappearance node, can jump distance query source node n in the time of can guaranteeing to inquire about like this
1,1Nearest destination node;
The step 142 of query source querying node forward node: described query source node is inquired about each routing table according to resource keyword cryptographic Hash, select and described destination node between the shortest node of path as first forward node.
Forward node continues the step 152 of query node: described first forward node is inquired about next second forward node according to resource keyword cryptographic Hash to each routing table, and circulation searching is until finding the destination node that has described resource.
In above-mentioned steps 142, because node is the organizational form of many rings, so each query source node can be set to the node n of first row, one row
1,1, other nodes on the ring can change its distributing position in matrix accordingly, and are unaffected.
Therefore, there are many rings to be provided with on each node, reduced network diameter, reduced the average number of hops of query node, saved the expense of peer-to-peer network routing table maintenance, improved the efficient of network discovery resource.
Shown in Figure 14-16, the pairing node of all values in the Hash space can not all exist, at this situation, provided the simulation result when 40% node exists, obtained for three ring four ends (MRBDPA-3 (4)), six ends of Fourth Ring (MRBDPA-4 (6)) configuration and Chord agreement, the comparison schematic diagram of F-Chord agreement major parameter, four ends of three rings, the degree of the routing table of six end of Fourth Ring method for organizing, network diameter and average number of hops will be lower than the Chord agreement, F-Chord agreement relevant parameters, realized optimization, made the discovery speed of resource improve network.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claim.
Claims (10)
1, the method for organizing of node in a kind of wireless peer-to-peer network is characterized in that, comprising:
It is in the ring of index value with the node IP address cryptographic Hash that each node is included in one at least, described each node is that each ring that comprises this node is created a routing table respectively, and described each routing table is stored each node IP address and each the node IP address cryptographic Hash outside this node in its ring.
2, the method for organizing of node in the wireless peer-to-peer network according to claim 1, it is characterized in that, also comprise: ascending with each node IP address cryptographic Hash be index value with all node organizations of correspondence is a matrix, in described matrix, the query path of described each ring is to take out first query path that a node is formed in every row, or takes out second query path that a node is formed in every row.
3, the method for organizing of node in the wireless peer-to-peer network according to claim 2, it is characterized in that, described each routing table is first routing table of storing described node IP address and node IP address cryptographic Hash according to described first query path, perhaps stores the secondary route table of described IP addresses of nodes and node IP address cryptographic Hash according to described second query path.
4, the discover method of resource in a kind of wireless peer-to-peer network is characterized in that, it finds resource based on the arbitrary described node organization method of claim 1-3, comprising:
The query source node carries out in inquiry itself has after the hash conversion each routing table and the immediate forward node of resource keyword cryptographic Hash the resource that will search;
With the immediate next forward node of resource keyword cryptographic Hash, circulation is until finding the destination node that has described resource in each routing table that this forward node inquiry itself has.
5, the discover method of resource in the wireless peer-to-peer network according to claim 4, it is characterized in that, when all described nodes are on peer-to-peer network, the step of query source querying node forward node comprises: the query source node is set to the node of first row, one row in the described matrix, described query source node carries out inquiring about each routing table that itself has after the hash conversion to the resource keyword that will search, select ranks number all less than the ranks of the destination node that has described resource number, and and described destination node between the shortest node of path as forward node;
The step that forward node continues query node comprises: each routing table that itself is had by the forward node inquiry finds next forward node, and circulation is until finding the destination node that has described resource.
6, the discover method of resource in the wireless peer-to-peer network according to claim 4, it is characterized in that, when the described node of part is on peer-to-peer network, before the step of query source querying node forward node, the query source node is set to the node of first row, one row in the described matrix, search k capable in the node of the most approaching described query source node, k is the integer more than or equal to 2, when the row of described node number less than the row of any one node in all routing tables of described query source node number, perhaps when the row of described node number less than the row of any one node in all routing tables of described query source node number, described node is added first routing table of described query source node.
7, the discover method of resource in the wireless peer-to-peer network according to claim 6, it is characterized in that, search in the k row node near the query source node, when the row of described node number less than the row of any one node in all routing tables of described query source node number, perhaps the row of described node number add described node in the secondary route table of described query source node less than the row of any one node in all routing tables of described query source node number.
8, the discover method of resource in the wireless peer-to-peer network according to claim 7 is characterized in that, circulation searching to k greater than the row of the minimum of the node of row minimum in the secondary route table of described query source node number, finish to add node.
9, the discover method of resource in the wireless peer-to-peer network according to claim 8 is characterized in that, circulation searching to k greater than the row of the minimum of the node of row minimum in first routing table of described query source node number, finish to add node.
10, the discover method of resource in the wireless peer-to-peer network according to claim 9, it is characterized in that, the step that the query source node is searched forward node comprises: the query source node is set to the node of first row, one row in the described matrix, described query source node carries out each routing table that inquiry itself has after the hash conversion to the resource keyword that will search, select and described destination node between the shortest node of path as forward node;
The step that forward node continues query node comprises: each routing table that itself is had by the forward node inquiry finds next forward node, and circulation is until finding the destination node that has described resource.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008102251901A CN101399778B (en) | 2008-10-30 | 2008-10-30 | Node organizing method and resource discovery method in wireless P2P network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008102251901A CN101399778B (en) | 2008-10-30 | 2008-10-30 | Node organizing method and resource discovery method in wireless P2P network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101399778A true CN101399778A (en) | 2009-04-01 |
| CN101399778B CN101399778B (en) | 2011-08-31 |
Family
ID=40518041
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008102251901A Expired - Fee Related CN101399778B (en) | 2008-10-30 | 2008-10-30 | Node organizing method and resource discovery method in wireless P2P network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101399778B (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011107000A1 (en) * | 2010-03-05 | 2011-09-09 | 华为技术有限公司 | Resource control method, apparatus and system in peer-to-peer network |
| CN102325301A (en) * | 2011-07-28 | 2012-01-18 | 同济大学 | Mobile P2P (peer-to-peer) network resource positioning and scheduling method |
| CN101741844B (en) * | 2009-12-11 | 2012-06-20 | 北京工业大学 | Method for discovering peer nodes of P2P file sharing network based on centre indexing |
| WO2012079240A1 (en) * | 2010-12-17 | 2012-06-21 | Empire Technology Development Llc | Device discovery in a ubiquitous computing environment |
| CN102905339A (en) * | 2012-10-19 | 2013-01-30 | 南京邮电大学 | Peer query method for JXTA (juxtapose) overlay network based on mobile ad-hoc network (MANET) |
| CN104967968A (en) * | 2015-05-28 | 2015-10-07 | 北京海尔广科数字技术有限公司 | Multi-hop resource finding method and apparatus |
| CN105007610A (en) * | 2015-05-28 | 2015-10-28 | 北京海尔广科数字技术有限公司 | Method and apparatus for discovering resource through multiple hops |
| CN105208622A (en) * | 2015-08-26 | 2015-12-30 | 江苏林洋电子股份有限公司 | High-efficiency dynamic automatic-maintenance routing list structure and routing list management method |
| CN105338029A (en) * | 2014-08-01 | 2016-02-17 | 青岛海尔智能家电科技有限公司 | Resource discovery method and device |
| CN102487397B (en) * | 2010-12-02 | 2016-08-10 | 山东智慧生活数据系统有限公司 | Data based on node underlying security grade storage and method for routing and node |
| CN107273392A (en) * | 2016-04-06 | 2017-10-20 | 百度（美国）有限责任公司 | Computer implemented method, device and data handling system for searching for image |
| CN107306194A (en) * | 2016-04-19 | 2017-10-31 | 华为技术有限公司 | The construction method of network system and network system |
| CN109104466A (en) * | 2018-07-24 | 2018-12-28 | 南京邮电大学 | A kind of WoT method for managing resource based on P2P |
| CN113238185A (en) * | 2021-07-12 | 2021-08-10 | 中国人民解放军国防科技大学 | Fibonacci scatter search-based non-cooperative target positioning method and system |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100365997C (en) * | 2005-08-26 | 2008-01-30 | 南京邮电大学 | Distributed hash table in opposite account |
| CN100518129C (en) * | 2007-12-10 | 2009-07-22 | 华中科技大学 | Universal resource management method under confusion type peer-to-peer network environment |
-
2008
- 2008-10-30 CN CN2008102251901A patent/CN101399778B/en not_active Expired - Fee Related
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101741844B (en) * | 2009-12-11 | 2012-06-20 | 北京工业大学 | Method for discovering peer nodes of P2P file sharing network based on centre indexing |
| CN102195790A (en) * | 2010-03-05 | 2011-09-21 | 华为技术有限公司 | Resource control method, device and system for peer-to-peer network |
| WO2011107000A1 (en) * | 2010-03-05 | 2011-09-09 | 华为技术有限公司 | Resource control method, apparatus and system in peer-to-peer network |
| CN102487397B (en) * | 2010-12-02 | 2016-08-10 | 山东智慧生活数据系统有限公司 | Data based on node underlying security grade storage and method for routing and node |
| WO2012079240A1 (en) * | 2010-12-17 | 2012-06-21 | Empire Technology Development Llc | Device discovery in a ubiquitous computing environment |
| CN103229163A (en) * | 2010-12-17 | 2013-07-31 | 英派尔科技开发有限公司 | Device discovery in a ubiquitous computing environment |
| US8850021B2 (en) | 2010-12-17 | 2014-09-30 | Empire Technology Development Llc | Device discovery in a ubiquitous computing environment |
| CN103229163B (en) * | 2010-12-17 | 2016-08-10 | 英派尔科技开发有限公司 | Equipment in general calculation entironment finds |
| CN102325301A (en) * | 2011-07-28 | 2012-01-18 | 同济大学 | Mobile P2P (peer-to-peer) network resource positioning and scheduling method |
| CN102325301B (en) * | 2011-07-28 | 2013-12-25 | 同济大学 | Mobile P2P (peer-to-peer) network resource positioning and scheduling method |
| CN102905339A (en) * | 2012-10-19 | 2013-01-30 | 南京邮电大学 | Peer query method for JXTA (juxtapose) overlay network based on mobile ad-hoc network (MANET) |
| CN102905339B (en) * | 2012-10-19 | 2014-11-19 | 南京邮电大学 | Peer query method for JXTA (juxtapose) overlay network based on mobile ad-hoc network (MANET) |
| CN105338029B (en) * | 2014-08-01 | 2018-11-27 | 青岛海尔智能家电科技有限公司 | A kind of resource discovery method and device |
| CN105338029A (en) * | 2014-08-01 | 2016-02-17 | 青岛海尔智能家电科技有限公司 | Resource discovery method and device |
| CN105007610A (en) * | 2015-05-28 | 2015-10-28 | 北京海尔广科数字技术有限公司 | Method and apparatus for discovering resource through multiple hops |
| CN104967968A (en) * | 2015-05-28 | 2015-10-07 | 北京海尔广科数字技术有限公司 | Multi-hop resource finding method and apparatus |
| CN105208622A (en) * | 2015-08-26 | 2015-12-30 | 江苏林洋电子股份有限公司 | High-efficiency dynamic automatic-maintenance routing list structure and routing list management method |
| CN105208622B (en) * | 2015-08-26 | 2019-05-10 | 江苏林洋能源股份有限公司 | A kind of route selection method and method for managing route table of the router-table structure that high-efficiency dynamic is safeguarded automatically |
| CN107273392A (en) * | 2016-04-06 | 2017-10-20 | 百度（美国）有限责任公司 | Computer implemented method, device and data handling system for searching for image |
| CN107306194A (en) * | 2016-04-19 | 2017-10-31 | 华为技术有限公司 | The construction method of network system and network system |
| CN107306194B (en) * | 2016-04-19 | 2019-12-06 | 华为技术有限公司 | network system and method for constructing network system |
| CN109104466A (en) * | 2018-07-24 | 2018-12-28 | 南京邮电大学 | A kind of WoT method for managing resource based on P2P |
| CN109104466B (en) * | 2018-07-24 | 2021-01-26 | 南京邮电大学 | WoT resource management method based on P2P |
| CN113238185A (en) * | 2021-07-12 | 2021-08-10 | 中国人民解放军国防科技大学 | Fibonacci scatter search-based non-cooperative target positioning method and system |
| CN113238185B (en) * | 2021-07-12 | 2021-09-24 | 中国人民解放军国防科技大学 | Fibonacci scatter search-based non-cooperative target positioning method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101399778B (en) | 2011-08-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101399778B (en) | Node organizing method and resource discovery method in wireless P2P network | |
| CN109618381B (en) | Ad hoc network communication method and ad hoc network communication system | |
| US7668119B2 (en) | Ad hoc network formation and management based on aggregation of ad hoc nodes according to an aggregation hierarchy | |
| Chaudhuri et al. | TreeCast: A stateless addressing and routing architecture for sensor networks | |
| Mishra et al. | Survey on recent clustering algorithms in wireless sensor networks | |
| Garg et al. | A review of routing protocols in mobile ad hoc networks | |
| CN101330529B (en) | Method for distributing address of self-pruning type tree-shaped structure network | |
| CN101902388A (en) | Expandable fast discovery technology for multi-stage sequencing resources | |
| Sharma et al. | An efficient cluster based routing protocol for MANET | |
| Deokate et al. | Mobility-aware cross-layer routing for peer-to-peer networks | |
| CN101360055B (en) | P2P network information resource location method having constant hop routing characteristic | |
| Wirtz et al. | Mesh-DHT: A locality-based distributed look-up structure for Wireless Mesh Networks | |
| Paliwal et al. | A topology based routing protocols comparative analysis for manets | |
| Zhang et al. | PCAR: A power controlled routing protocol for wireless ad hoc networks | |
| Wong et al. | Hybrid address configuration for tree-based wireless sensor networks | |
| Viana et al. | Easily-managed and topology-independent location service for self-organizing networks | |
| Kunz et al. | Efficient routing in mobile ad-hoc social networks | |
| Shah et al. | An efficient and scalable routing for MANETs | |
| Song et al. | Multi-hop scatternet formation and routing for large scale Bluetooth networks | |
| Eriksson et al. | Routing scalability in MANETs | |
| Bhatti | A novel scheme for address assignment in wireless sensor networks | |
| Ren et al. | Unicast routing in mobile ad hoc networks: Present and future directions | |
| Srivastava et al. | A performance analysis of routing protocols in mobile ad-hoc networks | |
| Chauhan et al. | Global cluster cooperation strategy in mobile ad hoc networks | |
| Shahbazi | A survey on hybrid routing protocols in MANETS |
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: 20110831 Termination date: 20111030 |