1 Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree Department of Computer Science and Information Engineering National.

Slides:



Advertisements
Similar presentations
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Advertisements

Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.
1 K-clustering in Wireless Ad Hoc Networks Fernandess and Malkhi Hebrew University of Jerusalem Presented by: Ashish Deopura.
1 K-clustering in Wireless Ad Hoc Networks using local search Rachel Ben-Eliyahu-Zohary JCE and BGU Joint work with Ran Giladi (BGU) and Stuart Sheiber.
1 TCAM Razor: A Systematic Approach Towards Minimizing Packet Classifiers in TCAMs Department of Computer Science and Information Engineering National.
Coupling-Aware Length-Ratio- Matching Routing for Capacitor Arrays in Analog Integrated Circuits Kuan-Hsien Ho, Hung-Chih Ou, Yao-Wen Chang and Hui-Fang.
Minimum Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan
1 On Constructing k- Connected k-Dominating Set in Wireless Networks Department of Computer Science and Information Engineering National Cheng Kung University,
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 21st Lecture Christian Schindelhauer.
Graph & BFS.
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
CS Dept, City Univ.1 Low Latency Broadcast in Multi-Rate Wireless Mesh Networks LUO Hongbo.
1 Multicast Routing with Minimum Energy Cost in Ad hoc Wireless Networks Xiaohua Jia, Deying Li and Frankie Hung Dept of Computer Science, City Univ of.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
3 -1 Chapter 3 The Greedy Method 3 -2 The greedy method Suppose that a problem can be solved by a sequence of decisions. The greedy method has that each.
WiOpt’03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks March 3-5, 2003, INRIA Sophia-Antipolis, France Session : Energy Efficiency.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
© Honglei Miao: Presentation in Ad-Hoc Network course (19) Minimal CDMA Recoding Strategies in Power-Controlled Ad-Hoc Wireless Networks Honglei.
Topology Control and Mobility Management in Mobile Ad Hoc Networks Fei Dai and JIe Wu Department of Electrical and Computer Engineering North Dakota State.
Speaker: Li-Sheng Chen 1 Jan 2, 2012 EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing Protocol for Wireless Ad Hoc Networks.
WiOpt’04: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks March 24-26, 2004, University of Cambridge, UK Session 2 : Energy Management.
[1][1][1][1] Lecture 2-3: Coping with NP-Hardness of Optimization Problems in Practice May 26 + June 1, Introduction to Algorithmic Wireless.
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
Extending Network Lifetime for Precision-Constrained Data Aggregation in Wireless Sensor Networks Xueyan Tang School of Computer Engineering Nanyang Technological.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
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:
1 A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks Umesh Kumar, Himanshu Gupta and Samir R. Das Department of Computer.
1 The Orphan Problem in ZigBee- based Wireless Sensor Networks IEEE Trans. on Mobile Computing (also in MSWiM 2007) Meng-Shiuan Pan and Yu-Chee Tseng Department.
1 Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Infocom /12/20.
Special Topics on Algorithmic Aspects of Wireless Networking Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central.
A Topology-based ECO Routing Methodology for Mask Cost Minimization Po-Hsun Wu, Shang-Ya Bai, and Tsung-Yi Ho Department of Computer Science and Information.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
© The McGraw-Hill Companies, Inc., Chapter 3 The Greedy Method.
Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks Paper By: Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder Presenter: Ke Gao Instructor:
+ Mayukha Bairy Disk Intersection graphs and CDS as a backbone in wireless ad hoc networks.
SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.
David S. L. Wei Dept of Computer and Information Sciences Fordham University Bronx, New York Szu-Chi Wang and Sy-Yen Kuo Dept of Electrical Engineering.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Maximizing Lifetime of Ad Hoc Networks/WSNs Using Dynamic Broadcast Scheme Guofeng Deng.
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.
Design and Analysis of an MST-Based Topology Control Algorithm Ning Li, Jennifer C. Hou, and Lui Sha Department of Computer Science University of Illinois.
Minimal Spanning Tree Problems in What is a minimal spanning tree An MST is a tree (set of edges) that connects all nodes in a graph, using.
1/24 Introduction to Graphs. 2/24 Graph Definition Graph : consists of vertices and edges. Each edge must start and end at a vertex. Graph G = (V, E)
1 G-REMiT: An Algorithm for Building Energy Efficient Multicast Trees in Wireless Ad Hoc Networks Bin Wang and Sandeep K. S. Gupta Computer Science and.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks Mobile Networks and Applications 6, ,2001 Author : JEFFREY E. WIESELTHIER.
LOCALIZED MINIMUM - ENERGY BROADCASTING IN AD - HOC NETWORKS Paper By : Julien Cartigny, David Simplot, And Ivan Stojmenovic Instructor : Dr Yingshu Li.
S. K. S. Gupta, Arizona State Univ On Maximizing Lifetime of Multicast Trees in Wireless Ad hoc Networks Bin Wang and Sandeep K. S. Gupta Computer Science.
An Adaptive, High Performance MAC for Long-Distance Multihop Wireless Networks Sergiu Nedevschi *, Rabin K. Patra *, Sonesh Surana *, Sylvia Ratnasamy.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees IEEE ICDCSW, 2011 Pouya Ostovari Department of Computer and Information.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
Bin Wang, Arizona State Univ S-REMiT: A Distributed Algorithm for Source-based Energy Efficient Multicasting in Wireless Ad Hoc Networks Bin Wang and Sandeep.
Fundamentals of Computer Networks ECE 478/578
On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks Jeffrey E. Wieselthier, Gam D. Nguyen, and Anthony Ephremides.
Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.
Errol Lloyd Design and Analysis of Algorithms Approximation Algorithms for NP-complete Problems Bin Packing Networks.
Power-Aware Topology Control for Wireless Ad-Hoc Networks Wonseok Baek and C.-C. Jay Kuo Department of Electrical Engineering University of Southern California.
Xiaohua (Edward) Li and Juite Hwu
Graphs All tree structures are hierarchical. This means that each node can only have one parent node. Trees can be used to store data which has a definite.
Introduction Wireless Ad-Hoc Network
ADVISOR : Professor Yeong-Sung Lin STUDENT : Hung-Shi Wang
Minimum Spanning Trees
Maximizing Broadcast Tree Lifetime in Wireless Ad Hoc Networks
Presentation transcript:

