Energy Efficient Broadcast in WANETs under an Overhearing Cost Model Guofeng Deng IMPACT Lab at ASU.

Slides:



Advertisements
Similar presentations
The Primal-Dual Method: Steiner Forest TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A AA A A A AA A A.
Advertisements

Network Design with Degree Constraints Guy Kortsarz Joint work with Rohit Khandekar and Zeev Nutov.
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
Minimum Spanning Trees
Combinatorial Algorithms
CS774. Markov Random Field : Theory and Application Lecture 17 Kyomin Jung KAIST Nov
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 21st Lecture Christian Schindelhauer.
1 Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree Department of Computer Science and Information Engineering National.
CS Dept, City Univ.1 Low Latency Broadcast in Multi-Rate Wireless Mesh Networks LUO Hongbo.
Optimal Sleep-Wakeup Algorithms for Barriers of Wireless Sensors S. Kumar, T. Lai, M. Posner and P. Sinha, BROADNETS ’ 2007.
E. AlthausMax-Plank-Institut fur Informatik G. CalinescuIllinois Institute of Technology I.I. MandoiuUC San Diego S. Prasad Georgia State University N.
1 Delay-efficient Data Gathering in Sensor Networks Bin Tang, Xianjin Zhu and Deng Pan.
1 Internet Networking Spring 2006 Tutorial 6 Network Cost of Minimum Spanning Tree.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
Symmetric Connectivity With Minimum Power Consumption in Radio Networks G. Calinescu (IL-IT) I.I. Mandoiu (UCSD) A. Zelikovsky (GSU)
Speaker: Li-Sheng Chen 1 Jan 2, 2012 EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing Protocol for Wireless Ad Hoc Networks.
Energy efficient multicast routing in ad hoc wireless networks Summer.
[1][1][1][1] Lecture 2-3: Coping with NP-Hardness of Optimization Problems in Practice May 26 + June 1, Introduction to Algorithmic Wireless.
1 Internet Networking Spring 2004 Tutorial 6 Network Cost of Minimum Spanning Tree.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 22nd Lecture Christian Schindelhauer.
The community-search problem and how to plan a successful cocktail party Mauro SozioAris Gionis Max Planck Institute, Germany Yahoo! Research, Barcelona.
1 Internet Networking Spring 2002 Tutorial 6 Network Cost of Minimum Spanning Tree.
Steiner trees Algorithms and Networks. Steiner Trees2 Today Steiner trees: what and why? NP-completeness Approximation algorithms Preprocessing.
Lecture 8. Why do we need residual networks? Residual networks allow one to reverse flows if necessary. If we have taken a bad path then residual networks.
Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Outline Introduction The hardness result The approximation algorithm.
1 Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Infocom /12/20.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.
Efficient Gathering of Correlated Data in Sensor Networks
Network Aware Resource Allocation in Distributed Clouds.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
On Maximizing Network Lifetime of Broadcast in WANETs under an Overhearing Cost Model Guofeng Deng, Sandeep K.S. Gupta IMPACT Lab (
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
G-REMiT: An Algorithm for Building Energy Efficient Multicast Trees in Wireless Ad Hoc Networks Bin Wang and Sandeep K. S. Gupta NCA’03 speaker : Chi-Chih.
1 Steiner Tree Algorithms and Networks 2014/2015 Hans L. Bodlaender Johan M. M. van Rooij.
On Non-Disjoint Dominating Sets for the Lifetime of Wireless Sensor Networks Akshaye Dhawan.
Connected Dominating Sets. Motivation for Constructing CDS.
Maximizing the lifetime of WSN using VBS Yaxiong Zhao and Jie Wu Computer and Information Sciences Temple University.
4 Introduction Broadcasting Tree and Coloring System Model and Problem Definition Broadcast Scheduling Simulation 6 Conclusion and Future Work.
Linear Programming & its Applications to Wireless Networks Guofeng Deng IMPACT Lab, Arizona State University.
LOCALIZED MINIMUM - ENERGY BROADCASTING IN AD - HOC NETWORKS Paper By : Julien Cartigny, David Simplot, And Ivan Stojmenovic Instructor : Dr Yingshu Li.
1 Latency-Bounded Minimum Influential Node Selection in Social Networks Incheol Shin
Two Connected Dominating Set Algorithms for Wireless Sensor Networks Overview Najla Al-Nabhan* ♦ Bowu Zhang** ♦ Mznah Al-Rodhaan* ♦ Abdullah Al-Dhelaan*
The full Steiner tree problem Theoretical Computer Science 306 (2003) C. L. Lu, C. Y. Tang, R. C. T. Lee Reporter: Cheng-Chung Li 2004/06/28.
Distributed Data Gathering Scheduling in Multi-hop Wireless Sensor Networks for Improved Lifetime Subhasis Bhattacharjee and Nabanita Das International.
Vasilis Syrgkanis Cornell University
Self-stabilizing energy-efficient multicast for MANETs.
Maximal Independent Set and Connected Dominating Set Xiaofeng Gao Research Group on Mobile Computing and Wireless Networking Univ. of Texas at Dallas.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
E. AlthausMax-Plank-Institut fur Informatik G. CalinescuIllinois Institute of Technology I.I. MandoiuUC San Diego S. Prasad Georgia State University N.
Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.
Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.
Implementation and Analysis of an Overhearing Cost Model based Broadcast Method for Wireless Sensor Networks Newton Alex Venkatraman Jayaraman.
Does Topology Control Reduce Interference?
Topology Control –power control
Outline Introduction Network Model and Problem Formulation
CS200: Algorithm Analysis
Research: algorithmic solutions for networking
Robustness of wireless ad hoc network topologies
Connected Dominating Sets
Robustness of wireless ad hoc network topologies
Power Efficient Range Assignment in Ad-hoc Wireless Networks
Introduction Wireless Ad-Hoc Network
Maximizing Broadcast Tree Lifetime in Wireless Ad Hoc Networks
Lecture 28 Approximation of Set Cover
Presentation transcript:

Energy Efficient Broadcast in WANETs under an Overhearing Cost Model Guofeng Deng IMPACT Lab at ASU

Outline Introduction Related work Network model Minimum energy broadcast (MinEB) Maximum lifetime broadcast (MaxLB)

Introduction Motivation  Broadcast is an essential networking primitive  Wireless broadcast medium  Reception energy consumption matters, e.g., in TelosB, reception power is as much as peak transmission power  Overhearing cost charged at each non-destination node, unless Fine-grained network synchronization, switching on/off related/unrelated nearby receivers Contributions include approximation algorithms to the following problems:  Minimum energy broadcast tree based on directed Steiner tree problem (DST)  Maximum lifetime broadcast tree based on connected dominating neighbor problem (CDN)

Related Work Under simple reception energy cost model:  Maximum lifetime broadcast problem is simple  Minimum energy broadcast problem is NP-hard and well studied: connected dominating set (CDS) Minimum energy convergecast in WSN: optimum branching problem [Basu & Redi, IPSN’04] Minimum energy broadcast w/o transmission power control: connected exact cover (CEC) [Lee & Mans, VTC’06] Maximum lifetime broadcast: greedy heuristic [Deng & Gupta, ICDCN’06] Interference aware broadcast: somewhat related depending on definition of interference

Network Model Transmission power  Identical  Adjustable in discrete levels Reception power  Identical  Non-identical Wireless medium  Symmetric  Asymmetric Battery capacity  Identical  Non-identical One-to-many traffic  Broadcast  Multicast Optimization problems  Unit vs weighted cost (UC/WC)  Undirected vs directed graph (UG/DG)  Steiner vs spanning subgraph MinEBUCWC UGLee’06 DG MaxLBUCWC UG? DG?? Approximate solutions

Minimum Energy Broadcast MinEB: In a WANET, find a spanning tree rooted at the given source node such that the overall power consumption (OPC) is minimized. An example: Let node s be the source and energy consumed for receiving each packet is 5 µJ for each node equally. OPC(T1) = (8+0) + (10) + (7+5) + 5 = 35 OPC(T2) = (9) + (5) + (5) + (5) = 24

Minimum Energy Broadcast (2) Convert the MinEB problem to the minimum directed Steiner tree (DST) problem  In the widget G v =(V v,E v ) of a node v, a square v r corresponds the receiving state and a hexagon v t i corresponds to the state that the node is transmitting at its i th power level. An arch (v r,v t i ) is weighted as the sum of the transmission power at the i th level and the corresponding overhearing cost in the neighborhood.  The inter-widget arch set E int : the is an arch (u t i,v r ) if v can receive the packet transmitted by u at its i th power level. For each arch in E int, the weight is 0.  A directed graph G=( U V v, U E v U E int ) that has n(p+1) vertices and up to n 2 p arches, where n is the number of nodes in the original network and p is the number of power levels of eahc node. The best known DST approximation ratio is O(k ε ) for any fixed ε>0, where k is the number of terminals [Charikar et al., ACM-SIAM’98] This solution covers the cases of weighted cost and directed graph as well as multicast traffic.

Maximum Lifetime Broadcast Discuss unit cost in undirected graph, the transmission power is ignored for now:  Transmission power control can make it fairly small compared to reception power  Will be consider later MaxLB is essentially finding a subnetwork, in which the source node is connected to all the other nodes and the maximum number of transmitting neighbors of a node is minimized. Trivial greedy algorithm may have O(n) performance [Deng & Gupta, ICDCN’06] Convert the MaxLB problem to an optimization problem in a graph, which is the minimum connected dominating neighbor problem (CDN)

CDN Problem: In a graph G=(V,E), find a connected dominating set D such that max{δ(v)} is minimized, where δ(v) is the dominating degree defined as the number of neighbor nodes of v that belong to D. To convert MinLB to CDN, add a dummy node and connect it to the source node.

CDN (2) CDN is NP-hard (reduce set cover to CDN) Related problems: connected dominating set (CDS), minimum degree spanning tree (MDST), connected exact cover (CEC)

CDN (3): Future work Algorithm: update look-ahead greedy algorithm [Guha & Khuller, Algorithmica’98] Performance guarantee proof Extend to weighted cost and directed graph Extend to include transmission power