iosr-jmca   Volume-3 ~ Issue-6 ~ Nov – Dec 2016

ABSTRACT: Mobile Agents are the set of processes that can move from one host to another host. The request granted by the client machine is executed by movement of mobile agents from a host machine to another host machine. The processes called by client are executed on a machine. The host machine must have all the resource needed to implement the service. This paper deals with allocation of resources through a proposed technique. In order to implement the tasks offered by the client, the mobile agents resume execution at the new machine. The extension of client and server model is followed in the development of Mobile agents. This paper also analyses the resolution of deadlock through different methods of study. The client only performs the operations provided by the server. There is scope of network scalable system when a particular server does not provide request desired by the client

Keywords: Mobile Agents, deadlock, client, server, resource

[1]. Almes, G.T., A.P.Black, E.D Lazowska,"The Eden System: A Technical Review", IEEE Transactions on Software Engineering,vol. 11, ( 1998) .
[2]. Bacor,J.M.,and K.G.Hamilton,Distributed Computing with RPC:The Cambridge Approach, " ACM Transaction on Computer Systems,vol.5,( 2003) .
[3]. Nelson,B.J., "Remote Procedure Call", PhD thesis, Computer Science, Carnegie Mellon University, (2002)
[4]. Cheriton, D.R., "The V Distributed System", Communications of the ACM, Vol.30, (2000)

ABSTRACT: Personal CommunicationSystem(PCS) designates a set of wireless communications capabilities that allows the combination of terminal mobility, personal mobility, and service profile management.PCS can provide users with an all-in-one wireless phone, paging, messaging, and data service through portable devices. However, mobile services relaxed security has effectively made device users a target for hackers; mobile users have become increasingly concerned with security risks. The need for security has never been more detrimental than it is now. In this paper, we present a survey on emerging security issues of personal communication system, such as virus, worm, phishing and many others. In addition, some real recent examples are studied and finally some security rules are given to PCS users.

[1] Alazab, M., Venkatraman, S. Watters, P. and Alazab, A. (2012) Cybercrime: The Case of Obfuscated Malware. International Conference in Global Security Safety and Sustainability, pp. 204-211.

[2] Arora, M. (2012). How secure is AES against brute force attacks? Retrieved May 6, 2015 from http://www. eetimes. com/document.asp?doc_id=1279619

[3] Aycock, John (2006). Computer Viruses and Malware. Springer. p. 14. ISBN 978-0-387-30236-2.

[4] Bank, D. (2004). NEW VIRUS CAN TURN YOU INTO A SPAMMER; MYDOOM OPENS A'BACK DOOR'THAT HACKERS CAN ACCESS; SIGNING UP FOR SECURITY ALERTS. The Wall Street Journal, 1.

[5] Camenisch, J., Ortiz-Yepes, D. A., & Preiss, F. S. (2015). Strengthening Authentication with Privacy-Preserving Location Verification of Mobile Phones. In Proceedings of the 14th ACM Workshop on Privacy in the Electronic Society, ACM, pp. 37-48.

ABSTRACT: A mobile Ad-hoc networks consists of wireless hosts that may move often, movement of host results changes in path. The well known Fisheye State routing (FSR) protocol determines a route when no route exists or route breaks. To establish new path from source to destination, it broadcast control packets (route request packets), which increases the network bandwidth consumption and to reduce flooding. As mobile Ad-hoc networks have limited bandwidth, it is important to reduce the flooding. This paper provides a protocol which uses the weighted Rough set model to control the route request packets in the existing FSR protocol in GRID. Weighted Rough set theory is a mathematical tool to deal with vagueness, uncertainty and it also considers the importance of the objects (nodes).

Keywords: MANET; Grid Fisheye State Routing Protocol (GFSR); NS2; Weighted Rough Set Model

[1]. Calinescu G., Mandoiu I., Wan P., and Zelikovsky A.,"Selecting Forwarding Neighbours in Wireless Ad-hoc Networks," in
Proceedings of ACM Int' Workshop Discrete Algorithms and Methods for Mobile Computing ,pp. 33-43, 2001.
[2]. Jian L. and Mohapatra P., An Approach to Improve Flooding Based Route Discovery in Mobile Ad-Hoc Networks, Springer
Science, 2006.
[3]. Johnson D. and Maltz D., "Dynamic Source Routing in Ad-hoc Networks," in Computer Communication Review Proceedings
of SIGCOMM'96, 1996.
[4]. Lim H. and Kim C., "Flooding in Wireless Adhoc Networks," Computer Journal of Communication, vol. 24, no. 3-4, pp. 353- 363,
2001.
[5]. S.Nithya Rekha, and Dr.C.Chandrasekar, "Performance Analysis of Probabilistic Rebroadcasting in Grid FSR for MANET"
International Journal of Computer Science Issues (IJCSI) Vol. 9, No. 2, March 2012 , pp. 293-300. (Indexed by DBLP & Elsevier).