Web Service Composition Framework using Petrinet and Web Service Data Cache in MANET

M. Deivamani, S.R. Murugaiyan, V. Ravisankar, P. Victer Paul, R. Baskaran, P. Dhavachelvan

Abstract


A Mobile Ad Hoc Network (MANET) is characterized by multi-hop wireless links and frequent node mobility. Every neighboring node in the MANET is likely to have similar task and interests, several nodes might need to access the similar web service at different times. So, by caching the repeatedly accessed web service data within MANET, it is possible to reduce the cost of accessing the same service details from the UDDI and also from the external providers. Composition of web services leads to a better alternative as, at times a candidate web service may not completely serve the need of the customer. An effective Data Cache Mechanism (DCM) has been proposed in [6] using the Distributed Spanning Tree (DST) as a communication structure in Mobile network to improve scalability and lessen network overload. As an enhancement, Ant Colony Optimization (ACO) technique has been applied on DST to cope with the fragile nature of the MANET and to improve the network fault tolerance [1]. In these perspectives, an efficient Web Service Cache Mechanism (WSCM) can be modeled to improve the performance of the web service operations in MANET. In this paper, a fine grained theoretical model has been formulated to assess the various performance factors such as Cooperative Cache and Mobility Handoff. In addition to these, the performance improvement of WSCM using DST and ACO optimized DST techniques in MANET has been proved experimentally using Precision and Data Reliability of the system using appropriate simulation.

Keywords


Data Cache, Web Service, Distributed Spanning Tree, Ant Colony Optimization, MANET, OMNeT++

Full Text:

PDF

References


R. Baskaran, P. Victer Paul and P. Dhavachelvan (2012), Ant Colony Optimization for Data Cache Technique in MANET, Int. Conf. on Advances in Computing (ICADC 2012), Advances in Intelligent and Soft Computing series, India, Springer, 873-878.

Hassan Artail and Khaleel Mershad (2009); MDPF: Minimum Distance Packet Forwarding for search applications in mobile ad hoc networks , IEEE Transactions on Mobile Computing, 8(10): 1412 - 142.

MDPF: Minimum Distance Packet Forwarding for search applications in mobile ad hoc networks, IEEE Transactions on Mobile Computing, 8(10): 1412 - 142.
http://dx.doi.org/10.1109/TMC.2009.56

Lan Wang and Stephan Olariu (2005); Cluster Maintenance in Mobile Ad-hoc Networks, Springer Science + Business Media, 8: 111-118.

P. Krishna, M. Chatterjee, N. Vaidya and D. Pradhan(1997); A cluster-based approach for routing in ad-hoc networks, ACM SIGCOMM Computer Communication, 27(2): 49-64.

P. Victer Paul, N. Saravanan, S.K.V. Jayakumar, P. Dhavachelvan, R. Baskaran (2008); QoS Enhancements for Global Replication Management in Peer to Peer networks, Future Generation Computer Systems, Elsevier, 28(3):573-582.

P. Victer Paul, D. Rajaguru, N. Saravanan, R. Baskaran and P. Dhavachelvan (2013); Efficient service cache management in mobile P2P networks, Future Generation Computer Systems, Elsevier, 29(6): 1505-1521.

