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

Designing Smart Adaptive Flooding in MANET using Evolutionary Algorithm

International audienceThis paper deals with broadcasting warning / emergency messages in mobile ad hoc networks. Traditional broadcasting schemes tend to focus on usually high and homogeneous neighborhood densities environments. This paper presents a broadcasting protocol that locally and dynamically adapts its strategy to the neighborhood densities. The behavior of the protocol is tuned using various internal parameters. Multiple combinations of those parameters have been pre-computed as optimal solutions for a range of neighborhood densities, and the most relevant one is dynamically chosen depending on the locally perceived environment. The combinations were determined by coupling an evolutionary algorithm and a network simulator, using a statistically realistic radio-propagation model (Shadowing Pattern). This approach is compared with other probabilistic methods while broadcasting an emergency message in vehicular ad hoc networks with variable and heterogeneous vehicle densities. In such a context, it is expected from the network to enable each node to receive the warning message. The results show that our protocol covers the whole network, whereas other methods only have a probability of 0.57 to 0.9 to cover the entire network

Networking strategies in streptomyces coelicolor

We are interested the soil dwelling bacteria Streptomyces coelicolor because its cells grow end to end in a line. New branches have the potential to extend from any point along this line and the result is a network of branches and connections. This is a novel form of colonisation in the bacterial world and it is advantageous for spreading through an environment resourcefully. Networking protocols for communication technologies have similar pressures to be resourceful in terms of time, computing power, and energy. In this preliminary investigation we design a computer model of the biological system to understand its limitations and strategies for survival. The decentralised capacity for organisation of both the bacterial system and the model reflects well on the now-popular conventions for path finding and ad hoc network building in human technologies. The project will ultimately become a comparison of strategies between nature and the man-made