Vol. 8 No. 3 JUN 2010

Vol. 8 No. 3 June 2010 International Journal of Computer Science and Information Security

Publication June 2010, Volume 8 No. 3 (Download Full Journal) (Archive)

Copyright © IJCSIS. This is an open access journal distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

1. Paper 27051043: Implementation of SPIN Model Checker for Formal Verification of Distance Vector Routing Protocol (pp. 1-6)

Full Text: PDF

Kashif Javed, Department of Information Technologies, Abo Akademi University, Joukahaisenkatu, Turku, FIN-20520, Finland

Asifa Kashif, Department of Electrical Engineering, National University- Foundation for Advancement of Science and Technology, A.K. Brohi Road, H-11/4, Islamabad, 44000, Pakistan

Elena Troubitsyna, Department of Information Technologies, Abo Akademi University, Turku, FIN-20520, Finland

Abstract - Distributed systems and computing requires routing protocols to meet a wide variety of requirements of a large number of users in heterogeneous networks. DVR is one of many other employed protocols for establishing communication using routes with minimum cost to different destinations from a given source. Research work presented in this paper focuses on implementation of DVR in SPIN and provides formal verification of correctness of DVR behaviour covering all required aspects. Simulation results clearly show a proof of the established paths from each router to different destinations in a network consisting of six routers and a number of links.

Keywords: Formal Verification, DVR Protocol, SPIN Model Checker, Distance Vector Routing, Implementation in PROMELA

2. Paper 31051062: Integrated Queuing based Energy-Aware Computing in MANET (pp. 7-10)

Full Text: PDF

Dr. P. K. Suri, Dean and Professor, Faculty of Science, Deptt. of Comp. Sci. & Appl. Kurukshetra University, Kurukshetra, Haryana, India

Kavita Taneja, Assistant Professor, M. M. Inst. of Computer Tech. & Business Mgmt. Maharishi Markandeshwar University, Mullana, Haryana, India

Abstract— Mobile Computing has witnessed a flare-up of applications in mobile and personal communication. It is a phrase that embodies on-the-go business initiatives. By marrying today's dominant office computing environment with increasingly compact-but-powerful handheld devices, mobile computing makes it possible for millions of workers to conduct business on their feet and from the road. Energy efficiency is an important design consideration due to the limited battery life of mobile devices. In order to minimize energy consumption and maximize the network life time, the proposed simulator opt for intelligent routing through substitute routes instead of conventional routing through shortest route. To reduce energy consumption only devices in the traversed route are active, other mobile devices of network are switched off. Also simulator implements clusters for efficient sleep and active mobile device mechanism and reflects on MANET in terms of queuing network and consider the packets arrival rate in terms of poisson distribution.

Keywords- Queuing theory, poisson distribution, clustering, mobile unit, mobile ad hoc network.

3. Paper 30051057: A Review of Negotiation Agents in e-commerce (pp. 11-20)

Full Text: PDF

Sahar Ebadi, Department of Information System, Faculty of Computer Science and Information Technology, University Putra Malaysia, Serdang, Malaysia

Md. Nasir Sulaiman, Department of Information System, Faculty of Computer Science and Information Technology, University Putra Malaysia, Serdang, Malaysia

Masrah Azrifah Azmi Murad, Department of Information System, Faculty of Computer Science and Information Technology, University Putra Malaysia, Serdang, Malaysia

Abstract—With the growth of World Wide Web and the increasing human demand on online trading, there is a pressing need for complex systems that are capable of handling the client needs in e-commerce. In recent years, numbers of Multi Agent System (MAS) developers arise to fulfill this mission by performing a huge number of studies on agent negotiation systems. However, far too little attention has been paid to provide a rich review as a repository for developers to distinguish the aspect and scope of MAS. The purpose of this paper is to do a review of progressing agent negotiation technology in e-commerce. In order to achieve our aim we propose different classification schemata and interpret different models according to the proposed classifications. Popular methods for optimizing negotiation agents have been introduced and the effect of relative techniques has been analyzed. The result of analysis shows that genetic algorithm is the most effective learning technique in optimizing negotiation models. Moreover, we interpret the most prominent negotiation models according to the main parameters on which any negotiation agent model depends. The result of these analysis supplies a resource of differentiating competing alternatives for the area of negotiation agent’s models to exploit. Finally, a range of open issues and future challenges are highlighted.

Keywords-Component; Artificial Intelligence; Agent; Multi-Agent System; Negotiation; E-Commerce

4. Paper 31051071: Customized Digital Road Map Building using Floating Car GPS Data (pp. 21-29)

Full Text: PDF

G. Rajendran, Assistant Professor of Computer Science, Thiruvalluvar Government Arts College, Rasipuram-637401, Tamilnadu, India

Dr. M. Arthanari, Director, Bharathidasan School of Computer Applications, Ellispettai-638116, Tamilnadu, India

M. Sivakumar, Doctoral Research Scholar, Anna University, Coimbatore, Tamilnadu, India

Abstract—The vehicle tracking, navigation and road guidance applications are becoming more popular but the presently available digital maps are not suitable for many such applications. Among the drawbacks are the insufficient accuracy of road geometry and the delayed time in loading the unwanted data. Most of the commercial applications in vehicle tracking require digital maps which have only roads and places of interest whereas the currently available maps show all available roads and places. A simplified map building process to construct customized high-precision digital maps from floating car data obtained from Global Positioning System (GPS) receivers is presented in this paper. The data collected from the GPS receiver fixed in a moving car are used to construct the customized digital road maps. The approach consists of six successive steps: Collecting floating car data (FCD) for desired road segments in a log file; refining the log file; constructing the road segments using the data present in refined log file; merging the segments which has negligible slope; refining the road intersections; and labeling the points of interest. The quality of outcome of the map making process is demonstrated by experimental results and the results indicate that customized road maps of required routes with good accuracy can be built with the help of the proposed map making process.

Keywords- digital map; global positioning system; floating car data; road network

5. Paper 31051077: Robust stability check of fractional control law applied to a LEO (Low Earth Orbit) Satellite (pp. 30-36)

Full Text: PDF

Ouadiâ EL Figuigui, Noureddine Elalami,

Laboratoire d’Automatique et Informatique Industrielle EMI, Morocco

Abstract: The use of the differentiation and integration of fractional order or non-integer order in systems control is gaining more and more interests from the systems control community. In this paper we will briefly describe the LEO (Low Earth Orbit) satellite systems and recall the theoretical aspects of robust stability check procedure. This procedure will be applied to a LEO satellite that is under the fractional control law. Numerical examples will be analyzed and presented at the end of this document.

Keywords: fractional control, LEO satellite, robust stability

