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.

Slides:

Advertisements

Similar presentations

Energy-Efficient Distributed Algorithms for Ad hoc Wireless Networks Gopal Pandurangan Department of Computer Science Purdue University.

Advertisements

Multicasting in Mobile Ad hoc Networks By XIE Jiawei.

Multicasting in Mobile Ad Hoc Networks Ravindra Vaishampayan Department of Computer Science University of California Santa Cruz, CA 95064, U.S.A. Advisor:

Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.

Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.

Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.

1 Crosslayer Design for Distributed MAC and Network Coding in Wireless Ad Hoc Networks Yalin E. Sagduyu Anthony Ephremides University of Maryland at College.

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.

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.

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.

1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.

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.

WiOpt’04: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks March 24-26, 2004, University of Cambridge, UK Session 2 : Energy Management.

LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.

Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.

Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.

Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:

Efficient Multihop Broadcast for Wideband Systems Ivana Maric and Roy Yates.

1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)

LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.

Clustering in Mobile Ad hoc Networks. Why Clustering? –Cluster-based control structures provides more efficient use of resources for large dynamic networks.

A Framework for Energy- Saving Data Gathering Using Two-Phase Clustering in Wireless Sensor Networks Wook Chio, Prateek Shah, and Sajal K. Das Center for.

Convergecasting In Wireless Sensor Networks Master’s Thesis by Valliappan Annamalai Committee members Dr. Sandeep Gupta Dr. Arunabha Sen Dr. Hasan Cam.

SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.

Multicast Algorithms for Multi- Channel Wireless Mesh Networks Guokai Zeng, Bo Wang, Yong Ding, Li Xiao, Matt Mutka Department of Computer Science and.

IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.

Wireless Sensor Networks COE 499 Energy Aware Routing

On Maximizing Network Lifetime of Broadcast in WANETs under an Overhearing Cost Model Guofeng Deng, Sandeep K.S. Gupta IMPACT Lab (

Maximizing Lifetime of Ad Hoc Networks/WSNs Using Dynamic Broadcast Scheme Guofeng Deng.

1 Power-Aware Routing in Mobile Ad Hoc Networks S. Singh, M. Woo and C. S. Raghavendra Presented by: Shuoqi Li Oct. 24, 2002.

Bandwidth Constrained Energy Efficient Transmission Protocol in Wireless Sensor Networks Jain-Shing LIU and Chun-Hung Richard LIN,Nonmembers IEICE TRANS.

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.

A Power Saving MAC Protocol for Wireless Networks Technical Report July 2002 Eun-Sun Jung Texas A&M University, College Station Nitin H. Vaidya University.

Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan

Converge-Cast: On the Capacity and Delay Tradeoffs Xinbing Wang Luoyi Fu Xiaohua Tian Qiuyu Peng Xiaoying Gan Hui Yu Jing Liu Department of Electronic.

A Low-Latency and Energy-Efficient Algorithm for Convergecast in Wireless Sensor Networks Authors Sarma Upadhyayula, Valliappan Annamalai, Sandeep Gupta.

A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks Reporter: Yanlin Peng Wenrui Zhao, Mostafa Ammar, College of Computing,

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.

Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,

Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks Mobile Networks and Applications 6, ,2001 Author ： JEFFREY E. WIESELTHIER.

 Tree in Sensor Network Patrick Y.H. Cheung, and Nicholas F. Maxemchuk, Fellow, IEEE 3 rd New York Metro Area Networking Workshop (NYMAN 2003)

Ad Hoc Multicast Routing

LOCALIZED MINIMUM - ENERGY BROADCASTING IN AD - HOC NETWORKS Paper By : Julien Cartigny, David Simplot, And Ivan Stojmenovic Instructor : Dr Yingshu Li.

Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation Yanwei Wu, Member, IEEE, Xiang-Yang Li, Senior Member, IEEE, YunHao Liu, Senior.

A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.

Energy-Aware Data-Centric Routing in Microsensor Networks Azzedine Boukerche SITE, University of Ottawa, Canada Xiuzhen Cheng, Joseph Linus Dept. of Computer.

Distributed Data Gathering Scheduling in Multi-hop Wireless Sensor Networks for Improved Lifetime Subhasis Bhattacharjee and Nabanita Das International.

Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.

Self-stabilizing energy-efficient multicast for MANETs.

Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,

Saran Jenjaturong, Chalermek Intanagonwiwat Department of Computer Engineering Chulalongkorn University Bangkok, Thailand IEEE CROWNCOM 2008 acceptance.

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 Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)

