1 / 5

Maximizing Network Lifetime of Broadcast/Multicast in WANETs

Maximizing Network Lifetime of Broadcast/Multicast in WANETs. Guofeng Deng. Network Lifetime of Broadcast/Multicast. Definition: Network lifetime of broadcast/multicast is a period of time that all the nodes/all the destination nodes can receive packets.

branden-fitzpatrick
Download Presentation

Maximizing Network Lifetime of Broadcast/Multicast in WANETs

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 Network Lifetime of Broadcast/Multicast in WANETs Guofeng Deng

  2. Network Lifetime of Broadcast/Multicast • Definition: Network lifetime of broadcast/multicast is a period of time that all the nodes/all the destination nodes can receive packets. • Broadcast/Multicast trees: a tree that is rooted at the source node and spans all the destination nodes. Transmission power control

  3. Energy Consumption Model • Zero-Receiving Power (NRP) • Designated (Constant) Receiving Power (DRP) • Transmitter-Receiver Power Trade-off (TREPT): receiving power is inversely proportional to transmission power • Overhearing Cost (OC): non-designated receivers overhears nearby transmissions

  4. Proposed Solutions • Static solutions • A greedy optimal solution for broadcast (ZRP & DRP) • A greedy + pruning optimal solution for multicast (ZRP & DRP) • A binary search optimal solution when the broadcast tree is given (TREPT) • The problem under the OC model is NP-hard. • Heuristic solutions under the OC model • Dynamic solutions • This version of the problem under the DRP model is known to be NP-hard. • A heuristic algorithm with adaptive update intervals for broadcast and multicast (CRP)

  5. Research Topics • Maximizing network lifetime of multicast/broadcast under various energy consumption model • Maximizing network lifetime of convergecasting • Battery model • Energy harvesting • Distributed solutions

More Related