6. Paper 30051054: Performance Evaluation of Genetic Algorithm For Solving Routing Problem In Communication Networks (pp. 37-43)

Full Text: PDF

Ehab Rushdy Mohamed, Faculty of Computer and Informatics, Zagazig University, Zagazig, Egypt,

Mahmoud Ibrahim Abdalla, Faculty of Engineering, Zagazig University, Zagazig, Egypt,

Ibrahim Elsayed Zidan, Faculty of Engineering, Zagazig University, Zagazig, Egypt,

Ibrahim Mahmoud El-Henawy, Faculty of Computer and Informatics, Zagazig University, Zagazig, Egypt

Abstract —There has been an explosive growth in both computer and communication networks since the last three decades. Communication networks pervade our everyday life, from telephony system, to airline reservation systems, to electronic mail services, to electronic bulletin boards, to the internet. Routing problem is one of the most important issues facing the development, improvement and performance of communication networks. Recently, there has been increasing interest in applying genetic algorithms to problems related to communication networks. This study evaluates the genetic algorithm used for finding the shortest path in communication network. The paths result from applying genetic algorithm could be used in establishing routing table for network protocols. The genetic approach is thought to be an appropriate choice since it is computationally simple, provide powerful search capability, and has the ability to move around in the solution space without a dependence upon structure or locality. The performance of the genetic algorithm is compared to Dijkstra algorithm, which is widely used in most network protocols. This is realized using different simulated networks to clarify the advantages and deficiencies of each algorithm. The relative performance of the two algorithms is judged on the basis of delay and adaptation.

7. Paper 25051033: Testing Equivalence of Regular Expressions (pp. 44-46)

Full Text: PDF

Keehang Kwon, Department of Computer Engineering, Dong-A University, Busan, Republic of Korea

Hong Pyo Ha, Department of Computer Engineering, Dong-A University, Busan, Republic of Korea

Abstract— We propose an algorithm that tests equivalence of two regular expressions. This algorithm is written in the style of a sequent proof system. The advantage of this algorithm over traditional algorithms is that it directly captures the real essences regarding language equivalence. As a consequence, our algorithm extends easily to other larger languages with variables.

Keywords- regular expression, equivalence, language, algorithm.

8. Paper 31051079: CRS, a Novel Ensemble Construction Methodology (pp. 47-51)

Full Text: PDF

Navid Kardan, Computer Engineering Dep. IUST, Tehran, Iran

Morteza Analoui, Computer Engineering Dep., IUST, Tehran, Iran

Abstract — Constructing ensemble classifiers that are both accurate and diverse is an important issue of research and challenging task in machine learning. In this paper, we proposed Class-based Random Subspace (CRS) method; a new ensemble construction method based on the random subspace (RS) strategy, and tested it on a number of standard data sets from UCI machine learning repository. Our results show that CRS is at least as good as RS, and outperforms it in datasets with strong correlation between their classes.

Keywords: Random subspace method; Feature selection; Classifier ensemble; Classification

9. Paper 31051072: Routing Optimization Technique Using M/M/1 Queuing Model & Genetic Algorithm (pp. 52-58)

Full Text: PDF

Madiha Sarfraz, M. Younus Javed, Muhammad Almas Anjum, Shaleeza Sohail

Department of Computer Engineering, College of Electrical & Mechanical Engineering, Pakistan

Abstract— Optimization Approaches have been applied to various real life issues in communication and networking. In this research a new approach has been proposed for network path optimization using Genetic Algorithm. The path which is best fitted in the population is considered as the optimal path. It is obtained after qualifying the fitness function measuring criteria. The fitness function measures the best fitted path based on constraints; bandwidth, delay, link utilization and hop count. Population is composition of valid and invalid paths. The length of the chromosome is variable. So the algorithm executes competently in all scenarios. In this paper the comparison of this approach with the fitness function; measuring delay and bandwidth factor, has also been catered. This work has been performed on smaller network; work is in progress on large network. Thus, the results proved our affirmation that proposed approach finds optimal path more proficiently than existing approaches.

10. Paper 31051083: Architectural Description of an Automated System for Uncertainty Issues Management in Information Security (pp. 59-67)

Full Text: PDF

Haider Abbas, Department of Electronic Systems, Royal Institute of Technology, Sweden

Christer Magnusson, Department of Computer and System Sciences, Stockholm University, Sweden

Louise Yngström, Department of Computer and System Sciences, Stockholm University, Sweden

Ahmed Hemani, Department of Electronic Systems, Royal Institute of Technology, Sweden

Abstract— Information technology evolves at a faster pace giving organizations a limited scope to comprehend and effectively react to steady flux nature of its progress. Consequently the rapid technological progression raises various concerns for the IT system of an organization i.e. existing hardware/software obsoleteness, uncertain system behavior, interoperability of various components/methods, sudden changes in IT security requirements and expiration of security evaluations. These issues are continuous and critical in their nature that create uncertainty in IT infrastructure and threaten the IT security measures of an organization. In this research, Options theory is devised to address uncertainty issues in IT security management and the concepts have been deployed/validated through real cases on SHS (Spridnings-och-Hämtningssystem) and ESAM (E-Society) systems. AUMSIS (Automated Uncertainty Management System in Information Security) is the ultimate objective of this research which provides an automated system for uncertainty management in information security. The paper presents the architectural description of AUMSIS, its various components, information flow, storage and information processing details using options valuation technique. It also presents heterogeneous information retrieval problems and their solution. The architecture is validated with examples from SHS system.

Keywords: Information Security, Uncertainty Issues, Options Theory

11. Paper 14041018: Driving Architectural Design through Business Goals (pp. 68-71)

Full Text: PDF

Lena Khaled, Software Engineering Department, Zarqa Private University, Amman, Jordon

Abstract - Architectural design must encompass changes to business goals, their relations to quality attributes overtime and their results upon building the final specific systems. This paper discusses the effect of business goals on building the architectural design on any system. It describes the relationship between business goals and system qualities, and how these qualities are met during architectural design. This paper also describes how the qualities have an effect on the decisions of building the architectural design on any system. The role of the agent is described through the process of building.

Keywords- Bussiness Goals; Qualities; Architectural Design Decisions.

12. Paper 11051005: Distributed Information Sharing Cooperation In Dynamic Channel Allocation Scheme (pp. 72-79)

Full Text: PDF

Mr. P. Jesu Jayarin, Sathyabama University, Chennai-119, India.

Dr. T. Ravi, KCG college of Technology, Chennai-97, India.

Abstract - The Channel allocation method is an Cooperative Asynchronous multichannel MAC which introduces an Distributed Information Sharing (DISH) to be used in a distributed flavor of control-plane cooperation, as a new approach to wireless protocol design and then apply it to multichannel medium access control(MAC) to solve the MCC problem. The basic idea is to allow nodes to share control information with each other such that nodes can make more informed decisions in communication. Medium access control (MAC) protocols play a major role to create a wireless communication infrastructure. In Wireless network, transmitter-receiver pairs make independent decisions, which are often suboptimal due to insufficient knowledge about the communication environment. So, the new concept DISH is introduced and overcomes the problem occurred in the MAC protocol. The DISH concept avoids collision and re-transmission among nodes. The notion of control-plane cooperation augments the conventional understanding of cooperation, which sits at the data plane as a data relaying mechanism. In a multichannel network, DISH allows neighboring nodes to notify transmitter-receiver pairs of channel conflicts and deaf terminals to prevent collisions and retransmissions. Based on this, we design a single-radio cooperative asynchronous multichannel MAC protocol called CAM-MAC. When the CAM-MAC is used in illustration purposes, we choose a specific set of parameters for CAM-MAC. First we analyze the throughput to 91% of the system bandwidth to 96%, then saturate 15 channels and compare the result, this provides an good result in implementing hardware.

Keywords - Distributed information sharing (DISH), control-plane cooperation, CAM-MAC, multichannel coordination problem, MAC protocol, ad hoc networks.

13. Paper 15051008: Key Generation For AES Using Bio-Metic Finger Print For Network Data Security (pp. 80-85)

Full Text: PDF

Dr. R. Seshadri, Director, University Computer Center, Sri Venkateswara University, Tirupati,

T. Raghu Trivedi, Research Scholar, Department of Computer Science, Sri Venkateswara University, Tirupati.

Abstract - Encryption is one of the Essential security technologies for computer data, and it will go a long way toward securing information. The unauthorized thefts in our society have made the requirement for reliable information security mechanisms. Even though information security can be accomplished with the help of a prevailing tool like cryptography, protecting the confidentiality of the cryptographic keys is one of the significant issues to be deal with. Here we proposed a biometric-crypto system which generates a cryptographic key from the Finger prints for encrypting and decrypting the information the popular biometric used to authenticate a person is fingerprint which is unique and permanent through out a person’s

life. Hence, the biometric is gone eternally and possibly for all the applications. If your information traverses on net to reach destination a number of attacks may be done. To protect from attacks we proposed a system which will encrypt the data using AES with biometric based key generation technique.

Key Words: Decryption, Encryption, Histogram Equalization, Minutiae points, Morphological Operation.

14. Paper 18051018: Classification of Five Mental Tasks Based on Two Methods of Neural Network (pp. 86-92)

Full Text: PDF

Vijay Khare, Jaypee Institute of Information Technology, Dept. of Electronics and Communication, Engineering, Nioda, India.

Jayashree Santhosh, Indian Institute of Technology, Computer Services Centre, Delhi, India.

Sneh Anand, Indian Institute of Technology, Centre for Biomedical Engineering Centre, Delhi, India.

Manvir Bhatia, Sir Ganga Ram Hospital, Department of Sleep Medicine, New Delhi, India

Abstract— In this paper performance of two classifiers based on Neural Network were investigated for classification of five mental tasks from raw Electroencephalograph (EEG) signal. Aim of this research was to improve brain computer interface (BCI) system applications. For this study, Wavelet packet transform (WPT) was used for feature extraction of the relevant frequency bands from raw electroencephalogram (EEG) signals. The two classifiers used were Radial Basis Function Neural Network (RBFNN) and Multilayer Perceptron Back propagation Neural Network(MLP-BP NN) . In MLP-BP NN five training methods used were (a) Gradient Descent Back Propagation (b) Levenberg-Marquardt (c) Resilient Back Propagation (d) Conjugate Learning Gradient Back Propagation and (e) Gradient Descent Back Propagation with movementum.

Index Terms— Electroencephalogram (EEG), Wavelet Packet Transform (WPT), Radial Basis Function Neural Network(RBFNN), Multilayer Perceptron back propagation Neural Network(MLP-BP NN), Brain computer interfaces (BCI).

15. Paper 25051047: Sixth order Butterworth Characteristics using LV MOCCII and Grounded Components (pp. 93-97)

Full Text: PDF

T. Parveen, Electronics Engineering Department, Z. H. College of Engineering & Technology, AMU, Aligarh, India

Abstract — This paper introduces an active realization of the sixth order current mode Butterworth filter function using low voltage(LV) Multioutput current conveyors (MOCCII) and grounded passive components. The proposed realization is based on cascading an insensitive single input multi output (SIMO) current mode universal biquadratic filter (UBF). The UBF is constructed employing only two MOCCIIs, four grounded components, that lead to simple structure, easy to design and suitable for IC fabrication. The proposed UBF can realize all standard biquadratic responses without any matching conditions and has current outputs at a high impedance terminal, which enable easy cascadablity. An example of eighth order current mode Butterworth filter has been considered. The filter has the advantages of minimum requirement of active and passive component count, low sensitivity, and high performance. The performance of the filter is verified through PSPICE simulation using low supply voltage.

Keywords-component; Current mode circuits, High order Butterworth filter, Multioutput current conveyors (MOCCIIs), Universal biquadratic filter.

16. Paper 27051042: A Lightweight Secure Trust-based Localization Scheme for Wireless Sensor Networks (pp. 98-104)

Full Text: PDF

P. Pandarinath, Associate Professor, CSE, Sir C R, Reddy College of Engineering, Eluru-534001, Andhra Pradesh

M. Shashi, Head of the Department, Dept. Of CS&SE, Andhra University, Visakhapatnam- 530 003, Andhra Pradesh

Allam Appa Rao, Vice Chancellor, JNTU Kakinada, Kakinada, Andhra Pradesh

Abstract— Location based security plays an important role in the trustworthiness of wireless sensor networks and the results that are obtained from them. Enforcement of location-aware security policies requires trusted location information. As more of these location-dependent services get deployed, the mechanisms that provide location information will become the target of misuse and attacks. In this paper, we propose to design a protocol that validates the reliability of location information associated with event reports. The protocol depends on the collaborative interaction of the network nodes to find compromised nodes. Nodes in the network record information of routing paths taken by packets through the network. Upon receiving the route request packets from the nodes, the sink checks whether their route matches a historically expected behavior by packets from the same claimed location. A trust value for the location claim of this request is then created by the sink. The attached trust values will be used to certify the truthfulness of the packets location information. Since this scheme does not involve any complex cryptographic operations, it has less overhead and delay. By simulation results, we show that our proposed scheme attains good delivery ratio with reduced delay and overhead.

Keywords- Localization; Wireless Sensor Networks; Trust;Security issues; Lightweight Secure Trust-based Localization (LSTL)

17. Paper 30051051: Mechanism to Prevent Disadvantageous Child Node Attachment in HiLOW (pp. 105-110)

Full Text: PDF

Lingeswari V.Chandra, Kok-Soon Chai and Sureswaran Ramadass, National Advanced IPv6 Centre, Universiti Sains Malaysia

Gopinath Rao Sinniah, MIMOS Berhad, 57000 Kuala Lumpur

Abstract— Vast research is being conducted in the area of Wireless Sensor Network in recent years due to it foreseen potential in solving problems covering many aspects of daily, industrial and ecological areas. One of the biggest challenges in the power and memory constrained sensor network is in establishing reliable network and communication among the nodes. . IP-based 6LoWPAN was introduced to give a new dimension to sensor network by enabling IPv6 to be applied to the wired as well as wireless sensors. An extendable and scalable Hierarchical Routing Protocol for 6LoWPAN (HiLOW) is one of three routing protocols which has been introduced specially for 6LoWPAN. HiLOW was designed by exploiting the dynamic 16 bit short addresses assignment capabilities featured by 6LoWPAN. HiLOW clearly defines the network setup process, address allocation method and routing mechanism. However there are shortcomings or issues pertaining HiLOW that make it less efficient. One of the major issues identified in HiLOW is in the process of selecting the parent node to attach with during the network tree setup. Disadvantageous parent selection could lead to significant shorter life span of the network which affects the reliability and stability of the network. In this paper we review the HiLOW routing protocol, highlight the issues revolving HiLOW and suggest a mechanism to prevent disadvantageous child node attachment in HiLOW. The proposed mechanism takes into consideration the LQI value, the potential parents’ depth in the network and the average energy level of the parent in selecting the suitable parent node in order to provide a more reliable wireless sensor network.

Keywords- 6LoWPAN, routing protocol, HiLOW, WSN, Hierarchichal routing protocol

18. Paper 30051052: Rough Entropy as Global Criterion for Multiple DNA Sequence Alignment (pp. 111-118)

Full Text: PDF

Sara El-Sayed El-Metwally, Demonstrator, Computer Science Departement, Faculty of Computer and information Science, Mansoura University, Egypt.

Dr. ElSayed Foad Radwan, Lecturer,Computer Science Departement, Faculty of Computer and information Science, Mansoura University, Egypt.

Ass. Prof. Taher Tawfek Hamza, Vice Dean for Graduate Studies and Research, Assistant Professor, Computer Science Departement, Faculty of Computer and information Science, Mansoura University, Egypt.

Abstract - This paper presents a new method for multiple sequence alignment using rough entropy as a global criterion to measure the quality of alignment. This method collects DNA sequences in clusters based on rough sets indcernibility relation. Rough entropy is used to maximize the total number of sequences inside each cluster with respect to the total number of sequences being aligned. The method terminates when all aligned sequences are located in all clusters and hence the problem is near optimally solved.

Keywords-Multiple Sequence Alignment MSA, Rough Set Theory, Indcernibility relation,Rough Entropy, Similarity relation SIM(P),SP(x).

19. Paper 30051053: Weighted Attribute Fusion Model for Face Recognition (pp. 119-125)

Full Text: PDF

S. Sakthivel, Assistant Professor, Department of Information Technology, Sona college of Technology, Salem, India

Dr. R. Lakshmipathi, Professor, Department of Electrical and Electronic Engineering, St. Peter’s Engineering College, Chennai, India

Abstract — Recognizing a face based on its attributes is an easy task for a human to perform as it is a cognitive process. In recent years, Face Recognition is achieved with different kinds of facial features which were used separately or in a combined manner. Currently, Feature fusion methods and parallel methods are the facial features used and performed by integrating multiple feature sets at different levels. However, this integration and the combinational methods do not guarantee better result. Hence to achieve better results, the feature fusion model with multiple weighted facial attribute set is selected. For this feature model, face images from predefined data set has been taken from Olivetti Research Laboratory (ORL) and applied on different methods like Principal Component Analysis (PCA) based Eigen feature extraction technique, Discrete Cosine Transformation (DCT) based feature extraction technique, Histogram Based Feature Extraction technique and Simple Intensity based features. The extracted feature set obtained from these methods were compared and tested for accuracy. In this work we have developed a model which will use the above set of feature extraction techniques with different levels of weights to attain better accuracy. The results show that the selection of optimum weight for a particular feature will lead to improvement in recognition rate.

Keywords- Face Recognition, Feature Fusion Method, Parallel Method, PCA, DCT, Histogram Matching

20. Paper 30051055: A DNA and Amino Acids-Based Implementation of Playfair Cipher (pp. 126-133)

Full Text: PDF

Mona Sabry, Mohamed Hashem, Taymoor Nazmy, Mohamed Essam Khalifa

Computer Science department, Faculty of Computer Science and information systems, Ain Shams University, Cairo, Egypt.

Abstract-- The DNA cryptography is a new and very promising direction in cryptography research. Although in its primitive stage, DNA cryptography is shown to be very effective. Currently, several DNA computing algorithms are proposed for quite some cryptography, cryptanalysis and steganography problems, and they are very powerful in these areas. This paper discusses a significant modification to the old Playfair cipher by introducing DNA-based and amino acids-based structure to the core of the ciphering process. In this study, a binary form of data, such as plaintext messages, or images are transformed into sequences of DNA nucleotides. Subsequently, these nucleotides pass through a Playfair encryption process based on amino-acids structure. The fundamental idea behind this encryption technique is to enforce other conventional cryptographic algorithms which proved to be broken, and also to open the door for applying the DNA and Amino Acids concepts to more conventional cryptographic algorithms to enhance their security features.

Keywords: DNA, amino acids, encryption, decryption, cryptography, security, Playfair cipher.

21. Paper 30051061: Ultra Wideband Slot Antenna with Reconfigurable Notch bands (pp. 134-139)

Full Text: PDF

J. William and R. Nakkeeran,

Department of Electronics and Communication Engineering, Pondicherry Engineering College, Puducherry, India . 605014.

Abstract— An Ultra Wideband (UWB) slot antenna with reconfigurable notch bands is presented in this paper. The basic UWB antenna consists of a rectangular slot with triangular structure that acts as a tuning stub with CPW feed. The CPW feed is designed for 50 Ω impedance. The notch band is achieved by inserting a rectangular slot in the ground plane with a effective length of λ/2. The reconfigurable rejection of the bands 3.1 GHz – 3.9 GHz, 4 GHz–5.3 GHz and 4.1 GHz–5.9 GHz are achieved by switching the diodes placed over the slot in the ground plane. The characteristics of the designed structure are investigated by using MoM based electromagnetic solver, IE3D. The return loss (S11) of the antenna is measured and that are comparable with the simulation results. The proposed antenna covers the entire UWB range 3.1 GHz to 10.6 GHz with reconfiguration. The low profile and simple configuration of the proposed antenna leads to easy fabrication that may be built in any wireless UWB device applications where reconfigurable rejection bands are required. The rejection of WiMax, IEEE 802.11a and HYPERLAN/2 bands can be achieved by using the proposed antenna design.

Keywords- coplanar waveguide; notch band; slot antenna; reconfiguration; ultra wideband

22. Paper 31051073: UWB Slot Antenna with Rejection of IEEE 802.11a Band (pp. 140-145)

Full Text: PDF

J. William and R. Nakkeeran

Department of Electronics and Communication Engineering, Pondicherry Engineering College, Puducherry, India . 605014.

Abstract— A compact coplanar waveguide (CPW) fed slot antenna for ultra wideband (UWB) with notched band from 5.1 GHz to 5.9 GHz is presented in this paper. By inserting a rectangular slot with the particular length and width in the ground plane, a desired notch in the frequency band can be achieved. The characteristics of the designed structure are investigated using an electromagnetic solver, IE3D. The overall size of the antenna comes around 28(L) × 21(W) × 1.6(T) mm3. For the developed antenna the VSWR is measured and compared with the simulated results. The measured parameter is in good agreement with the simulation and the antenna covers entire UWB band ranging from 3.1 GHz to 11.4 GHz with band notching between 5.1 GHz and 5.9 GHz. Time domain analysis of the antenna is also investigated and presented, which ensures that the antenna is capable of working effectively in the UWB environment. This type of antenna configuration would be quiet useful for UWB indoor applications with no interference from WLAN and HYPERLAN/2 systems when they coexist.

Keywords- band notch; coplanar waveguide; slot antenna; time domain analysis; ultra wideband

23. Paper 31051086: A Study Of Various Load Balancing Techniques In Internet (pp. 146-153)

Full Text: PDF

M. Azath, Research Scholar, Anna University, Coimbatore.

Dr. R.S.D. Wahida banu, Research Supervisor, Anna University, Coimbatore.

Abstract - One of the most important applications of traffic engineering is load balancing. Successful implementation of load balancing depends on the underlying routing protocol that provides connectivity through the Internet by determining the routes used by traffic flows. But the load-balancing problem is not yet solved completely; new applications and architectures are required to meet the existing or incoming fastest Internet world. And, for greatest impact, these new capabilities must be delivered in toolkits that are robust, easy-to-use, and applicable to a wide range of applications. For balancing traffic in internet, packets should be reorder, reordering also having a problem for flows in internet. In Internet, unresponsive flows easily occupy the limited buffers, there by reducing the Quality of Service (QoS). In this paper, various techniques that are adopted for load balancing in Internet are analyzed.

Keywords: Traffic engineering, Load Balancing, Internet Services, unresponsive flows, QOS, Buffer, Traffic splitting and Router.

24. Paper 30051058: Laboratory Study of Leakage Current and Measurement of ESDD of Equivalent Insulator Flat Model under Various Polluted Conditions (pp. 154-158)

Full Text: PDF

N. Narmadhai, Senior Lecturer, Dept of EEE Government College of Technology Coimbatore, India

S. Suresh, PG Scholar, Dept of EEE, Government College of Technology, Coimbatore, India

Dr. A. Ebenezer Jeyakumar, Director (Academics), SNR Sons Charitable Trust, SREC Coimbatore, India

Abstract—The phenomenon of flashover in polluted insulators has been continued by the study of the characteristics of contaminating layers deposited on the surface of insulators in high voltage laboratories. This paper proposed the Equivalent insulator flat plate model for studying the flashover phenomena due to pollution under wet conditions even at low voltage. Laboratory based tests were carried out on the model under AC voltage at different pollution levels. Different concentrations of salt solution has been prepared using sodium chloride, Kaolin and distilled water representing the various contaminations. Leakage current during the experimental studies were measured. A conductivity measuring instrument (EQ-660 A) is used to measure the conductivity of the salt-solution. Salinity and Equivalent salt Deposit Density (ESDD) were calculated. Test results in terms of conductivity and ESDD are plotted against salt concentration and the relationship between the conductivity and ESDD is examined. Reported results of this preliminary study on the insulator model simulates the distinctive stages of development of flashover due to the pollution and it could be easily identified from the contamination level of ESDD and from the magnitude of leakage current.

Keywords-Conductivity, ESDD, Flashover, Insulator model, Leakage Current, Salt solution.

25. Paper 31051076: SSL/TLS Web Server Load Optimization using Adaptive SSL with Session Handling Mechanism (pp. 159-164)

Full Text: PDF

R. K. Pateriya, J. L. Rana, S. C. Shrivastava

Department of Computer Science & Engineering and Information Technology, Maulana Azad National Institute of Technology, Bhopal, India

Abstract — Secure Sockets Layer (SSL) is the world standard for web security. SSL provide authentication ,data integrity and ensure message confidentiality using cryptography. This paper proposes an approach for load management by applying Adaptive SSL (ASSL) policy with session handling mechanism for enhancement of the security and performance of the server . ASSL policy negotiate session security at runtime by adapting more secured and comparatively costly cryptographic algorithm at runtime if load is under safe limit otherwise change to less secure algorithm. Session handling mechanism limit the active session running on the server .This self-adaptive security policy offers great potential in providing timely fine grained security control on server and therefore enhance performance and security of e-commerce sites.

Keywords- Admission control, E-commerce, Overload control, Security, SSL Session.

26. Paper 15051011: An Enhancement On Mobile TCP Socket (pp. 165-168)

Full Text: PDF

S. Saravanan, Research Scholar, Sathyabama University, Chennai-119, India.

Dr. T. Ravi, Prof & Head, Dept of CSE ,KCG College of Technology,Chennai,India

Abstract – A TCP session uses IP addresses (+ IP port) of both end points as identifiers. Therefore when a mobile handover to a new AP that belong to a different subnet/domain, the IP address will changes and ongoing TCP connections are reset. Several approaches have been proposed to solve this problem, and one of which was to modified the TCP/IP stack to update the changes of the IP address for the ongoing connections [5] [6]. However, these proposals causes unnecessary processing when TCP is used in applications which have already employed some kinds of security measures, such as SIP. This paper proposes the Mobi Socket, which specifically supports TCP mobility for intrinsic secure applications without unnecessary overhead.

27. Paper 15051017: Modern Computer Graphics Technologies Used at Educational Programs and Some Graphical output screens (pp. 169-171)

Full Text: PDF

N. Suresh Kumar, S. Amarnadh, K. Srikanth, Ch. Heyma Raju, GIT, GITAM University, Visakhapatnam

D.V. Rama Koti Reddy, College of Engineering, Andhra University, Visakhapatnam

R. Ajay Suresh Babu, Raghu Engineering College, Visakhapatnam

K. Naga Soujanya, GIS, GITAM University, Visakhapatnam

Abstract - In This paper a new technique is implemented to teach microprocessor and to clarify the doubts in the subject microprocessor. Although a lecturer has many aids to explain the topic in the class room, but a graphical environment is more power full environment in the present education scenario, which can improve the student level of understanding. The graphical interface develops the concepts of the student graphics concepts and also a student can easily grasp any level of task. The lecturer shows a visual object or animated show to the student to explain the particular topic in the class room. This work includes the framework of graphics programming; students can concentrate on the technical subject. Thus they acquire a method to construct computer graphics programs in many ways and gain knowledge in the concerned technical paper. The project have used for six years, and convinced of the positive effect.

28. Paper 20051023: Impact of language morphologies on Search Engines Performance for Hindi and English language (pp. 172-178)

Full Text: PDF

Dr. S.K Dwivedi, Reader and Head, Computer Science Dept., BBAU, Lucknow, India.

Rajesh Kr. Gautam, Research Scholar, Computer Science Dept., BBAU, Lucknow, India.

Parul Rastogi, Research Scholar, Computer Science Dept., BBAU, Lucknow, India.

Abstract - Search Engines are the basic tools of Information Retrieval on the web. The performance of the search engines are affected by various morphological factors of the language. The paper covers the comprehensive analysis and also the comparison of the impact of morphological factors and other language structure related factors (like sense ambiguity, synonyms) on the performance of Hindi and English language information retrieval on the web.

Keywords: Hindi language morphology; English language morphology; web searching; morphological structure; precision; Hindi language Search Engines.

29. Paper 20051029: Comparison of Traffic in Manhattan Street Network in NS2 (pp. 179-182)

Full Text: PDF

Ravinder Bahl, Rakesh Kumar,Department of Information and Technology, MMEC, Muallana, Ambala, Haryana, India

Rakesh Sambyal, Information and Technology, MBS College of Engineering and Technology, Babliana, Jammu, Jammu and Kashmir,India

Abstract— The paper presents the Comparison analysis of traffic in Manhattan Street Network (MSN). The behaviour of Manhattan Street Network for constant bit rate (CBR) and exponential traffic sources is demonstrated. The results are produced using NS2 simulator. It is concluded that the performance in multipath networks like MSN can be improved by taking account of appropriate buffering for each traffic source at the link node.

Keywords— Comparison Analysis, Traffic, Constant bit rate (CBR), Exponential, MSN, Buffering.

30. Paper 25051036: An Evolving Order Regularized Affine Projection Algorithm, suitable for Echo Cancellation (pp. 183-187)

Full Text: PDF

Shifali Srivastava, Electronics Deptt., JIIT, Noida, India

M.C. Srivastava, Electronics Deptt., JIIT, Noida, India

Abstract— In this paper, a regularized Affine Projection algorithm with Evolving Order is proposed. This algorithm automatically determines its projection order, derived in the context of acoustic echo cancellation (AEC). The simulation results indicate that the proposed algorithm yields better performance with small steady state error as compared to existing evolving order affine projection algorithm (APA) and has fast convergence speed.

Keywords—Acoustic echo cancellation (AEC), affine projection algorithm (APA), evolving order affine projection algorithm (EO-APA), Evolving order regularized affine projection algorithm (EO-RAPA), double talk(DT), echo path change (EPC).

31. Paper 30051060: Design and Implementation of Flexible Framework for Secure Wireless Sensor Network Applications (pp. 188-194)

Full Text: PDF

Inakota Trilok, Department of Computer Science & Engineering, National Institute of Technology Warangal, India

Mahesh U. Patil, National Ubiquitous Computing Research Centre, Centre for Development of Advanced Computing, Hyderabad, India

Abstract—Secure communications is an interesting and challenging research area in Wireless Sensor Networks (WSN) fundamentally because of the low power constraints and small memory footprints inherent in the technology. In this context, there are many hardware platforms like TelosB, MicaZ and Mote2 which implement a security layer in hardware, supporting multiple modes of operation like encryption, integrity or combinations of both. However, not all hardware platforms support hardware security which creates avenues of research in designing low power security algorithms in software. As with the development of security algorithms for WSN applications, there is an urgent requirement to create a unified approach for application developers by which they can integrate and use existing security algorithms thereby maintaining an abstraction from the intricacies of the algorithm. This paper introduces a flexible framework which implements a unified API to add new security algorithms to a security library suite. This library integrates existing security algorithms like TinySec, MiniSec etc. We also bring out the implementation of Advanced Encryption Standard (AES) in software supporting its various modes of operation. We have integrated this implementation with the unified framework and demonstrated its performance and our results. We compare our software AES implementation with the Hardware AES implementation, in all the supported mode settings.

Keywords- Wireless Sensor Networks; Mote; Link Layer Security; Network Layer Security; Hardware Level Security, Integrity; Encryption; Authentication.

32. Paper 31051070: Optimizing the Application-Layer DDoS Attacks for Networks (pp. 195-200)

Full Text: PDF

P. Niranjan Reddy, K. Praveen Kumar, M. Preethi,

KITS, Warangal, A.P. , India

Abstract – The main aim of the proposed framework is to implement the Application-Layer DDoS Attacks Optimizing for Popular Websites that employing legitimate HTTP requests to flood out victim resources and to implement an effective method to identify whether the surge in traffic is caused by App-DDoS attackers or by normal Web surfers.

Keywords: Terms – Application-layer, distributed denial of service (DDoS), popular website.

33. Paper 08051002: Survey – New Routing Technique for Grid Computing (pp. 201-206)

Full Text: PDF

R. Rameshkumar, Research Schlolar, J.N.T. University, Kukatpally, Hyderabad.

Dr. A. Damodaram , Director/ U.G.C Academic Staff College, J.N.T. University, Kukatpally, Hyderabad.

Abstract- Trust plays an indispensable role in grid computing. Trust-management systems provide applications with a standard interface for getting answers to such questions and provide users with a standard language for writing the policies and credentials that control what is allowed and what isn’t. Using a trust-management system for controlling security-critical services frees the application developer from a number of often difficult design and implementation issues and allows users to take advantage of a flexible, standard, application-independent language for specifying policy. In this paper, we develop trust management architecture for trust enhanced Grid security incorporating a novel trust model which is capable of capturing various types of trust relationships that exist in a Grid system and providing mechanisms for trust evaluation, recommendations and update for trust decisions. The outcomes of the trust decisions can then be employed by the Grid security system to formulate trust enhanced security solutions. Here we put forth ant algorithm for implementation. The ant colony algorithm is an algorithm for finding optimal paths that is based on the behavior of ants searching for food. At first, the ants wander randomly. When an ant finds a source of food, it walks back to the colony leaving "markers" (pheromones) that show the path has food. When other ants come across the markers, they are likely to follow the path with a certain probability. If they do, they then populate the path with their own markers as they bring the food back. As more ants find the path, it gets stronger until there are a couple streams of ants traveling to various food sources near the colony.

Key words - Grid computing, security, trust, Ant Colony, Service Request.

34. Paper 27051037: A Forager Bees Behaviour Inspired approach to predict the forthcoming navigation pattern of online users (pp. 207-215)

Full Text: PDF

V. Mohanraj, Assistant Professor/IT, Sona College of Technology, Salem, Tamilnadu, India

Dr. R. Lakshmipathi, Professor/EEE, St. Peters Engineering College (Deemed University), Chennai, Tamilnadu, India

J Senthilkumar, Assistant Professor/IT, Sona College of Technology, Salem, Tamilnadu, India

Y. Suresh, Assistant Professor/IT, Sona College of Technology, Salem, Tamilnadu, India

Abstract— The World Wide Web is continuously growing and become de facto place to conduct online business. In the current internet world, peoples are more attracted towards participating in the e-commerce sites. The real challenge for the web master of any such website is to find the users need in advance and provide the resources pages that keep them interested in browsing their site. It is easy for any unsatisfied user to reach out the counterpart site in a single click. Many Web usage mining methods were adopted to work on web server log and predict the forthcoming navigation pattern of user. However, the accuracy of the methods can’t satisfy the user especially in huge site. This paper presents the forager bees behaviour inspired Forager agent based architecture that uses its collective intelligence for predicting the forthcoming navigation pattern of user. Our practical implementation shows that accuracy and coverage measures are very much improved than existing methods.

Keywords-Web Usage Mining; Web Personalization; Artificial Bee Colony.

35. Paper 27051038: Quality of Service Issues in Wireless Ad Hoc Network (IEEE 802.11b) (pp. 216-221)

Full Text: PDF

Mohammed Ali Hussain, Research Scholar, Dept. of CSE, Acharya Nagarjuna University, Guntur, A.P., India.

Mohammed Mastan, Research Scholar, Dept. of CSE, JNT University, Kakinada, A.P., India.

Syed Umar, Research Scholar, Dept. of CSE, Dravidian University, Kuppam, A.P., India.

Abstract --- A wireless Ad-hoc network consists of wireless nodes communicating without the need for a centralized administration, in which all nodes potentially contribute to the routing process. In this paper, we report Fluctuations in channel quality effect the QoS metrics on each link and the whole end-to-end route. The interference from non-neighboring nodes affects the link quality. QoS is an essential component of ad-hoc networks. The most commonly studied QoS metrics are throughput, bandwidth, delay and jitter. Bandwidth is the QoS metric that has received the most attention in the QoS literature. The QoS requirements are typically met by soft assurances rather than hard guarantees from the network. Most mechanisms are designed for providing relative assurances rather than absolute assurances.

Keywords: QoS, Ad-hoc, Throughput, Bandwidth, Delay, Jitter, 802.11.

36. Paper 27051049: Collaborative Web Recommendation Systems based on Association Rule Mining (pp. 222-227)

Full Text: PDF

A. Kumar, Research Scholar, Department of Computer Science & Engineering, Sathyabama University, Chennai, India.

Dr. P. Thambidurai, Department of Computer Science & Engineering, Pondicherry Engineering College, Puducherry, India.

Abstract— Massive development of internet in recent years necessitate the development of recommender systems that turn out to be user friendly in web applications. Recommender systems make an effort to outline user preferences over items, and model the relation between users and items. There are two elemental approaches that can be applied when generating recommendations systems. They are content based web recommender system and the other is collaborative web recommender system. This proposed paper presents a method of developing a collaborative web recommendation systems using association rule mining. The association rules were applied to personalization based on web usage data. The method utilize apriori algorithm to generate association rules. In general association rule mining is a technique common in data mining that attempts to discover patterns of products that are purchased together. The greater part of web page recommender systems that were proposed earlier utilized collaborative filtering. Web Content Recommendation has been an active application area for Information Filtering, Web Mining and Machine Learning research. The future work explains some of the modifications using other algorithms to generate the association rules that can be adopted on existing web recommendation system to make them functionally more effective. In order to explore the performance of the proposed web recommendation system experiments were conducted on available dataset. The performance of the proposed approach is best illustrated by comparing it with K-nearest neighboring algorithm.

Keywords---Association Rules, Apriori Algorithm, Collaborative Recommender System, Information Filtering, Machine Learning, and Web Mining.

37. Paper 31051065: Similarity Based Imputation Method For Time Variant Data (pp. 228-232)

Full Text: PDF

Dr. F. Sagayaraj Francis, Saranya Kumari Potluri, Vinolin Deborah Delphin, Vishnupriya. B

Pondicherry Engineering College, Pondicherry, India

Abstract —The intent of any analysis is to make valid inferences regarding a population of interest. Missing data threatens this goal if it is missing in a manner which makes the sample different than the population from which it was drawn, that is, if the missing data creates a biased sample. Therefore, it is important to respond to a missing data problem in a manner which reflects the population of inference. This paper deals with the proposal of an efficient method of filling missing data called Similarity based Imputation Method (SIM). SIM processes the target segment by extracting its features and based on the extracted features the target segment is classified into its appropriate cluster which has complete data segments, which are similar to the target segment. Now from the similar segments within the identified cluster, the most identical segment is found using similarity measure and the values substituted from that complete segment

Keywords-- Imputation, Time variant Multi-dimensional data, Clustering, Feature Extraction, Similarity measure, Segment Matching

38. Paper 31051075: Efficient Node Search in P2P Using Distributed Spanning Tree (pp. 233-239)

Full Text: PDF

P. Victer Paul, T.Vengattaraman, M.S. Saleem Basha, P. Dhavachelvan

Department of Computer Science, Pondicherry University, Puducherry, India.

R. Baskaran, Department of Computer Science and Engineering, Anna University, Chennai, India.

Abstract - Peer to Peer (P2P) networks are the important part of the next cohort of Internet, so how to search the node in the P2P networks efficiently is the key problem of the perception of the P2P network. However, the node search process in unstructured P2P is not efficient because the same search message may go through a node multiple times. To ease the complex search and improve the search efficiency, we propose a mechanism using the interconnection structure called Distributed Spanning Tree (DST) which facilitates the P2P Network into a layered structure to improve the node search technique. The performance evaluations of simulation demonstrate that the proposed mechanism can improve the node search efficiency of P2P systems.

Keywords: Peer to Peer, Distributed Spanning Tree, Node Search, Ant colony optimization

39. Paper 31051085: A new Peer to Peer Caching Techniques for Transmission The Video over Wireless Ad Hoc Network (pp. 239-245)

Full Text: PDF

Saleh Ali K. Al-Omari, Putra Sumari, Mohammad Azmi Q. Al-Madi

School of Computer Science, Universiti Sains Malaysia, Penang, Malaysia

Abstract—In our life today’s the wireless networks becomes so significant due to the advancing in science and technology. It is also playing an important role in many applications in our daily lives especially in widespread Ad Hoc network. Ad hoc networks are the wireless mobile networks to create a communication between the nodes or devices without using any existing fixed network infrastructure. Currently multimedia services are applied to ad hoc networks where the problem of the mobility constantly makes an interruption of the video packets transmission. This paper proposes a new peer to peer caching techniques using radius based binary search algorithm (RBBSA) and mobile management in order to solve the problem at the same time proposed the cluster head to provide Video services to other nodes or devices. In turn to transmit video packages through ad hoc network, layered scalable video coding are adopted where the video is encoded into a three layers by layered scalable video coding. The result for this new technique that the hit ratio of the peer to peer can increase the catching and reduce the cache distance, where the cluster head for the node mechanism can provide the Video to another nodes which the node acting as server. It also extends the range of the services as well to make lesser load on the main cluster head or server.

Keywords-wireless ad hoc networks, RBBSA, ad hoc network, peer to peer (P2P), random caching, mobile management.

40. Paper 25051035: Finding near optimal solution for Graph Coloring Problem using Parallel Genetic Algorithm (pp. 246-250)

Full Text: PDF

Fardin Esmaeeli Sangari, Sama organization (affiliated with Islamic Azad Universi-ty)-Mamaghan Branch

Seyed Mostafa Mansourfar, Sama organization (affiliated with Islamic Azad Universi-ty)-Mamaghan Branch

Ali Hosseinalipour, Sama organization (affiliated with Islamic Azad Universi-ty)-Mamaghan Branch

Abstract—in this paper a new parallel genetic algorithm is proposed to find near optimal solution for k-graph coloring problem. In the algorithm we have applied a coarse-grained model of parallelism, along with two new algorithms for cros-sover and mutation are represented: FCX and Fmm. these algorithms compared with CEX’s First Fit and Transposition mutation operators. We will see that combining FCX and Fmm will yield more correct solutions in better time. In computer simulations of PGA we used DIMACS benchmark.

Key words—parallel genetic algorithm; Graph coloring problem; FCX; Fmm; migration model; migration strategy

41. Paper 23051030: New method for increase reliability in WSNs (pp. 251-255)

Full Text: PDF

Saeid Aga alizadeh, Department of Computer Engineering, Islamic Azad University- Shabestar Branch, Shabestar Iran

Shahram Babaie, Department of Computer Engineering, PhD students, Islamic Azad University, Olom VA Tahghighat Branch, Tehran, Iran

Ahmad Khadem Zade, Department of Computer Engineering, Iran Telecommunication Research Center, Tehran, Iran

Ali Hosseinalipour, Department of Computer Engineering, Islamic Azad University- Tabriz Branch, Tabriz Iran

Abstract - Recent advances in Wireless Sensor Networks (WSN) have led to many new protocols specifically designed for different kinds of applications where energy efficiency is an essential consideration. Limitations of wireless sensor networks make it more prone to failure. Thus after discussing disadvantages of SPIN, GAF, DSDV, TinyLAP, EAR and FDDA protocols, In this paper we offer a way that all Data-Center protocols can send and receive data to use this information to be received by the sink properly. The method for sending data from two different path and use the node could vote. Our simulation results show that our algorithm increases network lifetime and reliability as well.

Keywords-component; Data-center protocols, Reliability, lifetime, Wire

42. Paper 08051001: Performance Counter Monitoring Mechanism for Measuring QoS Attributes in SOA (pp. 256-262)

Full Text: PDF

Bahareh Sadat Arab, Universiti Putra Malaysia, Faculty of computer science and information technology, UPM, 43400 upm serdang, selongor, Malaysia, Kuala Lumpur, Malaysia

Abdul Azim Abd Ghani, Universiti Putra Malaysia, Faculty of computer science and information technology, UPM, 43400 upm serdang, selongor, Malaysia, Kuala Lumpur, Malaysia

Rodziah Binti Atan, Universiti Putra Malaysia, Faculty of computer science and information technology, UPM, 43400 upm serdang, selongor, Malaysia, Kuala Lumpur, Malaysia

Abstract— Nowadays, many similar web services with same functionalities have been developed around the world. When multiple web services provide same functionalities, Quality of Service (QoS) turns to an important issue. In this paper, monitoring is used in order to measure QoS attributes of web services in Service-Oriented Architecture (SOA). Windows Performance Counters (WPC) is a windows component which supports application monitoring. The main focus of this paper is applying performance counters for monitoring of web services in order to measure their QoS attributes such as response time and throughput at provider-side. We introduce CWPC monitoring approach in detail and we describe employing performance counter facilitate QoS measurement process. Additionally, the results of monitoring via performance counter for measuring QoS attributes such as response time and throughput are presented which can be considered for taking management decisions like adjusting proper monitoring interval.

Keywords- monitoring, performance counter, web services, Quality of Service, SOA

43. Paper 31051074: Effective Packet Management Scheme in Wireless Ad-Hoc Networks using Distributed Spanning Tree (pp. 263-269)

Full Text: PDF

J. Amudhavel*, M.S.Saleem Basha*, T. Vengattaraman*, P. Dhavachelvan*, R. Baskaran#

*Department of Computer Science, Pondicherry University, Puducherry, India.

#Department of Computer Science and Engineering, Anna University, Chennai, India.

Abstract—Effective Packet Management(PM) is widely used in distributed environments to reduce the access costs and improve data availability. Therefore, Packet transmission in wireless environment becomes one of the important challenges for effective data transfer. This paper addresses the issues in maintaining the effective packet management in the wireless ad hoc network environments and proposes an effective solution for the same using an optimization technique. The proposed approach concentrate on local consistency issues which occurred in the network environment. Therefore, this paper evaluates the efficiency of existing techniques, and proposes a more efficient local packet management algorithm. The new algorithm leverages existing techniques which are shown to be efficient. This paper also addresses the advantages and disadvantages of various packet management and its issues.

Keywords- Packet Management, Local Packet, Distributed Spanning Tree, Wireless Application, QOS Parameters, Performance Evaluation, Ad-Hoc Networks.