Mobile ad hoc networks (MANETs) were originally designed for a cooperative environment. To use them in hostile environments, trust-based routing can be used, where instead of establishing the shortest routes as done in traditional routing protocols, most trusted routes are established. In this study, the authors present a light-weight trust-based routing protocol. It is light-weight in the sense that the intrusion detection system (IDS) used for estimating the trust that one node has for another, consumes limited computational resource. Moreover, it uses only local information thereby ensuring scalability. Our light-weight IDS takes care of two kinds of attacks, namely, the blackhole attack and the grey hole attack. Whereas our proposed approach can be incorporated in any routing protocol, the authors have used AODV as the base routing protocol to evaluate our proposed approach and give a performance analysis.

Mobile ad hoc networks (MANETs) are self-configuring infrastructureless dynamic wireless networks in which the nodes are resource constrained. Intrusion detection systems (IDSs) are used in MANETs to monitor activities to detect any intrusion in the otherwise vulnerable network. In this paper, we present efficient schemes for analyzing and optimizing the time duration for which the IDSs need to remain active in a MANET. A probabilistic model is proposed, which makes use of cooperation between IDSs among neighborhood nodes to reduce their individual active time. Typically, an IDS has to run all the time on every node to oversee network behavior. This can turn out to be a costly overhead for a battery-powered mobile device in terms of power and computational resources. Hence, in this work, our aim is to reduce the duration of active time of the IDSs without compromising their effectiveness. To validate our proposed approach, we model the interactions between IDSs as a multiplayer cooperative game in which the players have partially cooperative and partially conflicting goals. We theoretically analyze this game and support it with simulation results.

Device-to-device (D2D) communication is an emerging IoT technology for improved performance of cellular networks in terms of spectral efficiency, battery lifetime, coverage range, etc. The 5G cellular network is supposed to provide a perception of 99.999% network availability. One of the approaches to obtain it is by intercell D2D communication that eliminates the issue of unavailability of bandwidth between two users connected with different base stations (BSs). The interference mitigation is a key challenge while using licensed cellular spectrum for D2D links. It is seen that the resource allocation to the D2D links is a complex problem when D2D pairs are connected with different base stations. This paper presents a dynamic Resource-Block (RB) sharing scheme between the D2D users and cellular users in a multi-cell cellular network. Here a D2D user pair plays a Repeated Game with the nearby base stations in such a way that the players share a subset of their initial allotted resource to maximize their utility. The game is played by every intercell D2D players with the base stations simultaneously. We show that the punishment period of a deviating player may be reduced by invoking an additional penalty factor for its fast adherence. In addition, it also computes the optimal number of initial orthogonal RBs that is allocated to the D2D and the cellular users. Evaluation of our proposed scheme in comparison to few well known existing techniques shows a marked improvement in throughput of the overall system.