A New Scheme for Minimizing Malicious Behavior of Mobile Nodes in Mobile Ad Hoc Networks

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.42

Sanctuary in the Midst of Crisis? a Look Into Shariah Indices Using Multivariate GARCH DCC

Islamic Finance has evolved over the past few decades, and stands at over a trilliondollars today. At the foundations of Islamic finance lay the concept of risk sharing, and the purest forms of it in the modern day finance is equity investments. The evidence of Islamic investors pursing equity investments in reality is thin. Multitude of reasons are attributed to this low participation, mainly revolving around lack of empirical proof of Islamic investments being a reliable and steady return alternative. This study is an attempt to study the volatilities and correlations with the conventional global equity indices utilizing Multivariate GARCH Dynamic Conditional Correlations (MGARCH DCC) method. The findings provide an interesting angleto our study, where there is a significant downwards trend in the correlations during the crisis era. This provides substance to the argument that Islamic investors would experience lesser downside in economic crisis. This study further dwells into the linkage of Islamic indices with global financial indices to study if financial sector exclusion from Islamic indices benefits theinvestors. The findings are positive, with lower correlations and that to reducing in the recent global crisis. Islamic finances core philosophy is equity based investments and this study is a humble attempt to empirically substantiate its benefits

A tripartite inquiry into volatility-efficiency-integration nexus - case of emerging markets

The objective of this paper is to analyse the time-varying changes of the three parameters, volatility, efficiency and integration on stock markets across emerging markets. We do this using a four-step process with focus on Multifractal Detrended Fluctuation Analysis to measure its efficiency. Our analysis show that lower volatility was found in short-term for countries that experienced fast paced economic growth. This increase in volatility is supported by a decrease in efficiency for the short-term, while market integration rose during periods of crises, which represent higher volatility. Hence, a tripartite relationship between our parameters is observed

Functional properties of whey protein concentrate texturized at acidic pH: effect of extrusion temperature

Reactive supercritical fluid extrusion (RSCFX) process at acidic condition (pH 3.0) was used to generate texturized whey protein concentrate (TWPC) and the impacts of process temperature on product's physicochemical properties were evaluated. TWPC extruded at 50 and 70 °C formed soft-textured aggregates with high solubility than that extruded at 90 °C that formed protein aggregates with low solubility. Total free sulfhydryl contents and solubility studies in selected buffers indicated that TWPC is primarily stabilized by non-covalent interactions. Proteins texturized at 90 °C showed an increased affinity for 1-anilino-naphthalene-8-sulfonate (ANS) and a decreased affinity for cis-parinaric acid (CPA), indicating changes in protein structure. Water dispersion of TWPC at room temperature showed thickening function with pseudoplastic behavior. Secondary gelation occurred in TWPC obtained at 50 and 70 °C by heating the cold-set gels to 95 °C. TWPC texturized at 90 °C produced cold-set gels with good thermal stability. Compared to control, TWPC formed stable oil-in-water emulsions. Factors such as degree of protein denaturation and the balance of surface hydrophobicity and solubility influenced the heat- and cold-gelation and emulsifying properties of the protein ingredients. TWPC generated by low and high temperature extrusions can thus be utilized for different products requiring targeted physicochemical functionalities

A New Mathematical Model for Optimizing the Performance of Parallel and Discrete Event Simulation Systems

Null message algorithm is an important conservative time management protocol in parallel discrete event simulation systems for providing synchronization between the distributed computers with the capability of both avoiding and resolving the deadlock. However, the excessive generation of null messages prevents the widespread use of this algorithm. The excessive generation of null messages results due to an improper use of some of the critical parameters such as frequency of transmission and Lookahead values. However, if we could minimize the generation of null messages, most of the parallel discrete event simulation systems would be likely to take advantage of this algorithm in order to gain increased system throughput and minimum transmission delays. In this paper, a new mathematical model for optimizing the performance of parallel and distributed simulation systems is proposed. The proposed mathematical model utilizes various optimization techniques such as variance of null message elimination to improve the performance of parallel and distributed simulation systems. For the sake of simulation results, we consider both uniform and non-uniform distribution of Lookahead values across multiple output lines of an LP. Our experimental verifications demonstrate that an optimal NMA offers better scalability in parallel discrete event simulation systems if it is used with the proper selection of critical parameters

