Competition and Cooperation between Nodes in Delay Tolerant Networks with Two Hop Routing

Altman, Eitan

doi:10.1007/978-3-642-10406-0_18

Cited by 27 publications

(23 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In Ref. 11, authors derived performance and optimization statistics to measures the success in delivery probability for a message covering both cooperative and noncooperative scenarios. The study in Ref.…”

Section: Related Workmentioning

confidence: 99%

Proximity based trust‐advisor using encounters for mobile societies: Analysis of four filters

Kumar

Thakur

2010

Wireless Communications

View full text Add to dashboard Cite

Many interactions between network users rely on trust, which is becoming particularly important given the security breaches in the Internet today. These problems are further exacerbated by the dynamics in wireless mobile networks. In this paper, we address the issue of trust advisory and its establishment in mobile networks, with application to ad hoc networks, including delay tolerant (DTNs). We utilize encounters in mobile societies in novel ways, noticing that mobility provides opportunities to build proximity, location, and similarity based trust. Four new trust advisor filters are introduced -including encounter frequency, duration, behavior vectors, and behavior matrices. The filters are evaluated over an extensive set of real-world traces collected from a major university. Two sets of statistical analyses are performed; the first examines the underlying encounter relationships in mobile societies, and the second evaluates DTN routing in mobile peer-to-peer networks using trust and selfishness models. We find that for the analyzed trace, trust filters are stable in terms of growth with time (three filters have close to 90% overlap of users over a period of 9 weeks) and the results produced by different filters are noticeably different. In our analysis for trust and selfishness model, our trust filters largely undo the effect of selfishness on the unreachability in a network. Thus improving the connectivity in a network with selfish nodes. We hope that our initial promising results open the door for further research on proximity-based trust.infrastructure-less peer-to-peer mobile networks, such as ad hoc, delay tolerant (DTNs) or sensor networks, cooperation, and subsequently trust is imperative to the construction and operation of the network. Selfish and uncooperative nodes can easily disrupt communication. With trust, several potential applications can be enabled including mobile social networking, building groups and communities of interest, localized alert and emergency notification, context-aware and similaritybased networking [1], to name a few.

show abstract

Section: Related Workmentioning

confidence: 99%

Proximity based trust‐advisor using encounters for mobile societies: Analysis of four filters

Kumar

Thakur

2010

Wireless Communications

View full text Add to dashboard Cite

show abstract

“…25 Hence, the total energy consumption per node becomes = e r + e t + e s . 25 Hence, the total energy consumption per node becomes = e r + e t + e s .…”

Section: Problem Formulationmentioning

confidence: 99%

Satisfactory content delivery scheme for QoS provisioning in delay tolerant networks

Ezzahidi

Sabir

Ghogho

2018

Int J Communication

View full text Add to dashboard Cite

We deal in this article with the content forwarding problem in delay tolerant networks (DTNs). We first formulate the content delivery interaction as a noncooperative 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 has to solve the dilemma of accepting/rejecting to cache the source's file. Cooperation incurs energy cost due to caching, carrying, and forwarding the source's file. Yet when a relay accepts to cooperate, it may receive some reward if it succeeds to be the first relay to forward the content to the destination. Otherwise, the relay may receive some penalty in the form of a constant regret; the latter parameter is introduced to make incentive for cooperation.Next, we introduce the concept of satisfaction equilibrium (SE) as a solution concept to the induced game. Now, the source node is solely interested in reaching a file delivery probability greater than some given threshold, while the relays behave rationally to maximize their respective payoffs. Full characterizations of the SEs for both pure and mixed strategies are derived. Furthermore, we propose two learning algorithms allowing the players (source/relays) to reach the SE strategies. Finally, extensive numerical investigations and some learning simulations are carried out to illustrate the behavior of the interacting nodes and to give some insightful thoughts on how to fine-tune the network setting.KEYWORDS content caching, delay tolerant network, distributed learning, energy efficiency, reward-penalty incentive mechanism, satisfaction equilibrium Int J Commun Syst. 2019;32:e3844.wileyonlinelibrary.com/journal/dac

show abstract

“…In [14], a fully distributed reputation system is proposed that can cope with false information, where each node maintains a reputation rating for peers. In [15], [16], [17], [18], analysis of rewards provisions and punishment is conducted based on game theoretic approaches to provide incentives for message delivery. In [19], authors propose a game-theoretic model to discourage selfish behavior and stimulate cooperation by leveraging Nash equilibria with socially optimal behavior.…”

Section: Related Workmentioning

confidence: 99%

Social discovery using longitudinal spatial smartphone sensing

Kumar

2014

2014 IEEE Wireless Communications and Networking Conference (WCNC)

View full text Add to dashboard Cite

A new generation of social discovery and crowdsourced location-based services promise to integrate mobile computing into our lives more than ever. An essential component in these services is the neighbor or peer selection, that is also needed for peer-to-peer (P2P) mobile applications and multiplayer mobile gaming. One major challenge is posed by the interpretation of the information collected by the smartphones (about nearby devices, locations) to bring the user closer to context-awareness and informed peer selection. We introduce a framework and a corresponding application (ConnectEnc) for mobile peer rating using a multi-dimensional metric scheme based on encounter and location sensing.ConnectEnc maintains a history of discovered nearby devices and locations, and rates them using an array of metrics ranging in complexity from simple (encounter frequency) to complex and novel (location vector and matrix similarity). We have developed and deployed ConnectEnc application on Android and Nokia N810 platform to measure the link between the scores of proposed filters and device selection by the user. Results from the deployment shows that statistically high correlation exists between ConnectEnc recommendations and user selections.Our framework is distributed, modular and can serve as a peer selection platform for other mobile protocols based on specific requirements. It runs on individual devices and does not require data sharing or interaction; and hence can bootstrap other recommendation, cooperation or reputation systems.

show abstract

Competition and Cooperation between Nodes in Delay Tolerant Networks with Two Hop Routing

Cited by 27 publications

References 7 publications

Proximity based trust‐advisor using encounters for mobile societies: Analysis of four filters

Proximity based trust‐advisor using encounters for mobile societies: Analysis of four filters

Satisfactory content delivery scheme for QoS provisioning in delay tolerant networks

Social discovery using longitudinal spatial smartphone sensing

Contact Info

Product

Resources

About