Auction-Based Secondary Relay Selection on Overlay Spectrum Sharing in Hybrid Satellite–Terrestrial Sensor Networks

In this paper, we investigate the auction-based secondary relay selection on overlay spectrum sharing in hybrid satellite–terrestrial sensor networks (HSTSNs), where both the decode-and-forward (DF) and amplify-and-forward (AF) relay protocols are analyzed based on time division multiple access (TDMA). As both the primary and secondary networks are rational, honest but with incomplete network information, they prefer to obtain maximum possibility payoffs by the cooperation between the primary and secondary networks, and the competition among secondary networks. Hence, Vickery auction is introduced to achieve the effective and efficient secondary relay selection by distinct sub-time slot allocation for one shot in terms of a distributed manner. Finally, numerical simulations are provided to validate the effectiveness of the auction mechanism on cooperative spectrum sharing in HSTSNs for secondary relay selection. Besides, the effect of key factors on the performance of the auction mechanism are analyzed in details.

SELFISH ROUTING IN THE PRESENCE OF NETWORK UNCERTAINTY

We study the problem of selfish routing in the presence of incomplete network information. Our model consists of a number of users who wish to route their traffic on a network of m parallel links with the objective of minimizing their latency. However, in doing so, they face the challenge of lack of precise information on the capacity of the network links. This uncertainty is modeled via a set of probability distributions over all the possibilities, one for each user. The resulting model is an amalgamation of the KP-model of [14] and the congestion games with user-specific functions of [22]. We embark on a study of Nash equilibria and the price of anarchy in this new model. In particular, we propose polynomial-time algorithms (w.r.t. our model's parameters) for computing some special cases of pure Nash equilibria and we show that negative results of [22], for the non-existence of pure Nash equilibria in the case of three users, do not apply to our model. Consequently, we propose an interesting open problem, that of the existence of pure Nash equilibria in the general case of our model. Furthermore, we consider appropriate notions for the social cost and the price of anarchy and obtain upper bounds for the latter. With respect to fully mixed Nash equilibria, we show that when they exist, they are unique. Finally, we prove that the fully mixed Nash equilibrium is the worst equilibrium.