Time filter

Source Type

Chandigarh, India

Kalra M.,NITTTR | Singh S.,Panjab University
Egyptian Informatics Journal | Year: 2015

Cloud computing has become a buzzword in the area of high performance distributed computing as it provides on-demand access to shared pool of resources over Internet in a self-service, dynamically scalable and metered manner. Cloud computing is still in its infancy, so to reap its full benefits, much research is required across a broad array of topics. One of the important research issues which need to be focused for its efficient performance is scheduling. The goal of scheduling is to map tasks to appropriate resources that optimize one or more objectives. Scheduling in cloud computing belongs to a category of problems known as NP-hard problem due to large solution space and thus it takes a long time to find an optimal solution. There are no algorithms which may produce optimal solution within polynomial time to solve these problems. In cloud environment, it is preferable to find suboptimal solution, but in short period of time. Metaheuristic based techniques have been proved to achieve near optimal solutions within reasonable time for such problems. In this paper, we provide an extensive survey and comparative analysis of various scheduling algorithms for cloud and grid environments based on three popular metaheuristic techniques: Ant Colony Optimization (ACO), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), and two novel techniques: League Championship Algorithm (LCA) and BAT algorithm. © 2015. Source

Tuteja A.,Mm University | Gujral R.,Mm University | Thalia S.,NITTTR
ACE 2010 - 2010 International Conference on Advances in Computer Engineering | Year: 2010

Mobile Ad-Hoc networks are highly dynamic networks characterized by the absence of physical infrastructure. Nodes of these networks functions as a routers which discovers and maintains the routes to other nodes in the network. In such networks, nodes are able to move and synchronize with their neighbors. Due to mobility, connections in the network can change dynamically and nodes can be added and removed at any time. In this paper, we are going to compare Mobile Ad-Hoc network routing protocols DSDV, AODV and DSR using network simulator NS2.34. We have compared the performance of three protocols together and individually too. The performance matrix includes PDR (Packet Delivery Ratio), Throughput, End to End Delay, Routing overhead. We are comparing the performance of routing protocols when packet size changes, when time interval between packet sending changes, when mobility of nodes changes. © 2010 IEEE. Source

International Conference on Computing, Communication and Automation, ICCCA 2015 | Year: 2015

Cloud Computing is a major area of research. Nature Inspired Algorithms (NIAs) form the major portion of research going on in the Cloud today. NIAs as the name suggests are the algorithms whose source of inspiration is nature. NIAs can further be classified into algorithms based on Swarm Intelligence (SI), Biological Phenomena (called Bio-inspired BI), Physics and Chemistry systems or based on some other things. SI based algorithms are called intelligent because they are known to learn and improve their performance by observing the output on previous moves made by them. NIAs provide an efficient solution to many real-world optimization problems which are categorized to be NP-Hard Problems. NIAs have a huge list of applications and most of them prove to be more efficient than other algorithms and thus are many a time used in combination to other algorithms in order to improve performance and thus deliver a better QoS. The paper intends to review, classify and briefly describe various NIAs and the principle behind each algorithm so as to inspire further research. The paper also lists the applications of various NIAs. NIAs also find their application in Cluster and Grid Computing. © 2015 IEEE. Source

Mehra R.,NITTTR | Singh A.,RGGI
Proceedings of the 2013 3rd IEEE International Advance Computing Conference, IACC 2013 | Year: 2013

Recently received signal strength (RSS)-based distance estimation technique has been proposed as a low complexity, low-cost solution for mobile communication node with minimum RSSI error. After investigating the existing algorithm of location technique, it is observed that the distribution of RSSI-value at each sample point is fluctuant even in the same position due to shadow fading effect. Therefore, here present a novel method for RSSI error reduction in distance estimation using recursive least square (RLS)-algorithm to the existing deterministic algorithms. The proposed method collects RSSI-values from the mobile communication node to build the probability model. Once the probability models are estimated for different standard deviation related to path loss exponent using adaptive filtering in real time, it is possible to accurately determine the distance between the mobile communication node and fixed communication node. From simulation results it is shown, that the accuracy of RSSI-value for mobile communication node in real time distance estimation is improved in changing environments. © 2013 IEEE. Source

Bhateja V.,SRMCEM | Devi S.,NITTTR
ICECT 2011 - 2011 3rd International Conference on Electronics Computer Technology | Year: 2011

Minute calcium deposits that appear as bright spots on mammograms are known as microcalcifications. Calcifications in ducts and lobules are common markers of malignancy; therefore its detection plays a vital role in early detection of breast cancer. This paper proposes a novel framework for edge detection of microcalcifications using a combination of non-linear enhancement operator and morphological filter. The contrast improvement of the region of interest for better visualization of mammographic abnormalities is obtained using the proposed non-linear operator. This enhancement operator is versatile in approach, producing promising results for dense as well as non dense breast tissues. The enhanced ROI is then convolved with the proposed mask of two stage iterative discrete morphological gradient operator with variable sized structuring elements leading to improved edge detection of microcalcifications. © 2011 IEEE. Source

Discover hidden collaborations