NDLI: On a locally minimum cost forwarding game

Please wait, while we are loading the content...

Wireless link scheduling under a graded SINR interference model

A 3d-localization and terrain modeling technique for wireless sensor networks

Passive localization using rotating anchor pairs in wireless sensor networks

On self-organization in MANETs

A constant approximation algorithm for link scheduling in arbitrary networks under physical interference model

An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks

Spatio-temporal monitoring using contours in large-scale wireless sensor networks

On the multicast throughput capacity of network coding in wireless ad-hoc networks

Can a packet walk straight through a field of randomly dying location-unaware wireless nodes?

Reactive jamming attacks in multi-radio wireless sensor networks: an efficient mitigating measure by identifying trigger nodes

On a locally minimum cost forwarding game

On a locally minimum cost forwarding game

Content Provider	ACM Digital Library
Author	Eidenbenz, Stephan Ercal-Ozkaya, Gunes Percus, Allon Meyerson, Adam
Abstract	We consider the problem of all-to-one (reverse multicast) selfish routing in the absence of a payment scheme in wireless networks, where a natural model for cost is the power required to forward. Whereas each node requires a path to the destination, it does not care how long that path is, so long as its own individual or local forwarding cost is minimized. Thus, we refer to this setting as a Locally Minimum Cost Forwarding Game (LMCF). From a system-wide perspective, short paths are clearly desirable, yielding two related social objectives of finding topologies that minimize: (i) the maximum stretch factor, and (ii) the directed weighted diameter. We prove that Nash equilibria always exist for LMCF, in particular the directed MST always being one, and we analyze the ratio of the social cost of Nash equilibria to the global optimum. The worst (maximum) possible value of this ratio is called the price of anarchy (PoA), and the best (minimum) possible value is called the price of stability (PoS). For the maximum stretch factor we present a Ω(n) worst-case bound on PoA and PoS, and for the directed weighted diameter we present a $Ω(n^{c})$ worst-case bound on PoA and PoS for all c < 1, even when restricted to Euclidean instances. On the one hand, we present Ω(n) and $Ω(n^{c})$ (for all c < 1) worst-case bounds, even when restricted to Euclidean instances We prove hardness of computing the optimal Nash equilibrium in three-dimensional Euclidean instances as well as approximation hardness in arbitrary instances. Finally, we propose a heuristic for finding Nash equilibria and analyze, via simulations and probabilistic arguments, the social costs given by the heuristic and by the MST. These results suggest that for random Euclidean power instances, the expected PoA is Ω(1) while the expected PoS is θ(1).
Starting Page	29
Ending Page	36
Page Count	8
File Format	PDF
ISBN	9781605585239
DOI	10.1145/1540343.1540349
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-05-18
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Price of stability Random euclidean power graphs Reverse multicast Game-theory
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in