This paper discusses the Constrained Application Protocol (CoAP), an application layer protocol introduced by Internet Engineering Task Force (IETF) Constrained RESTful environment (CoRE) Working Group for use with low power and resource constrained nodes in the internet of things. The paper discusses the CoAP architecture supported with suitable examples. CoAP protocol message format, types, methods and security feature is also discussed. In this paper, we present a CoAP based car parking system implemented using Contiki, an open source operating system for resource constrained device. The Cooper (Cu) CoAP user agent for Firefox browser is used for handling CoAP URI scheme.

Decision tree is a data mining technique which is used to build classification model. ID3 and C4.5 are basic decision tree algorithms that are used to create classification model depending upon the different datasets. In this paper, the enhanced C4.5 algorithm is presented to analyze the traffic accident data using WEKA data mining tool. The main aim of this enhanced approach is to provide a simple, efficient model in classifying the data set. The efficiency of enhanced algorithm is drawn by comparing it with existing algorithms.

In cloud environment, the main challenge is load balancing as it requires distributing the load among many various virtual machines (VM) while avoiding underflow and overflow conditions. In this article, the question that which load-balancing (overflow or underflow) management will better improves the performance and quality of service has been answered with a number of experiments. For experiment purpose, scientific workflow DAG files has been used with one host configuration. Ant Colony Optimization (ACO) and BAT algorithm are used for checking underflow and overflow conditions respectively for VMs. In proposed work, initially the workflow is parsed by Predict Earliest Finish Time (PEFT) heuristic to generate initial seed for meta-heuristic algorithms which will optimize the VM in terms of makespan and cost of execution. Different workflows have been used with varying number of VMs from 2 to 20. The results shows that makespan analysis is approximately overlapped for different workflow tasks and shows no significant difference however, the cost analysis show a significant change for overflow and underflow identification with cost for overflow condition is reduced significantly.

No abstract

No abstract