International Conference on Intelligent Computing and Systems
24
International Conference on Intelligent Computing and Systems 2017 [ICICS 2017]
ISBN Website Received Article ID
978-81-933235-5-7 icics.asia 10 – January – 2017 ICICS047
VOL eMail Accepted eAID
01 icics@asdf.res.in 28 - January – 2017 ICICS.2017.047
Routing Protocol Classification and Improving QOS Metrics: A Survey 1
K Jothimani1, P Gomathi3 Assistant Professor/CSE, Professor & Dean, EEE, NSN College of Engineering and Technology, India 2
Abstract: Mobile ad hoc network (MANET) is a self-governing system of mobile nodes which is an infrastructure less network and requires no centralized management. Mobile ad hoc networks are self-organizing and self-configuring network where, the structure of topology is changed arbitrarily and communication will take place via radio waves at anywhere and anytime. The goal of Quality of service (QoS) is to provide a better service to the selected network traffic. QoS for wireless is more challenging than wired network due to node mobility and resource constraints. This paper discusses various classification of routing protocols in MANET and the QoS parameters like end-to-end delay, energy, bandwidth, packet delivery ratio, jitter, throughput and so on for different types of routing protocols such as proactive, reactive, hybrid, power-aware, position based which are used in mobile ad hoc networks.
ISBN Website Received Article ID
978-81-933235-5-7 icics.asia 10 – January – 2017 ICICS048
VOL eMail Accepted eAID
01 icics@asdf.res.in 28 - January – 2017 ICICS.2017.048
An Efficient Heuristic Method for Solving Vehicle Routing Problem 1
K Pandeeswari1, P Gomathi2 Assistant Professor, CSE, Dean & Professor, EEE, NSN College of Engineering and Technology, India 2
Abstract: A solution is designed for the vehicles to minimize the cost of distribution by which it can supply the goods to the customers with its known capacity can be named as a vehicle routing problem. In Clarke and Wrights saving method and Chopra and Meindl savings matrix method mainly an efficient vehicle routing can be achieved by calculating the distance matrix and savings matrix values based on the customers location or the path where the customer’s resides. The main objectives of this paper are to reduce the total distance and the total number of vehicles which is used to deliver the goods to the customers. There are few new algorithms which are mainly based on the min-min, max-min and k-means clustering algorithm techniques which are used in cloud computing and data mining scenario effectively. The proposed algorithm decreases the total distance and the number of vehicles assigning to each route. The important thing we need to consider here is that, this new algorithm can enhance the Chopra & Meindl saving matrix method and Clarke and Wright saving matrix method. This paper is prepared exclusively for International Conference on Intelligent Computing and Systems 2017 [ICICS 2017] which is published by ASDF International, Registered in London, United Kingdom under the directions of the Editor-in-Chief Dr M Sivaraja and Editors Dr. Daniel James, Dr. Kokula Krishna Hari Kunasekaran and Dr. Saikishore Elangovan. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honoured. For all other uses, contact the owner/author(s). Copyright Holder can be reached at copy@asdf.international for distribution.
2017 © Reserved by Association of Scientists, Developers and Faculties [www.ASDF.international]