A New Heuristic Approach for Minimum Connected Dominating Set In Adhoc Wireless Networks

@article{Rai2009ANH,
  title={A New Heuristic Approach for Minimum Connected Dominating Set In Adhoc Wireless Networks},
  author={Manish Rai and Naveen Garg and Shikha Verma and Shashikala Tapaswi},
  journal={2009 IEEE International Advance Computing Conference},
  year={2009},
  pages={284-289}
}
The Connected Dominating Set (CDS) of a graph acts as a virtual backbone in ad-hoc wireless network. In this paper, a simple and efficient algorithm is proposed for the determination of CDS in a graph. The algorithm starts by finding a root node in the graph; a priority queue is maintained centrally to decide whether an element would be a part of CDS. This concept is extended to distributed version of the algorithm where each dominated node maintains a priority queue and acts as dominator for… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Ad Hoc Mobile Wireless Networks-Protocols and Systems

C. K. Toh
2002

Frieder Distributed heuristics for connected dominating set in wireless ad hoc networks

P.-J. Wan K. M. Alzoubi
IEEE V . CONCLUSION ComSoc / KICS Journal on Communication Networks • 1979

Similar Papers

Loading similar papers…