Minimizing broadcast latency in ad hoc wireless networks

Network wide broadcasting in ad-hoc wireless networks provides important control and route establishment functionality for a number of unicast and multicast protocols. In broadcasting, a source node sends the same message to all the nodes in the network. Broadcasting based on Minimum Connected Dominating Set (MCDS) is a frequently used approach to reduce the communication overhead. A set of connected nodes in a graph is a connected dominating set, if all the nodes in the graph are either in the set or neighbors of nodes in the set. MCDS is such a set with minimum cardinality. Several broadcasting algorithms in adhoc wireless networks based on neighborhood information use MCDSs. This approach minimizes the total number of transmissions in broadcasting process but it does not guarantee minimum broadcast latency. Minimum latency broadcast is NPhard for ad-hoc wireless network [1]. A proper collision-free broadcast scheduling among nodes in MCDS will minimize the broadcast latency. In thi...

• Type: Conference
• Year: 2007
• Where: ACMSE
• Authors: Shankar M. Banik, Sridhar Radhakrishnan
• Keywords: ACMSE 2007, Broadcast Latency, Connected Dominating Set, Minimum Connected Dominating, Theoretical Computer Science