vix.ing · top · new · best · stats · spec

CSMA Local Area Networking under Dynamic Altruism

2012/04/21 by Panayotis Antoniadis, Serge Fdida, Antoniadis, Panayotis +7
Computer Science · Decision Sciences · Economics, Econometrics and Finance · #Economic Policies and Impacts #Economic theories and models #FOS: Computer and information sciences #Game Theory and Applications #Networking and Internet Architecture (cs.NI) #cs.NI

paper · pdf · doi:10.48550/arxiv.1204.4847

arxiv created 2012/04/21 · openalex publication_date 2012/04/21 · arxiv updated 2012/04/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we consider medium access control of local area networks (LANs) under limited-information conditions as befits a distributed system. Rather than assuming "by rule" conformance to a protocol designed to regulate packet-flow rates (e.g., CSMA windowing), we begin with a non-cooperative game framework and build a dynamic altruism term into the net utility. The effects of altruism are analyzed at Nash equilibrium for both the ALOHA and CSMA frameworks in the quasistationary (fictitious play) regime. We consider either power or throughput based costs of networking, and the cases of identical or heterogeneous (independent) users/players. In a numerical study we consider diverse players, and we see that the effects of altruism for similar players can be beneficial in the presence of significant congestion, but excessive altruism may lead to underuse of the channel when demand is low.

Citations

Related