CN102843744A - Self-networking node coordination and trust method based on two-way quantitative evaluation in ubiquitous computing - Google Patents
Self-networking node coordination and trust method based on two-way quantitative evaluation in ubiquitous computing Download PDFInfo
- Publication number
- CN102843744A CN102843744A CN2012103333750A CN201210333375A CN102843744A CN 102843744 A CN102843744 A CN 102843744A CN 2012103333750 A CN2012103333750 A CN 2012103333750A CN 201210333375 A CN201210333375 A CN 201210333375A CN 102843744 A CN102843744 A CN 102843744A
- Authority
- CN
- China
- Prior art keywords
- node
- credit value
- self
- judge
- coordination
- 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
- 238000000034 method Methods 0.000 title claims abstract description 21
- 238000011158 quantitative evaluation Methods 0.000 title abstract 2
- 230000007246 mechanism Effects 0.000 claims abstract description 10
- 238000011002 quantification Methods 0.000 claims description 12
- 230000002195 synergetic effect Effects 0.000 claims description 8
- 230000005540 biological transmission Effects 0.000 claims description 3
- 230000001737 promoting effect Effects 0.000 abstract 1
- 230000008859 change Effects 0.000 description 2
- 238000007796 conventional method Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000018109 developmental process Effects 0.000 description 2
- 230000000977 initiatory effect Effects 0.000 description 2
- 201000004569 Blindness Diseases 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000008929 regeneration Effects 0.000 description 1
- 238000011069 regeneration method Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention provides a self-networking node coordination and trust method based on two-way quantitative evaluation in ubiquitous computing. The method comprises the following steps of: adjusting coordination in message transferring based on an evaluating credit value; calculating an evaluating credit value S under ready consumption though a node of a sending side based on a sending coordination mechanism; determining an evaluating credit value R to be promoted through the node of a receiving side based on receiving the coordination mechanism; if S is not less than R, reaching a trust between two sides, and determining that a final evaluating credit value for consumption and promoting is (S+R)/2, otherwise, determining that the coordination between the two sides fails. With adoption of the method, the coordination of nodes can be effectively excited; an excellent message transmitting rate and time delay can be achieved at a limited resource condition in the ubiquitous computing, and resource consumption can be actively promoted to be reduced; and moreover, the method can effectively solve the problem due to block caused by blind coordination of the nodes to a performance of a network.
Description
Technical field
The present invention relates to self-organizing network nodes and transmit the collaborative of interaction technique, especially self-organizing network nodes and trust lift technique, the collaborative and trust method of the self-organizing network nodes of passing judgment on based on two-way quantification in specifically a kind of ubiquitous environment.
Background technology
The notion of " ubiquitous calculating " (Ubiquitous Computing) in 1991 is proposed by the breadboard computer scientist of Xerox; This conceptual description anyone no matter when and where can be connected with network through suitable terminal equipment, obtain the brand-new information environment of individual info service.After this; Attend Japan and Korea S has proposed " ubiquitous environment is a Ubiquitous Network " (U-biquitous Network), European Union and has proposed " environment sensing intelligence " (Am-bient Intelligence), the U.S. and proposed " ubiquitous knowledge environment " (Ubiq-uitous Knowledge Environment) and wait and describe difference but the notion of intension unanimity on the basis of " ubiquitous calculating "; Its target all is " to set up multilingual a, multimedia, mobile, semantic network environment, to promote the development and the change of information service ".Current, Ubiquitous Network is all being implemented targetedly in Asia-Pacific, European Union, North America, has formulated clear and definite promotion policy and development plan from the national industry height, is devoted to realize from " E epoch " transformation to " U epoch ".In ubiquitous environment; The internet at any time with situation under can be interconnected comprehensively; The issue of information with exchange and will change network structure, the staggered pattern of transmitting into by traditional linear structure, unidirectional delivery pattern; Each user can become the publisher and the transmitter of information, and organizing also of information maintained close ties with user behavior more.
At present, ubiquitous environment is that Ubiquitous Network (Ubiquitous networks) is widely used in reading intelligent agriculture, perception environment, a plurality of fields such as intelligent transportation, wild scientific investigation.MANET in the ubiquitous environment relies on internodal cooperation and trust to carry out networking work with " storing-carry-transmit " mode.Since the resource-constrained of the self-organizing network nodes in the ubiquitous environment, and the self-organizing network nodes energy is difficult to regeneration in the environment of the overwhelming majority, in order to guarantee operate as normal, node can be practiced thrift own resource, and other node forwarding information refuses one's help.This selfishness property has seriously undermined network performance.
At present, both at home and abroad to self-organizing network nodes in the ubiquitous environment is collaborative mainly exist with trust schemes below several kinds:
Scheme 1:N.Li and S.Das propose each node has a table of depositing other node trust value, preferentially selects the big node of trust value to jump as next.This scheme shortcoming is that can't to excite low value node to participate in effectively collaborative, and the resource of having quickened big trust value node is excessively used.
Scheme 2:U Shevade proposes a cover doulbe-sides' victory rule, and the A node is the data volume transmitted of B with B is that the data volume of A forwarding is identical.This scheme shortcoming is the transmission that same quantity of data is seldom arranged in the ubiquitous environment of reality, has certain blindness, and network performance is difficult to promote.
Summary of the invention
The objective of the invention is to the problems referred to above, the self-organizing network nodes that proposes to pass judgment on based on two-way quantification in a kind of ubiquitous environment is worked in coordination with and trust method, improves the cooperation enthusiasm of selfish node, strengthens network performance.
Technical scheme of the present invention is:
Collaborative and the trust method of the self-organizing network nodes of passing judgment on based on two-way quantification in a kind of ubiquitous environment; At first deposit the table that node self is passed judgment on credit value for one of each node configuration; The initial value of the judge credit value of all nodes is identical, and each node carries out the collaborative of forwards through passing judgment on the credit value adjustment: promptly arbitrary node consumes self and passes judgment on credit value after other node for data forwarding; Initiatively receiving other nodes changes after the data sent, promotes himself and passes judgment on credit value.
The concrete following steps that adopt of judge credit value of the present invention adjustment: the transmit leg node calculates and self is ready the judge credit value S that consumes according to sending synergistic mechanism; Recipient's node calculates the judge credit value R that oneself hopes lifting according to receiving synergistic mechanism; If S >=R; Then both sides reach trust, and the final judge credit value that both sides consume and promote is (S+R)/2; Otherwise, the collaborative failure of both sides.
The transmission synergistic mechanism that the present invention adopts is: the transmit leg node according to self residual resource, transmit leg node current self the judge credit value, send out the size of sending message and this message existence remaining time, adopt computes transmit leg node self to be ready the judge credit value S that consumes:
In the calculating of described judge credit value S, the size of sending message is sent out in the K representative, and M is the current judge credit value that has of transmit leg node, and P represents the remaining space percentage of transmit leg node, T
ReAnd T
TTLThe existence remaining time of difference information representing and existence total time; A and b are two weight coefficients; Represent that respectively node is for self residual resource and the message existence preference of remaining time; Each node is with self functional requirement and separately the understanding of environment is estimated the factors as two, set by analytic hierarchy process (AHP), and a+b=1.
The reception synergistic mechanism that the present invention adopts is that recipient's node adopts computes node self to hope the judge credit value R that promotes according to its other resources and the current judge credit value that has:
R=K＇M＇×[(1-L)
2+(1-E)
2]/[(1-L)+(1-E)]
In the calculating of described judge credit value R, K ＇ representative waits to receive the size of message, and M represents the current judge credit value that has of receiving node, and L ＇ represents receiving node current residual space percentage, and E represents receiving node current remaining percentage.
Surplus resources of the present invention comprises the dump energy of the remaining space and the node of node.The remaining space of node representes that with remaining space percentage the dump energy of node is represented with dump energy percentage.
The free buffer space size that remaining space percentage of the present invention is the current time node and the ratio of initial spatial cache size, the ability of expression node storing message.
The ratio of the residual energy value that dump energy percentage of the present invention is the current time node and the primary power value of node, the expression node is transmitted the ability of message.
Beneficial effect of the present invention:
Method of the present invention can encourage node cooperation effectively, and under the limited resources condition of ubiquitous environment, the present invention has superior message transmissibility and time delay than conventional method, initiatively promotes the reduction of resource consumption.In network traffic carrying capacity more for a long time, the present invention has solved in the conventional method node effectively and has blindly cooperated to the obstruction of network performance.
Description of drawings
Fig. 1 is a flow chart of the present invention.
Embodiment
Below in conjunction with accompanying drawing and embodiment the present invention is further described.
As shown in Figure 1; Collaborative and the trust method of the self-organizing network nodes of passing judgment on based on two-way quantification in a kind of ubiquitous environment; Carry out the collaborative of forwards through passing judgment on the credit value adjustment between node; Any node can consume self to other node for data forwarding and pass judgment on credit value, initiatively receives other nodes commentaries on classics data sent and can promote its judge credit value.
During practical implementation:
The first step is trusted preliminary treatment.Message is the message in the node A buffer memory; When node A and Node B are met; If the collision probability of the destination node of Node B and Message is greater than node A; Node A calculates according to
and self is ready the judge credit value S that consumes so, and prepares Message is transmitted to Node B.
Second step, the collaborative initiation.Node A is initiation session at first, sends solicited message then to Node B, solicited message comprise in have: the id of Message, destination node, message size and node A self are ready the judge credit value S that consumes.
In the 3rd step, trust and set up.After Node B is received solicited message, if Node B confirms to receive Message for the first time and be not the destination node of Message that Node B will be according to K ＇ M ＇ * [(1-L) so
2+ (1-E)
2]/[is (1-L)+(1-E)] calculate the own judge credit value R that hopes lifting.If the R of Node B is less than the S of node A, Node B will feed back to node A confirmation so, comprise the id (identity code) and the R of message, and the expression Node B is ready to receive Message.
In the 4th step, data passes is estimated with adjustment.After the node A service of receiving is confirmed, begin to send Message.After the forwarding of accomplishing Message, the judge credit value of node A reduces (S+R)/2, and the judge credit value of Node B increases (S+R)/2 simultaneously, and node A deletes message Message in the buffer memory of oneself then.
The present invention does not relate to all identical with the prior art prior art that maybe can adopt of part and realizes.
Claims (7)
1. work in coordination with and trust method based on the self-organizing network nodes of two-way quantification judge in a ubiquitous environment; It is characterized in that: at first deposit the table that node self is passed judgment on credit value for one of each node configuration; The initial value of the judge credit value of all nodes is identical; Each node carries out the collaborative of forwards through passing judgment on the credit value adjustment: promptly arbitrary node is after other node for data forwarding; Consume self and pass judgment on credit value, initiatively receiving other nodes changes after the data sent, promotes himself and passes judgment on credit value.
2. the collaborative and trust method of the self-organizing network nodes of passing judgment on based on two-way quantification in the ubiquitous environment according to claim 1; It is characterized in that the concrete following steps that adopt of described judge credit value adjustment: the transmit leg node calculates and self is ready the judge credit value S that consumes according to sending synergistic mechanism; Recipient's node calculates the judge credit value R that oneself hopes lifting according to receiving synergistic mechanism; If S >=R, then both sides reach trust, and the final judge credit value that both sides consume and promote is (S+R)/2; Otherwise, the collaborative failure of both sides.
3. the collaborative and trust method of the self-organizing network nodes of passing judgment on based on two-way quantification in the ubiquitous environment according to claim 2; It is characterized in that described transmission synergistic mechanism is: the transmit leg node according to self residual resource, transmit leg node current self the judge credit value, send out the size of sending message and this message existence remaining time, adopt computes transmit leg node self to be ready the judge credit value S that consumes:
In the calculating of described judge credit value S, the size of sending message is sent out in the K representative, and M is the current judge credit value that has of transmit leg node, and P represents the remaining space percentage of transmit leg node, T
ReAnd T
TTLRespectively existence remaining time of information representing and existence total time, a and b are two weight coefficients, represent the preference that node is survived remaining time for self residual resource and message respectively, and a+b=1.
4. the collaborative and trust method of the self-organizing network nodes of passing judgment on based on two-way quantification in the ubiquitous environment according to claim 2; It is characterized in that described reception synergistic mechanism is; Recipient's node adopts computes node self to hope the judge credit value R that promotes according to its other resources and the current judge credit value that has:
R=K＇M＇×[(1-L)
2+(1-E)
2]/[(1-L)+(1-E)]
In the calculating of described judge credit value R, K ＇ representative waits to receive the size of message, and M represents the current judge credit value that has of receiving node, and L ＇ represents receiving node current residual space percentage, and E represents receiving node current remaining percentage.
5. the collaborative and trust method of the self-organizing network nodes of passing judgment on based on two-way quantification in the ubiquitous environment according to claim 3 is characterized in that described surplus resources comprises the dump energy of the remaining space and the node of node.The remaining space of node representes that with remaining space percentage the dump energy of node is represented with dump energy percentage.
6. work in coordination with and trust method according to the self-organizing network nodes of passing judgment on based on two-way quantification in claim 4, the 5 described ubiquitous environment; The ratio that it is characterized in that free buffer space size that described remaining space percentage is the current time node and initial spatial cache size, the ability of expression node storing message.
7. work in coordination with and trust method according to the self-organizing network nodes of passing judgment on based on two-way quantification in claim 4, the 5 described ubiquitous environment; It is characterized in that the ratio of residual energy value that described dump energy percentage is the current time node and the primary power value of node, the expression node is transmitted the ability of message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210333375.0A CN102843744B (en) | 2012-09-10 | 2012-09-10 | Self-networking node coordination and trust method based on two-way quantitative evaluation in ubiquitous computing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210333375.0A CN102843744B (en) | 2012-09-10 | 2012-09-10 | Self-networking node coordination and trust method based on two-way quantitative evaluation in ubiquitous computing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102843744A true CN102843744A (en) | 2012-12-26 |
| CN102843744B CN102843744B (en) | 2015-05-27 |
Family
ID=47370741
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210333375.0A Expired - Fee Related CN102843744B (en) | 2012-09-10 | 2012-09-10 | Self-networking node coordination and trust method based on two-way quantitative evaluation in ubiquitous computing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102843744B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101296190A (en) * | 2008-06-27 | 2008-10-29 | 清华大学 | Cooperative communication mode based on game theory in wireless ad hoc network |
| US20090323640A1 (en) * | 2008-06-26 | 2009-12-31 | Qualcomm Incorporated | Fair resource sharing in wireless communications |
-
2012
- 2012-09-10 CN CN201210333375.0A patent/CN102843744B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090323640A1 (en) * | 2008-06-26 | 2009-12-31 | Qualcomm Incorporated | Fair resource sharing in wireless communications |
| CN101296190A (en) * | 2008-06-27 | 2008-10-29 | 清华大学 | Cooperative communication mode based on game theory in wireless ad hoc network |
Non-Patent Citations (2)
| Title |
|---|
| CHEE-WAH TAN, ET.AL: ""Enforcing Cooperation in an Ad Hoc Network using a Cost-Credit Based Forwarding and Routing Approach"", 《WCNC 2007 PROCEEDINGS》 * |
| 许智君等: ""MANET网络激励节点协作的信任评估路由协议"", 《通信学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102843744B (en) | 2015-05-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Liu et al. | A green and reliable communication modeling for industrial internet of things | |
| CN102256267B (en) | The node clustering method of energy priority in radio sensing network | |
| Li et al. | Pipeline slot based fast rerouting scheme for delay optimization in duty cycle based M2M communications | |
| Singh et al. | Low latency and energy efficient routing-aware network coding-based data transmission in multi-hop and multi-sink WSN | |
| Altman et al. | Optimal activation and transmission control in delay tolerant networks | |
| Xiang et al. | Duty cycle adaptive adjustment based device to device (D2D) communication scheme for WSNs | |
| CN103118413B (en) | A kind of IPv6 industrial wireless sensor network method for routing based on deterministic schedule | |
| CN102868602A (en) | Improved routing method based on social correlation degree in delay tolerant network | |
| CN102164425A (en) | MTC (machine type communication)equipment management method, system and MTC equipment | |
| Wu et al. | Packet size-aware broadcasting in VANETs with fuzzy logic and RL-based parameter adaptation | |
| CN101291295B (en) | Probabilistic routing method with limited time delay based on intermittent communicated self-organizing network | |
| CN109802773A (en) | A kind of cooperative wireless network network data transmission method of social activity degree of belief perception | |
| US9713054B2 (en) | Communication terminal and method for communicating data | |
| Li et al. | Energy efficiency of five broadcast‐based ARQ protocols in multi‐hop wireless sensor networks | |
| Laya et al. | Green MTC, M2M, internet of things | |
| Nasri et al. | Adaptive dynamic multi‐hop technique for clustering protocol in wireless sensor networks assisted‐Internet of Things applications | |
| CN105517094B (en) | Energy information piggybacking-based efficient routing method in mobile sensor network | |
| CN102843744A (en) | Self-networking node coordination and trust method based on two-way quantitative evaluation in ubiquitous computing | |
| CN104378180B (en) | Multicast reliability based on binary system molecule traffic model determines method | |
| CN103152252A (en) | Whole-domain synergy forwarding method for wireless sensing ad-hoc network nodes | |
| CN103002536A (en) | Energy efficient wireless multi-hop network routing mechanism based on random walks | |
| CN102594906A (en) | Data fusion method and device | |
| CN102932869B (en) | Distance and delay based method for effectively transmitting energy in mobile relay system | |
| CN103607748A (en) | Maximum lifetime routing method based on node lifetimes | |
| CN104936225A (en) | Message distribution optimized control method for hybrid mobile social network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: INSTITUTE OF STATE GRID INTELLIGENT ELECTRIC GRIDS Free format text: FORMER OWNER: WUXI NJUST TECHNOLOGY DEVELOPMENT CO., LTD. Effective date: 20150427 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| C53 | Correction of patent of invention or patent application | ||
| CB03 | Change of inventor or designer information |
Inventor after: Li Qianmu Inventor after: Chen Hanjing Inventor after: Xu Xiaoqiang Inventor after: Li Deqiang Inventor after: Hou Jun Inventor before: Li Qianmu Inventor before: Qi Yong Inventor before: Hou Jun |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: LI QIANMU QI YONG HOU JUN TO: LI QIANMU CHEN HANJING XU XIAOQIANG LI DEQIANG HOU JUN Free format text: CORRECT: ADDRESS; FROM: 214192 WUXI, JIANGSU PROVINCE TO: 210003 NANJING, JIANGSU PROVINCE |
|
| TA01 | Transfer of patent application right |
Effective date of registration: 20150427 Address after: Nanjing City, Jiangsu Province, 210003 South Shui Road No. 8 Applicant after: State Grid Smart Grid Institute Address before: 214192 Jiangsu City, Xishan Province Economic Development Zone, Xishan Furong Road No. 99, No. three, No. Applicant before: Wuxi Nanligong Technology Development Co., Ltd. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150527 Termination date: 20170910 |