Distributed routing schemes for ad hoc networks using d-SPR sets

Microprocessors and Microsystems

Volumn 28, Issue 8 SPEC. ISS., 2004, Pages 427-437

  Dhar, Subhankar ^a   Rieck, Michael Q ^b   Pai, Sukesh ^c   Kim, Eun Jik ^a  

^a SAN JOSE STATE UNIVERSITY   (United States)

^b DRAKE UNIVERSITY   (United States)

^c MICROSOFT   (United States)

Author keywords

Ad hoc wireless networks; Dominating set; Routing algorithm; Set covering problem; Shortest path routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BENCHMARKING; COMPUTATIONAL COMPLEXITY; FUNCTIONS; ITERATIVE METHODS; MOBILE TELECOMMUNICATION SYSTEMS; PROBABILISTIC LOGICS; PROBLEM SOLVING; ROUTERS;

AD HOC WIRELESS NETWORKS; DOMINATING SET; ROUTING ALGORITHM; SET COVERING PROBLEM; SHORTEST PATH ROUTING;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 4444245153     PISSN: 01419331     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.micpro.2004.03.016     Document Type: Article

References (18)

1. Alon N., Spencer J. The Probabilistic Method. 2000;Wiley, New York.
2. K.M. Alzoubi, P. Wan, O. Frieder, New distributed algorithm for connected dominating set in wireless ad hoc networks, Proceedings of the 35th Hawaii International Conference on System Sciences, Hawaii, 2002.
3. A.D. Amis, R. Prakash, T.H.P. Vuong, D.T. Huynh, Max-min D-cluster formation inwireless ad hoc networks, Proceedings of IEEE INFOCOM'2000, Tel Aviv, March 2000.
4. Y.P. Chen, A.L. Liestman, Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks, Third ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'02), Lausanne, Switzerland, June 2002, pp. 157-164.
5. Das B., Bharghavan V. Routing in ad-hoc networks using minimum connected dominating sets. IEEE International Conference on Communications. ICC'97:(1):1997;376-380.
6. Guha S., Khuller S. Approximation algorithms for connected dominating sets. Algorithmica. 1998;20.
7. Johnson D. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences. 9:1974;256-278.
8. Dhar S., Rieck M., Pai S. On shortest path routing schemes for wireless ad-hoc networks. Proceedings of the 10th International Conference on High Performance Computing (HiPC'03), Lecture Notes in Computer Science. 2003;Springer, Berlin.
9. Dhar S., Rieck M.Q., Pai S., Kim E.J. Various distributed shortest path routing strategies for wireless ad hoc networks. Proceedings of the Fifth International Workshop on Distributed Computing (IWDC 2003), Lecture Notes in Computer Science. 2003;Springer, Berlin.
10. Kutten S., Peleg D. Fast distributed construction of small k-dominating sets and applications. Journal of Algorithms. 28:(1):1998;40-66.
11. L. Jia, R Rajaraman, T Suel, An efficient distributed algorithm for constructing small dominating sets. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, August 2001, pp. 33-42.
12. Lovász L. On the ratio of optimal integral and fractional covers. Discrete Mathematics. 13:1975;383-390.
13. B. Liang, Z.J. Haas, Virtual backbone generation and maintenance in ad hoc network mobility management. Proceedings of the 19th Annual Joint Conference IEEE Computer and Communication Society INFOCOM, vol. 3, 2000, pp. 1293-1302.
14. S. Rampone, Probability-driven greedy algorithms for set cover. VIII SIGEF Congress New Logics for the New Economy Naples, Italy, September, 2001.
15. M.Q. Rieck, S. Pai, S. Dhar, Distributed routing algorithms for wireless ad hoc networks using d-hop connected d-hop dominating sets. Proceedings of the Sixth International Conference on High Performance Computing: Asia Pacific, Bangalore, December 16-19, 2002.
16. J. Wu, F. Dai, Broadcasting in ad hoc networks based on self-pruning, IEEE INFOCOM, April 2003.
17. Wu J. Extended dominationg-set-based routing in ad hoc wireless networks with unidirectional links. IEEE Transactions on Parallel and Distributed Systems. 13:(9):2002.
18. Wu J., Li H. A dominating-set-based routing scheme in ad hoc wireless networks. Special Issue on Wireless Networks in the Telecommunication Systems Journal. 3:2001;63-84.