A Mathematical Model for Evaluating the Performance of Multicast Systems

© 2008 IEEE. Reprinted, with permission, from Syed S. Rizvi, Aasia Riasat, and Khaled M. Elleith, "A Mathematical Model for Evaluating the Performance of Multicast Systems," The 1st IEEE International Workshop on IP Multimedia Communications (IPMC 2008) August 4 - 7, 2008, St. Thomas U.S. Virgin IslandsThe Internet is experiencing the demand of high-speed real-time applications, such as live streaming multimedia, videoconferencing, and multiparty games. IP multicast is an efficient transmission technique to support these applications. However, there are several architectural issues in this technique that hinder the development and the deployment of IP multicast such as a lack of an efficient multicast address allocation scheme. On the other hand, End System Multicasting (ESM) is a very promising application-layer scheme where all the multicast functionality is shifted to the end-users. Supporting high-speed real-time applications always demand a sound understanding of these schemes and the factors that might affect the end-user requirements. In this paper we attempt to propose both analytical and the mathematical models for characterizing the performance of IP multicast and ESM. Our proposed mathematical model can be used to design and implement a more efficient and robust ESM model for the future networks

Investigating the Effects of Trees and Butterfly Barriers on the Performance of Optimistic GVT Algorithm

The final publication is available at www.springerlink.comThere is two approaches for handling timing constraints in a heterogeneous network; conservatives and optimistic algorithms. In optimistic algorithms, time constraints are allowed to be violated with the help of a time wrap algorithm. Global Virtue Time (GVT) is a necessary mechanism for implementing time wrap algorithm. Mattern [2] has introduced an algorithm for GVT based computation using a ring structure. which showed high latency. The performance of this optimistic algorithm is optimal since it gives accurate GVT approximation. However, this accurate GVT approximation comes at the expense of high GVT latency. Since this resultant GVT latency is not only high but may vary, the multiple processors involve in communication remain idle during that period of time. Consequently, the overall throughput of a parallel and distributed simulation system degrades significantly In this paper, we discuss the potential use of trees and (or) butterflies structures instead of the ring structure. We present our analysis to show the effect of these new mechanisms on the latency of the system.http://link.springer.com/chapter/10.1007%2F978-90-481-3660-5_7

A Novel Approach of Using Data Guard for Disaster Recovery & Rolling Upgrades

© ASEE 2008Though we already had a standardized way (from Oracle) for Disaster Recovery policy, a major crash of the PLM database made our DBAs to come up with a proposal to execute a procedure using Data Guard together with Oracle Transportable Tablespace which resulted in the successful and timely migration of the PLM Production from Oracle 9.2.0.3 on HP N-Class to Oracle 9.2.0.5 on HP-Superdome in just 8 minutes. This same procedure also gives a fast, reliable way to upgrade from Oracle9i to Oracle Database10g with minimal downtime. And future database upgrades get even easier using Data Guard 10g Rolling Upgrades

An Efficient Routing Algorithm for Mesh-Hypercube (M-H) Networks

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'08, ISBN Set # 1-60132-084-1), Editors: Hamid R. Arabnia and Youngsong Mun, 2008.This paper presents an efficient routing algorithm for the Mesh-Hypercube (M-H) network. The M-H network is one of the new interconnection networking techniques use to build high performance parallel computers. The combination of M-H networks offers high connectivity among multiple nodes, fault-tolerance, and load scalability. However, the performance of M-H networks may degrade significantly in the presence of frequent link or node failures. When a link or node failure occurs, neither the hardware schemes nor point to point and multistage routing algorithms can be used without adding extra links. This paper presents an efficient single bit store and forward (SBSF) routing algorithm for MH network that based on the round robin scheduling algorithm. Simulation and numerical results suggest that the proposed routing algorithm improves the overall performance of M-H network by both reducing the transmission delay and increasing the total data throughput even in the presence of faulty nodes.http://www.world-academy-of-science.org