In the paradigm of mobile Ad hoc networks (MANET), forwarding packets originating from other nodes requires cooperation among nodes. However, as each node may not want to waste its energy, cooperative behavior can not be guaranteed. Therefore, it is necessary to implement some mechanism to avoid selfish behavior and to promote cooperation. In this paper, we propose a simple quid pro quo based reputation system, i.e., nodes that forward gain reputation, but lose more reputation if they do not forward packets from cooperative users (determined based on reputation), and lose less reputation when they chose to not forward packets from non-cooperative users. Under this framework, we model the behavior of users as an evolutionary game and provide conditions that result in cooperative behavior by studying the evolutionary stable states of the proposed game. Numerical analysis is provided to study the resulting equilibria and to illustrate how the proposed model performs compared to traditional models.
Ad-hoc networks are independent of any infrastructure. The nodes are autonomous and make their own decisions. They also have limited energy resources. Thus, a node tends to behave selfishly when it is asked to forward the packets of other nodes. Indeed, it would rather choose to reject a forwarding request in order to save its energy. To overcome this problem, the nodes need to be motivated to cooperate. To this end, we propose a self-learning repeated game framework to enforce cooperation between the nodes of a network. This framework is inspired by the concept of "The Weakest Link" TV game. …
In mobile ad hoc networks (MANET), nodes usually belong to different authorities and pursue different goals. In order to maximize their own performance, nodes in such networks tend to be selfish and are not willing to forward packets for benefit of others. Meanwhile, some nodes may behave maliciously and try to disrupt the network through wasting other nodes resources in a very large scale. In this article, we present a reputation-based attack resistant cooperation stimulation (RACS) system which ensures that damage caused by malicious nodes can be bounded and cooperation among the selfish nod…
Motivated by the concerns of cooperation security, this work examines selected principles of state-of-the-art reputation systems for multihop adhoc networks and their impact upon optimal strategies for rational nodes. An analytic framework is proposed and used for identification of effective cooperation-enforcement schemes. It is pointed out that an optimum rather than high reputation can be expected to be sought by rational nodes.
In self-organized mobile ad hoc networks (MANETs), network functions rely on cooperation of self-interested nodes, where a challenge is to enforce their mutual cooperation. In this paper, we study cooperative packet forwarding in a one-hop unreliable channel which results from loss of packets and noisy observation of transmissions. We propose an indirect reciprocity framework based on evolutionary game theory, and enforce cooperation of packet forwarding strategies in both structured and unstructured MANETs. Furthermore, we analyze the evolutionary dynamics of cooperative strategies, and deriv…
Ad hoc networks rely on the cooperation of the nodes participating in the network to forward packets for each other. A node may decide not to cooperate to save its resources while still using the network to relay its traffic. If too many nodes exhibit this behavior, network performance degrades and cooperating nodes may find themselves unfairly loaded. Most previous efforts to counter this behavior have relied on further cooperation between nodes to exchange reputation information about other nodes. If a node observes another node not participating correctly, it reports this observation to oth…
Node cooperation during packet forwarding operations is critically important for fair resource utilization in Community Wireless Mesh Networks (CoWMNs). In a CoWMN, node cooperation is achieved by using fairness protocols specifically designed to detect and isolate malicious nodes, discourage unfair behavior, and encourage node participation in forwarding packets. In general, these protocols can be split into two groups: Incentive-based ones, which are managed centrally, and use credit allocation schemes. In contrast, reputation-based protocols that are decentralized, and rely on information e…
Node misbehavior due to selfish or malicious behavior could significantly degrade the performance of MANET because most existing routing protocols in MANET aim to find the most efficient path. Overhearing and reputation based cooperation schemes have been used to detect and isolate the misbehaving nodes as well as to force them to cooperate. Performance analysis has been done for the network traffic using OCEAN over DSR on ns2 while considering the low energy levels for mobile nodes. Throughput, energy level, routing packets and normalized routing overhead are analyzed for OCEAN and normal DSR…
Sustaining cooperation among self-interested agents is critical for the proliferation of emerging online social communities, such as online communities formed through social networking services. Providing incentives for cooperation in social communities is particularly challenging because of their unique features: a large population of anonymous agents interacting infrequently, having asymmetric interests, and dynamically joining and leaving the community; operation errors; and low-cost reputation whitewashing. In this paper, taking these features into consideration, we propose a framework for…
MANET is a cooperative network in which nodes are responsible for forwarding as well as routing. Noncooperation is still a big challenge that certainly degrades the performance and reliability of a MANET. This paper presents a novel methodology to overcome routing misbehavior in MANET using Retaliation Model. In this model node misbehavior is watched and an equivalent misbehavior is given in return. This model employs several parameters such as number of packets forwarded, number of packets received for forwarding, packet forwarding ratio etc. to calculate Grade and Bonus Points. The Grade is …
With the current host-based Internet architecture, networking faces limitations in dynamic scenarios, due mostly to host mobility. The ICN paradigm mitigates such problems by releasing the need to have an end-to-end transport session established during the life time of the data transfer. Moreover, the ICN concept solves the mismatch between the Internet architecture and the way users would like to use it: currently a user needs to know the topological location of the hosts involved in the communication when he/she just wants to get the data, independently of its location. Most of the research …
Noncooperation or failure to work together is a big challenge that surely degrades the performance and reliability of Mobile Adhoc Networks. In MANETs, nodes have dual responsibilities of forwarding and routing, that's why it needs unison with nodes. To sort out non-cooperation a real life behavior should be implemented, so that misbehavior is nullified. In this paper, we present the "Mirror Model" that strictly enforces cooperation due to its punishment strategy. Node's behavior is watched by its neighbors in PON mode, to update the NPF, NPRF values for a threshold time. After the expiry of t…
Profile-cast is a service paradigm within the communication framework of delay tolerant networks (DTN). Instead of using destination addresses to determine the final destination it uses similarity-based forwarding protocol. With the rise in popularity of various wireless networks, the need to make wireless technologies robust, resilient to attacks and failure becomes mandatory. One issue that remains to be addressed in behavioral networks is node co-operation in forwarding packets. Nodes might behave selfishly (due to bandwidth preservation, energy /power constraints) or maliciously by droppin…
We deal in this paper with the content forwarding problem in Delay Tolerant Networks (DTNs). We first formulate the content delivery interaction as a non-cooperative satisfaction game. On one hand, the source node seeks to ensure a delivery probability above some given threshold. On the other hand, the relay nodes seek to maximize their own payoffs. The source node offers a reward (virtual coins) to the relay which caches and forwards the file to the final destination. Each relay faces the dilemma of accepting/rejecting to cache the source's file. Cooperation incurs energy cost due to caching,…
Many Internet of things (IoT) applications have been developed and implemented on unreliable wireless networks like the Delay tolerant network (DTN), however, efficient data transfer in DTN is still an important issue for the IoT applications. One of the application areas of DTN is Vehicular Delay Tolerant Network (VDTN) where the network faces communication disruption due to lack of end-to-end relay route. It is challenging as some of the nodes show selfish behavior to preserve their resources like memory, and energy level and become non-cooperative. In this article, an Honesty based Democrat…
Nodes in an ad hoc wireless network incur certain costs for forwarding packets since packet forwarding consumes the resources of the nodes. If the nodes are rational, free packet forwarding by the nodes cannot be taken for granted and incentive based protocols are required to stimulate cooperation among the nodes. Existing incentive based approaches are based on the VCG (Vickrey-Clarke-Groves) mechanism which leads to high levels of incentive budgets and restricted applicability to only certain topologies of networks. Moreover, the existing approaches have only focused on unicast and multicast…
Community networks are prone to free-riders, i.e., participants who take advantage of cooperation from others' routers but do not contribute reciprocally. In this paper, we present HARPIA, a system for credit-based incentive mechanisms for data forwarding in community networks aimed to prevent selfish behavior. HARPIA does not require a trusted third-party or tamper-resistant security modules as in other incentive mechanisms. Instead, it uses a distributed accounting scheme (DPIFA) to estimate the balance of data forwarding contribution and consumption of each network router and settle corresp…
The problem of communication among nodes in an \emph{extended network} is considered, where radio power decay and interference are limiting factors. It has been shown previously that, with simple multi-hopping, the achievable total communication rate in such a network is at most $Θ(\sqrt{N})$. In this work, we study the benefit of node cooperation in conjunction with multi-hopping on the network capacity. We propose a multi-phase communication scheme, combining distributed MIMO transmission with multi-hop forwarding among clusters of nodes. We derive the network throughput of this communicatio…
Delay Tolerant Networks (DTNs) rely on the cooperation of nodes in a network to forward a message from its source to its destination. Most of previous studies on DTNs have focused on the design of routing schemes under the hypothesis that each relay node is willing to participate in the forwarding process. However, the delivery of a message incurs energy and memory costs. In this paper we handle the problem of how to incentivize mobile nodes to participate in relaying messages using a reward mechanism. We consider heterogeneous relay nodes where the cost for taking part in the forwarding proce…
The performance of Mobile Ad hoc networks (MANET) depends on the cooperation of all active nodes. However, supporting a MANET is a cost-intensive activity for a mobile node. From a single mobile node perspective, the detection of routes as well as forwarding packets consume local CPU time, memory, network-bandwidth, and last but not least energy. We believe that this is one of the main factors that strongly motivate a mobile node to deny packet forwarding for others, while at the same time use their services to deliver its own data. This behavior of an independent mobile node is commonly known…
Wireless sensor networks (WSN) have recently received an increasing interest. They are now expected to be deployed for long periods of time, thus requiring software updates. Updating the software code automatically on a huge number of sensors is a tremendous task, as ''by hand'' updates can obviously not be considered, especially when all participating sensors are embedded on mobile entities. In this paper, we investigate an approach to automatically update software in mobile sensor-based application when no localization mechanism is available. We leverage the peer-to-peer cooperation paradigm…
This paper studies a novel user cooperation model in a wireless powered mobile edge computing system where two wireless users harvest wireless power transferred by one energy node and can offload part of their computation tasks to an edge server (ES) for remote execution. In particular, we consider that the direct communication link between one user to the ES is blocked, such that the other user acts as a relay to forward its offloading data to the server. Meanwhile, instead of forwarding all the received task data, we also allow the helping user to compute part of the received task locally to…
One formal way of studying cooperation and incentive mechanisms in wireless ad hoc networks is to use game theory. In this respect, simple interaction models such as the forwarder's dilemma have been proposed and used successfully. However, this type of models is not suited to account for possible fluctuations of the wireless links of the network. Additionally, it does not allow one to study the way a node transmits its own packets. At last, the repeated game models used in the related literature do not allow the important scenario of nodes with partial information (about the link state and no…
This paper describes a strategy that was designed, implemented, and presented at the {\it Mobile Ad Hoc Networking Interoperability and Cooperation (MANIAC) Challenge 2013}. The theme of the MANIAC Challenge 2013 was ``Mobile Data Offloading,'' and consisted on developing and comparatively evaluating strategies to offload infrastructure access points via customer ad hoc forwarding using handheld devices (e.g., tablets and smartphones). According to the challenge rules, a hop-by-hop bidding contest (or ``auction'') should decide the path of each data packet towards its destination. Consequently…
The performance of data delivery in wireless relay networks (WRNs), such as delay-tolerant networks and device-to-device communications heavily relies on the cooperation of mobile nodes (i.e., users and their carried devices). However, selfish nodes may refuse to relay data to others or share their resources with them due to various reasons, such as resource limitations or social preferences. Meanwhile, misbehaving nodes can launch different types of internal attacks (e.g., blackhole and trust-related attacks) to disrupt the normal operation of the network. Numerous mechanisms have been recent…
In this work, we investigate a slotted-time relay assisted cooperative random access wireless network with multipacket (MPR) reception capabilities. MPR refers to the capability of a wireless node to successfully receive packets from more than two other modes that transmit simultaneously at the same slot. We consider a network of $N$ saturated sources that transmit packets to a common destination node with the cooperation of two infinite capacity relay nodes. The relays assist the sources by forwarding the packets that failed to reach the destination. Moreover, the relays have also packets of …
