"Research is what I'm doing when I don't know what I'm doing. "-Wernher von Braun

"If you steal from one author it's plagiarism. If you steal from many it's research."- Wilson Mizner, Quoted in A. Johnston, The Legendary Mizners, Ch. 4.

 

List of Publications

• DBLP Computer Science Bibliography
• Google Scholar
• ResearchGate
• Microsoft Academic Search
• HEC PhD Approved Supervisor
• Academic Heritage

Publications

  Book

1. R. B. Muhammad, Network Algorithms: Applications of Steiner Tree and Voronoi Diagram, Lambert Publishers, Germany, 2013. ISBN: 978-3-6759-29168-5

Journal (Refereed)

25. R. B. Muhammad, Range Assignment Problem on the Steiner Tree Based Topology in Ad Hoc Wireless Networks, in Mobile Information Systems, Special Issue on Advances in Wireless Networks, Vol. 5, Number 1, 2009, IOS Press, pp. 53-64. PDF

24. R. B. Muhammad, A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks, Journal of Networks, Vol. 2, Issue 6, 2007, Academy Publishers, pp. 50-57. PDF

Proceedings (Refereed)

23. R. B. Muhammad, Time Delay Analysis for a Parallel Steiner tree Algorithm, in Proceedings of The 2008 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’08), July 14-17, 2008, Las Vegas, USA, pp. 320-326.

22. R. B. Muhammad, Topology Control Based on a Steiner Tree in Ad Hoc Wireless Networks, in Proceedings of The International Conference on Wireless Networks (ICWN’08), July 14-17, 2008, Las Vegas, USA, pp. 229-233