1 Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree Department of Computer Science and Information Engineering National Cheng Kung University, Taiwan R.O.C. Authors: Ioannis Papadimitriou and Leomidas Georgiadis Publisher: Mobile Networks and Applications 11, 361–375, 2006 Present: Min-Yuan Tsai ( 蔡旻原 ) Date: October, 16, 2007

2 Outline 1. Introduction 2. Definitions and problem description 3. Broadcasting using a single broadcast tree 4. Numerical results 5. Conclusion

3 Introduction In this paper, the authors focus on the problem of energy-efficient broadcasting in wireless networks where omni-directional antennas are used and there is flexibility of power adjustment. Common solution depends on the source node that initiates the broadcast request. (Every time a node needs to broadcast some information to all other nodes in the network, the algorithm for the broadcast tree construction is executed for the specific source node.) Each node in the network has to keep track of n broadcast trees, one for each of the possible source nodes (n is the number of nodes in the network). large memory space

4 Introduction (cont.) The authors proposed minimum-energy broadcasting using a single broadcast tree(SBT) to simplified the above situation. Advantages of the proposed scheme General networks Independence of the source node – considerable simplification, scaling Approximation ratio close to best achievable bound in polynomial time

5 Outline 1. Introduction 2. Definitions and problem description 3. Broadcasting using a single broadcast tree 4. Numerical results 5. Conclusion

6 Model for Wireless Broadcasting Definition: G(N, L): connected undirected graph c l > 0: power needed for successful transmission over link l =(i, j) If node i transmits with power p, it can reach any node j for which c (i, j) ≤ p T s =(N, L Ts ): s-rooted directed spanning tree that induced by undirected tree T node s transmits with power

7 Model for Wireless Broadcasting (cont.) Example: T : {(A,B), (A,C), (B,D)} (undirected) T A and T D (directed) are induced by T, C & D are leaves node in T A, (D,B) is outgoing link of D in T D

8 The Minimum-Energy Broadcast Problem : total power consumed for broadcasting from source node s In general, for different source nodes, the trees that minimize the sum of node powers are different (each node has to keep track of |N| broadcast trees, one for every possible source) To simplify the above situation we have to “Find a single (undirected) spanning tree T to be used by all nodes for broadcasting, such that the sum of consumed node powers P(T s ) is minimized for any source node s”. Each node needs to store only a small set of links that belong to tree T Processing of broadcast information is minimal (scaling to larger networks)

9 The Minimum-Energy Broadcast Problem (cont.) Two open issues: If all broadcasts take place on the same tree, then Issue 1 : Certain broadcasts may need much more total power than others, depending on the source node (widely varying total power consumption for different source nodes). Issue 2 : If one attempts to find a tree for which the total powers consumed for broadcasting initiated by different source nodes are approximately the same, then, for a given source node, the resulting total power may be far away from the optimal.

10 Outline 1. Introduction 2. Definitions and problem description 3. Broadcasting using a single broadcast tree 4. Numerical results 5. Conclusion

11 Broadcasting using a single broadcast tree Addressing Issue 1 : We use the following Corollary. If the same spanning tree T is used for broadcasting by all nodes, then the total broadcast power consumption for source node s is at most twice the total broadcast power consumption for any other source node s ΄, P( T s ) ≤ 2P( T s΄ ). Addressing Issue 2 : We propose a polynomial time approximation algorithm for the construction of a single broadcast tree. For any source node s, the total power consumed for broadcasting using tree has an approximation ratio 2H(n-1) with respect to the optimal power. Approximation ratio close to the best achievable bound in polynomial time (n=|N| is the number of nodes in the network and H(n) is the harmonic function)

12 Broadcasting using a single broadcast tree (cont.) Single Broadcast Tree (SBT) algorithm: At each iteration, SBT maintains a forest of trees in the network, such that each node belongs to a forest tree. Initially, each node constitutes a forest tree. The forest is expanded by joining trees through nodes, so that the “incremental power consumed per joined tree” is minimal. This is achieved by examining the adjacent links of every node i in the network that terminate outside the tree to which node i belongs. The algorithm terminates when the forest consists of a single (undirected) spanning tree.

13 Broadcasting using a single broadcast tree (cont.) Example of SBT algorithm : Node i min is selected to be joined with the forest tress T F1 and T F2. Link l min joins tree T Fmin with T F1. Only one of the links (i min, m), (i min, n) must be selected to join tree T Fmin with T F2 to avoid the creation of cycle.

14 Broadcasting using a single broadcast tree (cont.) A minimum spanning tree (MST) of G is a spanning tree whose sum of link costs is minimal. For any source node s, the total power consumed for broadcasting using a minimum spanning tree, is at most Δ times the optimal power, where Δ is the maximum node degree in the network. For any source node s, the total power consumed for broadcasting using a single broadcast tree has an approximation ratio 2H(n-1) with respect to the optimal power where H(n) is the harmonic function. MST may be a good candidate for broadcasting in sparse networks.

15 Outline 1. Introduction 2. Definitions and problem description 3. Broadcasting using a single broadcast tree 4. Numerical results 5. Conclusion

16 Numerical results Algorithms compared: 1) Broadcast Incremental Power algorithm (“BIP”) 2) Single Broadcast Tree (“SBT”) 3) Minimum Spanning Tree (“MST”) Networks: 1) With a specified number of nodes (20,40,…,100) in a rectangular grid of 100×100 points (The power needed for successful transmission over link (i, j ) depends on the distance d(i,j) between the two nodes and it is given by c(i,j) = d a (i,j ), where a is the propagation loss exponent.) 2) “Special” nodes added to the grid – 3-dimensional network Performance metric: Average total broadcast power consumption

17 Numerical results (cont.) a = 2, complete networks a = 4, complete networks BIP determines a different broadcast tree for every possible source node, while SBT algorithm constructs a single tree used by all nodes for broadcasting. Average tree power of SBT is slightly larger than that of BIP. The difference in performance of the algorithms vanishes for larger values of a. The “penalty” of using longer links increases and all algorithms converge to MST.

18 Numerical results (cont.) The power of a link between the “special” node and any other node on the grid at distance d is f  d 2, where f is a factor 0 < f ≤ 1. There is a range of values of f for which SBT outperforms significantly BIP. SBT succeeds in selecting links of “special” node when they are more cost efficient. Ratio of avg. tree power of SBT to BIP, a = 2, 100-node sparse networks + 1 “special” node a = 2, 1 “special” node added to the sparse networks, factor f = 0.1

19 Numerical results SBT algorithm performs fairly well, compared to BIP algorithm, for networks represented by unit disk graphs, while using a single broadcast tree. There are interesting instances of general networks, for which SBT algorithm significantly outperforms BIP and MST. MST algorithm performs worse for most of the network instances considered. SBT algorithm presents a good compromise between simplicity and achieved performance.

20 Outline 1. Introduction 2. Definitions and problem description 3. Broadcasting using a single broadcast tree 4. Numerical results 5. Conclusion

21 Conclusion The main contribution of this paper is that we do not have to determine a different broadcast tree every time a source node initiates a broadcast request. Some further study: Network environments with high mobility and frequent topological changes. Energy-limited and resource-limited environment, Lifetime maximization. Dynamic power assignments