An Improved Kalman Filter Positioning Method in NLOS Environment

In the precision positioning system, NLOS(Non Line of Sight) propagation and clock synchronization error caused by multiple base stations are the main reasons for reducing the reliability of communication and positioning accuracy. So, in the NLOS environment, it has an important role to eliminate the clock synchronization problem in the positioning system. In order to solve this problem, this paper proposes an improved Kalman filter localization method NLOS-K(Non Line of Sight-Kalman filter). First, the maximum likelihood estimation algorithm is used to iterate. Then, the Kalman filter algorithm is implemented and the Kalman gain matrix is redefined. The clock drift is compensated so that the clock between the master and slave base stations remains synchronized. The experimental results show that in the non-lineof-sight environment, compared with other algorithms, the positioning accuracy error of the improved algorithm is about 5 cm, and the accuracy compared with other algorithms is 97%. In addition, the influence of bandwidth and spectral density on the method is analyzed, and the accuracy and stability of positioning are improved as a whole.

Bargaining Game Theoretic Power Control in Selfish Cooperative Relay Networks

Wireless cooperative communications require appropriate power allocation （PA） between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information for each other, but each user node has the incentive to consume his power solely to decrease its own symbol error rate （SER） at the receiver. In this paper, we propose a fair and efficient PA scheme for the decode-and-forward cooperation protocol in selfish cooperative relay networks. We formulate this PA problem as a two-user cooperative bargaining game, and use Nash bargaining solution （NBS） to achieve a win-win strategy for both partner users. Simulation results indicate that the NBS is fair in that the degree of cooperation of a user only depends on how much contribution its partner can make to decrease its SER at the receiver, and efficient in the sense that the SER performance of both users could be improved through the game.

An Algorithm for Hybrid Nodes Barrier Coverage Based on Voronoi in Wireless Sensor Networks

In order to make up for the deficiencies and insufficiencies that In order to make up for the deficiencies and insufficiencies that wireless sensor network is constituted absolutely by static or dynamic sensor nodes. So a deployment mechanism for hybrid nodes barrier coverage (HNBC)is proposed in wireless sensor network, which collaboratively consists of static and dynamic sensor nodes. We introduced the Voronoi diagram to divide the whole deployment area. According to the principle of least square method, and the static nodes are used to construct the reference barrier line (RBL). And we implemented effectively barrier coverage by monitoring whether there is a coverage hole in the deployment area, and then to determine whether dynamic nodes need limited mobility to redeploy the monitoring area. The simulation results show that the proposed algorithm improved the coverage quality, and completed the barrier coverage with less node moving distance and lower energy consumption, and achieved the expected coverage requirements

Game Theoretic Subcarrier and Power Allocation for Wireless OFDMA Networks

This paper proposes a bargaining game theoretic resource(including the subcarrier and the power) allocation scheme for wireless orthogonal frequency division multiple access(OFDMA) networks.We define a wireless user s payoff as a function of the achieved data-rate.The fairness resource allocation problem can then be modeled as a cooperative bargaining game.The objective of the game is to maximize the aggregate payoffs for the users.To search for the Nash bargaining solution(NBS) of the game,a suboptimal subcarrier allocation is performed by assuming an equal power allocation.Thereafter,an optimal power allocation is performed to maximize the sum payoff for the users.By comparing with the max-rate and the max-min algorithms,simulation results show that the proposed game could achieve a good tradeoff between the user fairness and the overall system performance.

ASCFL:Accurate and Speedy Semi-Supervised Clustering Federated Learning

The influence of non-Independent Identically Distribution(non-IID)data on Federated Learning(FL)has been a serious concern.Clustered Federated Learning(CFL)is an emerging approach for reducing the impact of non-IID data,which employs the client similarity calculated by relevant metrics for clustering.Unfortunately,the existing CFL methods only pursue a single accuracy improvement,but ignore the convergence rate.Additionlly,the designed client selection strategy will affect the clustering results.Finally,traditional semi-supervised learning changes the distribution of data on clients,resulting in higher local costs and undesirable performance.In this paper,we propose a novel CFL method named ASCFL,which selects clients to participate in training and can dynamically adjust the balance between accuracy and convergence speed with datasets consisting of labeled and unlabeled data.To deal with unlabeled data,the prediction labels strategy predicts labels by encoders.The client selection strategy is to improve accuracy and reduce overhead by selecting clients with higher losses participating in the current round.What is more,the similarity-based clustering strategy uses a new indicator to measure the similarity between clients.Experimental results show that ASCFL has certain advantages in model accuracy and convergence speed over the three state-of-the-art methods with two popular datasets.