No abstract

This system counts numbers of travellers through cameras that are settled at an overhead position. The identified head checks are refreshed to the server intermittently. The framework consolidates worldwide situating framework information and standard time to build up the quantity of travellers at each transport stop at various timeframes and ascertains the quantity of travellers to give business-related data. The goal of this paper is to build up an ideal transport task technique. An android application that helps the resident to track a transport and can check the quantity of travellers inside the transport. A red, green and yellow sign is to demonstrate the present status of the transport that helps the travelers to choose in which transport to get into. We have broke down the crowed in the transports in a specific transport course. This examination result helps the administration to move the transports starting with one course then onto the next.

No abstract

In Delay Tolerant Networks (DTNs) the core challenge is to cope with lack of persistent connectivity and yet be able to deliver messages from source to destination. In particular, routing schemes that leverage relays' memory and mobility area customary solution in order to improve message delivery delay. When large files need to be transferred from source to destination, not all packets may be available at the source prior to the first transmission. This motivates us to study general packet arrivals at the source, derive performance analysis of replication based routing policies and study their optimization under two-hop routing. In particular, we determine the conditions for optimality in terms of probability of successful delivery and mean delay and we devise optimal policies, so-called piecewise-threshold policies. We account for linear block-codes and rateless random linear coding to efficiently generate red undancy, as well as for an energy constraint in the optimization. We numerically assess the higher efficiency of piecewise-threshold policies compared with other policies by developing heuristic optimization of the thresholds for all flavors of coding considered.

Cloud computing is becoming prominent trend which offers the number of significant advantages. One of the ground laying advantage of the cloud computing is the pay-as-per-use, where according to the use of the services, the customer has to pay. At present, user's storage availability improves the data generation. There is requiring farming out such large amount of data. There is indefinite large number of Cloud Service Providers (CSP). The Cloud Service Providers is increasing trend for many number of organizations and as well as for the customers that decreases the burden of the maintenance and local data storage. In cloud computing transferring data to the third party administrator control will give rise to security concerns. Within the cloud, compromisation of data may occur due to attacks by the unauthorized users and nodes. So, in order to protect the data in cloud the higher security measures are required and also to provide security for the optimization of the data retrieval time. The proposed system will approach the issues of security and performance. Initially in the DROPS methodology, the division of the files into fragments is done and replication of those fragmented data over the cloud node is performed. Single fragment of particular file can be stored on each of the nodes which ensure that no meaningful information is shown to an attacker on a successful attack. The separation of the nodes is done by T-Coloring in order to prohibit an attacker to guess the fragment's location. The complete data security is ensured by DROPS methodology.