CN112601294B - Wireless Mesh ad hoc network trusted connection excitation method based on energy consumption balance - Google Patents

Wireless Mesh ad hoc network trusted connection excitation method based on energy consumption balance Download PDF

Info

Publication number
CN112601294B
CN112601294B CN202011315408.XA CN202011315408A CN112601294B CN 112601294 B CN112601294 B CN 112601294B CN 202011315408 A CN202011315408 A CN 202011315408A CN 112601294 B CN112601294 B CN 112601294B
Authority
CN
China
Prior art keywords
node
nodes
backbone
combination
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.)
Active
Application number
CN202011315408.XA
Other languages
Chinese (zh)
Other versions
CN112601294A (en
Inventor
徐乃庭
胡岩峰
廉海明
任岩
王毅
张培
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Suzhou Research Institute Institute Of Electronics Chinese Academy Of Sciences
Original Assignee
Suzhou Research Institute Institute Of Electronics Chinese Academy Of Sciences
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Suzhou Research Institute Institute Of Electronics Chinese Academy Of Sciences filed Critical Suzhou Research Institute Institute Of Electronics Chinese Academy Of Sciences
Priority to CN202011315408.XA priority Critical patent/CN112601294B/en
Publication of CN112601294A publication Critical patent/CN112601294A/en
Application granted granted Critical
Publication of CN112601294B publication Critical patent/CN112601294B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)

Abstract

The invention provides a trusted connection excitation method of a wireless Mesh ad hoc network, which comprises the steps of setting registration qualification of backbone nodes and admission conditions of branch nodes, screening out a backbone network node set with the qualification of constructing a private network and a branch node set allowing borrowing the backbone nodes to access the Internet; calculating the overall cooperation level of the backbone network node networking according to the cooperation willingness and the possessed energy of the dynamic nodes, and screening out a backbone node set needing to receive a new node; and removing monopoly nodes from the expected receiving node combination of the backbone nodes, determining an effective expected combination, calculating the average expenditure of single nodes of the effective expected combination, determining a winner set and a corresponding access node set, and completing the credible connection of the wireless ad hoc network based on an excitation method. The networking of the invention has the characteristics of mutual trust, active cooperation and balanced energy consumption, and considers the combination will of the network nodes to be accessed and the node combination expected to be received by the backbone nodes.

Description

