Results 91 to 100 of about 1,225 (207)
Egyptian Informatics Journal, 2014 In MANETs, the cooperation is considered as an important entity for enabling reliable data dissemination among the mobile nodes. But, the existence of selfish nodes weakens the degree of cooperation and in turn reduces the network performance. Hence, the
J. Sengathir, R. Manoharan
doaj +1 more source
Mixed Nash equilibria in selfish routing problems with dynamic constraints [PDF]
, 2008 We study the problem of routing traffic through a congested network consisting of m parallel links, each having a certain speed. Moreover, we are given n selfish (non-cooperative) agents, each of them willing to route her own piece of traffic on exactly ...
Alessandro Ferrante +3 more
core +1 more source
Algorithms, 2009 We consider the problem of all-to-one selfish routing in the absence of a payment scheme in wireless sensor networks, where a natural model for cost is the power required to forward, referring to the resulting game as a Locally Minimum Cost Forwarding ...
Sarvesh Varatharajan +4 more
doaj +1 more source
VCG with Communities on Random Ad Hoc Networks
International Journal of Distributed Sensor Networks, 2011 We study game-theoretic mechanisms for routing in wireless ad hoc networks. Our major results include a combination of theoretical bounds and extensive simulations, showing that VCG-based routing in wireless ad-hoc networks exhibits small frugality ratio
Gunes Ercal +3 more
doaj +1 more source
Game Theoretic Reward Based Adaptive Data Communication in Wireless Sensor Networks
IEEE Access, 2018 Selfish or non-cooperative behavior of nodes can degrade the performance of a wireless sensor network in many ways. These nodes can cause increased end-to-end delays and unfair energy consumption among the nodes due to higher packet loss ratio and non ...
Muhammad Muneer Umar +3 more
doaj +1 more source
Pairwise cooperations in selfish ring routing for minimax linear latency
, 2012 This paper studies the selfish routing game in ring networks with a load-dependent linear latency on each link. We adopt the asymmetric atomic routing model.
Weidong Ma +5 more
core +1 more source
How Much Can Taxes Help Selfish Routing?
, 2008 We study economic incentives for influencing selfish behavior in networks. We consider a model of selfish routing in which the latency experienced by network traffic on an edge of the network is a function of the edge congestion, and network users are ...
Tim Roughgarden +2 more
core
Enhanced binary Spray and Wait scheme based on reputation for DTN
Tongxin xuebao, 2012 A concept of forwarding credential was introduced,and a detection protocol of behavior was designed.A novel scheme which enhanced the prevalent binary Spray and Wait routing scheme was integrated with reputation to resist the impairment of selfishness ...
Xi ZHANG +3 more
doaj +2 more sources
Selfish routing games with priority lanes
CoRRWe study selfish routing games where users can choose between regular and priority service for each network edge on their chosen path. Priority users pay an additional fee, but in turn they may travel the edge prior to non-priority users, hence experiencing potentially less congestion.
Li, Yang +2 more
openaire +3 more sources
Effective ANT based Routing Algorithm for Data Replication in MANETs [PDF]
ICTACT Journal on Communication Technology, 2013 In mobile ad hoc network, the nodes often move and keep on change its topology. Data packets can be forwarded from one node to another on demand.
N.J. Nithya Nandhini +2 more
doaj