Muhammad Hassan Raza

Muhammad Hassan Raza

Auto-generated profile, based on publicly available information

Muhammad Hassan Raza

Department of Internetworking, Faculty of Engineering, Dalhousie University, Halifax, Canada

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 June 2015 in Journal of Ambient Intelligence and Humanized Computing
Verified
Journal Article
Closed access
PDF file
ANAlireza Nafarieh
Alireza Nafarieh
MRMuhammad Raza
Muhammad Raza
WRWilliam Robertson
William Robertson

7 March 2016 in Journal of Ambient Intelligence and Humanized Computing
Verified
Journal Article
Closed access
PDF file
YFYashar Fazili
Yashar Fazili
ANAlireza Nafarieh
Alireza Nafarieh
MRMuhammad H. Raza
Muhammad H. Raza
BRBill Robertson
Bill Robertson
WPWilliam Phillips
William Phillips

1 January 2006
Verified
Conference Paper
Closed access
MRMuhammad Hassan Raza
Muhammad Hassan Raza
Larry HughesLarry Hughes
Larry Hughes
Nodes in an ad hoc network are potentially in motion, meaning that the density of an ad hoc network can vary over time. Increasing density can result in congestion and collisions, while decreasing it may lead to poor coverage. For these reasons, density is considered an important metric for defining network environments. The density of an ad hoc network is referred to when performance metrics are defined, when routing parameters are tuned, and when different kinds of protocols are compared. Despite the importance of density, little research appears to have been done to determine it in ad hoc networks. In this paper, two algorithms for determining density are proposed: a census of nodes and traffic analysis. To validate these algorithms, the simulation results are also presented

1 December 2007
Verified
Conference Paper
Closed access
IRImran Raza
Imran Raza
MRM. Hassan Raza
M. Hassan Raza
The Cartesian ad hoc routing protocols (CARP) is a set of efficient broadcast control mechanism for geographical position aware nodes. In CARP, when a source node tries to transmit a packet in the direction of the destination, a logical transmission area is formed. To reduce the flooding traffic, only nodes located inside this area will forward the packet. The CARP assume that a source knows the Cartesian address of the mobile ad hoc destination node and nodes have some knowledge about the density from previous activity of the network. This research paper presents an initialization mechanism for (CARP), to find the destination logical address through controlled broadcast. In this paper, an initialization mechanism based on controlled retransmission and geographical position is presented. To validate these algorithms, the simulation results are also presented.