1 / 8

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

Maximizing Lifetime of Ad Hoc Networks/WSNs Using Dynamic Broadcast Scheme. Guofeng Deng. Background. Two features of wireless networks: Wireless advantage Transmission range adjustment Energy constraint Definition of lifetime: Number of packets all nodes can get from source.

mark-pace
Download Presentation

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

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

  2. Background • Two features of wireless networks: • Wireless advantage • Transmission range adjustment • Energy constraint Definition of lifetime: Number of packets all nodes can get from source

  3. Related Work • Power-efficient broadcasting [1-11] (minimum total energy consumption) • Energy-efficient broadcasting [12-18] (minimum bottleneck energy consumption)

  4. Example (b) 10000/1.2 = 8333 (c) After 7500 with b, remaining: Node 1: 10000-7500*1.1 = 1750 Node 2: 10000-7500*1.2 = 1000 Node 3: 10000-7500*1.0 = 2500 Node 4: 10000-7500*0 = 10000 Lifetime of (c): Node 1: 1750/1.3 = 1346 Node 2: 1000/0 = infinite Node 3: 2500/0 = infinite Node 4: 10000/1.0 = 10000 Total: 7500+1346 = 8846

  5. System Model • One source per broadcast tree • All broadcast task • Adjustable Transmission Power • Pre-calculate scheme • No interferences and node failures are considered

  6. Research Problems • If one broadcast tree is given, could another broadcast tree be found such that the combination of these two trees has longer lifetime? • Based on previous problem, how to combine them to achieve maximum lifetime? • How to choose certain amount of trees, for example 2, whose combination has maximum lifetime through topology control?

  7. References • Power-Efficient Algorithms and Protocols • R.Ramanathan, R.Rosales-Hain, Topology Control of Multihop Wireless Networks using Transmit Power Adjustment, IEEE INFOCOM 2000 • Y.C.Tsend, Y.N.Chang, B.H.Tzeng, Energy-Efficient Topology control for Wireless Ad Hoc Sensor Networks, ICPADS 2002 • M.Cagalj, J.P.Hubaux, C.Enz, Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues, MOBICOM’02 • J.E.Wieselthier, G.D.Nguyen, A.Ephremides, On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks, IEEE INFOCOM 2000 • J.E.Wieselthier, G.D.Nguyen, A.Ephremides, Distributed Algorithms for Energy-Efficient Broadcasting in Ad Hoc Networks, MILCOM 2002 • W.T.Chen, N.F.Huang, The Strongly Connecting Problem on Multihop Packet Radio Networks, Communications, IEEE Transactions on, Volume: 37, Issue: 3, March 1989 • R.G.Gallager, P.A.Humblet, P.M Spira, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Transactions on Programming Languages and Systems, Vol.5, No.1, January 1983, Pages 66-77 • A.E.F.Clementi, P.Crescenzi, P.Penna, G.Rossi, P.Vocca, On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs, Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science, 2001 • P.J.Wan, G.Calinescu, X.Y.Li, O.Frieder, Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks, IEEE INFOCOM 2001

  8. Reference (cont’d) • W.Liang, Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks, MOBIHOC’02, June 9-11, EPFL Lausanne, Switzerland • S.Guo, O.Yang, Minimum-Energy Broadcast Routing in Wireless Multi-Hop Networks, Performance, Computing, and Communications Conference, 2003 • Energy-Efficient Algorithms and Protocols • P.Floreen, P.Kaski, J.Kohonen, P.Orponen, Multicast Time Maximization in Energy Constrained Wireless Networks, DIALM-POMC’03, September 19, 2003 • B.Wang, S.K.S. Gupta, On Maximizing Lifetime of Multicast Trees in Wireless Ad Hoc Networks, ICPP’03 • R.Wattenhofer, L.Li, P.Bahl, Y.M. Wang, Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks, IEEE INFOCOM 2001 • I.Papadimitriou, L.Georgiadis, Energy-aware Broadcasting in Wireless Networks, Wiopt'03 Conference, Sophia-Antipolis, France, March 3-6, 2003 • J.Liu, B.Li, Distributed Topology Control in Wireless Sensor Networks With Asymmetric Links, IEEE GLOBECOM 2003 • E.L.Lloyd, R.Liu, M.V.Marathe, Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks, MOBIHOC’02, June 9-11, 2002 EPFL Lausanne, Switzerland • I.Kang, R.Poovendran, Maximizing Static Network Lifetime of Wireless Broadcast Adhoc Networks, Communications, 2003. ICC '03

More Related