Modeling and performance analysis of AODV routing protocol using coloured petri nets

The growth of interest in mobile ad-hoc networks is increasing exponentially. In a Mobile Ad hoc Network(MANET), wireless transmissions can happen in such a way that mobile nodes can send messages directly to one another through wireless links. The protocols which establish their routes dynamically on demand are called reactive protocols. One of the such reactive protocols defined for MANETs is AODV (Ad hoc On-demand Distance Vector) routing protocol. Since the nodes are mobile in nature, the topology of the network does not remain constant, it keeps on changing frequently. Thus it is very much necessary for every node in the network to keep track of change so that an efficient packet transmission can be done. In this thesis, AODV is modeled using Coloured Petri nets, various performance measures like workload, number of packets sent and received, efficiency of the protocol are evaluated using monitors. The same routing protocol is again simulated using well known NS2 tool. The results of the modeled CPN are compared with NS2 simulator output. We have assumed that all the nodes have sufficient energy while participating in the routing process

Modeling of AODV routing protocol using timed petri nets

The growth of interest and research on wireless networks is exponentially in recent years. In a Mobile Ad hoc NETwork (MANET), wireless transmission takes place where one mobile node can send messages directly to other mobile node. One of the reactive protocol (the protocol which creates route in an on-demand basis) defined for MANETs is AODV (Ad hoc On-demand Distance Vector) routing protocol. The node movement in the dynamic environment causes frequent topology changes in the network. Thus it is very much necessary for every node in the network to keep track of change so that an efficient packet transmission can be done. In this thesis, the delay associated with a packet is calculated in MATLAB as well as in CPN tools and a comparison is made between them. Implementation in CPN tools requires time values to be incorporated amongst the states (i.e. places and transitions) which indicates the delay taken by a router or delay associated over a link or it may be delay due to queuing of packet. This value can be extracted for a particular route and delay value associated with it can be obtained. We have assumed that all the nodes have sufficient energy while participating in the routing process

Eighth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, Aarhus, Denmark, October 22-24, 2007

This booklet contains the proceedings of the Eighth Workshop on Practical Use of Coloured Petri Nets and the CPN Tools, October 22-24, 2007. The workshop is organised by the CPN group at the Department of Computer Science, University of Aarhus, Denmark. The papers are also available in electronic form via the web pages: http://www.daimi.au.dk/CPnets/workshop0

Distributed Web Service Coordination for Collaboration Applications and Biological Workflows

In this dissertation work, we have investigated the main research thrust of decentralized coordination of workflows over web services. To address distributed workflow coordination, first we have developed “Web Coordination Bonds” as a capable set of dependency modeling primitives that enable each web service to manage its own dependencies. Web bond primitives are as powerful as extended Petri nets and have sufficient modeling and expressive capabilities to model workflow dependencies. We have designed and prototyped our “Web Service Coordination Management Middleware” (WSCMM) system that enhances current web services infrastructure to accommodate web bond enabled web services. Finally, based on core concepts of web coordination bonds and WSCMM, we have developed the “BondFlow” system that allows easy configuration distributed coordination of workflows. The footprint of the BonFlow runtime is 24KB and the additional third party software packages, SOAP client and XML parser, account for 115KB

Privacy-Conflict Resolution for Integrating Personal and Electronic Health Records in Blockchain-Based Systems

Integrating personal health records (PHRs) and electronic health records (EHRs) facilitates the provision of novel services to individuals, researchers, and healthcare practitioners. Simultaneously, integrating healthcare data leads to complexities arising from the structural and semantic heterogeneity within the data. The subject of healthcare data evokes strong emotions due to concerns surrounding privacy breaches. Blockchain technology is employed to address the issue of patient data privacy in inter-organizational processes, as it facilitates patient data ownership and promotes transparency in its usage. At the same time, blockchain technology creates new challenges for e-healthcare systems, such as data privacy, observability, and online enforceabil-ity. This article proposes designing and formalizing automatic conflict resolution techniques in decentralized e-healthcare systems. The present study expounds upon our concepts by employing a running case study centered around preventive and personalized healthcare domains. © 2023, Partners in Digital Health. All rights reserved

Seventh Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, Aarhus, Denmark, October 24-26, 2006

This booklet contains the proceedings of the Seventh Workshop on Practical Use of Coloured Petri Nets and the CPN Tools, October 24-26, 2006. The workshop is organised by the CPN group at the Department of Computer Science, University of Aarhus, Denmark. The papers are also available in electronic form via the web pages: http://www.daimi.au.dk/CPnets/workshop0

ACHIEVING AUTONOMIC SERVICE ORIENTED ARCHITECTURE USING CASE BASED REASONING

Service-Oriented Architecture (SOA) enables composition of large and complex computational units out of the available atomic services. However, implementation of SOA, for its dynamic nature, could bring about challenges in terms of service discovery, service interaction, service composition, robustness, etc. In the near future, SOA will often need to dynamically re-configuring and re-organizing its topologies of interactions between the web services because of some unpredictable events, such as crashes or network problems, which will cause service unavailability. Complexity and dynamism of the current and future global network system require service architecture that is capable of autonomously changing its structure and functionality to meet dynamic changes in the requirements and environment with little human intervention. This then needs to motivate the research described throughout this thesis. In this thesis, the idea of introducing autonomy and adapting case-based reasoning into SOA in order to extend the intelligence and capability of SOA is contributed and elaborated. It is conducted by proposing architecture of an autonomic SOA framework based on case-based reasoning and the architectural considerations of autonomic computing paradigm. It is then followed by developing and analyzing formal models of the proposed architecture using Petri Net. The framework is also tested and analyzed through case studies, simulation, and prototype development. The case studies show feasibility to employing case-based reasoning and autonomic computing into SOA domain and the simulation results show believability that it would increase the intelligence, capability, usability and robustness of SOA. It was shown that SOA can be improved to cope with dynamic environment and services unavailability by incorporating case-based reasoning and autonomic computing paradigm to monitor and analyze events and service requests, then to plan and execute the appropriate actions using the knowledge stored in knowledge database