An optimal routing scheme in space information networks was presented to balance network loads for heterogeneous users. According to the competition among the nodes, the model was built based on queuing game theory. The virtual routing platform was in charge of resources allocation and route selection. It got user’s gain to decide which node the user joined in. Owning to the existing of heterogeneous users, an optimal admission fee needed to be obtained to avoid congestion. In our model, firstly, the whole welfare of the system was formulated. Then the optimal admission fee was calculated through maximizing the whole welfare. Meanwhile, the average maximum queue length was generated to set the buffer space of the node. At last, a routing factor was introduced into the route algorithm in order that the optimal routing could be selected by heterogeneous users. As a result, the system welfare reaches the maximum.
2 February 2022 in IEEE Transactions on Wireless Communications
The Space-Air-Ground Integrated Networks (SAGINs) converges the rapidly developing ground, aerial and satellite communication networks to provide users with efficient and personalized services through the multi-layer network architecture. The complex structure, inconsistent communication protocol, and incompatible equipment significantly affect the information transmission efficiency in SAGINs. The application of Software Defined Network (SDN) technology promotes global deployment of the SAGIN resources. Aiming at the information transmission bottleneck between controller and switch nodes in the software-defined SAGINs, a dynamic handover transmission control scheme based on the queuing game model is proposed. Considering long transmission delay links in the SAGINs, the traditional queuing game model is improved to reduce the number of information interactions. The users’ service value are defined as the random distribution to describe the various requirements in the network. In addition, the relationship between the social welfare and the arrival rate of the transmission control system is discussed under two modes of observable and unobservable controller queues. Through theoretical analysis and calculation, the unique handover arrival rate is obtained to make the social welfare equal in the two modes. When the arrival rate is less than the handover threshold, the controller queue is set to unobservable mode, and otherwise to observable mode. Then, the system can operate in an optimal way to obtain the maximum benefit. At last, numerical and system simulation verify the effectiveness of the scheme.
This article studies the integration of laser-beamed wireless power transfer (WPT) into high-altitude platform (HAP)-aided multiaccess edge computing (MEC) systems for the HAP-connected aerial user equipments (AUEs). By discretizing the 3-D coverage space of the HAP, we present a multitier tile grid-based spatial structure to provide the aerial locations in the form of tile grids to AUEs for laser charging. We identify a new privacy vulnerability caused by the openness during the WPT signaling transfer in the presence of a terrestrial adversary, which is able to launch the attacks by distributing the false tile grids to the AUEs. To address this vulnerability and enhance the location privacy of AUEs, we then propose a Colonel Blotto (CB) game framework to formulate the competitive tile grid allocation problem for the HAP and the adversary. The attack-defense interaction between the adversary and the HAP as a defender in their tile grid allocations to the AUEs is formulated as a CB game, which models the competition of two players for limited resources over multiple battlefields. Moreover, we derive the mixed-strategy Nash equilibria of the game for both symmetric and asymmetric tile grids between two players. Simulation results show that the proposed framework significantly outperforms the design baselines with a given privacy protection level in terms of system-wide expected total utilities.
In wireless powered sensor networks (WPSN), it is essential to research uplink transmit power control in order to achieve throughput performance balancing and energy scheduling. Each sensor should have an optimal transmit power level for revenue maximization. In this paper, we discuss a dynamic game-based algorithm for optimal power control in WPSN. The main idea is to use the non-cooperative differential game to control the uplink transmit power of wireless sensors in WPSN, to extend their working hours and to meet QoS (Quality of Services) requirements. Subsequently, the Nash equilibrium solutions are obtained through Bellman dynamic programming. At the same time, an uplink power control algorithm is proposed in a distributed manner. Through numerical simulations, we demonstrate that our algorithm can obtain optimal power control and reach convergence for an infinite horizon.
Thanks to the full play of the synergy of local node sets, fog Internet of things technology has become the focus of many researchers. Unfortunately, the data transmission of the sensing terminal therein has the risk of being eavesdropped, due to the openness of the wireless channel and the large-scale deployment of different types of terminals. Meanwhile, the encryption method based on cryptography is difficult to apply to the Internet of things terminals with limited capacity because of its high computational complexity. This paper considers the use of physical layer security technology where the fog node improves the secrecy capacity of the desired channel by sending artificial noise to the untrusted third party to ensure the reliable transmission of data. Specifically, an intelligent resource allocation method based on deep reinforcement learning is proposed to realize the rapid allocation of link resources and interference noise power in the scene, where the relevant elements, such as state, action and reward, are reasonably designed. Simulation results demonstrate that the presented algorithm could effectively resolves the allocation problem, and its transmission delay obviously outperforms that of multiple comparison methods.
31 January 2021 in KSII Transactions on Internet and Information Systems