IOSR Journal of Computer Engineering (IOSR-JCE)

Nov. - Dec. 2016 Volume 18 - Issue 6

Version 1 Version 2 Version 3 Version 4 Version 5 Version 6

Paper Type : Research Paper
Title : Designing Educational Computer Games to Enhance Teaching and Learning
Country : Bulgaria
Authors : Georgi Krastev || Valentina Voinohovska

Abstract: The paper presents an overview of the potential of educational computer games for enhancing teaching and learning activities. When applied to educational contexts, educational computer games can enhance students' intrinsic motivation to learn, encourage learning by doing, encourage meaningful learning and provide risk-free environments which enable learners to explore and experiment

Keyword: Educational games, learning, teaching

[1] Ferdig, R. Learning and Teaching with Electronic Games, Association for the Advancement of Computing in Education, 2006.
[2] Griffith, C. Real-World Flash Game Development How to Follow Best Practices and Keep Your Sanity, Elsevier, p.511, 2012.
[3] Cruz-Cunha, M. Computer Games as Educational and Management Tools: Uses and Approaches, IGI Global, p. 358, 2011.
[4] Whitton, N. Learning with Digital Games A Practical Guide to Engaging Students in Higher Education, Taylor and Francis, p. 231, 2010.
[5] http://www-01.ibm.com/software/solutions/soa/innov8/index.html, Retrieved January, 2013.


Paper Type : Research Paper
Title : Big Data Authentication Using Cloud Storage with Fine Grained Updates
Country : India
Authors : Manoj Kottawar || Omshankar Swami || Govind Sakhare || Gaurav Shiraskar || Prof. Sachin Patil

Abstract: Now a days cloud computing is one of the intensively growing technology.Cloud computing is storing and accessingbased program over the internet without use of your computer's hard drive. Proposed system mainly focuses on security of private confidential data stored on cloud. Now a day's use of cloud increasing rapidly.In order to manage security of private/confidential data we need an effective system. In proposed work we provide system which continuously interact with the content owner of cloud and gives continuous updates to content owner.Existing system also audits data which result in time consuming process.Instead of checking on whole data whether the updates are going on or not in system, proposed system divides the whole data in blocks and system checks that particular updated block where changes occurs. Hence proposed systemprovides reliability and enhanced security.

[1]. "Fine Grained Updates in Cloud Using Third Party Auditing" M Paventhan, C Murugavel, S Rajadurai
[2]. "Authorized Public Auditing of Dynamic Big Data Storage on Cloud with Efficient Verifiable Fine-Grained Updates"
[3]. "Authorized Public Auditing of Dynamic Big Data Storage on Cloud with Efficient Verifiable Fine-Grained Updates".Chang Liu, Jinjun Chen, Senior Member, IEEE, Laurence T. Yang, Member, IEEE, Xuyun Zhang, Chi Yang, Rajiv Ranjan, and Ramamohanarao
[4]. " Public Auditing of Dynamic Big Data Storage with Efficient High Memory Utilization and ECC Algorithm"G.Janani1, C.Kavitha2 P.G Scholar, Department of CSE, Sri Shanmugha College of Engineering and Technology, Pullipalayam, Salem (Dt), India1 Assistant Professor, Department of CSE, Sri Shanmugha College of Engineering and Technology, Pullipalayam, Salem (Dt), India2
[5]. "Improving Flexibility, Scalability and Fine-Grained Access Control using Hierarchical Attribute Set Based Encryption (HASBE) and Security in Cloud Computing". Prashant A. Kadam*, Dinesh M. Yadav Department of Computer Engineering & Savitribai Phule Pune University, Maharashtra, India.


Paper Type : Research Paper
Title : A Study to the different implementation approaches for the Grid YM-Algorithm DNA alignment
Country : Egypt
Authors : Mohamed Assal || Ahmed Said || Soha Souliman || Ahmed Essam

Abstract: DNA Multiple sequence alignment is common bioinformatics application that determines the similarity between a new sequence with other exist sequences. Needleman-Wunsch algorithm is the most famous algorithm for DNA global alignment. Unfortunately, it is based on sequential computing so it has a problem of being slow. Recently purposed algorithm (YM-Algorithm) aim to overcome this sequential computing limitation. This paper presents a different implementation approaches for the YM algorithm in a real environment. Finally, the paper study the experimental results of applying these implementations approached in a realistic parallel environment.

Keyword: DNA Computing, Computational biology, Distributed computing, Grid computing, Bioinformatics