Sylvain Dahan (2005); Distributed Spanning Tree Algorithms for Large Scale Traversals, 11th International Conference on Parallel and Distributed Systems (ICPADS'05), DOI: 10.1109/ICPADS.2005.131 , 1: 453-459.
http://dx.doi.org/10.1109/ICPADS.2005.131

P. Victer Paul, T. Vengattaraman, P. Dhavachelvan (2010); Improving efficiency of Peer Network Applications by formulating Distributed Spanning Tree, Third International Conference on Emerging Trends in Engineering & Technology (ICETET-2010), IEEE, India, 813-818.

R. Baskaran, P. Victer Paul and P. Dhavachelvan (2012); Algorithm and Direction for Analysis of Global Replica Management in P2P Network, IEEE International Conference on Recent Trends in Information Technology (ICRTIT), May 2012, Chennai, 211 - 216.

Sylvain Dahan, Jean-Marc Nicod and Laurent Philippe (2005); The Distributed Spanning Tree: A Scalable Interconnection Topology for Efficient and Equitable Traversal, International Symposium on Cluster Computing and the Grid, 2005 IEEE.

The Distributed Spanning Tree: A Scalable Interconnection Topology for Efficient and Equitable Traversal, International Symposium on Cluster Computing and the Grid, 2005 IEEE.

Sylvain Dahan (2005); Distributed Spanning Tree Algorithms for Large Scale Traversals, 11th International Conference on Parallel and Distributed Systems (ICPADS'05), DOI: 10.1109/CCGRID.2005.1558561, 1: 243-250.
http://dx.doi.org/10.1109/CCGRID.2005.1558561

R. Friedman (2002); Caching Web Services in Mobile Ad-Hoc Networks: Opportunities and Challenges, Proc. Second ACM Intl Workshop Principles of Mobile Computing, 90-96.
http://dx.doi.org/10.1145/584490.584508

J. Zhao, P. Zhang, G. Cao, and C. Das (2010); Cooperative caching in wireless p2p networks: Design, implementation, and evaluation, Parallel and Distributed Systems, IEEE Transactions on, 21(2):229-241.

S. Lim, W. Lee, G. Cao, and C. Das (2006); A Novel Caching Scheme for Internet Based Mobile Ad Hoc Networks Performance, Ad Hoc Networks, 4(2):225-239.

A Novel Caching Scheme for Internet Based Mobile Ad Hoc Networks Performance, Ad Hoc Networks, 4(2):225-239.
http://dx.doi.org/10.1016/j.adhoc.2004.04.013

N. Chand, R. C. Joshi, and M. Misra (2006); Efficient cooperative caching in ad hoc networks. COMSWARE, DOI:10.1109/COMSWA.2006.1665190, 1-8.
http://dx.doi.org/10.1109/COMSWA.2006.1665190

Fan Ye, Qing Li, and EnHong Chen, Adaptive caching with heterogeneous devices in mobile peer to peer network, ACM Symposium on Applied Computing (SAC '08). ACM, New York, USA, 1897-1901.

Guohong Cao, Liangzhong Yin, Chita R. Das (2004);

Cooperative Cache- Based Data Access in Ad Hoc Networks, Pennsylvania State University, IEEE Computer Society, February 2004, 32-39.

Hassan Artail and Khaleel Mershad (2009); MDPF: Minimum Distance Packet Forwarding for search applications in mobile ad hoc networks, IEEE Transactions on Mobile Computing, 8(10): 1412 - 142.

MDPF: Minimum Distance Packet Forwarding for search applications in mobile ad hoc networks, IEEE Transactions on Mobile Computing, 8(10): 1412 - 142.
http://dx.doi.org/10.1109/TMC.2009.56

Dorigo, M., Maniezzo, V., Colorni A. (1991); The ant system: An autocatalytic optimizing Process. Tech.Rep. 91-016 Revised, Politecnico di Milano, Italy.

A. Colorni, M. Dorigo, V. Maniezzo (1991); Distributed optimization by ant colonies, Proc. of ECAL91 European Conference on Artificial Life, Elsevier Publishing, Amsterdam, The Netherlands, 134-142.

P. Victer Paul, T. Vengattaraman, P. Dhavachelvan and R. Baskaran (2010); Improved Data Cache Scheme using Distributed Spanning Tree in Mobile Adhoc Network, The International Journal of Computer Science and Communication (IJCSC), 1(2): 329-332.




DOI: https://doi.org/10.15837/ijccc.2015.2.1751



Copyright (c) 2017 M. Deivamani, S.R. Murugaiyan, V. Ravisankar, P. Victer Paul, R. Baskaran, P. Dhavachelvan

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]


INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.

 

 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2);

SCImago Journal & Country Rank

Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.