Broadcast has been a fundamental mechanism to lower down delivery time latency in wireless ad hoc networks. The intrinsic broadcasting nature of radio communications can either speed up the communications by transmitting the message to all neighbors or slow down the communications because of the conflicts with other transmissions. Thus, it is crucial to devise the conflict-free broadcast schedule, especially in mobile ad hoc networks on 3D space. Additionally, as most real networks are dynamic, it is also challenging to develop online algorithms for the broadcast scheduling with a good performance.

Objectives:

• Devise constant approximation algorithms for broadcast scheduling in mobile ad hoc networks on 3D space
• Design a practical model to cover all interference and mobility scenarios in dynamic networks
• Devise online scheduling algorithms for broadcast in dynamic networks