Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links

  title={Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links},
  author={Jie Wu and Hailan Li},
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wireless network with unidirectional links. This approach is based on the concept of dominating set in graph theory. A hostv is called a dominating neighbor (absorbant neighbor) of another host u if there is a directed edge (v; u) ((u; v)). A subset of vertices is dominating and absorbant if every vertex not in the subset… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 36 extracted citations


Publications referenced by this paper.
Showing 1-10 of 13 references

A review of current routing protocols for ad hoc mobile wireless networks

  • E. M. Royer, C. K. Toh
  • IEEE Personal Communications . Apr
  • 1999
1 Excerpt

On calculating connected dominating set for efficient routing in ad hoc wireless networks

  • J. Wu, H. Li
  • Proc. of the 3rd Int’l Workshop on Discrete…
  • 1999
2 Excerpts

Fundamentals of Domination in Graphs

  • T. W. Haynes, S. T. Hedetniemi, P. J. Slater
  • Marcel Dekker, Inc.
  • 1998
2 Excerpts

The dynamic source routing protocol for mobile ad hoc networks. IETF, Internet Draft, draft-ietf-manet-dsr- 00.txt, March 1998

  • J. Broch, D. Johnson, D. Maltz
  • 1998
1 Excerpt

and V

  • R. Sivakumar, B. Das
  • Bharghavan. An improved spine-based…
  • 1998
1 Excerpt

Perkins.Mobile IP: Design Principles and Practices

  • C E.
  • Addison Wesley,
  • 1997
1 Excerpt

Mobile Computing

  • T. Imielinski, H. Korth
  • Kluwer Academic Publishers
  • 1996
1 Excerpt

A clusterbased approach for routing in ad hoc networks

  • M. Chatterjee, N. H. Vaidya, D. K. Pradhan
  • Proc . of the Second USENIX Symp . on Mobile and…
  • 1995

Similar Papers

Loading similar papers…