CN106851673B - Method and device for acquiring non-overlapping stable forwarding alliance structure - Google Patents
Method and device for acquiring non-overlapping stable forwarding alliance structure Download PDFInfo
- Publication number
- CN106851673B CN106851673B CN201710047835.6A CN201710047835A CN106851673B CN 106851673 B CN106851673 B CN 106851673B CN 201710047835 A CN201710047835 A CN 201710047835A CN 106851673 B CN106851673 B CN 106851673B
- Authority
- CN
- China
- Prior art keywords
- federation
- forwarding
- network
- structures
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 230000007704 transition Effects 0.000 claims description 29
- 239000011159 matrix material Substances 0.000 claims description 20
- 230000008901 benefit Effects 0.000 claims description 19
- 238000004364 calculation method Methods 0.000 claims description 18
- 230000008569 process Effects 0.000 claims description 14
- 239000013598 vector Substances 0.000 claims description 10
- 239000000126 substance Substances 0.000 claims description 5
- 230000006399 behavior Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 5
- 230000008859 change Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 4
- 238000011160 research Methods 0.000 description 4
- 230000005284 excitation Effects 0.000 description 2
- 238000010521 absorption reaction Methods 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000009916 joint effect Effects 0.000 description 1
- 239000007788 liquid Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000011273 social behavior Effects 0.000 description 1
- 238000005309 stochastic process Methods 0.000 description 1
- 230000002747 voluntary effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/22—Traffic simulation tools or models
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
-
- 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
Abstract
The invention discloses a method and a device for acquiring a non-overlapping stable forwarding alliance structure based on data packet forwarding, wherein the method comprises the following steps: determining the whole network G for forwarding the data packet; determining, through the entire network G, a set of non-overlapping distinct federation structures present in the network G; and taking the non-overlapping different alliance structure sets as state spaces of a discrete-time Markov chain model, and acquiring non-overlapping stable forwarding alliance structures in the different alliance structure sets existing in the network G based on the discrete-time Markov chain model. Through the mode, the method and the device can provide theoretical method and technical support for subsequently solving the selfish incentive problem of the nodes in the Ad hoc network.
Description
Technical Field
The present invention relates to the field of wireless network and communication technologies, and in particular, to a method and an apparatus for obtaining a non-overlapping stable forwarding federation structure based on packet forwarding.
Background
The Ad hoc network is composed of a plurality of nodes which can move freely, each node plays the dual roles of a host and a router, and communication between the nodes is completed through a wireless channel and multi-hop forwarding of relay nodes. The network is completely ad hoc without any fixed infrastructure, without central control, and therefore it is very different from conventional wireless networks. In traditional emergency and military applications, nodes in Ad hoc networks operate in a voluntary and active cooperative forwarding manner. However, recently, especially in the civil field, since the nodes are limited by various resources such as self processing capability, storage space, battery energy, and the like, the nodes will exhibit selfish behavior and discard the message to be forwarded, thereby achieving the purpose of saving self resources and reducing network performance. Therefore, ensuring the excitation cooperation of selfish nodes in the network, thereby ensuring the availability of the network and the performance of the network becomes one of the hot spots studied in the current Ad hoc network.
Currently, a game theory is adopted to enhance the cooperative research method of selfish nodes in the Ad hoc network, but the current research mainly focuses on the research category of non-cooperative game. In the non-cooperative game, the emphasis is mainly given to the behavior of the nodes: the strategy that the rational node can select in the process of forwarding the data packet, the result that the game can appear and the selection correspondingly made by the node, etc. In other research branches of game theory, cooperative game generally assumes that a protocol for joint action is implemented between nodes, i.e., the nodes may exhibit an "intention to cooperate" with each other, and the intention to cooperate is endogenous. Currently, how to solve the selfish incentive problem of nodes in the Ad hoc network through cooperative gaming becomes one of the most important problems.
Disclosure of Invention
The invention mainly solves the technical problem of providing a method and a device for acquiring a non-overlapping stable forwarding alliance structure based on data packet forwarding, which can provide theoretical method and technical support for solving the selfish incentive problem of nodes in an Ad hoc network.
In order to solve the technical problems, the invention adopts a technical scheme that: a method for obtaining a non-overlapping stable forwarding federation structure based on packet forwarding is provided, the method comprising: determining a whole network G for forwarding a data packet, wherein the network G is composed of N rational nodes, and G is an arbitrary directed graph; determining, from the entire network G, a set of non-overlapping different federation structures present in the network G as
η thereinxRepresented as a forwarding federation structure of N all nodes in a network G, DNExpressed as the number of different federation structures present in the network G, where,
with said set of non-overlapping different federation structures as discrete timeState space of markov chain model Ω { (η)x),x＝{1,...,DNAnd acquiring non-overlapping stable forwarding alliance structures in a set of different alliance structures existing in the network G based on the Markov chain model of the discrete time.
Wherein the step of obtaining non-overlapping stable forwarding federation structures in a set of different federation structures present in the network G based on the discrete-time Markov chain model comprises: obtaining non-overlapping stable forwarding federation structures in a set of different federation structures present in the network G by solving stationary probabilities of a discrete-time Markov chain model.
Wherein the step of obtaining non-overlapping stable forwarding federation structures in a set of different federation structures present in the network G by solving stationary probabilities of a discrete-time Markov chain model comprises: determining a transition probability matrix P of the discrete-time Markov chain model, wherein each element of the matrix P is represented as Pη,η'Element Pη,η'Representing the transition probability from η state to η state of the forwarding alliance structure formed for all nodes, and calculating and obtaining the stable probability vector of the Markov chain model of the discrete time through the transition probability matrix P
Thereby obtaining non-overlapping stable forwarding federation structures in a set of different federation structures present in the network G.
Wherein the element Pη，η'The calculation formula of (2) is as follows:
wherein, Cη,η'Denoted as the set of network nodes that are tuned from the current federation into the new federation resulting in forwarding federation structures from η states to η' states, lambda denotes the probability that any node in the network autonomously makes a tuning decision,
represented as an arbitrary nodei due to the current alliance
Adjust to a new alliance
Resulting in a probability of forwarding the federation structure from the η state to the η state,
the calculation formula of (2) is as follows:
federating for node i
The benefit of (2) in (1),
federating for node i
Income of (1), 0<φ≤1，
Wherein, the average benefit obtained by any node i in the network is as follows:
represented as a forwarding federation structure ηxProbability that can be formed, ui(Si) Represented as node i in federation SiThe benefit of (1).
In order to solve the technical problem, the invention adopts another technical scheme that: providing a method for obtaining non-duplicate data based on data packet forwardingAn apparatus for stacking a stable forwarding federation structure, the apparatus comprising: the system comprises a first determining module, a second determining module and a third determining module, wherein the first determining module is used for determining the whole network G for forwarding a data packet, the network G is composed of N rational nodes, and G is an arbitrary directed graph; a second determining module, configured to determine, through the entire network G, a set of non-overlapping different federation structures existing in the network G as
η thereinxRepresented as a forwarding federation structure of N all nodes in a network G, DNExpressed as the number of different federation structures present in the network G, where,
an obtaining module, configured to use the set of non-overlapping different federation structures as a state space Ω { (η) of a discrete-time Markov chain modelx),x＝{1,...,DNAnd acquiring non-overlapping stable forwarding alliance structures in a set of different alliance structures existing in the network G based on the Markov chain model of the discrete time.
The obtaining module is specifically configured to obtain a non-overlapping stable forwarding federation structure in a set of different federation structures existing in the network G by solving a stationary probability of a discrete-time markov chain model.
Wherein the acquisition module comprises: a determination unit for determining a transition probability matrix P of the discrete-time Markov chain model, wherein each element of the matrix P is represented as Pη,η'Element Pη,η'Representing the transition probability of the forwarding alliance structure formed by all nodes from η state to η' state, and an obtaining unit for calculating and obtaining the stable probability vector of the Markov chain model of the discrete time through the transition probability matrix P
Thereby obtaining non-overlapping stable forwarding federation structures in a set of different federation structures present in the network G.
Wherein the element Pη,η'The calculation formula of (2) is as follows:
wherein, Cη,η'Denoted as the set of network nodes that are tuned from the current federation into the new federation resulting in forwarding federation structures from η states to η' states, lambda denotes the probability that any node in the network autonomously makes a tuning decision,
denoted as arbitrary node i due to federation from the current
Adjust to a new alliance
Resulting in a probability of forwarding the federation structure from the η state to the η' state,
the calculation formula of (2) is as follows:
federating for node i
The benefit of (2) in (1),
federating for node i
Income of (1), 0<φ≤1，
Among them, any in the networkThe average benefit obtained by node i is as follows:
represented as a forwarding federation structure ηxProbability that can be formed, ui(Si) Represented as node i in federation SiThe benefit of (1).
The invention has the beneficial effects that: in contrast to the prior art case, the present invention determines the entire network G for packet forwarding; determining, over the entire network G, a set of non-overlapping distinct federation structures present in the network G; and taking the set of the non-overlapped different alliance structures as a state space of a discrete-time Markov chain model, and acquiring the non-overlapped stable forwarding alliance structures in the set of the different alliance structures existing in the network G based on the discrete-time Markov chain model. Due to the fact that the non-overlapping stable forwarding alliance structure in the set of different alliance structures existing in the network G is obtained through the Markov chain model based on the discrete time, theoretical methods and technical support can be provided for the follow-up solution of the selfish incentive problem of the nodes in the Ad hoc network.
Drawings
FIG. 1 is a flow diagram of one embodiment of a method for obtaining a non-overlapping stable forwarding federation structure based on packet forwarding;
figure 2 is a state transition diagram for a network based on a discrete time markov chain model;
fig. 3 is a schematic structural diagram of an embodiment of the apparatus for obtaining a non-overlapping stable forwarding federation structure based on packet forwarding according to the present invention.
Detailed Description
Before describing the present invention in detail, a general description of the preliminary knowledge of the league game associated with the present invention will be provided.
The classic game theory idea can be divided into non-cooperative game playing and cooperative game playing. In non-cooperative gaming, participants in the game make decisions based on their perceived environment and their own benefits. Participant utility is not only dependent on the behavior selection of itself, but is also influenced by the behavior of other participants. In non-cooperative gaming, the emphasis is mainly placed on individual behavior: what are the actions of rational participants selectable in a competitive environment? What are the results that a game may produce? What decisions should be made by rational participants? In cooperative gaming, it is assumed that the participants have an agreement to act together that the cooperation is exogenous. The emphasis here is on: what leagues these participants will constitute? How to determine the size of the competency between participants in a federation? How reasonably to distribute the corporate revenue (or amortization cost) from the federation?
In non-cooperative gaming, the results from the balance between participants are the product of competition and, in general, are unsatisfactory. Because they may exhibit an "interest in collaboration" that is endogenous, but that does not have a strict enforcement protocol. In cooperative gaming, there is an exogenous cooperative agreement between participants, which constitutes a fundamental distinction between the two types of gaming.
For the process of N participants participating in the game, I ═ 1,2, …, N, and any subset S of set I is referred to as a league.
Definition 1 (federation): let the set of participants in the game be I ═ {1,2, …, N }, any
S is called a federation of I. In the special case that the temperature of the liquid is lower than the set temperature,
and S ═ I, this case of S ═ I is known as a large union (The grand coordination).
Definition 2 (feature function): assuming that the set of participants in the game is I ═ 1,2, …, N, v(s) is a real-valued function defined over all subsets (i.e., leagues) of N, i.e., v:2N→ R (R is a real-valued set), which satisfies:
v (S) is called a feature function.
Definition 3 (league game): given the set of participants I and the characteristic function v, the cooperative game played is a league game CG, denoted CG as (I, v).
Theoretically, all participants in a game would like to join the large league so that any two participants in the large league are collaborating with each other. Since each participant is rational and can freely choose to join different alliances according to the situation of interest acquired by the participant, it is necessary to ensure that each participant joins a large alliance as the optimal strategy of choice.
In league game theory, there is a powerful concept-Core (Core). The method comprises the following specific steps:
definition 4 (core): in the league game CG ═ I, v, core c (v) is a payoff allocation vector x (x ∈ R) defined to satisfy the following conditionN) And (3) gathering:
wherein x isiThe allocation of the payment obtained for participant i.
Note that: the core formed by the league game is a vector set, which can be a set with any size or an empty set. In order to ensure that the found kernel is an optimal solution, the optimal kernel needs to be formed to satisfy the following conditions:
definition 5 (optimal kernel): in the league game CG ═ I, v, the best core Co(v) Must satisfy the following conditions:
individuality (individuality): x is the number ofi≧ v ({ i }). Namely: any participant participating in the league game will have a payout allocation that is at least better than the payout allocation itself.
Federation Rationality (national ratio): due to the reasonableness of the node, the node itself may leave the currently joined federation and join other federations formed to maximize the payment allocation it obtains.
Effectiveness (effectivenesss):
namely: the total amount of payout allocation in the league game balances the revenue obtained by the large league, and there are no more or less cases.
The present invention will be described in detail below with reference to the accompanying drawings and embodiments.
Under the theory framework of alliance game, the invention carries out formal definition aiming at the forwarding process of the node data packet in the Ad hoc network, abstracts the definition into non-overlapping forwarding alliance game, establishes an income model of the nodes in the alliance members, further designs a model of a Markov chain based on discrete time, converges the forwarding alliance structure formed in the network into a stable forwarding alliance structure, ensures that the average income of all the nodes in the network is maximized, further ensures that all the nodes in the network are willing to participate in the forwarding process of the data packet, and improves the collaboration of the normal communication of the network.
The invention provides theoretical reference and reference for establishing an excitation cooperative routing algorithm in the Ad hoc network by constructing the model, and the model can effectively excite the enthusiasm of the selfish node for cooperative forwarding, reduce the attack influence of the selfish node on the network and greatly improve the performance of the network.
In order to formally define the model, the following description is made for the specific case of the model:
(1) the whole network G (V, E) is composed of N rational nodes, G is any directed graph, and V and E are respectively nodes and edge sets formed by forwarding data by using links.
(2) If and only if nodes x, y are in transmission range of each other, then there is a link (x, y) E between them, and all links in E are bi-directional.
(3) When the nodes carry out normal communication, the nodes work in a promiscuous mode so as to monitor the condition that the neighbor nodes cooperatively forward the data packet.
(4) In the process of participating in data packet forwarding, each rational node i in the network calls the behavior as cooperative behavior if the node forwards the received data packet, and calls the behavior as selfish behavior if the node does not receive the data packet or does not forward the data packet.
(5) In a packet forwarding alliance Game (referred to as a forwarding alliance Game for short), FCG (N, v) (forwarding alliance Game), a Game process starts by sending a packet from a source node src, and ends by receiving the packet sent by the source node at a destination node dest. Where v is the federation payment obtained by the FCG federation.
(6) The nodes in the FCG are all rational, and the nodes can decide to join or leave the federation formed in the network according to the self income condition, but the nodes are all for the purpose of maximizing the income obtained by the nodes.
(7) The league game formed by the FCG is a non-overlapping league game DFCG (discrete forwarding relational Gate), namely, any node in the network can only be added into one league finally, and no cross-overlapping condition exists between the leagues. In addition, any node in the federation is cooperative with each other.
(8) The Non-overlapping league Game is called Non-transferable usability financial goal (Non-transferable utility Game) in the invention, namely, the league payment obtained by the league can not be arbitrarily transferred by all nodes in the league.
(9) In the league game DFCG (N, v), assume that a league structure is η { S ═ S1,...,SMM is the number of alliances (M is more than or equal to 1 and less than or equal to N, and M is | η |),
for if
Sj∈η，i≠j，Si∩Sj＝φ。
With the gradual evolution of the forwarding alliance game process, alliances are gradually formed among nodes. Suppose there is a federation
According to the situation that all nodes in S participate in forwarding data packets, the characteristic function calculation given by S is defined as follows:
wherein u isi(S) is the benefit of node i in federation S, ui(S) includes the cost c generated by node i in participating in the packet forwarding processi(S) and node i obtain a payment r due to their own aggressiveness for cooperative forwardingi(S). Therefore, uiThe specific calculation formula of (S) is as follows:
ui(S)＝α·ri(S)-β·ci(S)
wherein α and β are represented by c in the above formulai(S) and ri(S), wherein 0. ltoreq. α. ltoreq.1, 0. ltoreq. β. ltoreq.1, and α + β. ltoreq.1.
In (N, v), solving the maximization of node profit in a network is generally achieved by finding a stable forwarding federation structure formed in the network. In the league game, the forwarding league structure is formed by a league set formed by all nodes in the network. Therefore, in DFCG ═ (N, v), 2 exists in the networkN1 non-null federation. In addition, assume that the number of different federation structures present in the network is DNThe following formula can be derived:
as mentioned above, in the DFCG, due to the rationality of the nodes themselves, each node may decide to join or leave the currently formed federation according to its own profit. By using the theory of alliance game as a reference, in the DFCG framework, based on the above definition, an optimal forwarding alliance structure is searched through traversal, that is, the most stable forwarding alliance structure is searched, so that any node in the forwarding alliance structure does not join or leave the optimal forwarding alliance structure. That is, in the optimal forwarding federation structure, the revenue obtained by each node is optimized (i.e., the obtained revenue is maximized). The present invention will be described in detail below.
Referring to fig. 1, fig. 1 is a flowchart of an embodiment of a method for obtaining a non-overlapping stable forwarding federation structure based on packet forwarding, the method including:
step S101: and determining the whole network G for forwarding the data packet, wherein the network G is composed of N rational nodes, and G is an arbitrary directed graph.
The rational node refers to a node which is inclined to join in the alliance game when the distributed payment is better than the payment obtained by independently executing the node after the node joins in the alliance game. In other words, if a node is participating in a league game and the resulting payouts allocated are at least better than those obtained by itself executing independently, it tends to participate in the league game rather than to leave the league game.
A graph is composed of small dots (called vertices or nodes) and straight lines or curves (called edges) connecting the dots, and if each edge of the graph is defined with a direction, which is shown by an arrow indicating the direction, the resulting graph is called a directed graph, the edges are also called directed edges, and the nodes can only communicate or transmit messages in one direction.
Step S102: determining, through the entire network G, a set of non-overlapping different federation structures present in the network G as
η thereinxRepresented as a forwarding federation structure of N all nodes in a network G, DNExpressed as the number of different federation structures present in the network G, where,
wherein the content of the first and second substances,
the expression is that j non-repeating elements from the N-1 sets constitute a subset, regardless of the order of their elements.
The number of nodes in the network can determine the number of different alliance structures in the network, and the size of the non-overlapping different alliance structures in the network can be known.
For example, as shown in FIG. 2, FIG. 2 is a state transition diagram for a network based on the discrete-time Markov chain model, where there are three nodes {1,2,3}, and the network has different federation structures with non-overlapping existence: η1＝{{1},{2},{3}}，η2＝{{1,2},{3}}，η3＝{{1,3},{2}}，η4＝{{1},{2,3}}，η5The number of non-overlapping different federation structures present for the network is 5, and thus the set of non-overlapping different federation structures present for the network is: { η: { (1, 2,3}1,η2,η3,η4,η5}。
Step S103, taking a set of non-overlapped different alliance structures as a state space omega { (η) of the Markov chain model of discrete timex),x＝{1,...,DNAnd acquiring non-overlapping stable forwarding alliance structures in a set of different alliance structures existing in the network G based on a discrete time Markov chain model.
A markov chain refers to a discrete event stochastic process in mathematics with markov properties. In this process, given current knowledge or information, the past (i.e., the current past historical state) is irrelevant to predicting the future (i.e., the current future state). At each step of the Markov chain, the system may change from one state to another state, or may maintain the current state, according to a probability distribution. The change of state is called a transition and the probability associated with a different state change is called a transition probability.
The non-overlapping different alliance structures are taken as the state space of the discrete-time Markov chain model, and the non-overlapping stable forwarding alliance structures in the different alliance structure sets existing in the network G can be obtained through the discrete-time Markov chain model. The stable forwarding alliance structure is achieved, the profit of each node in the network is maximized, and the node in the network is not willing to leave the own alliance and join another alliance, so that the stable forwarding alliance structure can be achieved. By the method, theoretical methods and technical support can be provided for solving the selfish incentive problem of the nodes in the Ad hoc network subsequently.
The embodiment of the invention determines the whole network G for forwarding the data packet; determining, over the entire network G, a set of non-overlapping distinct federation structures present in the network G; and taking the set of the non-overlapped different alliance structures as a state space of a discrete-time Markov chain model, and acquiring the non-overlapped stable forwarding alliance structures in the set of the different alliance structures existing in the network G based on the discrete-time Markov chain model. Due to the fact that the non-overlapping stable forwarding alliance structure in the set of different alliance structures existing in the network G is obtained through the Markov chain model based on the discrete time, theoretical methods and technical support can be provided for the follow-up solution of the selfish incentive problem of the nodes in the Ad hoc network.
In step S103, the step of obtaining a non-overlapping stable forwarding federation structure in a set of different federation structures existing in the network G based on the discrete-time markov chain model includes: non-overlapping stable forwarding federation structures in a set of different federation structures present in network G are obtained by solving the stationary probability of a discrete-time Markov chain model.
Assuming that the distribution of the initial values of the Markov chain is Pi, the transition matrix (transition matrix) of the chain is P, and if Pi P is Pi, then Pi is the smooth distribution of the chain. The probability of stationary distribution is the stationary probability. A smooth distribution, indicating that any node on the network tends to stay within its federation, rather than joining a new federation away from its federation, so the forwarding federation structure at this point is stable. The greater the probability of the stationary distribution, the more stable the forwarding federation structure corresponding to the stationary distribution, and the greater the probability of forming the forwarding federation structure.
Further, the step of obtaining non-overlapping stable forwarding federation structures in a set of different federation structures present in the network G by solving the stationary probability of the discrete-time markov chain model comprises:
(1) determining a transition probability matrix P of a Markov chain model of discrete time, wherein each element of the matrix P is denoted as Pη,η'Element Pη,η'Representing a forwarding federation formed for all nodes
Transition probabilities of structures from η state to η state;
(2) obtaining stationary probability vector of Markov chain model of discrete time by transition probability matrix P calculation
Thereby obtaining non-overlapping stable forwarding federation structures in the set of different federation structures present in network G.
Stationary probability vector for Markov chain
The calculation method is as follows:
Wherein the element Pη,η'The calculation formula of (2) is as follows:
wherein, Cη,η'Denoted as the set of network nodes that are tuned from the current federation into the new federation resulting in forwarding federation structures from η states to η' states, lambda denotes the probability that any node in the network autonomously makes a tuning decision,
denoted as arbitrary node i due to federation from the current
Adjust to a new alliance
Resulting in a probability of forwarding the federation structure from the η state to the η' state,
the calculation formula of (2) is as follows:
federating for node i
The benefit of (2) in (1),
federating for node i
Income of (1), 0<φ≤1，
Wherein, the average benefit obtained by any node i in the network is as follows:
represented as a forwarding federation structure ηxProbability that can be formed, ui(Si) Represented as node i in federation SiThe benefit of (1).
Once the forwarding federation structures formed by all nodes reach a particular state (which belongs to the set of absorbing states), other forwarding federation structures subsequently formed by those nodes will always be in this set. That is, when the forwarding federation structure formed by all nodes is in the absorbing state, the state transition process of the whole Markov chain is ended, and the absorbing state at this time is the stable forwarding federation structure formed by all the nodes at present. In the stable forwarding alliance structure, no rational node is willing to change the decision of itself actively to adjust the joining or the quitting of the new alliance structure, namely, when any node is in the stable forwarding alliance structure, the average benefit obtained by all nodes is the largest.
With continued reference to FIG. 2, wherein η1In an initial state, η5In the final absorption state. Directed edges that transition between different states represent transitions between states, and the weight of a corresponding directed edge represents the transition probability of a transition between corresponding states
Wherein i and j∈{1,2,3,4,5}。
Referring to fig. 3, fig. 3 is a schematic structural diagram of an embodiment of the apparatus for obtaining a non-overlapping stable forwarding federation structure based on packet forwarding, it should be noted that the apparatus of the embodiment may perform the steps in the above method, and for a detailed description of relevant contents, please refer to the above method section, which is not described in detail herein. The device includes: a first determining module 101, a second determining module 102 and an obtaining module 103.
The first determining module 101 is configured to determine a whole network G for forwarding a data packet, where the network G is composed of N rational nodes, and G is an arbitrary directed graph;
the second determining module 102 is used for determining the set of non-overlapping different federation structures existing in the network G as
η thereinxRepresented as a forwarding federation structure of N all nodes in a network G, DNExpressed as the number of different federation structures present in the network G, where,
the obtaining module 103 is configured to use a set of non-overlapping different federation structures as a state space Ω { (η) of a discrete-time markov chain modelx),x＝{1,...,DNAnd acquiring non-overlapping stable forwarding alliance structures in a set of different alliance structures existing in the network G based on a discrete time Markov chain model.
The embodiment of the invention determines the whole network G for forwarding the data packet; determining, through the entire network G, a set of non-overlapping distinct federation structures present in the network G; and taking the set of the non-overlapped different alliance structures as a state space of a discrete-time Markov chain model, and acquiring the non-overlapped stable forwarding alliance structures in the set of the different alliance structures existing in the network G based on the discrete-time Markov chain model. Due to the fact that the non-overlapping stable forwarding alliance structure in the set of different alliance structures existing in the network G is obtained through the Markov chain model based on the discrete time, theoretical methods and technical support can be provided for the follow-up solution of the selfish incentive problem of the nodes in the Ad hoc network.
The obtaining module is specifically configured to obtain a non-overlapping stable forwarding alliance structure in a set of different alliance structures existing in the network G by solving a stationary probability of a discrete-time markov chain model.
Wherein, the acquisition module includes: a determining unit and an obtaining unit.
A determination unit forDetermining a transition probability matrix P of a Markov chain model of discrete time, wherein each element of the matrix P is denoted as Pη,η'Element Pη,η'Representing the transition probabilities from the η state to the η' state for the forwarding federation structure formed for all nodes;
the obtaining unit is used for calculating and obtaining the stable probability vector of the Markov chain model of the discrete time through the transition probability matrix P
Thereby obtaining non-overlapping stable forwarding federation structures in the set of different federation structures present in network G.
Wherein the element Pη,η'The calculation formula of (2) is as follows:
wherein, Cη,η'Denoted as the set of network nodes that are tuned from the current federation into the new federation resulting in forwarding federation structures from η states to η' states, lambda denotes the probability that any node in the network autonomously makes a tuning decision,
denoted as arbitrary node i due to federation from the current
Adjust to a new alliance
Resulting in a probability of forwarding the federation structure from the η state to the η' state,
the calculation formula of (2) is as follows:
federating for node i
The benefit of (2) in (1),
federating for node i
Income of (1), 0<φ≤1，
Wherein, the average benefit obtained by any node i in the network is as follows:
represented as a forwarding federation structure ηxProbability that can be formed, ui(Si) Represented as node i in federation SiThe benefit of (1).
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes performed by the present specification and drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (4)
1. A method for obtaining a non-overlapping stable forwarding federation structure based on packet forwarding, the method comprising:
determining a whole network G for forwarding a data packet, wherein the network G is composed of N rational nodes, and G is an arbitrary directed graph;
determining, from the entire network G, a set of non-overlapping different federation structures present in the network G as
WhereinηxRepresented as a forwarding federation structure of N all nodes in a network G, DNExpressed as the number of different federation structures present in the network G, where,
wherein the content of the first and second substances,
expressed as taking j non-repeating elements from the N-1 sets to form a subset, regardless of the order of the elements;
state space Ω { (η) of Markov chain model with the set of non-overlapping different federation structures as discrete timex),x＝{1,...,DNAcquiring non-overlapping stable forwarding alliance structures in different alliance structure sets existing in the network G based on the Markov chain model of the discrete time;
the step of obtaining non-overlapping stable forwarding federation structures in a set of different federation structures present in the network G based on the discrete-time Markov chain model comprises:
obtaining non-overlapping stable forwarding alliance structures in a set of different alliance structures existing in the network G by solving the stationary probability of a discrete-time Markov chain model;
the step of obtaining non-overlapping stable forwarding federation structures of a set of different federation structures present in the network G by solving stationary probabilities of a discrete-time Markov chain model comprises:
determining a transition probability matrix P of the discrete-time Markov chain model, wherein each element of the matrix P is represented as Pη,η'Element Pη,η'Representing the transition probabilities from the η state to the η' state for the forwarding federation structure formed for all nodes;
obtaining the distance by the transition probability matrix P calculationStationary probability vectors for a time-varying Markov chain model
Thereby obtaining non-overlapping stable forwarding federation structures in a set of different federation structures present in the network G;
element Pη,η'The calculation formula of (2) is as follows:
wherein, Cη,η'The set of network nodes that result in forwarding federation structures from η states to η' states, denoted as adjusting from the current federation into a new federation, represents the probability that an adjustment decision is made autonomously by any node in the network,
denoted as arbitrary node i due to federation from the current
Adjust to a new alliance
Resulting in a probability of forwarding the federation structure from the η state to the η' state,
the calculation formula of (2) is as follows:
federating for node i
The benefit of (2) in (1),
federating for node i
The income is more than 0 and less than or equal to 1,
2. The method of claim 1, wherein the average revenue obtained by any node i in the network is as follows:
represented as a forwarding federation structure ηxProbability that can be formed, ui(Si) Represented as node i in federation SiThe benefit of (1).
3. An apparatus for obtaining a non-overlapping stable forwarding federation structure based on packet forwarding, the apparatus comprising:
the system comprises a first determining module, a second determining module and a third determining module, wherein the first determining module is used for determining the whole network G for forwarding a data packet, the network G is composed of N rational nodes, and G is an arbitrary directed graph;
a second determining module, configured to determine, through the entire network G, that the set of non-overlapping different federation structures existing in the network G is a set of non-overlapping different federation structures existing in the network G
η thereinxRepresented as a forwarding federation structure of N all nodes in a network G, DNExpressed as the number of different federation structures present in the network G, where,
wherein the content of the first and second substances,
expressed as taking j non-repeating elements from the N-1 sets to form a subset, regardless of the order of the elements;
an obtaining module, configured to use the set of non-overlapping different federation structures as a state space Ω { (η) of a discrete-time Markov chain modelx),x＝{1,...,DNAcquiring non-overlapping stable forwarding alliance structures in a set of different alliance structures existing in the network G based on the Markov chain model of the discrete time;
the obtaining module is specifically configured to obtain a non-overlapping stable forwarding alliance structure in a set of different alliance structures existing in the network G by solving a stationary probability of a discrete-time markov chain model;
the acquisition module includes:
a determination unit for determining a transition probability matrix P of the discrete-time Markov chain model, wherein each element of the matrix P is represented as Pη,η'Element Pη,η'Representing the transition probabilities from the η state to the η' state for the forwarding federation structure formed for all nodes;
an obtaining unit, configured to obtain a stationary probability vector of the discrete-time markov chain model through the transition probability matrix P
Thereby obtaining the set of different federation structures present in the network GNon-overlapping stable forwarding federation structures;
element Pη,η'The calculation formula of (2) is as follows:
wherein, Cη,η'Denoted as the set of network nodes that are tuned from the current federation into the new federation resulting in forwarding federation structures from η states to η' states, lambda denotes the probability that any node in the network autonomously makes a tuning decision,
denoted as arbitrary node i due to federation from the current
Adjust to a new alliance
Resulting in a probability of forwarding the federation structure from the η state to the η' state,
the calculation formula of (2) is as follows:
federating for node i
The benefit of (2) in (1),
federating for node i
Income of (1), 0<φ≤1，
4. The apparatus of claim 3, wherein the average revenue obtained by any node i in the network is as follows:
represented as a forwarding federation structure ηxProbability that can be formed, ui(Si) Represented as node i in federation SiThe benefit of (1).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710047835.6A CN106851673B (en) | 2017-01-20 | 2017-01-20 | Method and device for acquiring non-overlapping stable forwarding alliance structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710047835.6A CN106851673B (en) | 2017-01-20 | 2017-01-20 | Method and device for acquiring non-overlapping stable forwarding alliance structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106851673A CN106851673A (en) | 2017-06-13 |
| CN106851673B true CN106851673B (en) | 2020-06-19 |
Family
ID=59120170
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710047835.6A Expired - Fee Related CN106851673B (en) | 2017-01-20 | 2017-01-20 | Method and device for acquiring non-overlapping stable forwarding alliance structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106851673B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107708169A (en) * | 2017-08-07 | 2018-02-16 | 国家计算机网络与信息安全管理中心 | Obtain the method and system of distributed overlay Stable coalitions structure |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103997752A (en) * | 2014-05-28 | 2014-08-20 | 天津大学 | Security and stability evaluation method of cooperative communication system based on Markov |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8874477B2 (en) * | 2005-10-04 | 2014-10-28 | Steven Mark Hoffberg | Multifactorial optimization system and method |
-
2017
- 2017-01-20 CN CN201710047835.6A patent/CN106851673B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103997752A (en) * | 2014-05-28 | 2014-08-20 | 天津大学 | Security and stability evaluation method of cooperative communication system based on Markov |
Non-Patent Citations (3)
| Title |
|---|
| "A Coalition Formation Game for Remote Radio Head Cooperation in Cloud Radio Access Network";Shun-Cheng Zhan;《IEEE Transactions on Vehicular Technology》;20160427;第4、5节 * |
| "Coalition Formation Games for Improving Data Delivery in Delay Tolerant Networks";Dusit Niyatoe etc.;《2010 IEEE Global Telecommunications Conference GLOBECOM 2010》;20101210;摘要，第1-4节 * |
| Dusit Niyatoe etc.."Coalition Formation Games for Improving Data Delivery in Delay Tolerant Networks".《2010 IEEE Global Telecommunications Conference GLOBECOM 2010》.2010, * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106851673A (en) | 2017-06-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wu et al. | Physical–social-aware D2D content sharing networks: A provider–demander matching game | |
| Guan et al. | Effective data communication based on social community in social opportunistic networks | |
| CN104640141B (en) | A kind of motivational techniques of more relay node cooperative games | |
| Seng et al. | User matching on blockchain for computation offloading in ultra-dense wireless networks | |
| Gao et al. | Network utility maximization based on an incentive mechanism for truthful reporting of local information | |
| Cai et al. | Allocate fair payoff for cooperation in wireless ad hoc networks using shapley value | |
| Zhao et al. | Social-community-aware long-range link establishment for multihop D2D communication networks | |
| Li et al. | Joint computation offloading and service caching for MEC in multi-access networks | |
| Sun et al. | Profit maximization task offloading mechanism with D2D collaboration in MEC networks | |
| CN106851673B (en) | Method and device for acquiring non-overlapping stable forwarding alliance structure | |
| CN106851672B (en) | Method and device for constructing data packet forwarding alliance game payment model | |
| Su et al. | Game-based distributed pricing and task offloading in multi-cloud and multi-edge environments | |
| Liu et al. | Distributed satisfaction‐aware relay assignment: a novel matching‐game approach | |
| Wang et al. | Truthful low-cost unicast in selfish wireless networks | |
| Wang et al. | Truthful multipath routing for ad hoc networks with selfish nodes | |
| Kondareddy et al. | Enforcing cooperative spectrum sensing in cognitive radio networks | |
| Lin et al. | The game theory: applications in the wireless networks | |
| Zhao et al. | Convergence study of decentralized min-cost subgraph algorithms for multicast in coded networks | |
| CN107708169A (en) | Obtain the method and system of distributed overlay Stable coalitions structure | |
| Xin et al. | Online node cooperation strategy design for hierarchical federated learning | |
| CN104735796B (en) | A kind of cooperating relay method of multi-source single relay system in cordless communication network | |
| Peng et al. | Resisting three-dimensional manipulations in distributed wireless spectrum auctions | |
| Jiang et al. | Fundamental tradeoffs and constrained coalitional games in autonomic wireless networks | |
| Sivaranjani et al. | Secure cluster head election for intrusion detection in MANET | |
| CN105608173A (en) | Adaptive agent based progressive community discovery method |
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 | ||
| 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: 20200619 |