[1]. L. V. Vinh, T. V. L. Lang, N. Thi Thu Du and V. H. B. Chau, "Multiple Sequence Alignment on the Grid Computing," International Journal of Computer Science and Telecommunications, vol. 3, no. 7, pp. 46-51, 2012.
[2]. M. Assal, A. Said, D. Mohamed and N. Osama, "A Study to the effect of task granulation for the DNA multiple sequence alignment on Grid Computing," IRACST - International Journal of Computer Science and Information Technology & Security (IJCSITS),, vol. 5, no. 3, 2015.
[3]. L. Jiang and W. T., "On the complexity of multiple sequence alignment," Journal of Computational Biology, vol. 1, no. 4, p. 337–348, 1994.
[4]. S. S., L. Y. and Q. Yang, "A polynomial time solvable formulation of multiple sequence alignment," Journal of Computational Biology, vol. 13, no. 2, p. 309–319, 2006.
[5]. S. Altschul, W. Gish, W. Miller, E. W. Myers and D. J. Lipman, "Basic Local Alignment Search Tool," Journal of Molecular Biology, vol. 215, no. 3, pp. 403-410, 1990.


Paper Type : Research Paper
Title : An Improved Simulation Model for Rayleigh Fading Channels
Country : China
Authors : Cuijuan Guo || Zhen Yang || Zhigang Wu

Abstract: the model of propagation of electromagnetic energy from transmitter to receiver will be largely by way of scatting, either by reflection from the flat sides of buildings or by diffraction around such buildings or other man-made or natural obstacles in mobile communication. These effects are called multipath propagation resulting in significant fluctuations of the received signal. Generally Rayleigh fading waveforms are often required to simulate in wireless communication channels. In this paper, in order to tackle with statistical property problems of the proposed model that cannot always approach theoretical value, an improved model based on Clarke model is proposed and its statistical properties of first and second-order are also analyzed in detail. Simulation results indicate that the modified amplitude, phase probability density function, the relevant function, the level crossing rate and the average fade duration can coincide with Clarke theoretical model characteristics. It can meet the requirements of the actual channel simulation.

Keyword: mobile communication, Rayleigh fading, Clarke model, statistical properties

[1] P. D. Huang,"A novel structure for Rayleigh channel generation with consideration of the implementation in FPGA,"IEEE Trans.
on Circuits & Systems, vol. 63, no. 2, pp. 216-220, Feb. 2016.
[2] S. Bose, A. Mondal, I. S. Misra, "FPGA based hardware implementation of adaptive equalizer for Rayleigh fading channel," in
Proc. International Conference on Microwave, Optical and Communication Engineering, India, Dec. 2015, pp. 338-341.
[3] J. Vázquez Castillo, L. Vela-Garcia, C. A. Gutiérrez, R. Parra-Michel, et al, "A reconfigurable hardware architecture for the
simulation of Rayleigh fading channels under arbitrary scattering conditions,"AEU-International Journal of Electronics and
Communications, vol. 69, no. 1, pp. 1-13, Jan. 2015.
[4] R. H. Clarke, "A statistical theory of mobile-radio reception,"Bell System Technical Journal,vol. 47, no.6, pp, 957-1000, July 1968.
[5] W. C. Jakes, D. C. Cox, Microwave Mobile Communications, Wiley-IEEE Press, 1994, pp. 57-66.


Paper Type : Research Paper
Title : Scalable and Cost Effective Solution to Minimum Cost Forwarding in WSN
Country : India
Authors : Mahima Bansal || Dr. Harsh Sadawarti || Abhilash Sharma

Abstract: This paper introduces an improved routing protocol for wireless sensor networks (WSN), built on the basis of fundamental concepts in source based minimum cost forwarding protocol. Neither routing tables nor network topology information is maintained at the sensor level, which makes the proposed protocol part of the reactive routing protocol class. Despite the lack of routing information at the sensor, the packets from the sink node to sensors, and vice versa, always accompany the optimal communication path with minimal cost. Simulation results have proven that the proposed protocol performs better than existing protocol, and nodes always route the packets through the optimal path up to destination. In fact, according to the energy consumption, packet delivery ratio,

Keyword: Minimum Cost Forwarding, Performance Parameter, Source Based Routing, Wireless Sensor Networks.

[1] M. Ilyas and I. Mahgoub, "Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems," CRC Press LLC, USA, 2005.
[2] F. Ye, A. Chen, S. Lu, and L. Zhang, "A scalable solution to minimum cost forwarding in large sensor networks," in Proc. IEEE 10th Int. Conf. Computer Communications and Networks, Scottsdale, Arizona, Oct. 2001.
[3] T.V. Padmavthy, G. Divya, and T.R. Jayashree, "Extending network lifetime in wireless sensor networks using modified minimum Cost forwarding protocol," Wireless Communications, Networking and Mobile Computing, 2009. WiComʼ09. 5th International Conference on, 2009, p. 1–4.
[4] Fardin Derogarian, João Canas Ferreira, Vítor M. Grade Tavares, "A Routing Protocol for WSN Based on the Implementation of Source Routing for Minimum Cost Forwarding Method", SENSORCOMM 2011: The Fifth International Conference on Sensor Technologies and Applications.
[5] Yingji Zhong and Dongfeng Yuan, "Dynamic source routing protocol for wireless ad hoc networks in special scenario using location information," in Communication Technology Proceedings, ICCT 2003. International Conference on, 2003, vol. 2, pp. 1287-1290 vol.2.


