Grid computing enables sharing, selection and aggregation of computing resources for solving complex and large-scale scientific problems. The resources making up a grid need to be managed to provide a good quality of service. Grid scheduling is a vital component of a Computational Grid infrastructure.
This paper presents a dynamic cluster based job scheduling algorithm for efficient execution of user jobs. This paper also includes the comparative performance analysis of our proposed job scheduling algorithm along with other well-known job scheduling algorithms considering the parameters like average waiting time, average turnaround time, average response time and average total completion time.
The result has shown also exhibit that Our proposed scheduling algorithms (CHS ) has shown the best average waiting times, average turnaround times, average response times and average total completion times compared to other job scheduling approaches.

Mobile ad hoc networks are type of wireless networks in which any kind of infrastructure is not used, i.e. there are no infrastructures such as routers or switches or anything else on the network that can be used to support the network structure and the nodes has mobility. The routing is particularly a challenging task in MANETs that selecting paths in a network along which to send network traffic. In this paper, the performance analysis is carried out on Ad-hoc On-demand Distance Vector (AODV), Limited Hop Count AODV (LHC-AODV), Optimized Link State Routing (OLSR), Unnecessary Loop OLSR (UL-OLSR) and Destination Sequenced Distance Vector (DSDV) protocols using NS2 simulator. The delay, throughput, and packet delivery ratio are the three common measures used for the comparison of the performance of above protocols.

The AODV protocol is based on the minimum delay path as its route selection criteria, regardless of the paths load. This issue leads to unbalanced load dissemination in the network and the energy of the nodes on the shortest path deplete earlier than others. We proposed an improved AODV protocol with limited TTL (Time to Live) of RREP packet in which the route reply (RREP) packet of AODV is modified to limite TTL information of nodes. Experiments have been carried out using network simulator software (NS2). Simulation results show that our proposed routing protocol outperforms regular AODV in terms of packet delivery rate, good put, throughput, and jitter.

Mobile ad hoc networks are type of wireless networks in which any kind of infrastructure is not used, i.e. there are no infrastructures such as routers or switches or anything else on the network that can be used to support the network structure and the nodes has mobility. The purpose of this paper is to provide a better quality of the package delivery rate and the throughput, that is in need of powerful routing protocol standards, which can guarantee delivering of the packages to destinations, and the throughput on a network. For achieving this purpose, we use OLSR routing protocol that is a responsive protocol and is currently covered under the IETF standard (RFC 3626). At this paper, we improved the OLSR routing protocol by eliminating the unnecessary loops, and simulation results demonstrated a significant improvement in the criteria of package delivery rate and throughput.