Wireless Mesh ad hoc network trusted connection excitation method based on energy consumption balance
Technical Field
The invention relates to the field of wireless ad hoc networks, in particular to a trusted connection excitation method for a wireless Mesh ad hoc network.
Background
The wireless Mesh network does not need the support of basic facilities such as a base station and the like, takes a distributed idea as guidance, and constructs a dynamic self-organized wireless multi-hop network, so that nodes in a network coverage range can flexibly perform high-speed wireless access on the Internet, and dynamically maintain the contact with other nodes. In the wireless Mesh network, each node has the capability of sending out a wireless signal, the network coverage is greatly widened, and meanwhile, each node has a routing function and can forward data, so that data congestion caused by the increase of access nodes is avoided. In addition, the self-repairing technology of the Mesh network can ensure that when one connection path fails, the network nodes can adaptively search the communication paths for communication, and therefore the stability and reliability of the whole network are improved. The wireless Mesh network can meet the communication requirements of modern military and social development, and therefore has very important research value.
In the wireless Mesh network, as long as a mobile phone is connected to the network, people in a certain area around the mobile phone can build an internet belonging to the mobile phone. However, it is difficult to secure personal information in this communication method, and power consumption of the backbone node is enormous. In addition, the outdoor environment is complex, the difficulty in deploying communication basic equipment is high, and the energy use of wireless network nodes is lack of balance, so that the access of outdoor mobile nodes to the internet and the communication among the nodes face huge challenges. Therefore, balanced energy consumption and reliable access are two important issues that need to be focused on in the wireless ad hoc network.
Supposing that one dynamic Node can be connected with the internet, after the Node is connected into the internet, other dynamic nodes in the power coverage range can all surf the internet through the Node hot spot, and communication among the dynamic nodes (intelligent mobile phones) can be realized. The new dynamic node wants to access the networking to realize the purpose of surfing the internet or communicating with the nodes in the networking, and only the dynamic node meeting the requirement has the qualification of applying for joining the networking through the evaluation and the certification of credit and cooperation capability. The evaluation of the reputation is to ensure the information security of the node communication, and the evaluation of the cooperation capability is to measure whether the current node can better cooperate with other nodes to realize networking communication. Considering that all nodes in a networking access the internet need to forward messages by means of the nodes, the electric energy of the nodes is consumed greatly, and in order to better stimulate the nodes to provide network assistance without privacy, the nodes are required to obtain economic or other benefits. In fact, in a region, more than one dynamic node may have the capability of connecting to the internet (the network radio wave can cover), and meanwhile, a large number of nodes which cannot connect to the internet (the network radio wave does not cover) may exist, so that an effective method is designed to plan a cooperative group to achieve the free convenience of network connection, which conforms to the concept of the information age.
Disclosure of Invention
The invention aims to provide a trusted connection excitation method for a wireless Mesh ad hoc network.
The technical solution for realizing the purpose of the invention is as follows: a trusted connection excitation method for a wireless Mesh ad hoc network comprises the following steps:
step 1, setting registration qualification of backbone nodes and admission conditions of branch nodes, screening out a backbone network node set with the qualification of constructing a private network and a branch node set allowing borrowing the backbone nodes to access the Internet;
step 2, calculating the overall cooperation level of the backbone network node networking according to the cooperation willingness and the possessed energy of the dynamic nodes, and screening out a backbone node set needing to receive a new node;
and 3, removing monopoly nodes from the expected receiving node combination of the backbone nodes, determining an effective expected combination, calculating the average expenditure of single nodes of the effective expected combination, determining a winner set and a corresponding access node set, and completing the trusted connection of the wireless ad hoc network based on the excitation method.
Compared with the prior art, the invention has the remarkable advantages that: the method can effectively stimulate the complete rationality nodes covered by network electromagnetism to construct a networking and assist other nodes covered by non-electromagnetism to carry out network communication, and the networking has the characteristics of mutual trust, active cooperation and energy consumption balance, and considers the combination willingness of the network nodes to be accessed and the node combination expected to be received by the backbone nodes.
Drawings
Fig. 1 is a flowchart of a trusted connection excitation method of a wireless Mesh ad hoc network.
Fig. 2 is a schematic diagram of an excitation mechanism for establishing Mesh end networking and node access.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
The invention is suitable for a wireless Mesh network environment, nodes seeking to access the internet all have a routing forwarding function, and dynamic nodes realize network access and information exchange among the nodes through cooperation. The invention aims to design a set of mechanism to stimulate electromagnetic coverage nodes to share hot spots to construct an ad hoc network (similar to a wireless Mesh terminal network), control the safe access of non-electromagnetic coverage nodes to the existing ad hoc network which is published externally by establishing a multi-party interest relationship, fully consider the load of each networking internal node, balance energy consumption and ensure the lasting stability of the ad hoc network. In addition, the invention uses the weighted aggregation idea for adaptive analysis to determine whether a new node needs to be introduced into the current ad hoc network or not so as to improve the overall cooperation capability. With the loss of the energy of the whole node, the communication cooperation capability presents a descending trend, because the fully rational nodes are selfish, the forced requirement of the fully rational nodes for assisting in forwarding messages can enable the nodes to be separated from a team for pursuing benefit balance, and the introduction of new nodes can certainly increase the communication links of the existing nodes, but the excessive addition of the new nodes can enable backbone nodes (the only nodes connected with the internet in each networking mode) to run in an overload mode, and the benefits of the backbone nodes are damaged to a certain extent. Therefore, the invention designs a set of scheme to control the overall cooperation level in the network, and ensures the benefit balance of each party.
The energy consumption balance-based trusted connection excitation method for the wireless Mesh ad hoc network has the following specific steps, and the whole detailed operation process is shown in figure 1:
step 100: the method comprises the steps of counting nodes which are electromagnetically covered by a network in a certain area and are expected to establish networking to play a network access medium, namely backbone nodes, and counting dynamic nodes which are not electromagnetically covered by the network in the certain area and are intentionally accessed to the Internet, namely branch nodes. And the registration qualification of the backbone node and the admission condition of the branch node are determined, and the detailed steps comprise:
dynamic node state initialization 101: suppose a certain area of memoryAt k dynamic nodes, defined as a ═ a1,...,akH, m electromagnetically covered backbone nodes B ═ B1,...,bmCan be connected to the internet and build a private network, there are n non-electromagnetically covered branch nodes C ═ C1,...,cnIntentional access to the internet requires the achievement of a goal by elements in the backbone node B. Wherein the content of the first and second substances,
Figure BDA0002791192780000033
confirm registration and admission qualification of all nodes 102: assuming that the reputation value possessed by a dynamic node is known, then a ═ a1,...,akThe reputation sequence corresponding to is R ═ R (a)1),...,r(ak) The reputation value corresponding to any element in the A is required to satisfy ri≥r0The person has the qualification of participating in the task, wherein r i∈R，r0Is a preset reference reputation threshold. Thus, the set of backbone network nodes with the qualification of constructing a private network is B' ═ B1,...,bm′Therein of
Figure BDA0002791192780000031
And a set of branch nodes allowing the internet access by the backbone node is C ═ C1,...,cn′Therein of
Figure BDA0002791192780000032
When a certain node has dangerous behaviors, such as stealing information of others, the corresponding credit value of the node is greatly reduced.
Step 200: in order to ensure the cooperation of nodes in the ad hoc network, the invention designs a set of mechanism to measure the overall cooperation capability of the network, and assists the backbone nodes to decide whether to bid for the addition of new nodes, namely, the multi-backbone nodes compete for the addition of branch nodes into the ad hoc network. Considering the selfishness of the dynamic nodes, assuming that all the dynamic nodes in the A are associated with a subjective fitting willingness value, combining the weighted aggregation idea and the energy of each node, the method carries out expansion and extension, and can quantify the whole cooperation capabilityAnd presetting an integral cooperation threshold { ξ (b) according to the needs of the backbone nodesi)|biE.g. B'. When with biIf the overall cooperation capability level of all nodes in the network of the backbone nodes is smaller than the threshold, the receiving new nodes promote the overall cooperation level (the addition of the new nodes will increase part of the node path selection range), otherwise, the current node group cooperation communication process is harmonious, and the new nodes can be considered to be temporarily stopped receiving. The cooperation capability represents the cooperation strength of the dynamic nodes in network activities (such as accessing the network by means of backbone nodes), and measures whether the branch nodes can actively help other nodes to forward messages. The specific principle is contained in fig. 2, and the detailed steps include:
Collaboration degree quantization 201 of individual nodes: defining the fitting willingness sequence corresponding to all the dynamic nodes in the A as theta ═ theta (a)1),...,θ(ak) H, the remaining energy percentage sequence is E ═ E (a)1),...,e(ak) }, node aiThe collaboration level of epsilon A is defined as x (a)i) And x (a) is easily obtained by fully considering the coordination willingness and the residual energy percentage of the nodesi)＝θ(ai)αe(ai)βWhere α and β are positive control factors that depend on the bias of the backbone nodes.
Networking overall cooperation degree quantification 202: any rational node a in a node set A in a certain regioniThe phenomenon that the cooperation forwarding of information is rejected may occur due to the fact that the E is analyzed from the angle of personal interest, and therefore the method defines rational nodes aiThe probability of selecting the information to assist in forwarding is p (a)i) Then the probability of rejecting the cooperative forwarding of information is 1-p (a)i) Wherein p (a)i)＝x(ai)∈[0,1]. For backbone node bjConstructed networking, let bjThere is a set of branch nodes S (b)j) Also called winner set, combines with weighted aggregation idea to expand and is based on S (b)j) Level of cooperation and bjTolerable degree of uncooperative 1- ξ (b)j) Around bjThe unique network established can draw the following weight aggregation conclusion:
Figure BDA0002791192780000041
it is easy to find from the above formula that when there is a new node join or S (b)j) ω (b) when the percentage of remaining energy of the elements in the winner set changes j) Will fluctuate in value of when backbone node b is presentjThe following choices will be made:
when the temperature is higher than the set temperature
Figure BDA0002791192780000042
When, backbone node b is illustratedjThe constructed network has a good overall cooperation state, bjThe backbone nodes consider load balance and group benefits, select to keep the current state, do not receive new nodes any more, network congestion can be caused due to excessive introduction of the new nodes, and the rational branch nodes select to separate from networking groups from the perspective of personal income to search for new groups.
On the contrary, the first step is to take the reverse,
Figure BDA0002791192780000043
when, the description is currently given with bjIf the overall cooperation level of the core network is reduced, bidding is required to introduce a new branch node to keep the overall cooperation state level, otherwise, reasonable branch node loss caused by partial node malfunction may occur, and the backbone node b is damagedj(a large loss of branch nodes will cause b)jA reduction in revenue).
Step 300: based on the backbone node sequence and the free branch node sequence which satisfy the auction requirement and are involved in the step 200, an excitation electromagnetic coverage node B' is designed1,...,bm′The mechanism to build a private network, and fully consider C ═ C1,...,cn′The willingness of branch nodes to be combined into the network (the nodes in C' are not added into the networking group yet), which accords with the typical combined bidding mode, the free branch nodes and the backbone nodes form a sealed reverse combined auction model, the free branch nodes are combined by themselves and give the acceptable payment in mind Price, the price paid is a given acceptable cost of expected likely consumption of traffic for a free branch node. While the backbone nodes also give the node combinations that the auction wishes to obtain and the true prices (the prices are also for the traffic that the branch nodes need to consume), the mechanism involved in the invention can ensure that the completely rational backbone nodes give their own true prices, because the unreal prices will make the backbone nodes the loser of the auction.
The invention utilizes the idea of bidding the mean value of the combined auction incentive mechanism to evolve and expand, the related single auction satisfies monotonicity and the price of individual transaction is a critical value, if the individual has an action of making a chance and getting a smart, the individual can be a loser of auction activities at will. The excitation mechanism designed by the invention accords with Myerson rule and has effective excitability. The detailed principle is shown in fig. 2.
Combined bidding mechanism parameter definition 301: presence of C ═ C1,…,cn′A non-electromagnetic overlay node element is expected to pass through B ═ B1,…,bm′Networking access internet constructed by backbone nodes, and in order to promote effective cooperation between the backbone nodes and the branch nodes, C ═ C1,…,cn′The node elements in the } need to pay backbone node remuneration for incentive B' ═ B 1,…,bm′The participation in the collaboration. B' ═ B1,…,bm′The limited power coverage of the backbone node in the invention is assumed to be B ═ B1,…,bm′In the node power coverage and intentionally accessing private networking, as a free branch node set
Figure BDA0002791192780000051
Wherein
Figure BDA0002791192780000052
Represents biPower covered and intentional introduction of biThe node set of the constructed network, and for any backbone node biThere is at least one intended combination of receiving nodes for e B', for ease of description, the invention defines BiCombinations of reported reception intentsIs composed of
Figure BDA0002791192780000053
Figure BDA0002791192780000054
Wherein N (b)i) Represents biThe number of sets to be auctioned, backbone node set B' ═ B1,…,bm′The corresponding expected receiving node combination sequence is:
Figure BDA0002791192780000055
combining sequences with an intended receiving node
Figure BDA0002791192780000058
The corresponding sealing quotation is
Figure BDA0002791192780000056
Figure BDA0002791192780000057
biThe expected receiving node set and the bid sequence are
Figure BDA0002791192780000061
Further, C ═ { C ═ C1,...,cn′The combination of intentions of the elements in } is
Figure BDA0002791192780000062
Wherein
Figure BDA0002791192780000063
Free branch node network access intention combination
Figure BDA0002791192780000064
The corresponding psychological valence sequence is V ═ V1,...,vγ}。
Judging monopoly nodes 302: for the free branch node contained in C', it is possibleExistence of a certain node cjE C' is only biE B' unique power cover, then the present invention defines that this case is monopolized because B is now at this pointiThere is no competitor. If free branch node c jThe backbone node b is highly desirous of gaining access to the internetiPossibly for a roaming price in order to obtain a richer return. For this case, the present invention illustrates the following execution flow:
(1) in order to guarantee the effectiveness of an incentive mechanism and maintain the order of the market, the invention selects a free branch node combination which temporarily eliminates monopoly nodes. Defining the set of ridge free nodes as CmonThe non-monopolized free node set is CnomoSuppose node element cjIs collected
Figure BDA0002791192780000065
Including a number of times of
Figure BDA0002791192780000066
Is easy to obtain
Figure BDA0002791192780000067
Figure BDA0002791192780000068
Wherein in order to guarantee the backbone node biMalicious circumvention monopoly (because each backbone node can submit a plurality of expected receiving node sets, if a plurality of sets submitted by a backbone node repeatedly contain a certain node, the situation that the node competes with the backbone node itself can be caused), engagement is given
Figure BDA0002791192780000069
There is no intersection of submitted expectation sets, i.e.
Figure BDA00027911927800000610
While
Figure BDA00027911927800000611
The intention combination of the nodes not including the monopolized free branches is
Figure BDA00027911927800000612
The intention combination of the monopolizing free branch nodes is
Figure BDA00027911927800000613
(2) To is directed at
Figure BDA00027911927800000614
The free branch node intention combination in (1) opens up a bidding auction campaign.
(3) Aiming at intention combination containing monopoly dissociative branch nodes
Figure BDA00027911927800000615
Taking negotiation or recombination intention combination, abandoning monopoly branch nodes, and recombining. Suppose there is a certain node c containing a monopoly disjoint branch lIn combination with
Figure BDA00027911927800000616
Then
Figure BDA00027911927800000617
After the change
Figure BDA00027911927800000618
The auction can be selected to be direct or combined with other non-monopolized nodes and then open.
Determining a winner set 303:
Figure BDA00027911927800000619
and for the network-accessing intention combination without monopolizing the free branch nodes, determining a winner set according to the effective expected combination average expenditure of the backbone nodes, wherein the winner set is the backbone nodes which successfully acquire the free branch nodes to join the network. The invention sets forth herein what is effectively expected to combine the average costs of individual nodes, as can be derived from step 301, for backbone node biIs combined into a desired access node
Figure BDA00027911927800000620
Figure BDA00027911927800000621
Non-monopolized node combination C defined according to step 302nomoAssuming that the non-monopolized node element set which is not accessed into the network currently is CrestThen, then
Figure BDA0002791192780000071
When present, is
Figure BDA0002791192780000072
At a price of o (b)i)jBidding, then the effective expected combined single-node average payout is:
Figure BDA0002791192780000073
in order to avoid cheating of backbone nodes, all intention sets submitted by the backbone nodes in a sealing way only have one winning bid (if the probability of multiple winning bids exists, the mechanism has the factor of cooperative game), and the detailed steps for determining the winner set are as follows:
(1) non-monopolized node set C not accessed to networkingrestIs C in the initial staterest←CnomoAnd the backbone nodes which participate in the auction and have not been successfully auctioned are integrated into B restStir No. B', the corresponding intention set is
Figure BDA0002791192780000074
The initial state of the winner set is defined as
Figure BDA0002791192780000075
The corresponding expected access node set and real access node set sequences are respectively
Figure BDA0002791192780000076
Figure BDA0002791192780000077
The mapping sequence of the winner set and the corresponding access node set is
Figure BDA0002791192780000078
(2) To pair
Figure BDA0002791192780000079
Middle set element R (b)i)jCalculating the average expenditure of the effective expected combination single node:
Figure BDA00027911927800000710
(3) calculating backbone nodes corresponding to the average expenditure of the minimum effective expected combination single node:
Figure BDA00027911927800000711
(4) counting a winner set, a corresponding access node set and a mapping sequence:
Figure BDA00027911927800000712
Figure BDA00027911927800000713
(5) removing the branch node combination which has successfully accessed the network:
Figure BDA00027911927800000714
(6) is removed from*There is a set of all desired access nodes associated:
Figure BDA00027911927800000715
repeating the steps (2), (3), (4) and (5) until CrestIs empty, at this time
Figure BDA00027911927800000720
Namely the set of the winner is obtained,
Figure BDA00027911927800000716
the mapping sequence of the winner and the access point set is that for the corresponding access point set
Figure BDA00027911927800000717
Determining a final transaction price 304: the melarson's law demonstrates that this mechanism is valid and has incentive implications if the single auction satisfies monotonicity and the individual transaction price is marginal. The invention here calculates the critical price (the price of the benefit that the backbone node wants to obtain) for each winner for the set of access nodes. The detailed steps for determining the critical transaction price are as follows:
(1) For the set of winners in step 303
Figure BDA00027911927800000718
Defining a corresponding transaction price mapping sequence as Q, and judging that the quotation mapping sequence for getting rid of individual control is Q';
(2) select any winner
Figure BDA00027911927800000719
The desired set according to step 301
Figure BDA00027911927800000721
Staging an expected set
Figure BDA0002791192780000081
(Note: winners in the calculation process correspond to a temporarily defined expectation set, e.g.
Figure BDA0002791192780000082
(3) Initializing temporary winner set store sequences
Figure BDA0002791192780000083
Crest←CnomoThe remaining set of backbone nodes is Brest←B′；
(4) By the desired node set in step 303
Figure BDA0002791192780000084
The node element combinations initiated by the backbone nodes and actually participating in the auction can be known, and the current minimum price is calculated according to the following steps:
Figure BDA0002791192780000085
Figure BDA0002791192780000086
update the final transaction price to
Figure BDA0002791192780000087
Wherein R (b)τ)exIs as described in step 304
Figure BDA0002791192780000088
Winner in sequence bτA corresponding expected offer combination;
(5) giving real quotation for exciting the backbone nodes and calculating the critical point price of the backbone node income
Figure BDA0002791192780000089
Determining prices to break away from individual control
Figure BDA00027911927800000810
(6) Updating
Figure BDA00027911927800000811
If it is
Figure BDA00027911927800000812
Then
Figure BDA00027911927800000813
(7) Repeating the steps (4) and (5) until
Figure BDA00027911927800000823
At this time q (b)τ) Has the value of bτThe transaction price, Q ← Q £ U (b), which can be obtainedτ,q(bτ))，Q′←Q′∪(bτ,q′(bτ))；
(8) Jumping to the step (2) until the traversal is finished
Figure BDA00027911927800000824
And obtaining a complete winner and a trading price mapping sequence Q by all winners (backbone node auction winners).
Excitation mechanism effectiveness control 305: the non-monopolized combined sequence from step 302
Figure BDA00027911927800000814
Figure BDA00027911927800000815
And the free branch node access intention combination stated in step 301
Figure BDA00027911927800000816
The bearable price sequence of the branch node is V ═ V1,...,vγBecause of
Figure BDA00027911927800000817
Can easily obtain
Figure BDA00027911927800000818
Corresponding price sequence, defined as V*Total accepted price
Figure BDA00027911927800000819
The upper limit of the effective quotation is easily obtained according to the Q' mapping sequence in step 304
Figure BDA00027911927800000820
If v is*<q' to explain this timeAnd if the free branch node or the backbone node is not enough to support the effective operation of the mechanism, seeking price adjustment and re-developing the auction activity.
Determining the actual cost paid by the branch node 306: from the bid mapping sequence Q in step 304, a winner set is easily derived
Figure BDA00027911927800000821
The total value required for providing the service is
Figure BDA00027911927800000822
And dividing the price to be borne by the individual according to the flow demand of the branch node and the service experience of the backbone node. Suppose a known winner backbone node biHas an experience degree of t (b)i) Accessed backbone node biBranch node c for establishing networkjFlow demand is f (c)j) Then c isjThe price that an individual needs to bear is according to g (c)j)＝t(bi)ζf(cj)ηζ and η are known and adjustable, depending on the bias of participating auction branch nodes. Computing all already accessed network nodes cjCorresponding weight g (c)j) Dividing the winner set
Figure BDA0002791192780000091
Total value required for providing service
Figure BDA0002791192780000092
If present, part of CnomoThe node(s) abandon the auction arrangement, then go to step 302 and resume the "auction" activity of the node network connection.
The invention also provides a wireless Mesh ad hoc network trusted connection excitation system, and the wireless Mesh ad hoc network trusted connection excitation is carried out based on the method.
A computer device comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor executes the computer program to realize the method, and the trusted connection excitation of the wireless Mesh ad hoc network is carried out.
A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the above-mentioned method for trusted connection activation of a wireless Mesh ad hoc network.
It is understood that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a non-volatile computer-readable storage medium, and can include the processes of the embodiments of the methods described above when executed. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is specific and detailed, but not to be understood as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent application shall be subject to the appended claims.

