Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Broadcast routing based on new link cost model for ad-hoc networks
Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
BREAC: broadcast routing based on Edmonds algorithm for ad hoc networks with asymmetric cost model
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
| Hi-index | 0.00 |
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 this paper, we propose a collision-free broadcast scheduling algorithm to minimize the broadcast latency for a given network with the number of transmissions equal to cardinality of MCDS.