Paper Type : Research Paper
Title : Performance Comparison of Transport Layer Protocols for Multimedia Application in Wired Networks
Country : China
Authors : Wasan Ali Hussein || Song Feng Lu

Abstract: In this paper, we present to discuss the performance of transport layer protocols for multimedia application in the wired network. More precisely, TCP and UDP Performance are evaluated then compared. Two scenarios implemented to evaluate the performance of the two transport layer protocols, first scenario TCP and UDP are simulated independently. Whilst, TCP, and UDP Simulated Interoperation in the second scenario. Performance evaluated according to the QoS metrics like throughput, packet delivery ratio, fairness, and end-to-end delay. This QoS criterion has been determined for each of two transport protocol. Network simulator (NS-2.35) used to simulate and implement both of TCP and UDP.

Keyword: Multimedia application, Transport layer, TCP, UDP, and Performance.

[1] J. I. Moreno, F. J. Gonzalez, QoS requirements for multimedia services, chapter in: Resource Management in Satellite Networks, Springer, 2007, pp. 67-94.
[2] H. Schulzrinne, S. Casner, RTP Protocol for Audio and Video Conferences with Minimal Control, IETF, Network Working Group, RFC 3551, 2003, pp. 1-38.
[3] C. Vaishnav, Voice over Internet Protocol (VoIP): The Dynamics of Technology and Regulation, Massachusetts Institute of Technology, June 2006.
[4] M. N. Khalid, Simulation Based Comparison of SCTP, DCCP and UDP Using MPEG-4 Traffic Over Mobile WiMAX/IEEE 802.16 e, Sch. Comput. Blekinge Inst. Technol, 2010.
[5] H. M. Omer, S. A. Mailk, M. Yousaf, Performance Evaluation of Transport Layer Protocols for Video Traffic over WiMax, in : Proceedings of the 2009 IEEE 13th International Multitopic Conference, INMIC IEEE, 2009, pp. 1-6.


Paper Type : Research Paper
Title : Scheduling Algorithm for University Timetabling Problem
Country : Nigeria
Authors : Francis K. || Manga I. || Sarjiyus O.

Abstract: Scheduling for timetabling is one of the challenges faced by most Universities in developing countries. In this research work, consideration is made in developing of a scheduling algorithm capable of providing solution to a timetabling problem in Universities. Hence, a practical approach is created by incorporating Local Search Procedures into Constraints Programming for generating lecture timetable which was tested on some universities timetabling problems and was found to provide a better solution than most existing methods.

Keyword: Scheduling algorithm, Timetabling, Search, Lecture, Constraints.

[1]. S. Abdennadher, & M. Marte (1999). University timetabling using constraint handling rules. Journal of Applied Artificial Intelligence, 12-22.
[2]. G. Brassard, & P. Bratley (1996). Fundamentals of Algorithmics. New York: Prentice Hall.
[3]. E. Burke, D. Elliman, & R. Weare (1993). Extension to a University Exam Timetabling System. Chicago: Adventure Works Press.
[4]. J. Chen (2014, January 5). Unitime Corporation . Retrieved from Unitime Corporation web site : http://www.unitime.org
[5]. R. Doug (2003). Extreme Programming Refactored. Chicago: Apress


Paper Type : Research Paper
Title : Study of e-Governance initiatives: e-Procurement a Business Reform Process for Odisha's Development
Country : India
Authors : Shaikh Imtiyaj || Er. Govinda Chandra Mangual || Dr. A K Hota

Abstract: Odisha is the one of the 29 states of India located in the eastern coast. Odisha which is the eleventh largest state of India in population, is working to provide better services to all the citizens in a transparent manner. Odisha is the first position among smart cities. The capital of Odisha, Bhubaneswar is the Number.1 smart city in the country. e-Governance aims to provide good governance to the public by using the Information and Communication Technology (ICT) for speedy, accurate, transparent and secured services. Information and Communication Technology is being increasingly used in daily life of a common man and it has become the nucleus part of providing...........

Keyword: e-Procurement, Digital Signature Certificate, Information and Communication Technology, e-Governance

