Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Syed Sajjad Rizvi

dblp:44/4666 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless networking · 77% Routing and switching · 23%
Network and information security
1 paper
Network security · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking
mobile ad hoc networks
0.112007
A novel approach for creating trust to reduce malicious behavior in MANET · CoNEXT 2007
Wireless networking › mobile ad hoc networks › cooperation incentives
reputation system
0.112007
A novel approach for creating trust to reduce malicious behavior in MANET · CoNEXT 2007
Network security › intrusion detection and prevention
intrusion detection
0.112007
A novel approach for creating trust to reduce malicious behavior in MANET · CoNEXT 2007
Routing and switching › source routing
dynamic source routing
0.012007
A novel approach for creating trust to reduce malicious behavior in MANET · CoNEXT 2007
Routing and switching › routing
secure routing
0.012007
A novel approach for creating trust to reduce malicious behavior in MANET · CoNEXT 2007

Methods — techniques the papers use, named apart from their topics

watchdog · 0.1simulation · 0.1pathrater · 0.1
YearPublicationVenuePosition
2008 Deterministic Formalization of the Processing Gain for Reducing MAI in Multi-Channel Communications System
abstract
Multiuser detectors suffer from their relatively higher computational complexity that prevents widespread use of this technique. In addition, one of the main characteristics of multichannel communications that can severely degrade the performance is the inconsistent values of processing gain (PG) that result in high multiple access interference (MAI). However, if we could lower the complexity of multiuser detectors and produce better values of PG, most of the CDMA systems would likely take advantage of this technique in terms of increased system capacity and a better data rate .This paper presents a deterministic formalization of the PG for a wireless multi-channel DS-CDMA system The proposed deterministic formalization demonstrates that how the reduced BER could be used to achieve reasonable values of PG by which unwanted signals can be suppressed relative to the desired signal at the receiving end. The performance measure adopted in this paper is the achievable bit rate for a fixed probability of error (10-7).
Syed Sajjad Rizvi, Khaled M. Elleithy, Aasia Riasat
CCNC1
2008 Reducing null message traffic in large parallel and distributed systems
abstract
Null message algorithm (NMA) is one of the efficient conservative time management algorithms that use null messages to provide synchronization between the logical processes (LPs) in a parallel discrete event simulation (PDES) system. However, the performance of a PDES system could be severely degraded if a large number of null messages need to be generated by LPs to avoid deadlock. In this paper, we present a mathematical model based on the quantitative criteria specified in (Rizvi et al., 2006) to optimize the performance of NMA by reducing the null message traffic. Moreover, the proposed mathematical model can be used to approximate the optimal values of some critical parameters such as frequency of transmission, Lookahead (L) values, and the variance of null message elimination. In addition, the performance analysis of the proposed mathematical model incorporates both uniform and non-uniform distribution of L values across multiple output lines of an LP. Our simulation and numerical analysis suggest that an optimal NMA offers better scalability in PDES system if it is used with the proper selection of critical parameters.
Syed Sajjad Rizvi, Khaled M. Elleithy, Aasia Riasat
ISCC1
2008 The Worst and Best Case Capacity Analysis of Mobile Ad Hoc Networks (MANET) Using a 3-Phase Algorithm
abstract
The capacity of mobile ad hoc network (MANET) is typically determined by the size of network, routing protocol, mobility and the interactions that occur between the nodes. Moreover, these critical parameters cause the loss rate that has severed impact on the performance of the MANET. This situation even becomes worst when these critical parameters are chosen inappropriately. This paper presents an analytical model that incorporates most of the critical parameters that can influence the capacity of MANET. Based on the analytical model, an efficient 3-phase algorithm is designed to optimize the performance of MANET in terms of an increased capacity and the reduced transmission delay. The proposed 3-phase algorithm considers both delay-tolerant and delay-sensitive network traffics. In addition, the 3-phase algorithm can be used to approximate both the best and worst case capacities of MANET with the relaying and non-relaying nodes.
Syed Sajjad Rizvi, Aasia Riasat, Mustafa A. Khan, Khaled M. Elleithy
SECON1
2007 A novel approach for creating trust to reduce malicious behavior in MANET
abstract
This paper presents a Reputation-Trust (RT) system that can be used to stabilize the performance of the network for the working nodes even in the presence of malicious nodes which intentionally do not route and forward packets send by others correctly. The situation becomes even worst when nodes do not rely on any routing infrastructure but relay packets for each other. We introduce two extensions to the Dynamic Source Routing algorithm (DSR) [1] to mitigate the effects of routing misbehavior: the watchdog and the pathrater. Using these two approaches, the proposed RT system will update the RT table of each node with the ranked values of other nodes. The implementation of the proposed RT system is entirely based on the underlying proposed RT algorithm. Simulation results demonstrate that the RT system can be used to reduce the malicious behavior of mobile nodes and consequently improve the overall performance of MANET.
Syed Sajjad Rizvi, Saroj Poudyal, Varsha Edla, Ravi Nepal
CoNEXT1