International Journal of Reviews in Computing

Welcome to International Journal of Reviews in computing

ISSN : 2076-3328 | E-ISSN : 2076-3336

Submit Paper / Call for Papers

Journal receives papers in continuous flow and we will consider articles from a wide range of Computing disciplines including hardware engineering, software engineering, information systems and information technology, encompassing the most basic research to the most innovative and radical ideas. Please submit your papers electronically to our submission system at http://IJRIC.org/submit_paper.php in an MSWord, Pdf or compatible format so that they may be evaluated for publication in the upcoming issue. This journal uses a blinded review process; please remember to include all your personal identifiable information in the manuscript before submitting it for review, we will edit the necessary information at our side. Submissions to IJRIC should be full research / review papers (properly indicated below main title in case of review paper).

International Journal of Reviews in Computing
Volume 12 December 31 2012

Title	A REVIEW: FROM KEYWORD BASED IMAGE RETRIEVAL TO ONTOLOGY BASED IMAGE RETRIEVAL
Authors	V.VIJAYARAJAN, M.KHALID, P.V.S.S.R. CHANDRA MOULI
Abstract	This paper confers the evolution of the various image retrieval techniques starting from Keyword based Image Retrieval (KBIR) to Ontology Based Image Retrieval. It addresses various outstanding issues in both past and present. The rapid advancement of image data demands continuing the research and development of Image Retrieval. The exploration in image retrieval has its basis in keyword based retrieval and then evolved to retrieval techniques employing content based low-semantic features approach is that the complete knowledge cannot be mapped and hence there exists some gaps known as semantic gaps. To overcome these gaps, currently, the researchers are interested in Knowledge based retrieval using Ontology. The focus is towards the semantic features because the key words are very subjective, time consuming to search and also the low level features are very tough to map into high level concepts in user minds.
Keywords	Keyword Based Image Retrieval (KBIR), Content Based Image Retrieval (CBIR), Semantic Gap, Ontology Based Semantic Image Retrieval
Source	International Journal of Reviews in Computing	pp 01-17	Vol. 12
Full Text

Title	PERFORMANCE EXAMINATION OF AES ENCRYPTION ALGORITHM WITH CONSTANT AND DYNAMIC ROTATION
Authors	I.A. ISMIL, GALAL H. GALAL -EDEEN, SHERIF KHATTAB, MOHAMED ABD ELHAMID I. MOUSTAFA El BAHTITY
Abstract	Lately, the Rijndael algorithm has been standardized by the NIST as the Advanced Encryption Standard (AES). This makes AES an essential and necessary data-protection mechanism for federal agencies in the US and other countries. In AES, rotation occurs in key expansion, ciphering, and deciphering. Rotation is vital for confusion and diffusion, which play an important role in any cryptography technique. Confusion and diffusion make breaking the key complex and difficult. This paper studies the effect of reconfiguring the structure of AES, especially replacing constant rotation with variable rotation. The resulting twin cipher is called Dynamic Rotation for Advanced Encryption Standard (DRAES). DRAES with variable rotation increases the complexity of the algorithm, and thus, increases the time consumed for brute-force attacks. We measured the diffusion of AES and DRAES algorithms. DRAES reached acceptable level of diffusion faster than AES.
Keywords	AES, DRAES, Confusion, Diffusion
Source	International Journal of Reviews in Computing	pp 18-29	Vol. 12
Full Text

Title	WIRELESS SENSOR NETWORKS LOCLAIZATION ALGORITHMS: A COMPARATIVE STUDY
Authors	MAHMOUD NABIL, RABIE A. RAMADAN, HAMED ELSHENAWY, ADEL ELHENNAWY
Abstract	Wireless Sensor Networks (WSNs) are the type of networks that are currently used in many applications. Some of these applications are critical and their information is very sensitive e.g. battle field and health care monitoring. Any transferred data has to be known from where it comes. In other words, most of the WSNs applications depend mainly on the location of each node in the network. In fact, the location may affect the decision to be made. The importance of localization is not only due to location identification but also it provides the base for routing, density control, tracking, and number many of other communication network aspects. Therefore, it is very important that each node reports its location accurately. Unfortunately, GPS is not suitable for WSNs due to its cost in terms of nodes consumed energy as well as its availability. Many localization algorithms are proposed for WSNs; however, their accuracy is the main concern. This paper is designated to help the WSNs designers in selecting suitable localization algorithm for their applications. The paper presents as well as implements different localization algorithms and evaluate them.
Keywords	Localization, DIL, HiRLoc, SeRLoc, PTA, RAL
Source	International Journal of Reviews in Computing	pp 30-37	Vol. 12
Full Text

Title	ANALYSIS OF MOBILE AGENT SYSTEMS PERFORMANCE USING LINEAR PREDICTION MODEL
Authors	FAIZ AL-SHROUF, AIMAN TURANI
Abstract	Mobile Agents are considered an interesting technology to develop applications for distributed systems. Thus they present features, such as autonomy and capability to roam to hosts, process data, and save remote communications. Many mobile agent platforms have been developed for research purposes while other platforms have been deployed as commercial products. Some platforms have been outdated; others continue releasing new versions that fix bugs detected or offer new features. A common problem when one wants to benefit from mobile agent platform is the decision about which platform to use. In this paper, we provide up-to-date evaluation of existing mobile agent platforms. We derive linear prediction model to compare and forecast mobile agent platform's performance and their interested behavior. The study uses six mobile agent systems: JAMES, Odyssey, Swarm, Grasshopper, Aglets, and Voyager.
Keywords	Mobile Agents, Performance Analysis, Linear Prediction Model
Source	International Journal of Reviews in Computing	pp 38-43	Vol. 12
Full Text

Title	STUDYING THE EFFECTS OF MALICIOUS NODES USING GEOGRAPHIC ROUTING PROTOCOL IN THE WSN
Authors	HESHAM ABUSAIMEH
Abstract	In this paper, studying the effect of malicious nodes in the Wireless Sensor Networks (WSNs) is proposed. The low-cost, low data rate of the sensor nodes made the WSN a hot topic among researchers. Certain characteristics like dynamic topologies, limited data rate and limited battery power makes routing in WSN challenging compared to traditional networks. Earlier work on WSNs mainly focused on developing efficient routing mechanisms in dynamic and resource-constrained networks. Several efficient routing protocols were suggested for WSNs where most assume a trusted and cooperative environment. However, they are all vulnerable to attacks by malicious nodes; routing attacks in WSNs are especially serious. Geographic routing research is more recent than topological routing; it has received special attention as improvement in geographic information produces better routing performance. In this study, the effect of the malicious nodes on geographic routing is investigated. Simulations are conducted to evaluate the performance degradation of network due to malicious node activity. Simulation studies conducted for network with 15% malicious nodes show that the throughput of the network degrades significantly.
Keywords	Wireless Sensor Networks, Malicious Nodes, Routing Protocols, Geographic Routing Protocols, effect of the Malicious Nodes. Network Throughput
Source	International Journal of Reviews in Computing	pp 44-50	Vol. 12
Full Text

Title	ATTACKS AND DEFENSE IN MOBILE ADHOC NETWORKS (MANTS)
Authors	M. A. AL-SHABI
Abstract	Ever increasing days, Mobile ad hoc network (MANT) is becoming the important issue in an autonomous system that consists of a variety of mobile hosts forming temporary network without any fixed infrastructure. The success of mobile ad hoc networks (MANET) strongly depends on people’s confidence in its security. Various attacks against wireless ad hoc networks can be conducted. In this paper, various existing attack and defense were reviewed. It has been study how different attacks affect the performance of the network and find out the security issues which have not solved until now. And we should take There is no general algorithm that suits well against the most commonly known attacks such as wormhole, rushing attack etc. this paper attempts to review all such attached and defend in network layer and describe some techniques that can be used to defend against the multi hop routing protocol attacks.
Keywords	Mobil Ad hoc network (MANT), Routing, Classification of MANT, Attacks, Secure Routing Protocols
Source	International Journal of Reviews in Computing	pp 51-58	Vol. 12
Full Text

Title	AN EFFICIENT IMPLEMENTATION OF APRIORI ALGORITHM BASED ON HADOOP-MAPREDUCE MODEL
Authors	OTHMAN YAHYA, OSMAN HEGAZY, EHAB EZAT
Abstract	Finding frequent itemsets is one of the most important fields of data mining. Apriori algorithm is the most established algorithm for finding frequent itemsets from a transactional dataset; however, it needs to scan the dataset many times and to generate many candidate itemsets. Unfortunately, when the dataset size is huge, both memory use and computational cost can still be very expensive. In addition, single processor’s memory and CPU resources are very limited, which make the algorithm performance inefficient. Parallel and distributed computing are effective strategies for accelerating algorithms performance. In this paper, we have implemented an efficient MapReduce Apriori algorithm (MRApriori) based on Hadoop-MapReduce model which needs only two phases (MapReduce Jobs) to find all frequent k-itemsets, and compared our proposed MRApriori algorithm with current two existed algorithms which need either one or k phases (k is maximum length of frequent itemsets) to find the same frequent k-itemsets. Experimental results showed that the proposed MRApriori algorithm outperforms the other two algorithms.
Keywords	Hadoop, MapReduce, Parallel Computing, Distributed Computing, Apriori Algorithm, Frequent Itemset, Data Mining, Association Rule
Source	International Journal of Reviews in Computing	pp 59-67	Vol. 12
Full Text

Publish your quality research in

Sister JOURNALS

Journal of Theoretical and Applied Information Technology (JATIT)
www.jatit.org

IJRIC.org

Publishing Policy

Review Process

Code of Ethics