Claims (7)

1. A trusted connection excitation method for a wireless Mesh ad hoc network is characterized by comprising the following steps:
step 1, setting registration qualification of backbone nodes and admission conditions of branch nodes, screening out a backbone network node set with the qualification of constructing a private network and a branch node set allowing borrowing the backbone nodes to access the Internet;
step 2, calculating the overall cooperation level of the backbone network node networking according to the cooperation willingness and the possessed energy of the dynamic nodes, and screening out a backbone node set which needs to receive a new node;
Step 3, removing monopoly nodes from the expected receiving node combination of the backbone nodes, determining an effective expected combination, calculating the average expenditure of single nodes of the effective expected combination, determining a winner set and a corresponding access node set, and completing the credible connection of the wireless ad hoc network based on an excitation method;
in step 1, setting registration qualification of backbone nodes and admission conditions of branch nodes, screening out a backbone network node set with the qualification of constructing a private network and a branch node set allowing borrowing the backbone nodes to access the internet, and the specific method comprises the following steps:
dynamic node state initialization 101: assume that there are k dynamic nodes in a certain area, defined as a ═ a1,...,akThere are m electromagnetically covered backbone nodes B ═ B1,...,bmMay be connected to the internet and build a private network, and n non-electromagnetically covered branch nodes C ═ C1,...,cnIntentional access to the internet requires the achievement of a goal by means of elements in the backbone node B, where,
Figure FDA0003611136330000011
confirm registration and admission qualification of all nodes 102: assuming that the reputation value of a dynamic node is known, a ═ a1,...,akThe reputation sequence corresponding to is R ═{r(a1),...,r(ak) The reputation value corresponding to any element in the A is required to satisfy r i≥r0Then the person has the qualification of participating in the task, wherein ri∈R，r0Is a preset reference reputation threshold;
the finally obtained backbone network node set with the qualification of constructing the private network is B' ═ B1,...,bm'Therein of
Figure FDA0003611136330000012
And a set of branch nodes allowing the internet access by the backbone node is C ═ C1,...,cn'Therein of
Figure FDA0003611136330000013
Step 3, removing monopoly nodes from the expected receiving node combination of the backbone nodes, determining an effective expected combination, calculating the average expenditure of single nodes of the effective expected combination, determining a winner set and a corresponding access node set, and completing the credible connection of the wireless ad hoc network based on an excitation method, wherein the specific method comprises the following steps:
the combined bidding mechanism parameter definition 301: suppose that B' is { B }1,…,bm'In the node power coverage and intentionally access private networking, as a free branch node set
Figure FDA0003611136330000014
Wherein
Figure FDA0003611136330000015
Represents biPower covered and intentional introduction of biA node set of the constructed network;
for any backbone node biE B' has at least one receiving node intention combination, definition BiThe combination of the reported reception intentions is
Figure FDA00036111363300000231
Figure FDA0003611136330000021
And is
Figure FDA0003611136330000022
There is no intersection of submitted expectation sets, i.e.
Figure FDA0003611136330000023
Wherein N (b)i) Represents biThe number of sets to be auctioned, backbone node set B' ═ B1,…,bm'The corresponding expected receiving node combination sequence is:
Figure FDA0003611136330000024
Figure FDA0003611136330000025
Combining sequences with an intended receiving node
Figure FDA0003611136330000026
Corresponding seal quote is
Figure FDA0003611136330000027
Figure FDA0003611136330000028
biIs the sequence of pairs of expected receiving node sets and bids
Figure FDA0003611136330000029
In addition, for a set C' of branch nodes that allows access to the internet by borrowing a backbone node, { C }1,...,cn'And defining the combination of the access intention of the free branch node as
Figure FDA00036111363300000210
Wherein
Figure FDA00036111363300000211
Figure FDA00036111363300000212
Free branch node network access intention combination
Figure FDA00036111363300000213
The corresponding psychological valence sequence is V ═ V1,...,vγ}；
Judging monopoly nodes 302: defining the set of ridge free nodes as CmonThe non-monopolized free node set is CnomoSuppose node element cjIs collected
Figure FDA00036111363300000214
Including a number of times of
Figure FDA00036111363300000215
Then
Figure FDA00036111363300000216
Figure FDA00036111363300000217
While
Figure FDA00036111363300000218
The intention combination of the nodes not including the monopolized free branches is
Figure FDA00036111363300000219
The intention combination of the monopolizing free branch nodes is
Figure FDA00036111363300000220
According to the above-mentioned judgement result, for
Figure FDA00036111363300000221
The free branch node intention combination in the auction system can be directly added into an effective expected combination for bidding auction activities; to combinations of intentions comprising monopolized free branch nodes
Figure FDA00036111363300000222
The set in (1) needs to adopt negotiation or recombination intention combination, abandons monopoly branch nodes and then directly adds in the effective expectation combination, or adds in the effective expectation combination after recombination for bidding auction activities;
determine winner set 303: according to the average expenditure of the effective expected combination single nodes of the backbone nodes, a winner set and a corresponding access node set are determined, and the detailed steps are as follows:
Initializing a non-monopolized node set C that has not been accessed to a networkrestA backbone node set B which is a non-monopolized node set and participates in the auction but has not been successfully auctionedrestCorresponding intention set for the backbone node set needing to receive the new node obtained in the step 2
Figure FDA00036111363300000223
Initializing a winner set for the intention set of the backbone node set which needs to receive the new node and is obtained in the step 2
Figure FDA00036111363300000224
Is composed of
Figure FDA00036111363300000225
Corresponding desired access node set
Figure FDA00036111363300000226
And real access node set sequence
Figure FDA00036111363300000227
Are respectively as
Figure FDA00036111363300000228
Winner set and corresponding connectionInbound node set mapping sequences
Figure FDA00036111363300000229
Is composed of
Figure FDA00036111363300000230
To pair
Figure FDA0003611136330000031
Middle set element R (b)i)jCalculating the average expenditure of the effective expected combination single nodes, wherein the backbone node corresponding to the average expenditure of the minimum effective expected combination single node is the backbone node which successfully acquires the free branch node and joins the network, and updating C according to the average expenditurerest、
Figure FDA0003611136330000032
And
Figure FDA0003611136330000033
the formula for calculating the average expenditure of the effective expected combination single nodes is as follows:
Figure FDA0003611136330000034
repeating the previous step until CrestIs empty, at this time
Figure FDA0003611136330000035
Namely the set of the winner is obtained,
Figure FDA0003611136330000036
the mapping sequence of the winner and the access point set is that for the corresponding access point set
Figure FDA0003611136330000037
2. The method for exciting the trusted connection of the wireless Mesh ad hoc network according to claim 1, wherein in step 2, the overall cooperation level of the backbone network node networking is calculated according to the cooperation intention and the possessed energy of the dynamic nodes, and a backbone node set which needs to receive a new node is screened out, and the method specifically comprises the following steps:
Individual node cooperation degree quantization 201: defining the coordination intention sequence corresponding to all the dynamic nodes in the A as theta ═ theta (a)1),...,θ(ak) The percentage of remaining energy series is E ═ E (a)1),...,e(ak) }, node aiThe collaboration level of epsilon A is defined as x (a)i) Fully considering the coordination willingness and the remaining energy percentage of the nodes to obtain x (a)i)＝θ(ai)αe(ai)βWherein α and β are positive control factors;
networking overall cooperation degree quantification 202: defining rational nodes aiThe probability of selecting the information to assist in forwarding is p (a)i) Then the probability of rejecting the cooperative forwarding of information is 1-p (a)i) Wherein p (a)i)＝x(ai)∈[0,1]For backbone node bjConstructed networking, let bjThere is a set of branch nodes S (b)j) Then S (b) is obtainedj) The collaboration level of (c) is:
Figure FDA0003611136330000038
according to S (b)j) Level of cooperation and bjTolerable degree of uncooperative 1- ξ (b)j) In which ξ (b)j) Is b isjTolerable degree of collaboration, bjThe following judgment is made: when in use
Figure FDA0003611136330000039
When, backbone node b is illustratedjThe constructed network has a state of good overall cooperation, bjThe backbone node selects to keep the current state and does not receive a new node any more; on the contrary, the method can be used for carrying out the following steps,
Figure FDA00036111363300000310
when, the description is currently with bjThe overall cooperation level of the networking serving as the core is reduced, and a new branch node needs to be introduced for bidding so as to maintain the overall cooperation state level.
3. The method as claimed in claim 1, further comprising a process 304 of determining a final transaction price, namely calculating a critical price for each winner for the access node set, and the detailed steps are as follows:
(1) For the set of winners in step 303
Figure FDA0003611136330000041
Defining a corresponding transaction price mapping sequence as Q, and judging that the quotation mapping sequence for getting rid of individual control is Q';
(2) select any winner
Figure FDA0003611136330000042
Initializing a scratch expected set
Figure FDA0003611136330000043
Is composed of
Figure FDA0003611136330000044
Winners in the calculation process correspond to a temporarily defined desired set, e.g.
Figure FDA0003611136330000045
(3) Initializing temporary winner set storage sequences
Figure FDA0003611136330000046
Initializing non-monopolized node element set C which is not accessed into networking currentlyrestInitializing a remaining set B of backbone nodes for a non-monopolized node setrestA backbone node set which needs to receive a new node and is obtained in the step 2;
(4) according to the desired node set in step 303
Figure FDA0003611136330000047
Determining the node element combination which is initiated by the backbone node and really participates in the auction, and calculating the current minimum price according to the following steps:
Figure FDA0003611136330000048
Figure FDA0003611136330000049
update the final transaction price to
Figure FDA00036111363300000410
Figure FDA00036111363300000411
Wherein R (b)τ)exIs as described in step 304
Figure FDA00036111363300000412
Winner in sequence bτA corresponding expected offer combination;
(5) calculating a critical point price for backbone node revenue
Figure FDA00036111363300000413
Figure FDA00036111363300000414
Updating prices judged to be free from individual control
Figure FDA00036111363300000415
(6) Updating
Figure FDA00036111363300000416
If it is
Figure FDA00036111363300000417
Then
Figure FDA00036111363300000418
(7) Repeating the steps (4) and (5) until
Figure FDA00036111363300000419
At this time q (b)τ) Has the value of bτThe transaction price, Q ← Q £ U (b), which can be obtainedτ,q(bτ))，Q'←Q'∪(bτ,q'(bτ))；
(8) Jumping to the step (2) until the traversal is finished
Figure FDA00036111363300000424
And obtaining a complete winner and a trading price mapping sequence Q.
4. The method for exciting the trusted connection of the wireless Mesh ad hoc network according to claim 3, further comprising an excitation mechanism validity control process 305, specifically comprising:
assume that the non-monopoly combination sequence of step 302 is
Figure FDA00036111363300000420
The combination of the access intents of the free branch nodes in step 301 is
Figure FDA00036111363300000421
The bearable price sequence of the branch node is V ═ V1,...,vγBecause of
Figure FDA00036111363300000422
Can obtain
Figure FDA00036111363300000423
Corresponding price sequence, defined as V*Total accepted price
Figure FDA0003611136330000051
The upper limit value of the effective quotation of the mechanism is obtained according to the Q' mapping sequence in the step 304
Figure FDA0003611136330000052
If v is*<q', which indicates that the free branch node or backbone node quoted at this time is not enough to support the effective operation of the mechanism, needs to seek price adjustment and re-opens the auction activity, otherwise indicates that the free branch node or backbone node quoted at this time can support the effective operation of the mechanism.
5. The method for exciting the trusted connection of the wireless Mesh ad hoc network according to claim 3, further comprising a process 306 of determining the actual cost paid by the branch node, wherein the method specifically comprises:
(1) determining a winner set according to the price-reporting mapping sequence Q in step 304
Figure FDA0003611136330000053
The total value required for providing the service is
Figure FDA0003611136330000054
(2) Dividing the price to be borne by the individual according to the flow demand of the branch node and the service experience of the backbone node, and assuming the known winner backbone node b iHas an experience degree of t (b)i) Accessed backbone node biBranch node c for establishing networkjFlow demand is f (c)j) Then c isjThe price that an individual needs to bear is according to g (c)j)＝t(bi)ζf(cj)ηζ and η are known and adjustable, depending on the bias of participating auction branch nodes;
(3) computing all already accessed network nodes cjCorresponding weight g (c)j) Thereafter, the winner set is partitioned accordingly
Figure FDA0003611136330000056
Total value required for providing service
Figure FDA0003611136330000055
The actual payment cost of the branch node can be obtained.
6. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method of any one of claims 1-5 when executing the computer program, performing a wireless Mesh ad hoc network trusted connection stimulus.
7. A computer-readable storage medium, on which a computer program is stored which, when executed by a processor, implements the method of any of claims 1-5 for wireless Mesh ad hoc network trusted connection activation.
CN202011315408.XA 2020-11-20 2020-11-20 Wireless Mesh ad hoc network trusted connection excitation method based on energy consumption balance Active CN112601294B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011315408.XA CN112601294B (en) 2020-11-20 2020-11-20 Wireless Mesh ad hoc network trusted connection excitation method based on energy consumption balance

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011315408.XA CN112601294B (en) 2020-11-20 2020-11-20 Wireless Mesh ad hoc network trusted connection excitation method based on energy consumption balance

