Connected Dominating Set Based Hybrid Routing Algorithm in Ad Hoc Networks with Obstacles

@article{Di2006ConnectedDS,
  title={Connected Dominating Set Based Hybrid Routing Algorithm in Ad Hoc Networks with Obstacles},
  author={Wu Di and Qu Yan and Tong Ning},
  journal={2006 IEEE International Conference on Communications},
  year={2006},
  volume={9},
  pages={4008-4013}
}
Routing based on a connected dominating set (CDS) is a promising approach in wireless ad hoc networks. Wu and Li proposed a distributed approximation algorithm for calculating CDS in a given connected graph. However, this algorithm is difficult when there are obstacles in the network topology. Obstacle hybrid routing algorithm (OHRA), presented here, addresses these issues. OHRA consists of mobility model, CDS election and hybrid routing. In obstacle mobility model, we introduce STANDBY nodes… CONTINUE READING

Citations

Publications citing this paper.

References

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

Dominating set based routing

  • A. Schumacher
  • Algorithms for ad hoc networking, 2003, pp. 1-4.
  • 2003
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
1 Excerpt

Similar Papers

Loading similar papers…