-
2011 Spring Simulation Multi-conference, SpringSim '11, Boston, MA, USA, April 03-07, 2011. Volume 3: Proceedings of the 14th Communications and Networking Symposium (CNS).; 01/2011
-
CoRR. 01/2010; abs/1004.0598.
-
JCM. 01/2010; 5:455-466.
-
[show abstract]
[hide abstract]
ABSTRACT: This paper presents the implementation of a secure application for an academic institution that offers numerous services to both students and the faculty. The primary focus of this paper is to provide atechnical implementation of a new architecture for encrypting the database. The scope of this paper mainly includes but is not limited to symmetric and public-key cryptography, authentication, keymanagement, and digital signatures. The final results of this paper demonstrate that what security features one should implement in order to achieve a highly secured application. This paper presents theimplementation of a stand alone system that can be implemented on any legacy systems, and still operates effectively. In other words, it is self sufficient in terms of the data that it stores.
International Journal of Network Security & Its Applications. 01/2010;
-
[show abstract]
[hide abstract]
ABSTRACT: End-System multicasting (ESM) is a promising application-layer scheme that has been recently proposedfor implementing multicast routing in the application layer as a practical alternative to the IPmulticasting. Moreover, ESM is an efficient application layer solution where all the multicastfunctionality is shifted to the end users. However, the limitation in bandwidth and the fact that themessage needs to be forwarded from host-to-host using unicast connection, and consequentlyincrementing the end-to-end delay of the transmission process, contribute to the price to pay for this newapproach. Therefore, supporting high-speed real-time applications such as live streaming multimedia,videoconferencing, distributed simulations, and multiparty games require a sound understanding of thesemulticasting schemes such as IP multicast and ESM and the factors that might affect the end-userrequirements. In this paper, we present both the analytical and the mathematical models for formalizingthe end-to-end delay efficiency of both IP and ESM multicast systems. For the sake of the experimentalverifications of the proposed models, simulation results are presented in this paper. Finally, the proposedformulization can be used to design and implement a more robust and efficient multicast systems for thefuture networks.
International journal of Computer Networks & Communications. 01/2010;
-
[show abstract]
[hide abstract]
ABSTRACT: Due to high restrictions in wireless sensor networks, where the resources are limited, clustering protocolsfor routing organization have been proposed in much research for increasing system throughput,decreasing system delay and saving energy. Even these algorithms have proposed some levels of security,but because of their dynamic nature of communication, most of their security solutions are not suitable. Inthis paper we focus on how to achieve the highest possible level of security by applying new keymanagement technique that can be used during wireless sensor networks communications. For ourproposal to be more effective and applicable to a large number of wireless sensor networks applications,we work on a special kind of architecture that have been proposed to cluster hierarchy of wireless sensornetworks and we pick one of the most interesting protocols that have been proposed for this kind ofarchitecture, which is LEACH. This proposal is a module of a complete solution that we are developing tocover all the aspects of wireless sensor networks communication which is labeled Secure Object OrientedArchitecture for Wireless Sensor Networks (SOOAWSN) .
International Journal of Network Security & Its Applications. 01/2010;
-
[show abstract]
[hide abstract]
ABSTRACT: Wireless Multiuser receivers suffer from their relatively higher computational complexity that prevents widespread use of this technique. In addition, one of the main characteristics of multi-channel communications that can severely degrade the performance is the inconsistent and low values of SNR that result in high BER and poor channel capacity. It has been shown that the computational complexity of a multiuser receiver can be reduced by using the transformation matrix (TM) algorithm [4]. In this paper, we provide quantification of SNR based on the computational complexity of TM algorithm. We show that the reduction of complexity results high and consistent values of SNR that can consequently be used to achieve a desirable BER performance. In addition, our simulation results suggest that the high and consistent values of SNR can be achieved for a desirable BER performance. The performance measure adopted in this paper is the consistent values of SNR. Comment: 9 pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS July 2009, ISSN 1947 5500, Impact Factor 0.423
08/2009;
-
[show abstract]
[hide abstract]
ABSTRACT: The performance of Mobile Ad hoc networks (MANET) depends on the cooperation of all active nodes. However, supporting a MANET is a cost-intensive activity for a mobile node. From a single mobile node perspective, the detection of routes as well as forwarding packets consume local CPU time, memory, network-bandwidth, and last but not least energy. We believe that this is one of the main factors that strongly motivate a mobile node to deny packet forwarding for others, while at the same time use their services to deliver its own data. This behavior of an independent mobile node is commonly known as misbehaving or selfishness. A vast amount of research has already been done for minimizing malicious behavior of mobile nodes. However, most of them focused on the methods/techniques/algorithms to remove such nodes from the MANET. We believe that the frequent elimination of such miss-behaving nodes never allowed a free and faster growth of MANET. This paper provides a critical analysis of the recent research wok and its impact on the overall performance of a MANET. In this paper, we clarify some of the misconceptions in the understating of selfishness and miss-behavior of nodes. Moreover, we propose a mathematical model that based on the time division technique to minimize the malicious behavior of mobile nodes by avoiding unnecessary elimination of bad nodes. Our proposed approach not only improves the resource sharing but also creates a consistent trust and cooperation (CTC) environment among the mobile nodes. The simulation results demonstrate the success of the proposed approach that significantly minimizes the malicious nodes and consequently maximizes the overall throughput of MANET than other well known schemes. Comment: 10 pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS July 2009, ISSN 1947 5500, Impact Factor 0.423
08/2009;
-
Proceedings of the 2009 Spring Simulation Multiconference, SpringSim 2009, San Diego, California, USA, March 22-27, 2009; 01/2009
-
[show abstract]
[hide abstract]
ABSTRACT: End-System multicasting (ESM) is a promising application-layer scheme that has been recently proposed for implementing multicast routing in the application layer as a practical alternative to the IP multicasting. Moreover, ESM is an efficient application layer solution where all the multicast functionality is shifted to the end users. However, the limitation in bandwidth and the fact that the message needs to be forwarded from host-to-host using unicast connection, and consequently incrementing the end-to-end delay of the transmission process, contribute to the price to pay for this new approach. Therefore, supporting high-speed real-time applications such as live streaming multimedia, videoconferencing, distributed simulations, and multiparty games require a sound understanding of these multicasting schemes such as IP multicast and ESM and the factors that might affect the end-user requirements. In this paper, we present both the analytical and the mathematical models for formalizing the end-to-end delay and the bandwidth efficiency of both IP and ESM multicast system. For the sake of the experimental verifications of the proposed models, numerical and simulation results are presented in this paper. Finally, the proposed formulization can be used to design and implement a more robust and efficient multicast systems for the future networks
International Journal of Computer Networks. 01/2009;
-
[show abstract]
[hide abstract]
ABSTRACT: Extensive studies have been carried out for reducing the handover time of wireless mobile network at medium access control (MAC) layer. However, none of them show the impact of reduced handover timeon the overall performance of wireless mobile networks. This paper presents a quantitative analysis to show the impact of reduced handover time on the performance of wireless mobile networks. The proposed quantitative model incorporates many critical performance parameters involve in reducing the handover time for wireless mobile networks. In addition, we analyze the use of active scanning technique with comparatively shorter beacon interval time in a handoff process. Our experiments verify that the activescanning can reduce the overall handover time at MAC layer if comparatively shorter beacon intervals are utilized for packet transmission. The performance measures adopted in this paper for experimental verifications are network throughput under different network loads.
International Journal of Wireless & Mobile Networks. 01/2009;
-
[show abstract]
[hide abstract]
ABSTRACT: High performance packet switching networks are being deployed to provide sufficient data bandwidth for end users 3G services
such as video streaming and broadband like data services. The use of high performance networks is, therefore, essential to
the success of any 3G service. However, in practice, the deployment of High performance packet switching networks is hindered
due to the improper congestion control which consequently results longer delays. In this paper, we propose a new method that
can effectively improve the congestion control in high performance packet switching networks. Our numerical and simulation
results demonstrate that the proposed method can be implemented for both lightly and heavily loaded networks. Simulation results
show that the transmission delays can also be reduced significantly that improves the over all performance of high performance
packet switching networks
08/2008: pages 512-515;
-
[show abstract]
[hide abstract]
ABSTRACT: Voice Encoder Schemes, Weighted Fair Queuing (WFQ) and Speech Activity Detection (SAD) techniques affect the overall Quality
of Service (QoS) of Voice over Internet Protocol (VoIP) services. VoIP is one of the most discussed and rapidly emerging technologies
in telecommunication. We are slowly witnessing a change in telephony from Public Switched Telephone Network (PSTN) to IP based
VoIP Network. Despite the benefits being enormous, the switch to VoIP hasn’ t been swift, primarily due to various performance
(delay, jitter, packet loss, echo etc.) and security issues plaguing the VoIP telephony network. To achieve minimal QoS for
telephony, the voice (packets) must be delivered within 150 ms to 200 ms. This paper presents a performance model to quantifying
the influence of VoIP which gives an in-depth understanding of how Voice Encoder Schemes, WFQ and SAD influence VoIP QoS from
a theoretical and implementation point of views.
08/2008: pages 501-505;
-
[show abstract]
[hide abstract]
ABSTRACT: This paper provides a critical analysis of the recent research wok and its impact on the overall performance of a mobile Ad
hoc network. In this paper, we clarify some of the misconceptions in the understating of selfishness and miss-behavior of
nodes. Moreover, we propose a mathematical model that based on the time division technique to minimize the node misbehavior
by avoiding unnecessary elimination of bad nodes. Our proposed approach not only improves the resource sharing but also creates
a consistent trust and cooperation (CTC) environment among the mobile nodes. We believe, that the proposed mathematical model
not only points out the weaknesses of the recent research work but also approximates the optimal values of the critical parameters
such as throughput, transmission over head, channel capacity etc. The simulation results demonstrate the success of the proposed
approach that significantly minimizes the malicious nodes and consequently maximizes the overall throughput of the Ad Hoc
network than the other well known schemes.
08/2008: pages 506-511;
-
[show abstract]
[hide abstract]
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.
Computers and Communications, 2008. ISCC 2008. IEEE Symposium on; 08/2008
-
Proceedings of the 2008 Spring Simulation Multiconference, SpringSim 2008, Ottawa, Canada, April 14-17, 2008; 01/2008
-
Fifth International Conference on Information Technology: New Generations (ITNG 2008), 7-8 April 2008, Las Vegas, Nevada, USA; 01/2008
-
Proceedings of the Fifth Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2008, June 16-20, 2008, Crowne Plaza, San Francisco International Airport, California, USA; 01/2008
-
Novel Algorithms and Techniques in Telecommunications and Networking, proceedings of the 2008 International Conference on Telecommunications and Networking (TeNe), part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering, CISSE 2008, Bridgeport, Connecticut, USA; 01/2008
-
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008, Las Vegas, Nevada, USA, July 14-17, 2008, 2 Volumes; 01/2008