21. R. B. Muhammad, Execution Time Analysis of a Parallel Steiner Tree Algorithm on Server-Client Model of Computation, in Proceedings of 7th IEEE International Conference on Computer and Information Science (ICIS '08), May 14-16, 2008, Portland, Oregon, USA, pp. 415-420. FULL PAPER PDF

20. R. B. Muhammad, Transmitting Range Assignments using Steiner Tree in Ad Hoc Wireless Networks, in IEEE Proceedings of 5th International Conference on Information Technology: New Generations (ITNG'08), April 7-9, 2008, Las Vegas, USA, pp. 408-413. FULL PAPER PDF

19. R. B. Muhammad, A Parallel Steiner tree Construction on the Server-Client Model of Computation, in IEEE Proceedings of 5th International Conference on Information Technology: New Generations (ITNG'08), April 7-9, 2008, Las Vegas, USA, pp. 1281-1283. SHORT PAPER PDF

18. R. B. Muhammad, Range Assignment Approximation based on Steiner tree in Ad Hoc Wireless Networks, in Proceedings of 22nd IEEE International Conference on Advanced Information Networking and Applications  (AINA'08), March 25-28, 2008, Okinawa, Japan, pp. 100-105. PDF

17. R. B. Muhammad, A Parallel Computation of the Steiner Tree Algorithm on Server-Client Paradigm,  in Proceedings of the IEEE 22nd International Conference on Advanced Information Networking and Applications Workshops (AINAW'08), March 25-28, 2008, Okinawa, Japan, pp. 276-280. WORKSHOP PAPER PDF

16. R. B. Muhammad, Connectivity and Transmitting Range Assignments in Ad Hoc Wireless Networks, in Proceedings of The 2007 International Conference on Wireless Networks (ICWN'07), June 25-28, 2007, Las Vegas, USA, pp. 153-159.

15. R. B. Muhammad, A Geo-Routing Algorithm in Planar Graph for Ad Hoc Wireless Networks, in Proceedings of 21st IEEE International Conference on Advanced Information Networking and Applications Workshops (AINAW'07), May 21-23, 2007, Niagara Falls, Canada, pp. 685-689. WORKSHOP PAPER PDF

14. R. B. Muhammad, A Distributed Geometric Routing Algorithm for Ad hoc Wireless Networks, in IEEE Proceedings of 4th International Conference on Information Technology: New Generations (ITNG'07), April 2-4, 2007, Las Vegas, USA, pp. 961-963. SHORT PAPER PDF 

13. R. B. Muhammad, Distributed Construction of Planar Graph for Position-based Routing in Ad Hoc Wireless Networks, in Proceedings of The IEEE Southeast Conference (SoutheastCon 2007), March 22-25, 2007, Richmond, Virginia, USA, pp. 657-662. FULL PAPER PDF

12. R. B. Muhammad, Connectivity Setup using Steiner tree in Ad hoc Wireless Networks, in Proceedings of Eight Annual IEEE Wireless and Microwave Technology Conference (WAMICON 2006), December 4-5, 2006, Clear Water, Florida, USA, 5 pages, Full text on CD-ROM.

11. R. B. Muhammad, A Parallel Local Search Algorithm for Euclidean Steiner Tree Problem, in IEEE Proceedings of Seventh International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD 2006), June 19-20, 2006, Las Vegas, USA, pp. 157-164. FULL PAPER PDF

10. R. B. Muhammad, Distributed Steiner Tree Algorithm and its Application in Ad Hoc Wireless Networks, in Proceedings of The 2006 International Conference on Wireless Networks (ICWN'06), June 26-29, 2006, Las Vegas, USA, pp. 173-178.

9. R. B. Muhammad, A Theoretical Study of Parallel Voronoi Diagram, in Proceedings of The 2006 International Conference on Foundations of Computer Science (FCS'06), June 26-29, 2006, Las Vegas, USA, pp. 51-56. PDF

8. R. B. Muhammad, Parallel Greedy Adaptive Search Algorithm for Steiner Tree Problem, in Proceedings of The 2006 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2006), June 26-29, 2006, Las Vegas, USA, pp. 1062-1065.

7. R. B. Muhammad, Deterministic Energy Conserving Algorithms for Wireless Sensor Networks, in Proceedings of The 2006 IEEE International Conference on Networking, Sensing and Control (IEEE ICNSC 2006), April 23-25, 2006, Ft. Lauderdale, Florida, USA, pp. 324-329. FULL PAPER PDF
    
8. R. B. Muhammad, Parallelization of Local Search for Euclidean Steiner Tree Problem, in Proceedings of The 44th ACM Southeast Conference (ACMSE 2006), March 10-12, 2006, Melbourne, Florida, USA, pp. 233-238. PDF

5. R. B. Muhammad, Energy Efficient Topology Control in Wireless Sensor Networks, in Proceedings of The 44th ACM Southeast Conference (ACMSE 2006), March 10-12, 2006, Melbourne, Florida, USA, pp. 784-785. SHORT PAPER PDF

4. R. B. Muhammad, Distributed One-Hop Algorithm Based on Steiner Connected Dominating Set in Wireless Networks, in Proceedings of Seventeenth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2005),  November 14-16, 2005, Phoenix, Arizona, USA, pp. 225-230.

3. R. B. Muhammad, The CRCW-PRAM Voronoi Diagram and Proximity Problems, in Proceedings of The International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2005), June 27-30, 2005, Las Vegas, USA, pp. 1163-1169. PDF

2. R. B. Muhammad, Energy Efficient Algorithms for Static Ad Hoc Wireless Networks, in Proceedings of The International Conference on Wireless Networks (ICWN 2005), June 27-30, 2005, Las Vegas, USA, pp. 502-508.

1. R. B. Muhammad, A Parallel Voronoi Diagram on Hypercube Computers, in Proceedings of the Sixteenth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2004),  November 9-11, 2004, Cambridge, Massachusetts, USA, pp. 542-547.
   

Theses

• R. B. Muhammad, Parallel and Network Algorithms and Applications for Steiner Trees and Voronoi Diagram, Ph.D. Dissertation, Department of Computer Science, Kent State University, Kent, Ohio, USA, 2010. OhioLINK Document # kent1259182746. [PDF] [Dissertation Defense]

• R. B. Muhammad, The Parallel Voronoi Diagram on Hypercube Model of Computation, M.S. Thesis, Department of Computer Science, Kent State University, Kent, Ohio, USA, 2003. Includes bibliographical references (leaves 62-68). Appendix includes implementation of Voronoi diagram using multiprogramming technique in 19 java files. KSU Library Call # QA278.2 .M84 2003. [Thesis Defense]

Technical Reports, Posters & Non-refereed Articles

• R. B. Muhammad and J. Baker, Euclidean Steiner Tree Search on Client-Server Model of Computation, in Fourth Computer Science Poster Conference, May 1, 2009, Kent State University, Kent, OH, USA.
   
• R. B. Muhammad and J. Baker, Execution Time Analysis of a Parallel Euclidean Steiner Tree Algorithm, in Third Computer Science Poster Conference, April 11, 2008, Kent State University, Kent, OH, USA.
   
• R. B. Muhammad and J. Baker, A Parallel Algorithm for Euclidean Steiner Tree using Proximity Structures, in Second Computer Science Poster Conference, April 13, 2007, Kent State University, Kent, OH, USA.
   
• R. B. Muhammad and J. Baker, A Parallel Local Search Algorithm for Euclidean Steiner Tree Problem, in First Computer Science Poster Conference, April 21, 2006, Kent State University, Kent, OH, USA.
   
• R. B. Muhammad, A Parallel Algorithm for Planar Voronoi Diagram on Hypercube Model of Computation, in First Annual Ohio Graduate Student Symposium on Computer and Information Science & Engineering (OGSS-CISE '04), June 11, 2004, Wright State University, Dayton, OH, USA.
   
• R. B. Muhammad, Mapping Problem & Embedding of Various Networks in Hypercube, Technical Report, CS 75201-Spring 2001, Department of Computer Science, Kent State University, Kent, OH, USA.

Professional Activities

• Chair, Session SatA2A: Networks and Distributed Systems (I), The IEEE Southeast Conference (SoutheastCon 2007), March 22-25, 2007, Richmond, Virginia, USA.
   
• Additional review for the special session on Massively Parallel Processing in the workshop on Advances in Parallel and Distributed Computational Models (APDCM), IEEE IPDPS 2007, March 26-30, 2007, Long Beach, California, USA.
   
• Chair, Session 25-PDPTA: Load Balancing and Scheduling Algorithms I. The International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2005), June 27-30, 2005, Las Vegas, USA.
   
• Chair, Session 14-ICWN: Ad Hoc Networks. The International Conference on Wireless Networks (ICWN 2005), June 27-30, 2005, Las Vegas, USA.

Research Related Programming/Applets/Softwares/Simulators etc.

    8. Steiner Tree Problem's Heuristic Algorithm with Minimum Spanning Tree Problem

    7. Voronoi Diagram
        7a. Divide-and-Conquer Method
        7b. Incremental Method (with Convex Hull Delaunay Triangulation)

    6. Voronoi (Proximity) Structures
        6a. Planar Ordinary Voronoi Diagram
        6b. Area of Voronoi Region  
        6c. Higher Order Voronoi

    5. Voronoi Diagram in Minkowski metric
        5a. Manhattan Voronoi
        5b. Higher Order Manhattan Voronoi
        5c. Supermum Voronoi
        5d. Higher Order Supremum Voronoi
        5e. Karlsruhe Voronoi
        5f. Higher Order Karlsruhe Voronoi

    4. Delaunay Triangulation
        4a. Delaunay Tessellation
        4b. Second Order Delaunay Tessellation
        4c. Third Order Delaunay Tessellation

    3. Proximity Problem
        3a. Largest Empty Circle Problem
        3b. Smallest Enclosing Circle Problem
        3c. Nearest Point, Farthest Point Pair

    2. Convex Polygon Decomposition

    1. Traveling Salesperson Problem
        1a. TSP Heuristic Algorithm