-
41
Markov game modeling of mimic defense and defense strategy determination
Published 2018-10-01“…Network mimic defense technology enhances the robustness of active defense through the redundancy,dynamic and diversity as well as the decision feedback mechanism.However,little work has been done for its security assessment and existing classic game models are not suitable for its dynamic characteristics and lack of universality.A Markov game model was proposed to analyze the transfer relationship between offensive and defensive status and the measurement method of safety and reliability of mimic defense,and calculated the offensive and defensive game equilibrium through non-linear programming algorithm to determine the best defensive strategy considering performance.Experiments give a comparison with the multi-target hiding technique and shows that the mimic defense has a higher defensive effect.Combining with the specific network case,the specific attack and defense path for the exploit of the system vulnerability is given and the effectiveness of the defense strategy algorithm is verified.…”
Get full text
Article -
42
High-throughput and low-overhead probabilistic routing based on multi-player bargaining game for opportunistic networks
Published 2015-06-01“…To address the problems existing in the present probabilistic routing based on bargaining games,including unidirectional transmission of messages degrades the success ratio,depending on the virtual money decreases the purchasing power of nodes,and redundancy exists in the interaction process of messages,an routing algorithm based on multi-player bargaining game for opportunistic networks,HLPR-MG,was proposed.Through extending the two-player game to a multi-player bargaining game,introducing the barter trade to enhance purchasing power of nodes,and improving the existing interaction mechanism to reduce the times of game,proposed algorithm achieves the effect of increasing network throughput and decreasing control overhead.Theoretical analysis verifies the effectiveness of HLPR-MG,and simulation results show that HLPR-MG improves the network throughput and success ratio at least 3.63%,and reduces the control overhead and average end-to-end delay by more than 17.76% and 4.03%,respectively,as compared to the classical GSCP and BG algorithms.…”
Get full text
Article -
43
Research on WSN lifetime optimization game algorithm combined power and channel
Published 2019-04-01“…Due to the problem of shortening the network lifetime which was caused by the big energy consumption for wireless sensor network (WSN) whose energy and computing power was limit,a lifetime optimization game algorithm combined power control and channel allocation (LOAPC) was proposed.The influence of node power and residual energy on the node interference was explored to construct an interference affection measurement model.Then,expected transmission times was introduced to establish a novel node lifetime model.Finally,LOAPC aimed at reducing interference and prolonging lifetime,and the node power was limited by an optional power set which ensured the network connectivity and economized energy consumption,so as to prolong the network lifetime effectively.At the same time,the simulation results show that the algorithm has the characteristics of low interference,low energy consumption and effectively prolonging the lifetime of the network.…”
Get full text
Article -
44
Network slicing resource allocation strategy based on joint optimization
Published 2023-05-01“…To improve network resource utilization that was decreased by different applications with different requirements in 5G networks, a network slicing resource allocation strategy based on joint optimization was proposed, which was utilized to maximize both network resource utilization and network revenue by comprehensively considering in tra-slice and inter-slice resource schedule.Firstly, the user’s average satisfaction function was defined in the inter-slicing resource allocation problem.Furthermore, in terms of the number of users, slicing schedule delay and priority, a proportional fair resource allocation algorithm based on quality of service (QoS) was proposed, which was employed to achieve the best tradeoff between fairness and the users’ requirements among slices.Secondly, after two functions (service degradation and resource migration) were introduced in the inter-slice resource schedule problem, two price models were established for internal access users and external access users respectively, where congestion and non-congestion conditions were analyzed.According to the proposed price models, a Stackelberg game between the base station and users was constructed, and a global search algorithm with low complexity was leveraged to obtain the best response of the game, where the best tradeoff between the base station revenue and user utility was obtained.Simulation results show that the proposed strategy can effectively improve resource utilization and network revenue while reducing network congestion.Therefore, it can better realize fairness in resource allocation.…”
Get full text
Article -
45
A Multiple Collision Channel Assignment Based on Imperfect Game Theory
Published 2014-05-01Get full text
Article -
46
Power allocation in wireless network virtualization based on resource sharing
Published 2016-02-01“…A game theory based two steps power allocation scheme for wireless network virtualization, called G2SPA, was proposed, which designed a stackelberg equilibrium (SE)price strategy based on the interactions between SP and mobile user equipme (MUE), and then MacAfee based auction to reallocate leisure resource was performed. …”
Get full text
Article -
47
Resource allocation algorithm based on non-cooperative game theory in uplink OFDMA multi-hop relay networks
Published 2012-03-01“…Resource allocation issue in uplink OFDMA multi-hop relay networks was investigated.Firstly,with constraints such as maximum transmission power being imposed,a multi-cell optimization model for resource allocation in uplink OFDMA multi-hop relay networks was formulated.By applying non-cooperative game and pricing theories,the optimization is transformed into the case where power was independently allocated on each sub-channel.The existence and uniqueness of Nash equilibrium for power allocation model which was based on non-cooperative was proven,and accordingly a distributed algorithm was proposed.Simulation results show that,the proposed algorithm can improve the system throughput effectively while profoundly reducing total system transmission power,thus achieving much higher energy efficiency ratio.…”
Get full text
Article -
48
Dynamic On-Demand Collaborative Charging Scheduling Based on Game Theory
Published 2024-01-01“…On-demand charging scheduling is an important kind of online charging scheduling method in Wireless Rechargeable Sensor Networks (WRSNs). Its dynamism and energy adaptability enables Mobile Chargers (MCs) to adjust charging paths in real-time based on the energy state of the network, which has attracted widespread attention since its proposal. …”
Get full text
Article -
49
Secure topology protocol for mobile peer-to-peer networks
Published 2010-01-01“…For the security problem in mobile peer to peer(MP2P) networks,an adaptive mobile peer-to-peer secure topology protocol(AMPSTP) was proposed.Firstly,Fortune algorithm was used to divide a large geographical region into some small sub regions.Secondly,temporary anchor node selection and update strategies were given.Thirdly,MP2P overlay network topology construction and maintenance mechanisms were also given.Fourthly,MP2P overlay network routing discovery algorithm and node selection mechanism based on game theory for MP2P networks were successively proposed.Finally,the performance of the AMPSTP protocol was theoretically analyzed and simulated on the platform of NS-2.Theoretical analysis and simulation results show that compared with MADPastry protocol,AMPSTP protocol not only can guarantee the network security and improve network performance,but also greatly reduce the control overhead.…”
Get full text
Article -
50
Network security situational awareness model based on threat intelligence
Published 2021-06-01“…In order to deal with the problems that the increasing scale of the network in the real environment leads to the continuous high incidence of network attacks, the threat intelligence was applied to situational awareness, and the situational awareness model based on random game was constructed.Threat perception of the target system was performed by comparing the similarity between the exogenous threat intelligence and the internal security events of the system.At the same time, internal threat intelligence was generated based on the threat information inside the system.In this process, game theory was used to quantify the current network security situation of the system, evaluate the security status of the network.Finally, the prediction of the network security situation was realized.The experimental results show that the network security situation awareness method based on threat intelligence can reflect the changes in the network security situation and predict attack behaviors accurately.…”
Get full text
Article -
51
Frequency Resource Sharing and Allocation Scheme Based on Coalition Formation Game in Hybrid D2D-Cellular Network
Published 2015-01-01“…Taking the cost for coalition formation into account, such as the path loss for data sharing, we prove that the core of the proposed game is empty, which shows the impossibility of grand coalition. …”
Get full text
Article -
52
Requirements-oriented spectrum sharing for OFDMA cognitive radio networks
Published 2015-08-01“…Considering the satisfaction of the secondary network communication requirements,a two-stage model was proposed to address the spectrum leasing and allocation problem in OFDMA cognitive radio networks(CRN).At the first stage of the model,the secondary base station(SBS)collected channel capacity requirements of the secondary network,and rent the spectrum resource from multiple primary base stations(PBS).The trade behaviors between the PBS and the SBS were modeled with a Bertrand game,and adopted the Nash equilibrium as the pricing scheme.At the second stage,with the Nash bargaining solution(NBS),the subcarriers and power allocation problem were defined as a nonlinear programming problem,and obtained the solution by Lagrange multiplier method.Comparing with the other spectrum allocation schemes,simulation results show the proposed spectrum sharing scheme can satisfy each secondary user’s communication requirements more fairly and efficiently.…”
Get full text
Article -
53
Effectiveness of Centrality Measures for Competitive Influence Diffusion in Social Networks
Published 2025-01-01“…This paper investigates the effectiveness of centrality measures for the influence maximization problem in competitive social networks (SNs). We consider a framework, which we call “I-Game” (Influence Game), to conceptualize the adoption of competing products as a strategic game. …”
Get full text
Article -
54
Agent-based dynamic spectrum trading algorithm in cognitive radio network
Published 2013-03-01Get full text
Article -
55
Dynamic computing offloading strategy in LEO constellation edge computing network
Published 2024-07-01“…To address this problem, a multi-user computing offloading strategy based on stochastic game was proposed under the system model of dynamic environment low earth orbit constellation edge computing network. …”
Get full text
Article -
56
Optimizing VGG16 deep learning model with enhanced hunger games search for logo classification
Published 2024-12-01Get full text
Article -
57
ACS based differentiated service routing algorithm in wireless sensor network
Published 2013-10-01“…Aiming at the different requirements of data transmission in wireless sensor networks,QoS was divided into three services.By using game theory,the relationship among the delay,reliability and energy consumption during the process of data transmission was analyzed.Based on ACS (ant colony system),ACS based differentiated service and game-theory routing (ADSGR)was proposed.In accordance with the diverse QoS requirements,the ADSGR chooses the suitable paths,and improves network performance and resource utility.Experimental results show the ADSGR has better performance than some other routing algorithms in terms of the delay,reliability and energy consumption.…”
Get full text
Article -
58
An optimal energy-efficient resource allocation algorithm in ultra-dense network
Published 2017-10-01“…The energy-efficient resource allocation problem was taken in an ultra-dense network(UDN) consisted of multiple femtocells.Aiming at maximizing the energy efficiency (EE) of the whole network,quality of service (QoS) constraint and interference limitation was considered.Then,the established nonconvex and nonlinear problem was relaxed relying on Cauchy inequality,and was developed into a non-cooperative game.Additionally,a distributed EE maximization algorithm was proposed satisfying the max-min fairness (MMF) criterion.Simulation results show that the proposed algorithm outperformances the existing algorithms in terms of the EE and the throughput.…”
Get full text
Article -
59
A Collision Avoidance MAC Protocol with Power Control for Adaptive Clustering Underwater Sensor Networks
Published 2025-01-01Get full text
Article -
60
Energy efficiency-based downlink resource allocation in cognitive small cell networks
Published 2016-04-01“…After obtaining the SRB allocation strategies, the master game could be re-modeled as equivalent sub-games for solving the transmission power more easily. …”
Get full text
Article