"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
Publications
Book
 R. B. Muhammad,
Network Algorithms: Applications of Steiner Tree and Voronoi
Diagram,
Lambert Publishers, Germany, 2013. ISBN:
97836759291685
Journal (Refereed)
 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.
5364.
PDF
 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. 5057.
PDF
Proceedings (Refereed)

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 1417, 2008, Las Vegas, USA, pp. 320326.

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 1417, 2008, Las Vegas, USA, pp.
229233

R. B. Muhammad, Execution Time Analysis of a Parallel
Steiner Tree Algorithm on ServerClient Model of Computation, in Proceedings of 7th IEEE International Conference on Computer and Information
Science (ICIS '08), May 1416, 2008, Portland, Oregon, USA, pp.
415420.
FULL PAPER PDF
 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
79, 2008, Las Vegas,
USA, pp. 408413.
FULL PAPER PDF

R. B. Muhammad, A Parallel Steiner tree Construction on
the ServerClient Model of Computation, in IEEE
Proceedings of
5th International
Conference on Information Technology: New Generations (ITNG'08), April
79, 2008, Las Vegas,
USA, pp. 12811283. SHORT
PAPER PDF
 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 2528, 2008, Okinawa, Japan, pp. 100105.
PDF

R. B. Muhammad, A Parallel Computation of
the Steiner Tree Algorithm on ServerClient Paradigm,
in Proceedings of the IEEE 22nd International Conference
on Advanced Information Networking and Applications Workshops (AINAW'08), March 2528, 2008, Okinawa, Japan,
pp. 276280.
WORKSHOP PAPER PDF

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 2528, 2007, Las Vegas, USA, pp. 153159.

R. B. Muhammad, A GeoRouting 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 2123, 2007, Niagara
Falls, Canada, pp. 685689.
WORKSHOP PAPER PDF

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 24, 2007, Las Vegas, USA, pp. 961963.
SHORT PAPER PDF

R. B. Muhammad, Distributed
Construction of Planar Graph for Positionbased Routing in Ad Hoc
Wireless Networks, in Proceedings
of The IEEE Southeast Conference (SoutheastCon 2007), March
2225, 2007, Richmond, Virginia, USA, pp. 657662.
FULL PAPER PDF

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 45, 2006, Clear
Water, Florida, USA, 5 pages, Full text on CDROM.

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 1920, 2006, Las
Vegas, USA, pp. 157164.
FULL PAPER PDF

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 2629, 2006, Las Vegas, USA, pp. 173178.

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
2629, 2006, Las Vegas, USA, pp. 5156.
PDF

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 2629,
2006, Las Vegas, USA, pp. 10621065.

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 2325, 2006, Ft.
Lauderdale, Florida, USA, pp. 324329.
FULL PAPER PDF

R. B. Muhammad, Parallelization of Local
Search for Euclidean Steiner Tree Problem, in Proceedings of The 44th ACM Southeast Conference (ACMSE 2006), March 1012,
2006, Melbourne, Florida, USA, pp. 233238.
PDF

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

R. B. Muhammad, Distributed OneHop
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 1416, 2005, Phoenix, Arizona, USA, pp. 225230.

R. B. Muhammad, The
CRCWPRAM Voronoi Diagram and Proximity Problems, in Proceedings of The International Conference on
Parallel and Distributed Processing Techniques and Applications (PDPTA
2005), June 2730, 2005, Las Vegas, USA, pp. 11631169.
PDF

R. B. Muhammad, Energy
Efficient Algorithms for Static Ad Hoc Wireless Networks, in Proceedings of The International Conference on
Wireless Networks (ICWN 2005), June 2730, 2005, Las Vegas, USA,
pp. 502508.
 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 911, 2004, Cambridge, Massachusetts, USA, pp. 542547.
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 6268). 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 & Nonrefereed Articles
 R. B. Muhammad and J. Baker, Euclidean Steiner Tree
Search on ClientServer 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
(OGSSCISE '04), June 11, 2004, Wright State
University, Dayton, OH, USA.
 R. B. Muhammad, Mapping Problem &
Embedding of Various Networks in Hypercube, Technical Report,
CS 75201Spring 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 2225, 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 2630, 2007, Long Beach, California, USA.
 Chair, Session 25PDPTA: Load
Balancing and Scheduling Algorithms I. The International
Conference on Parallel and Distributed Processing Techniques and
Applications (PDPTA 2005), June 2730, 2005, Las Vegas, USA.
 Chair, Session 14ICWN: Ad Hoc Networks.
The International Conference on Wireless Networks (ICWN 2005), June
2730, 2005, Las Vegas, USA.
Research Related Programming/Applets/Softwares/Simulators etc.
7. Voronoi Diagram
7a.
DivideandConquer
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
There is no place like
Home