On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks Jeffrey E. Wieselthier, Gam D. Nguyen, and Anthony Ephremides.

Oregon Graduate Institute1 Sensor and energy-efficient networking CSE 525: Advanced Networking Computer Science and Engineering Department Winter 2004.

-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.

Power-Aware Topology Control for Wireless Ad-Hoc Networks Wonseok Baek and C.-C. Jay Kuo Department of Electrical Engineering University of Southern California.

Energy-aware Self-stabilizing Multicasting for MANETs Tridib Mukherjee IMPACT Lab Arizona State University impact.asu.edu.

Net 435: Wireless sensor network (WSN)

Maximizing Broadcast Tree Lifetime in Wireless Ad Hoc Networks

Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks

Presentation transcript:

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 and Engineering Department Arizona State University Tempe, AZ, USA

S. K. S. Gupta, Arizona State Univ Outline Multicasting in Wireless Network Node Metric Problem Statement Current State of Art L-REMiT Algorithm Performance Results Conclusions

S. K. S. Gupta, Arizona State Univ Multicasting Allow one entity to send messages to multiple entities residing in a subset of the nodes in the network Why multi-destination delivery in a single message? –Transparency; Efficiency; Concurrency Applications –distributed database, distributed games, teleconferencing

S. K. S. Gupta, Arizona State Univ Why Multicasting is different in Wireless Networks? Wireless medium is broadcast medium (Wireless multicast Advantage) –One time local transmission can possibly reach all the neighbors

S. K. S. Gupta, Arizona State Univ Power control allows a node to determine who are its neighbors. More power used  –more interference –Reduces # simultaneous transmissions (thrput) –Consumes energy at a faster rate  node can die faster leading to disconnections. Why Multicasting is different in wireless network?

S. K. S. Gupta, Arizona State Univ Why Not Single-Hop Multicast? Single source multicast: reach a subset of nodes from a given source s –s increases its transmission range to such an extent that it can reach all the group members Increased interference and power wastage source may have limited transmission range

S. K. S. Gupta, Arizona State Univ Multi-hop Approach Multi-hop Solution  Problem of constructing multicast tree 1.What is a link? Depends on power level Using maximum transmission power results in too many links 2.link weight? 1. & 2.  Link-based view not appropriate! –Node-based view: construct tree with “minimum/maximum summation of node cost”

S. K. S. Gupta, Arizona State Univ Node Cost? Depends upon the optimization goals: –Minimizing total energy consumption [Gupta, Globcom2003] 1 2 3

S. K. S. Gupta, Arizona State Univ Lifetime Node Cost –Maximizing multicast tree’s lifetime (#packets transmitted before the first node dies) 1 2 3

S. K. S. Gupta, Arizona State Univ Node’s Multicast Lifetime Metric Node i’s multicast lifetime: maximum number of multicast packets that may be forwarded by the node i: T: source-based multicast tree R i : remaining battery energy of node i, E(T,i): forwarding energy cost of node i

S. K. S. Gupta, Arizona State Univ Node’s Forwarding Energy Cost Energy consumed (per bit) at node i in a Source-based Tree T where and are energy cost (per bit) of transmission processing and reception processing, is length of the link between node i and i’s farthest children.  is propagation loss exponent, K is a constant dependent upon the antenna.

S. K. S. Gupta, Arizona State Univ Lifetime of Multicast Tree The lifetime of a multicast tree T is the minimum lifetime of any node in T: The maximum lifetime multicast tree T * is: where T G is the set of all possible multicast trees for the multicast group G in a given graph o. Maximizing multicast tree lifetime  maximizing the lifetime of tree’s bottleneck node

S. K. S. Gupta, Arizona State Univ REMiT Approach Refinement-based- (Take an initial solution and make it better) ? –Needed anyways because of dynamic changes in the network Battery level interference Distributed? –Sensor networks may have millions of nodes –High overhead to obtain global knowledge

S. K. S. Gupta, Arizona State Univ Challenges to Distributed Tree Construction? NP-complete problem [Li, LCN2001], [Singh, PIMRC99], heuristic algorithm is needed How to distribute the computation?

S. K. S. Gupta, Arizona State Univ Refinement Operation: Change Increase the lifetime of the multicast tree by moving the farthest child (say node i) of bottleneck node x to another node (say node j)

S. K. S. Gupta, Arizona State Univ Refinement Criterion

S. K. S. Gupta, Arizona State Univ Oscillation & Disconnection Avoidance Lemma 1: Nodes j and x are the only nodes in the multicast tree whose multicast lifetime may be affected by Change i x,j Lemma 2: If j is not in the sub-tree of i, then the tree remains connected after Change i x,j.

S. K. S. Gupta, Arizona State Univ L-REMiT Algorithm Two phases –First Phase: Build a MST [Gallager, TPLS1983]. –Second Phase: 1.Bottleneck node election, say node x. 2.Identify the farthest child of node x, say node i. 3.Select the new parent for node i with the highest lifetime gain, say node j. If the highest lifetime is not positive, go to step 5. 4.Node i changes its parent from x to j, then go to Step 1. 5.Terminate L-REMiT algorithm.

S. K. S. Gupta, Arizona State Univ Example of L-REMiT Algorithm Initial MST 3 1)Bottleneck node election: node 2 2)Farthest child of node 2 is node 4. 3)Moving 4 to node 3 results in the the highest positive lifetime gain. 4)Node 4 changes its parent from node 2 to 3. 5)New bottleneck node election. Node 1 6)Farthest child of node 1 is node 3. 7)Moving 3 to node 2 results in the highest lifetime gain, however, gain is negative. 8)Terminate L-REMiT Tree

