1 Cooperation in Multi-Domain Sensor Networks Márk Félegyházi Levente Buttyán Jean-Pierre Hubaux {mark.felegyhazi, EPFL, Switzerland.

Slides:



Advertisements
Similar presentations
Capacity Allocation in Networks Under Noncooperative Elastic Users Instructor: Ishai Menache Eliron Amir Winter 2006.
Advertisements

Márk FélegyháziMaster’s Thesis Development and Evaluation of a Dynamic Bluetooth Network Formation Procedure Márk Félegyházi, György Miklós Ericsson Research,
© 2007 Levente Buttyán and Jean-Pierre Hubaux Security and Cooperation in Wireless Networks Chapter 10: Selfishness in packet.
© 2007 Levente Buttyán and Jean-Pierre Hubaux Security and Cooperation in Wireless Networks Chapter 11: Wireless operators in.
Directed Diffusion for Wireless Sensor Networking
EPFL, Lausanne, Switzerland Márk Félegyházi Equilibrium Analysis of Packet Forwarding Strategies in Wireless Ad Hoc Networks – the Static Case Márk Félegyházi.
Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting Stephan Olariu Department.
Stimulation for Cooperation in Ad Hoc Networks: Beyond Nuglets Levente Buttyán, Jean-Pierre Hubaux, and Naouel Ben Salem Swiss Federal Institute of Technology.
21-23 November, 2012, 5th IDCS, Wu Yi Shan, China Smartening the Environment using Wireless Sensor Networks in a Developing Country Presented By Al-Sakib.
Border Games in Cellular Networks Infocom 2007 Márk Félegyházi*, Mario Čagalj†, Diego Dufour*, Jean- Pierre Hubaux* * Ecole Polytechnique Federale de Lausanne.
Joint Strategy Fictitious Play Sherwin Doroudi. “Adapted” from J. R. Marden, G. Arslan, J. S. Shamma, “Joint strategy fictitious play with inertia for.
Presented by Rick Skowyra
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
TOPOLOGIES FOR POWER EFFICIENT WIRELESS SENSOR NETWORKS ---KRISHNA JETTI.
Low-Energy Adaptive Clustering Hierarchy An Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks M. Aslam hayat.
1 Multi-radio Channel Allocation algorithms based on game theory analysis Shirin Saeedi Bidokhti Supervised by Mark Felegyhazi Prof. Hubaux Feb
Non-Cooperative Behavior in Wireless Networks Márk Félegyházi (EPFL) May 2007.
Gabriel Tsang Supervisor: Jian Yang.  Initial Problem  Related Work  Approach  Outcome  Conclusion  Future Work 2.
1 SOWER: Self-Organizing Wireless Network for Messaging Márk Félegyházi {mark.felegyhazi, srdan.capkun, Srdjan Čapkun Jean-Pierre.
FLIP : Flexible Interconnection Protocol Ignacio Solis Katia Obraczka.
Joint Multi-Access and Routing as a Stochastic Game for Relay Channel Yalin Evren Sagduyu, Anthony Ephremides Objective and Motivation * Objective: Analyze.
Problem Statement Given a control system where components, i.e. plant, sensors, controllers, actuators, are connected via a communication network, design.
Three heuristics for transmission scheduling in sensor networks with multiple mobile sinks Damla Turgut and Lotzi Bölöni University of Central Florida.
Research on cognitive radios Presented by George Fortetsanakis.
Theoretical Results on Base Station Movement Problem for Sensor Network Yi Shi ( 石毅 ) and Y. Thomas Hou ( 侯一釗 ) Virginia Tech, Dept. of ECE IEEE Infocom.
Collective actions and expectations Belev Sergey, Kalyagin Grigory Moscow State University.
Avoiding Energy Holes in Wireless Sensor Network with Nonuniform Node Distribution Xiaobing Wu, Guihai Chen and Sajal K. Das Parallel and Distributed Systems.
PRISONER’S DILEMMA By Ajul Shah, Hiten Morar, Pooja Hindocha, Amish Parekh & Daniel Castellino.
Speaker: Li-Sheng Chen 1 Jan 2, 2012 EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing Protocol for Wireless Ad Hoc Networks.
QoS Control For Sensor Networks Ranjit Iyer and Leonard Kleinrock UCLA Computer Science Department 4732 Boelter Hall Los Angeles, CA IEEE.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
A Game-Theoretic Look at Joint Multi-Access, Power and Rate Control Yalin Evren Sagduyu, Anthony Ephremides Objective and Motivation * Objective: Analyze.
QoS Control For Sensor Networks Iyer, R.; Kleinrock, L. ICC 2003.
Hierarchical Cooperation Achieves Linear Scaling in Ad Hoc Wireless Networks David Tse Wireless Foundations U.C. Berkeley AISP Workshop May 2, 2007 Joint.
Vikramaditya. What is a Sensor Network?  Sensor networks mainly constitute of inexpensive sensors densely deployed for data collection from the field.
Tuning the Carrier Sensing Range of IEEE MAC Jing Deng,Ben Liang and Pramod K. Varshney Univ. of New Orleans Globecom 2004.
Revocation Games in Ephemeral Networks Maxim Raya, Mohammad Hossein Manshaei, Márk Félegyházi, Jean-Pierre Hubaux CCS 2008.
NOBEL WP Szept Stockholm Game Theory in Inter-domain Routing LÓJA Krisztina - SZIGETI János - CINKLER Tibor BME TMIT Budapest,
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.
Wireless Sensor Networks COE 499 Energy Aware Routing
Energy-Efficient Protocol for Cooperative Networks IEEE/ACM Transactions on Networking, Apr Mohamed Elhawary, Zygmunt J. Haas Yong Zhou
Rational Exchange Levente Buttyán and Jean-Pierre Hubaux Swiss Federal Institute of Technology – Lausanne Laboratory for Computer Communications and Applications.
1 Energy Efficiency of MIMO Transmissions in Wireless Sensor Networks with Diversity and Multiplexing Gains Wenyu Liu, Xiaohua (Edward) Li and Mo Chen.
College of Engineering Grid-based Coordinated Routing in Wireless Sensor Networks Uttara Sawant Major Advisor : Dr. Robert Akl Department of Computer Science.
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
An Energy-Aware Periodical Data Gathering Protocol Using Deterministic Clustering in Wireless Sensor Networks (WSN) Mohammad Rajiullah & Shigeru Shimamoto.
An Energy-Efficient Voting-Based Clustering Algorithm for Sensor Networks Min Qin and Roger Zimmermann Computer Science Department, Integrated Media Systems.
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.
On Non-Cooperative Location Privacy: A Game-theoreticAnalysis
Probability Refresher COMP5416 Advanced Network Technologies.
S& EDG: Scalable and Efficient Data Gathering Routing Protocol for Underwater Wireless Sensor Networks 1 Prepared by: Naveed Ilyas MS(EE), CIIT, Islamabad,
Non-Cooperative Behavior in Wireless Networks Márk Félegyházi (EPFL) PhD. public defense July 9, 2007.
KAIS T Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua MobiCom ‘05 Presentation by.
1 Multi-radio Channel Allocation in Competitive Wireless Networks Mark Felegyhazi, Mario Čagalj, Jean-Pierre Hubaux EPFL, Switzerland IBC’06, Lisbon, Portugal.
Throughput-Oriented MAC for Mobile Ad Hoc Networks with Variable Packet Sizes Fan Wang, Ossama Younis, and Marwan Krunz Department of Electrical & Computer.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
Centralized Transmission Power Scheduling in Wireless Sensor Networks Qin Wang Computer Depart., U. of Science & Technology Beijing Edward Y. Hua Wireless.
“Group consumption, free-riding, & informal reciprocity agreements”. Why do people use informal reciprocity agreements? Most analysis answers this question.
Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime Z. Maria Wang, Emanuel Melachrinoudis Department of Mechanical and Industrial Engineering.
Structure-Free Data Aggregation in Sensor Networks.
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
Evolution of Cooperation in Mobile Ad Hoc Networks Jeff Hudack (working with some Italian guy)
How to minimize energy consumption of Sensors in WSN Dileep Kumar HMCL 30 th Jan, 2015.
Routing Protocols to Maximize Battery Efficiency
Xiaobing Wu, Guihai Chen and Sajal K. Das
Hybrid-ARQ Based Intra-Cluster Geographic Relaying
Edinburgh Napier University
Presentation transcript:

1 Cooperation in Multi-Domain Sensor Networks Márk Félegyházi Levente Buttyán Jean-Pierre Hubaux {mark.felegyhazi, EPFL, Switzerland TERMINODES Project (NCCR-MICS) Budapest University of Technology and Economics, Hungary PerSeNS

2 Multi-domain sensor networks  co-located sensor networks  sensors are compatible  sinks can be either separate or common

3 Non-cooperative game  assumption: paths to the sink exist in both own and common network  the game unfolds in discrete time steps t  lifetime of sensor networks: until the first sensor dies  finite routing game: ends when one subnetwork dies

4 Benefits of cooperation  operators as players  two decisions:  ask (or not) the other player to cooperate  cooperate (or not) if asked  reduce complexity: strategy is pre-defined in the sensors

5 Strategies  success of data gathering: if  moves:  strategy: where: is the gathered number of measurements is the requirement for success  pre-programmed strategy in the sensors  feedback in one bit from the sink (successful or not) DD - don't ask/drop DF - don't ask/forward AD - ask/drop AF - ask/forward successXX next moveXX

6 Utilities  gain, g i (t): if the step was successful, then g i (t) = G i otherwise g i (t) = 0  cost, c i (t): sum of the transmission cost of all sensors (c unit ~ d α )  payoff,  utility: where: T is the lifetime of the sensor network

7 Simulation parameters Number of sensors per domain (25) Distribution of the sensorsuniformly random Area size40 x 20 m Reception energy (R)100 units Transmission energy (Tr)Tr ~ d α units Path loss exponent2 – 5 (4) Success requirement (SR i )1.0 (all sensors have to report) Position of the sinks (separate sinks)[10,10] and [30,10] Position of the sinks (common sinks)[20,10] Route selectionMinimum energy path

8 Best strategies  Three types:  Cooperative: (AF, AF)  Defective: (DD, DD)  Other: for example (AF, DD)

9 Simulations: Separate sinks

10 Simulations: Common sinks

11 Simulations: Path loss exponent

12 Conclusion Cooperation is beneficial, because it can increase the lifetime of sensor networks.  For separate sinks, operators can use the sinks of each other  For common sinks, cooperation is beneficial:  if sensor networks are sparse – overhearing of packets is less significant  if path loss is high - transmission is expensive