[1]. Shaikh Imtiyaj, Er Gobinda Chandra Mangual, "An Indepth Understanding of e-Governance initiatives: e-Procurement –A Great Success in Odisha", IOSR Journal of Computer Engineering(IOSR-JCE) e-ISSN:2278-0661,p-ISSN:2278-8727,Volume 18,Issue 4,Ver. V(Jul-Aug. 2016), PP 144-147
[2]. Shaikh Imtiyaj, N.R Biswal, T.P Ray, Dr A.K Hota, "An Indepth Understanding of e-Procurement : A Case Study Approach", IOSR Journal of Computer Engineering(IOSR-JCE) e-ISSN:2278-0661,p-ISSN:2278-8727,Volume 17,Issue 6,Ver. V(Nov-Dec. 2015), PP 20-24
[3]. Shaikh Imtiyaj, N.R Biswal, T.P Ray, Dr A.K Hota , "Digital Signature Certificate: A blessing for e-Governance Application in Human Development", International Journal of Advanced Research in Science, Engineering and Technology,Vol. 2, Issue 1 , pp 350-355,January 2015
[4]. William S.," Cryptography and Network Security, Principles and Practice", Prentice Hall of India, 2005.
[5]. Dhiren R. Patel ,"Information Security Theory and Practice" , 2008 Edition


Paper Type : Research Paper
Title : Extracting Repitative Patterns from Fuzzy Temporal Data
Country : Saudi Arabia
Authors : Fokrul Alom Mazarbhuiya

Abstract: Association rules mining from temporal dataset is to find associations between items that hold within certain time frame but not throughout the dataset. This problem involves first discovering frequent itemsets which are frequent at certain time intervals and then extracting association rules from such frequent itemsets. In practice, we may have datasets having imprecise or fuzzy time attributes, we term such datasets as fuzzy temporal datasets. In such datasets, as the time of transaction is imprecise, we may have frequent itemsets that are frequent in certain fuzzy time intervals...........

Keyword: Fuzzy time intervals, Fuzzy temporal datasets, Frequent itemsets, Similarity measure on fuzzy sets, Similar fuzzy intervals, Similar trapezoidal fuzzy numbers, Fuzzy distance between fuzzy intervals, Aggregation of fuzzy intervals

[1]. F. A. Mazarbhuiya, and Ekramul Hamid; Finding Fuzzy Locally Frequent itemsets, International Journal of Computer Science and Information Security, ISSN: 1947-5500, LJS Publisher and IJCSIS Press, USA, 2011.
[2]. R. Agrawal, T. Imielinski and A. Swami; Mining association rules between sets of items in large databases; Proceedings of the ACM SIGMOD '93, Washington, USA, May 1993.
[3]. R. Agrawal and R. Srikant; Fast algorithms for mining association rules, Proceedings of the 20th International Conference on Very Large Databases (VLDB '94), Santiago, Chile, June 1994.
[4]. J. F. Roddick, M. Spillopoulou; A Biblography of Temporal, Spatial and Spatio-Temporal Data Mining Research; ACM SIGKDD, June 1999.
[5]. H. Manilla, H. Toivonen and I. Verkamo; Discovering frequent episodes in sequences; KDD'95; AAAI, 210-215, August 1995.


Paper Type : Research Paper
Title : Applications for Big Data in of Intelligent Distributed Processing
Country :  
Authors : Dr Farheen Siddiqui

Abstract: Today, "Big Data" has posed new problem of over-information in many different areas. Such areas include health care (e.g., hospitals, bioinformatics), e-sciences (e.g., physics, chemistry, and geology), and social sciences (e.g., politics) [Bizer et al. 2011, Jung 2009]. Thus, as we have various types of hetrogeneous data from a number of available sources, it is becoming increasingly more difficult to efficiently process such Big Data. Distributed computing technologies (e.g., Hadoop, Hive and Pig) are strongly related to the "Big Data" issues [Hogarth and Soyer 2015, Jung 2012]. Current big data issues are efficient distributed data processing and management for example, information acquisition and stream processing, as well as data integration [Madden 2012]............

[1]. [Bizer et al. 2011] Bizer, C., Boncz, P., Brodie, M.L., Erling, O.: The Meaningful Use of Big Data: Four Perspectives - Four Challenges. SIGMOD Record, 40(4):56-60, 2011.
[2]. [Hogarth and Soyer 2015] Hogarth, R.M., Soyer, E.: Using Simulated Experience to Make Sense of Big Data. MIT Sloan Management Review, 56(2):49-54, 2015.
[3]. [Jung 2009] Jung, J.J.: Contextualized query sampling to discover semantic resource descriptions on the web. Information Processing & Management, 45(2):283–290, 2009.
[4]. [Jung 2012] Jung, J.J.: Evolutionary Approach for Semantic-based Query Sampling in Large-scale information Sources. Information Sciences, 182(1):30-39, 2012.
[5]. [Madden 2012] Madden, S.: From Databases to Big Data. IEEE Internet Computing, 16(3):4-6, 2012. 756 Jung J.J., Camacho D., Badica C.: Intelligent Distributed Processing ...


Researcher can also search IOSR published article contents through

IOSR Xplore