Publications (2)

Publication Number Publication Date
CN112601294A CN112601294A (en) 2021-04-02
CN112601294B true CN112601294B (en) 2022-06-28

Family

ID=75183523

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011315408.XA Active CN112601294B (en) 2020-11-20 2020-11-20 Wireless Mesh ad hoc network trusted connection excitation method based on energy consumption balance

Country Status (1)

Country Link
CN (1) CN112601294B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107517479A (en) * 2017-08-17 2017-12-26 湖北工业大学 A kind of wireless relay network dynamic exciting Mechanism Design method based on contract theory
CN109379739A (en) * 2018-09-28 2019-02-22 嘉兴学院 A kind of credible cooperating service method of sea wireless Mesh netword

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107517479A (en) * 2017-08-17 2017-12-26 湖北工业大学 A kind of wireless relay network dynamic exciting Mechanism Design method based on contract theory
CN109379739A (en) * 2018-09-28 2019-02-22 嘉兴学院 A kind of credible cooperating service method of sea wireless Mesh netword

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Privacy-Preserving Auction-based Incentive Mechanism for Mobile Crowdsensing Systems;Naiting Xu，et al.;《IEEE Xplore》;20180511;全文 *
基于混合组合双向拍卖的网格资源分配方案;肖迎春，等;《计算机科学》;20150531;全文 *

