Vaggelis G. Douros Stavros Toumpis George C. Polyzos Channel Access Competition in Linear Multihop Device-to-Device Networks 1 Nicosia, 07.08.2014.

Slides:



Advertisements
Similar presentations
This research has been co-financed by the European Union (European Social Fund – ESF) and Greek national funds through the Operational Program "Education.
Advertisements

* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.
QoS in ad hoc nets: distributed fair scheduling SCOPE: Self-coordinating Localized FQ H. Luo et al “A Self-Coordinating Approach to Distributed FairQueueing.
TDMA Scheduling in Wireless Sensor Networks
Game Theory and Computer Networks: a useful combination? Christos Samaras, COMNET Group, DUTH.
Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks Mingyan Li, Iordanis Koutsopoulos, Radha Poovendran (InfoComm ’07) Presented.
Course: Applications of Information Theory to Computer Science CSG195, Fall 2008 CCIS Department, Northeastern University Dimitrios Kanoulas.
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
Playback delay in p2p streaming systems with random packet forwarding Viktoria Fodor and Ilias Chatzidrossos Laboratory for Communication Networks School.
Vaggelis G. Douros Applications of Game Theory for Radio Resource Management in Wireless Networks 1 «ΤΟ ΟΠΑ ΕΡΕΥΝΑ»
1 Evolution & Economics No. 5 Forest fire p = 0.53 p = 0.58.
Sogang University ICC Lab Using Game Theory to Analyze Wireless Ad Hoc networks.
Cooperative protocols for wireless vehicular communication
Joint Multi-Access and Routing as a Stochastic Game for Relay Channel Yalin Evren Sagduyu, Anthony Ephremides Objective and Motivation * Objective: Analyze.
Opportunistic Packet Scheduling and Media Access Control for Wireless LANs and Multi-hop Ad Hoc Networks Jianfeng Wang, Hongqiang Zhai and Yuguang Fang.
Performance Analysis of Reputation-based Mechanisms for Multi-hop Wireless Networks Fabio Milan Dipartimento di Elettronica Politecnico di Torino Turin,
A Game-Theoretic Look at Joint Multi-Access, Power and Rate Control Yalin Evren Sagduyu, Anthony Ephremides Objective and Motivation * Objective: Analyze.
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
Using Directional Antennas for Medium Access Control in Ad Hoc Networks MOBICOM 2002 R. Roy Choudhury et al Presented by Hyeeun Choi.
Medium Access Control Protocols Using Directional Antennas in Ad Hoc Networks CIS 888 Prof. Anish Arora The Ohio State University.
Johannes PODC 2009 –1 Coloring Unstructured Wireless Multi-Hop Networks Johannes Schneider Roger Wattenhofer TexPoint fonts used in EMF. Read.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
By: Gang Zhou Computer Science Department University of Virginia 1 A Game-Theoretic Framework for Congestion Control in General Topology Networks SYS793.
CCH: Cognitive Channel Hopping in Vehicular Ad Hoc Networks Brian Sung Chul Choi, Hyungjune Im, Kevin C. Lee, and Mario Gerla UCLA Computer Science Department.
Vaggelis G. Douros Stavros Toumpis George C. Polyzos On the Nash Equilibria of Graphical Games for Channel Access in Multihop Wireless Networks 1 WWRF-WCNC.
Lifetime and Coverage Guarantees Through Distributed Coordinate- Free Sensor Activation ACM MOBICOM 2009.
Computer Science, Economics, and the Effects of Network Structure
When rate of interferer’s codebook small Does not place burden for destination to decode interference When rate of interferer’s codebook large Treating.
Multimedia & Networking Lab
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
Grammati Pantziou 1, Aristides Mpitziopoulos 2, Damianos Gavalas 2, Charalampos Konstantopoulos 3, and Basilis Mamalis 1 1 Department of Informatics, Technological.
Beyond Routing Games: Network (Formation) Games. Network Games (NG) NG model the various ways in which selfish users (i.e., players) strategically interact.
A Distributed Framework for Correlated Data Gathering in Sensor Networks Kevin Yuen, Ben Liang, Baochun Li IEEE Transactions on Vehicular Technology 2008.
Inoculation Strategies for Victims of Viruses and the Sum-of-Squares Partition Problem Kevin Chang Joint work with James Aspnes and Aleksandr Yampolskiy.
ECE559VV – Fall07 Course Project Presented by Guanfeng Liang Distributed Power Control and Spectrum Sharing in Wireless Networks.
Applications of Game Theory for Power Control in Wireless Networks of Autonomous Entities «Το ΟΠΑ Ερευνά», Πρόγραμμα ΗΡΑΚΛΕΙΤΟΣ ΙΙ Vaggelis.
1 Power control under best response dynamics for interference mitigation in a two-tier femtocell network Vaggelis G. Douros Stavros.
A Non-Monetary Protocol for P2P Content Distribution in Wireless Broadcast Networks with Network Coding I-Hong Hou, Yao Liu, and Alex Sprintson Dept. of.
A Game Approach for Multi-Channel Allocation in Multi-Hop Wireless Networks Lin Gao, Xinbing Wang Dept. of Electronic Engineering Shanghai Jiao Tong University.
Wireless Sensor Network Protocols Dr. Monir Hossen ECE, KUET Department of Electronics and Communication Engineering, KUET.
PRICE-BASED SPECTRUM MANAGEMENT IN COGNITIVE RADIO NETWORKS Fan Wang, Marwan Krunz, and Shuguang Cui Department of Electrical & Computer Engineering, University.
Collaborative Communications in Wireless Networks Without Perfect Synchronization Xiaohua(Edward) Li Assistant Professor Department of Electrical and Computer.
Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks
Novel network coding strategy for TDD Use of feedback (ACK) improves delay/energy/ throughput performance, especially for high latency- high errors scenarios.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
Beyond selfish routing: Network Games. Network Games NGs model the various ways in which selfish agents strategically interact in using a network They.
Beyond selfish routing: Network Games. Network Games NGs model the various ways in which selfish users (i.e., players) strategically interact in using.
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
Non-Cooperative Behavior in Wireless Networks Márk Félegyházi (EPFL) PhD. public defense July 9, 2007.
Opportunistic Service Centric Scheduling with Strict Deadlines DAVID RAMIREZ 26/JAN/
1 Multi-radio Channel Allocation in Competitive Wireless Networks Mark Felegyhazi, Mario Čagalj, Jean-Pierre Hubaux EPFL, Switzerland IBC’06, Lisbon, Portugal.
MAIN RESULT: We assume utility exhibits strategic complementarities. We show: Membership in larger k-core implies higher actions in equilibrium Higher.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Double Coordination in Small Groups Luigi Mittone, Matteo Ploner, Ivan Soraperra Computable and Experimental Economics Laboratory – University of Trento,
The “New Network Node” Algorithm Brought to you by: Brian Wolf(Researcher) Harlan Russell (Advisor) Joe Hammond (Advisor Emeritus) Vivek Mehta(Graduate.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
SYNERGY: A Game-Theoretical Approach for Cooperative Key Generation in Wireless Networks Jingchao Sun, Xu Chen, Jinxue Zhang, Yanchao Zhang, and Junshan.
Caching Games between Content Providers and Internet Service Providers
Archimedes Foundation
Caching Games between Content Providers and Internet Service Providers
TexPoint fonts used in EMF.
Power Control in WLANs for Optimization of Social Fairness
Speaker: Po-Hung Chen Advisor: Dr. Ho-Ting Wu 2016/10/12
WWRF26 Meeting WG8 Spectrum Issues April 2011, Doha, Qatar
Vaggelis G. Douros George C. Polyzos Stavros Toumpis
Vaggelis G. Douros George C. Polyzos Stavros Toumpis
Information Sciences and Systems Lab
Presentation transcript:

Vaggelis G. Douros Stavros Toumpis George C. Polyzos Channel Access Competition in Linear Multihop Device-to-Device Networks 1 Nicosia,

Motivation (1) New communication paradigms will arise 2

Motivation (2) Proximal communication-D2D scenarios More devices…more interference Our work: Channel access in such scenarios  which device should transmit/receive data and when 3

Problem Description (1) Each node in this linear D2D network either transmits to one of its neighbors or waits Node 3 transmits successfully to node 4 IFF none of the red transmissions take place If node 3 decides to transmit to node 4, then none of the green transmissions will succeed

Problem Description (2) The problem: How can these autonomous nodes avoid collisions? The (well-known) solution: maximal scheduling… is not enough/incentive- compatible  We need to find equilibria!

Problem Description (3) This is a special type of game called graphical game Payoff depends on the strategy of nodes that are up to 2 hops away 1-c : a successful transmission -c : a failed transmission 0: a node waits 6

On the Nash Equilibria (1) How can we find a Nash Equilibrium? The (well-known) solution: Apply a best response scheme… will not converge  A naive approach: A distributed iterative randomized scheme, where nodes exchange feedback in a 2-hop neighborhood to decide upon their new strategy

On the Nash Equilibria (2) Each node i has |Di| neighbors and |Di|+1 strategies. Each strategy is chosen with prob. 1/(|Di|+1) A successful transmission is repeated in the next round Strategies that cannot be chosen increase the probability of Wait This is a NE! 23541

On the Nash Equilibria (3) By studying the structure of the NE, we can identify strategy subvectors that are guaranteed to be part of a NE We propose a sophisticated scheme and show that it converges monotonically at a NE

On the Nash Equilibria (4) A sophisticated approach: A successful transmission is repeated IFF it is guaranteed that it will be part of a NE vector Nodes exchange messages in a 3-hop neighborhood Is this faster than the naive approach? This is a NE!

Performance Evaluation (1) The sophisticated outperforms the naive scheme Even in big D2D networks, convergence at a NE is very fast 11

Performance Evaluation (2) Convergence at a NE for the sophisticated scheme is ~ proportional to the logarithm of the number of nodes of the topology In <10 rounds, most nodes converge at a local NE 12

Take-home Messages Channel access for selfish D2D networks can lead to efficient NE with minimal cooperation – stronger notion than maximal scheduling Studying the structure of the NE is very useful towards the design of efficient schemes – fast convergence – without spending much energy 13

Ευχαριστώ! Vaggelis G. Douros Mobile Multimedia Laboratory Department of Informatics School of Information Sciences and Technology Athens University of Economics and Business 14

Acknowledgement (1) Vaggelis G. Douros is supported by the HERAKLEITOS II Programme which is co- financed by the European Social Fund and National Funds through the Greek Ministry of Education. 15

Acknowledgement (2) The research of Stavros Toumpis has been co-financed by the European Union (European Social Fund ESF) and Greek national funds through the Operational Program “Education and Lifelong Learning” of the National Strategic Reference Framework (NSRF) Research Funding Program: THALES. Investing in knowledge society through the European Social Fund. 16