An Improved Algorithm on Calculating the Minimum Dominating Connected Set for Efficient Routing in Ad hoc Wireless Network

Abstract

This paper presents a new approach to compute the MCDS (Minimum Connected Dominating Set) for Mobile Ad hoc Network (MANET). The problem of finding a MCDS is NP-hard. This approach is based on linear programming theory. In first step, we formulate the problem to find the minimum dominating set as an integer linear programming problem. Next, we add… (More)

Topics

4 Figures and Tables

Cite this paper

@inproceedings{Mnif2004AnIA, title={An Improved Algorithm on Calculating the Minimum Dominating Connected Set for Efficient Routing in Ad hoc Wireless Network}, author={Kais Mnif and Michel Kadoch}, year={2004} }