2008 | ||
---|---|---|
14 | EE | Rashid Bin Muhammad: Execution Time Analysis of a Parallel Steiner Tree Algorithm on Server-Client Model of Computation. ACIS-ICIS 2008: 415-420 |
13 | EE | Rashid Bin Muhammad: Range Assignment Approximation Based on Steiner Tree in Ad Hoc Wireless Networks. AINA 2008: 100-105 |
12 | EE | Rashid Bin Muhammad: A Parallel Computation of the Steiner Tree Algorithm on Server-Client Paradigm. AINA Workshops 2008: 276-280 |
11 | Rashid Bin Muhammad: Topology Control Based on a Steiner Tree in Ad Hoc Wirless Networks. ICWN 2008: 229-233 | |
10 | EE | Rashid Bin Muhammad: A Parallel Steiner Tree Construction on the Server-Client Model of Computation. ITNG 2008: 1281-1283 |
9 | EE | Rashid Bin Muhammad: Transmitting Range Assignments Using Steiner Tree in Ad Hoc Wireless Networks. ITNG 2008: 408-413 |
8 | Rashid Bin Muhammad: Time Delay Analysis for a Parallel Steiner tree Algorithm. PDPTA 2008: 320-326 | |
2007 | ||
7 | EE | Rashid Bin Muhammad: A Geo-Routing Algorithm in Planar Graph for Ad Hoc Wireless Networks. AINA Workshops (2) 2007: 685-689 |
6 | Rashid Bin Muhammad: Connectivity and Transmitting Range Assignments in Ad Hoc Wireless Networks. ICWN 2007: 153-159 | |
5 | EE | Rashid Bin Muhammad: A Distributed Geometric Routing Algorithm for Ad HocWireless Networks. ITNG 2007: 961-963 |
4 | EE | Rashid Bin Muhammad: A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks. JNW 2(6): 50-57 (2007) |
2006 | ||
3 | EE | Rashid Bin Muhammad: Parallelization of local search for Euclidean Steiner tree problem. ACM Southeast Regional Conference 2006: 233-238 |
2 | EE | Rashid Bin Muhammad: A Parallel Local Search Algorithm for Euclidean Steiner Tree Problem. SNPD 2006: 157-164 |
2005 | ||
1 | Rashid Bin Muhammad: Distributed One-Hope Algorithm based on Steiner Connected Dominating Set in Wireless Networks. IASTED PDCS 2005: 225-230 |