Also Published As

Publication number Publication date
CN112601294A (en) 2021-04-02

Similar Documents

Publication Publication Date Title
Sun et al. Social-aware incentive mechanisms for D2D resource sharing in IIoT
Luong et al. A machine-learning-based auction for resource trading in fog computing
Chen et al. Tarco: Two-stage auction for d2d relay aided computation resource allocation in hetnet
Li et al. Game-theoretic analysis of cooperation incentive strategies in mobile ad hoc networks
US9615264B2 (en) Multifactorial optimization system and method
Hu et al. Game theoretic approaches for wireless proactive caching
Wu et al. A game-theoretic approach to stimulate cooperation for probabilistic routing in opportunistic networks
CN111262940A (en) Vehicle-mounted edge computing application caching method, device and system
Xiao et al. DAER: A resource preallocation algorithm of edge computing server by using blockchain in intelligent driving
Liu et al. Role of gifts in decision making: An endowment effect incentive mechanism for offloading in the IoV
Dong et al. Collaborative edge computing for social internet of things: Applications, solutions, and challenges
Ji et al. A game theoretical framework for dynamic pricing-based routing in self-organized MANETs
CN112601294B (en) Wireless Mesh ad hoc network trusted connection excitation method based on energy consumption balance
Li et al. A three-stage incentive formation for optimally pricing social data offloading
Zhang et al. A vehicular task offloading method with eliminating redundant tasks in 5g hetnets
Noreen et al. A review on game-theoretic incentive mechanisms for mobile data offloading in heterogeneous networks
CN116797364A (en) Edge calculation cross-chain computing force transaction method based on predictors
Abdellatif et al. Graph-based computing resource allocation for mobile blockchain
Jiang et al. Combinatorial double auction for resource allocation with differential privacy in edge computing
Jiang et al. A truthful double auction framework for promoting femtocell access
Yang et al. Incorporating user willingness in contract-based incentive mechanism for D2D cooperative data forwarding
Ji et al. An optimal dynamic pricing framework for autonomous mobile ad hoc networks
Liu et al. A novel game based incentive strategy for opportunistic networks
Lim et al. Dynamic resource allocation for hierarchical federated learning
Hui et al. Digital twin enabled multi-task federated learning in heterogeneous vehicular networks

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant