iosr-JCE   Volume-2 ~ Issue-3

Abstract: In recent years ad-hoc parallel data processing has emerged to be one of the killer applications for Infrastructure-as-a-Service (IaaS) clouds. Major Cloud computing companies have started to integrate frameworks for parallel data processing in their product portfolio, making it easy for customers to access these services and to deploy their programs. However, the processing frameworks which are currently used have been designed for static, homogeneous cluster setups and disregard the particular nature of a cloud. Consequently, the allocated compute resources may be inadequate for big parts of the submitted job and unnecessarily increase processing time and cost. In this paper we discuss the opportunities and challenges for efficient parallel data processing in clouds and present our research project Nephele. Nephele is the first data processing framework to explicitly exploit the dynamic resource allocation offered by today's IaaS clouds for both, task scheduling and execution. Particular tasks of a processing job can be assigned to different types of virtual machines which are automatically instantiated and terminated during the job execution.
Key words: Cloud computing, Nephele, Sharing, Fish Algorithm, Feistel Networks, VMs.

[1] Amazon Web Services LLC. Amazon Elastic Compute Cloud(Amazon EC2). http://aws.amazon.com/ec2/, 2009.
[2] Amazon Web Services LLC. Amazon Elastic MapReduce. ttp://aws.amazon.com/elasticmapreduce/, 2009.
[3] AmazonWeb Services LLC. Amazon Simple Storage Service. http://aws.amazon.com/s3/, 2009.
[4] D. Battr´e, S. Ewen, F. Hueske, O. Kao, V. Markl, and D. Warneke.Nephele/PACTs: A Programming Model and Execution Framework for Web-Scale Analytical Processing. In SoCC '10: Proceedingsof the ACM Symposium on Cloud Computing 2010, pages 119–130, New York, NY, USA, 2010. ACM.
[5] R. Chaiken, B. Jenkins, P.-A. Larson, B. Ramsey, D. Shakib,S. Weaver, and J. Zhou. SCOPE: Easy and EfficientParallel Processing of Massive Data Sets. Proc. VLDB Endow., 1(2):1265–1276, 2008.
[6] H. Chih Yang, A. Dasdan, R.-L. Hsiao, and D. S. Parker. Map-Reduce-Merge: Simplified Relational Data Processing on Large Clusters. In SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Man

Abstract : Cluster computing is one of the most interesting innovations in the field of parallel computing in the recent past. Due to record low prices on hardware and the availability of free, open source software, massive amounts of computing power are available to the general population. This availability allows for the implementation of cluster computing that can serve as the function of one PC based computer. This paper focuses on the implementation and the use of small cluster computing of three computers. It is quite impossible for us to effort a costly supercomputer and knows its performance. To minimize cost we have to consider some issues, these are software choice, installation, configuration and networking. In addition to the implementation of the cluster computing here uses LINUX operating System and OSCAR (Open Source Cluster Application Resources) & MPICH (Implementation of MPI, the Standard for the message passing libraries) that is fully free.
Keywords - Cluster Computing, MPI, OSCAR, Parallel System, Super Computer

[1] Buyya, High performance Cluster Computing ( NJ: Prentice-Hall,1999).
[2] Message Passing Interface Forum. MPI: A Message Passing Interface. In Proc. Of Supercomputing '93, pages 878–883. IEEE Computer Society Press, November 1993.
[3] Benoît des Ligneris, Stephen L. Scott, Thomas Naughton, and Neil Gorsuch. Open Source Cluster Application Resources (OSCAR) : design, implementation and interest for the [computer] scientific community. In Proceeding of 17th Annual International Symposium on High Performance Computing Systems and Applications (HPCS 2003), pages 241–246, Sherbrooke, Canada, May 11-14, 2003.
[4] Benoît des Ligneris, Stephen L. Scott, Thomas Naughton, and Neil Gorsuch. Open Source Cluster Application Resources (OSCAR) : design, implementation and interest for the [computer] scientific community. In Proceeding of 17th Annual International Symposium on High Performance Computing Systems and Applications (HPCS 2003), pages 241–246, Sherbrooke, Canada, May 11-14, 2003.
[5] System Installation Suite (SIS),http://www.sisuite.org/.
[6] NSF/TFCC Workshop on Teaching Cluster Computing Wednesday, July 11th - Friday July 13th, 2001 Department of Computer Science University of North Carolina at Charlotte
[7] Richard Ferri. The OSCAR revolution. Linux Journal, (98), June 2002. http://www.linuxjournal.com/article.ph p?sid=5559.

Abstract: Noises are the unwanted information in an image, so they should be removed before further processing. Existing methods consider histogram based analysis which is globally varied one. A modified statistical measured based automatic noise type recognition technique is proposed in this paper. This has 2 phases including training phase and testing phase. The key role involves deduction of noise samples using filters like wiener, lee, median and extracts the statistical measures like kurtosis and skewness from samples. Kurtosis and skewness values exhibit behavior based on noise type. By using the statistical information and trained data we can classify the type of noise. Finally the noise type is identified and corresponding filter is applied. Thus noise eliminated image would give the desirable results during further processing. Experimental results show that the method is capable of accurately classifying the types of noise.
Keywords: Enhanced Noise Type Recognition, Kurtosis, Noise type identification, Skewness, Statistical features.

[1] R.W. Hamming, "Error Detecting and Error Correcting Codes", Bell system, Technical 29(1950), pp.147-160.
[2] R. Gallager, "Low Density Parity Check codes", IEEE Trans. Information Theory 8 (1962) no-1, pp.21-28.
[3] Yunghsiang S. Han, "Introduction to Binary Linear Block Codes", Graduate Institute of Communication Engineering, National
Taipei University, pp.8-17.
[4] Sarah J. Johnson, "Introducing Low Density Parity Check Codes", University of Newcastle, Australia.
[5] William E. Ryan, " An Introduction to LDPC codes", Department of Electrical and Computer Engineering, University of
Arizona, August 2003
[6] Amin Shokrollahi, "LDPC codes- An Introduction", Digital Fountain, Inc. April 2 2003.
[7] Steve,"Basic Introduction to LDPC",University of Clifornia,March 2005
[8] H.A. Loeliger, "An Introduction to Factor Graphs", IEEE Signal Proc. Magazine (2004), pp.28-41.
[9] F.R. Kschischang, B.J. Frey, and H.A. Loeliger, "Factor Graphs and the Sum Product Algorithm", IEEE Trans. Information
Theory 47 (2001), pp.498-519.
[10] Frank R.Kschischang, Brenden J.Frey, "Iterative Decoding of Compound Codes by Probability Propagation in Graphical
Models", IEEE Journal on selected areas in communication, vol.16,no.2 February 1998,pp.219-230

ABSTRACT : CONTEXT-- Mobile commerce (M-Commerce) is an emerging business paradigm in which the buying and selling of products and services is done through mobile equipment. These equipments are mobile phones, personal digital assistant (PDA) or other hand held wireless devices. M-commerce vendor organizations face many challenges regarding customer relationships management.
OBJECTIVE: The objective is to develop a systematic literature review protocol for the identification of the challenges and success factors faced by mobile commerce vendors in building and strengthening of relationships with customers.
METHOD: A Systematic Literature Review (SLR) methodology will be used for the identification and assessment of relevant literature. SLR is based on a structured protocol, and is therefore, different from ordinary literature review. SLR gives more prescribe results than ordinary review.
EXPECTED OUTCOME: The expected outcomes of this systematic literature review will be a list of challenges and success factors faced by M-commerce vendors in establishing and strengthening of relationships with customers in an M-commerce business paradigm. Our ultimate goal is the development of a Mobile Commerce Customer Relationships Management Model (MCCRMM). The SLR will provide the first phase in the development of the model.
Keywords – Mobile commerce, m-commerce, customers Relationship management, mobile commerce vendors, customers.

[1] J.Felicitta and J. G. Jayanthi, "The Impact of M-Commerce in Global Perspectives- A SWOT Analysis," presented at Proceedings of the 8th WSEAS int. Conf. on ELECTRONICS, HARDWARE, WIRELESS and COMMUNICATIONS, 2009.
[2] I. Mobilocity., " Fundamentals of M-Business – An M-Business 101," May 2001.
[3] Anckar B. and D‟Incau, "Value-Added Services in Mobile Commerce: An Analytical Framework and Empirical Findings from a Nationals Consumer Survey," presented at Proceedings of the 35th Hawaii International Conference on Systems Sciences., 2002.
[4] A. M. Khasawneh, "The key success to mobile internet in the Middle East: wirless set to take the lead.," International Journal of Business Information Systems, vol. 4(4), pp. 477-488, 2009.
[5] C. Coursaris and k. Hassanein, "Understanding M-commerce: A consumer-centric Model," Quarterly Journal of Electronic Commerce, vol. 3, pp. 247-271, 2002.
[6] M. S. Hossain, R. Muhammad, and K. Amin, "Implementation Challenges of Mobile Commerce in Developing Countries- Bangladesh Perspective," presented at International Conference on Computer and Infonnation Technology (ICCIT 2011), Dhaka, Bangladesh, 2011.
[7] H. Dai, & and P. C. Palvia, "Mobile Commerce Adoption in China and the United States: A Cross-Culture Study," The DATA BASE for Advances in information Systems, vol. 40(4), pp. 43-61, 2009.
[8] J.J.H Zhu and E.Wang, "Diffusion, use and effect of the internet in China," Association for Computing Machinery," Communication of the ACM., vol. 48, pp. 49-55, 2005.
[9] Y. Xu, "Mobile data communications in China," Communication of the ACM, vol. 46, pp. 80-86, 2002.
[10] U. M. Z. Usman and Z. B. Mohammed, "The Impact of Mobile Advertisement and Communication on Customer Relationship Management (CRM)." presented at in 2012 International Conference on Economics, Business and Marketing Management., 2012....................

Abstract: Ad hoc networking allows portable devices to establish communication independent of a centralinfrastructure. However, the fact that there is no central Infrastructure and that the devices can move randomly gives rise to various kind of problems, such as routing and security. In this thesis the problem of routing is considered. This paper addresses issues pertaining to two different routing protocols Destination Sequenced Distance vector (DSDV) and Dynamic Source Routing (DSR) protocols, which are used for efficient routing under different scenarios in Mobile Ad-hoc Network (MANET), which plays a critical role in places where wired network are neither available nor economical to deploy. Objective of this paper to show the implementation of two routing protocols using Network Simulators and run it for different number of nodes. Then compared the two routing protocols for different network parameters and studied the efficient protocol under a particular scenario on the basis of two metrics. (1) Packet delivery ratio (2) Routing load DSDV is a Proactive gateway discovery algorithm where the gateway periodically broadcasts a gateway advertisement message which is transmitted after expiration of the gateways timer. DSR is a Reactive gateway discovery algorithm where a mobile device of MANET connects by gateway only when it is needed.
Keywords— DSDV, DSR, MANET, TMS, TTP.

[1]. D. Kim, J. Garcia and K. Obraczka, "Routing Mechanisms for Mobile Ad Hoc Networks based on the Energy Drain Rate", IEEE Transactions on Mobile Computing. Vol 2, no 2, 2003, pp.161-173
[2]. C.E. Perkins & P. Bhagwat, "Highly Dynamic Destination Sequence-Vector Routing (DSDV) for Mobile Computers", Computer Communication Review, vol. 24, no.4, 1994, pp. 234-244.
[3]. C.E. Perkins and E.M. Royer, "Ad-Hoc on-Demand Distance Vector Routing," Proc. Workshop Mobile Computing Systems and Applications (WMCSA '99), Feb. 1999 pp. 9
[4]. David B. Johnson And David Maltz. "Dynamic source routing in ad hoc wireless networks", Mobile Computing, Kluwer Academic Publishers. 1996 pp.153–181, 1996
[5]. M. S. Corson, J.P. Maker and G. H. Cirincione "Internet-Based Mobile Ad Hoc Networking," IEEE Interne Computing, Vol. 3, no. 4, July-August 1999, pp. 63-70.

Abstract: In Mobile Ad hoc Networks (MANET) Threats is a major concern and most routing protocols are based on Authentication, Security Association, key distribution and so on. we require a network-level or link layer security. Since without appropriate security provisions, the Mobile adhoc Networks are subjected to attacks like network traffic, replay transmissions, manipulate packet headers and redirect routing messages. In order to overcome these problems Trust based Packet Forwarding Scheme is suggested for mobile ad hoc Network System that provides the capability to express network requirements. In this paper, we propose a Trust Based scheme for Combined Data Security which focuses mainly on Integrity and Authentication. For providing security not only to data, but also for routing information, we calculate the trust indexes of the nodes and the route is selected according to the trust value which improves integrity. Then in order to provide Authentication we propose a Distributed Certificate Authority (DCA) technique in which multiple Distributed certificate authority are required to construct a certificate. Thus, the desired level of security is provided by the system based on the policy of the user by executing the corresponding security modules. Hence our proposed Trust based Packet Forwarding Scheme for data Security provide complete protection for the data in Mobile Ad hoc Network communications.
Keywords: Trust Index, Trust Value , Data Security, Mobile Ad hoc Networks, Integrity Certificate Authority, Cluster Heads.

[1] I Shin, YShen, Y.Xuan, "A Novel approach against reactive attach" Ad hoc and sensor Wireless Networks VOL.0,1-25,2010
[2] P.Papadimitratos , ZHass, "Securing Mobile Ad hoc Networks " The Handbook of Ad Hoc Wireless Networks, M.Ilyas, Ed. BocaRaton: CRC Press 2002 pp. 31.1-31.17.
[3] H.Yang, H. Luo, F. Ye, S.Lu and U. Zhang, "Security in Mobile Ad Hoc Networks: Challenges and Solutions ", IEEE Wireless Communications, Vol. 11,no. 1 Feb.2004, pp.62-67
[4] Ljubica Blazevic, Yves Le Boudec. "A Location-based Routing for Mobile Ad Hoc Networks". IEEE Transactions on Mobile Computing Vol. 4, No. 2., March 2005 pp 97-102
[5] S.Dhanalakshmi and Dr.M.Rajaram "A Reliable and Secure Framework for Detection and Isolation of Malicious Nodes in MANET" IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.10, October 2008
[6] Bhavyesh Divech Ajith Abraham, Crina Grosanand Sugata Sanyal "Impact of Node Mobility on MANET Routing Protocols Models" Journal of Digital Information Management, 2007.
[7] Alexander Nouak "MANET Security" Sixth International Conference on Intelligent Information hiding and multimedia signal processing "October 15-17, 2010 in Darmstadt, Germany.
[8] Nishu Garg and R.P.Mahapatra "MANET Security Issues" IJCSNS International Journal of Computer Science and Network Security, VOL.9 No.8, August 2009
[9] Panagiotis Papadimitratos and Zygmunt J. Haas "Secure message transmission in mobile ad hoc networks" Elsevier B.V. Ad Hoc Networks 1 (2003) 193–209
[10] Ovais Ahmad Khan "A survey of Secure Routing Techniques for MANET "Course Survey Report, fall 2003....................................

ABSTRACT: Inter-vehicular communication(IVC) is one of the most advanced research areas for last few years. Traditional Mobile-adhoc-network(MANET) protocols are proved to be not that much effective in Vehicular-adhoc-network(VANET). Moreover the protocols for dense areas are not suitable for partially connected areas. In this paper a Distance Node Based Multicast Routing (DBMR) protocol for sparse areas with a small overhead of incorporating multicast group selection is introduced with some small modification in the existing Border node Based Routing(BBR) protocol.The performance of DBMR is evaluated in NS-2 simulator with VanetMobiSim based mobility model. The simulation results verify that the multicast behavior of the proposed DBMR exploits a distinct bandwidth utilization over the flooding behavior of BBR.
Keywords: Broadcast, Distant nodes, IVC, Multicast, Routing protocols.

[1] S.Yousefi, M.S. Mousavi, and M. Fathy, " Vehicular Ad hoc Networks (VANETs) : challenges and perspectives," Proc. 6th International Conference on ITS Telecommunications , IEEE Press, Jun 2006, pp.761-766,doi:10.1109/ITST.2006.289012.
[2] M.Zhang and R.S. Wolff,‟Border Node-Based Routing Protocols for VANETS in sparse and rural areas",Autonet Workshop,IEEE Globecom,Washington DC,November 2007
[3] Online: DSRC, http://grouper.ieee.org/groups/scc32/dsrc/index.html.
[4] V. Naumov, R. Baumann, and T. Gross, "An evaluation of intervehicle ad hoc networks based on realistic vehicular traces," Proc. 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing, ACM Press, May. 2006, pp. 108-119, doi: 10.1145/1132905.1132918.
[5] B. Karp, and H. Kung, "GPSR: greedy perimeter stateless routing for wireless networks," Proc. 6th Annual International Conference on Mobile Computing and Networking, ACM Press, Aug. 2000, pp. 243- 254, doi: 10.1145/345910.345953.
[6] C. Lochert, et al, "A routing strategy for vehicular ad hoc networks in city environments," Proc. IEEE IV2003 Intelligent Vehicles Symposium, IEEE Press, Jun. 2003, pp. 156-161, doi: 10.1109/IVS.2003.1212901.
[7] B. C. Seet, et al, "A-STAR: a mobile Ad Hoc routing strategy for metropolis vehicular communications," Proc. IFIP TC6 Networking, Springer-Verlag Press, May. 2004, pp. 989-999, doi: 10.1007/b97826.
[8] E.Royer and C.Toh,"A review of current Routing Protocols for Ad-Hoc Mobile Wireless Networks",IEEE Personal Communications, Apr. 1999
[9] V. Naumov, and T. Gross, "Connectivity-aware routing (CAR) in vehicular ad-hoc networks," Proc. 26th IEEE International Conference on Computer Communications, IEEE Press, May. 2007, pp. 1919-1927, doi:10.1109/INFCOM.2007.223.
[10] C. Lochert, M. Mauve, H. Fu, and H. Hartenstein, "Geographic routing in city scenarios," ACM SIGMOBILE Mobile Computing and Communications Review, vol. 9, no. 1, Jan. 2005, pp. 69-72, doi:10.1145/1055959.1055970....................