S. K. S. Gupta, Arizona State Univ Related Work: BIP/MIP –BIP/MIP [Wieselthier, CN2002]); Dist-BIP-A, Dist-BIP- G [Wieselthier, Milcom2002]. The node metric is : Limitations: Even  =1, C i is not node i’s lifetime metric. As  increases, it will choose those nodes with higher remaining battery level as the relay nodes, 0<  <2.

S. K. S. Gupta, Arizona State Univ Example of BIP/MIP Algorithm

S. K. S. Gupta, Arizona State Univ Related Work: Refinement –Refine a minimum spanning tree (MST) to conserve energy consumption EWMA, Dist-EWMA[Cagalij, Mobicom2002] i j k

S. K. S. Gupta, Arizona State Univ Performance Results

S. K. S. Gupta, Arizona State Univ Performance Results

S. K. S. Gupta, Arizona State Univ Performance Results

S. K. S. Gupta, Arizona State Univ Performance Results

S. K. S. Gupta, Arizona State Univ Conclusions L-REMiT is a distributed algorithm to extend the lifetime of source-based multicast tree. L-REMiT performs better than BIP/MIP, L-MIP, EWMA-Dist algorithms.

S. K. S. Gupta, Arizona State Univ Future Work Lifetime extension for group-shared multicast trees Other schemes for maximizing lifetime of multicast tree –Directional antenna –Scheduling sleep mode among the nodes

S. K. S. Gupta, Arizona State Univ Reference [1] J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, Resource management in energy-limited, bandwidth-limited, transceiver-limited wireless networks for session-based multicasting. Computer Networks, 39(2):113–131, [2] J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, Distributed algorithms for energy- efficient broadcasting in ad hoc networks, Proceedings of MilCom, Anaheim, CA, Oct [3] M. Cagalj, J.P. Hubaux, and C. Enz. Minimum-energy broadcast in All-wireless networks: NP-completeness and distribution issues. In Proceedings of ACM MobiCom 2002, pages 172 – 182, Atlanta, Georgia, September [4] F. Li and I. Nikolaidis. On minimum-energy broadcasting in all-wireless networks. In Proceedings of the 26th Annual IEEE Conference on Local Computer Networks (LCN 2001), pages 193–202, Tampa, Florida, November [5] R.G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum weight spanning trees. ACM Transactions on Programming Languages and Systems, 5(1):66– 77, January [6] B. Wang and S. K. S. Gupta. S-REMiT: An algorithm for enhancing energy-efficiency of multicast trees in wireless ad hoc networks. In Proceedings of IEEE GlobleCOM, San Francisco, CA, Dec [7] S. Singh, C. S. Raghavendra and J. Stepanek. Power-Aware Broadcasting in Mobile Ad Hoc Networks. In Proceedings of PIMRC, pages 22 – 31, Osaka, Japan, September, 1999.