Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

Goodbye, ALOHA!

©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The vision of the Internet of Things (IoT) to interconnect and Internet-connect everyday people, objects, and machines poses new challenges in the design of wireless communication networks. The design of medium access control (MAC) protocols has been traditionally an intense area of research due to their high impact on the overall performance of wireless communications. The majority of research activities in this field deal with different variations of protocols somehow based on ALOHA, either with or without listen before talk, i.e., carrier sensing multiple access. These protocols operate well under low traffic loads and low number of simultaneous devices. However, they suffer from congestion as the traffic load and the number of devices increase. For this reason, unless revisited, the MAC layer can become a bottleneck for the success of the IoT. In this paper, we provide an overview of the existing MAC solutions for the IoT, describing current limitations and envisioned challenges for the near future. Motivated by those, we identify a family of simple algorithms based on distributed queueing (DQ), which can operate for an infinite number of devices generating any traffic load and pattern. A description of the DQ mechanism is provided and most relevant existing studies of DQ applied in different scenarios are described in this paper. In addition, we provide a novel performance evaluation of DQ when applied for the IoT. Finally, a description of the very first demo of DQ for its use in the IoT is also included in this paper.Peer ReviewedPostprint (author's final draft

MoMo: a group mobility model for future generation mobile wireless networks

Existing group mobility models were not designed to meet the requirements for accurate simulation of current and future short distance wireless networks scenarios, that need, in particular, accurate, up-to-date informa- tion on the position of each node in the network, combined with a simple and flexible approach to group mobility modeling. A new model for group mobility in wireless networks, named MoMo, is proposed in this paper, based on the combination of a memory-based individual mobility model with a flexible group behavior model. MoMo is capable of accurately describing all mobility scenarios, from individual mobility, in which nodes move inde- pendently one from the other, to tight group mobility, where mobility patterns of different nodes are strictly correlated. A new set of intrinsic properties for a mobility model is proposed and adopted in the analysis and comparison of MoMo with existing models. Next, MoMo is compared with existing group mobility models in a typical 5G network scenario, in which a set of mobile nodes cooperate in the realization of a distributed MIMO link. Results show that MoMo leads to accurate, robust and flexible modeling of mobility of groups of nodes in discrete event simulators, making it suitable for the performance evaluation of networking protocols and resource allocation algorithms in the wide range of network scenarios expected to characterize 5G networks.Comment: 25 pages, 17 figure