Dynamic Routing Protocol

The Online-Examination for Blind People is basi-cally an online examination system. It reflects the justification and objectivity of examination. It helps to release the workload of teachers and students. The current online examination systems do not allow blind people to appear for the examination. Hence, the proposed application is designed for the blind people so that they can appear for examination; it is also useful for the other handicapped people with upper limb disability. This research work provides the speech user interface for blind people to interact with the application. The proposed application will dictate the questions to the candidate with the help of Speech Synthesis. The application will accept the answers from candidates through voice commands using Speech Recognition. The proposed system also allows users (examiners/teachers) to add their questions to conduct the examination. The questions can be added easily by uploading a file. As the proposed system is online, result generation will be quick.

The current facilities/services of a campus such as requesting for documents, certificates, permissions etc. are fulfilled manually which takes a lot of time. The aim of our project is to develop an E-Help Desk (EHD) for the facilities available in the college campus. This is a web application that can be accessed throughout the campus. Our system can be used to automate the work flow of service requests for the various facilities available in the college campus. This is an integrated system that covers different kinds of sections/departments such as student section, accounts department, exam section, labs, departmental offices etc. Registered users i.e. students will log in to request for service of any of the supported facilities. The different requests will be sent to the concerned facility heads, who are also valid users of the system, who will fulfill the requests. Then the registered users will be notified through email notification about the status of their request.

During the last decades people have become witnesses to the rapid expansion of data networks. New ways of working, communicating and socializing have been accompanied by new terms such as “Bring your own device” (BYOD), the “Internet of things” and of course Cloud services. Routing protocol evolution has followed a similar path, simple distance-vector protocols and default routes led the way to link-state and hybrid protocols. This evolution is attributed to the following business demands: fast convergence in data centers in order to accommodate redundancy and failover requirements, public and private clouds service level management, and higher percentage availability.
The focus of this thesis is based on the two internal gateway protocols, OSPF and EIGRP, which monopolize the market, as more or less industry standards. Both operate inside an autonomous system, and while having different ways to form relationships among routing devices, adapt to topology changes and handle failures, they provide the same results: robust routing tables and network stability.
The objective is to evaluate their performance characteristics and more specifically their network convergence duration, video conference packet delay variation, IP voice jitter and CPU utilization in two different topologies. The first topology provides the basis for simulation comparison, while the second examines the scaling effects of both protocols.

Energy requirement of India particularly heating & cooling in space is likely to increase by for fold within the span of 20 years. So energy efficiency has been prime importance in HVAC system. There are various other options available for energy saving in HVAC systems and Variable Refrigerant Flow (VRF) technology is one of them. In heating/cooling space VRF technology is having considerable potential for energy saving (10% to 40%).

In mobile ad hoc networks (MANETs), links are created and destroyed in an unpredictable way, which makes quite challenging the determination of routes between each pair of nodes. In this paper, we propose a formulation of the routing problem in multi-services MANETs, as well as the implementation of an adaptation of the dynamic source routing (DSR) protocol.

ABSTRAK
Routing merupakan proses mengirim data dari satu network ke network lain. Dengan dynamic routing maka mekanisme routing dilakukan secara dinamis dengan menentukan jarak terpendek secara cepat dan akurat antara pengirim dan penerima. Open Shortest Path First (OSPF) dan Intermediate System to Intermediate System (IS-IS) merupakan protokol dynamic routing yang menggunakan algoritma link-state untuk membangun dan menghitung jalur terbaik ke semua tujuan yang diketahui.
Penelitian ini mensimulasikan routing protokol OSPF dan IS-IS untuk menguji dan menganalisa kinerja dari routing protokol tersebut agar diketahui perbandingan waktu proses lamanya routing yang lebih cepat dalam menentukan jalur dengan menggunakan software Wireshark.
Kata kunci : dynamic routing, OSPF, ISIS, Wireshark.
ABSTRACT
Routing is the process of sending data from one network to another network. With the dynamic routing mechanism dynamically routing is done by determining the shortest distance quickly and accurately between the sender and receiver equipment. Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (IS-IS) is a dynamic routing protocol that uses link-state algorithm to build and calculate the shortest path to all known destinations.
Research was simulate OSPF and IS-IS routing protocols to test and analyze the performance of routing protocols in order to know the length of processing time comparison faster routing in determining the path using Wireshark software.
Keywords: dynamic routing, OSPF, ISIS, Wireshark.

Gossip-based protocols for group communication have attractive scalability and reliability properties. The gossip schemes studied so far typically assume that each group member has full knowledge of the global membership and chooses gossip targets uniformly at random. In this study, we present a design of a routing algorithm that has the properties of gossip style of disseminating link state updates with the intention of making it faster than the current algorithms.

Network-on-Chip (NoC) has become one of the regular options in scaling chip multiprocessor (CMP) systems. While scaling networks in deep submicron (DSM) technology and with multiple cores, the NoC systems are subjected to manufacturing defects which results in low productivity, one such defects being the fault issues which reduce the number of available routing paths for packet delivery that will lead to severe traffic congestion finally resulting in a system crash. Therefore this gives rise to the necessity for the fault-tolerant routing algorithm which ensures the correct functioning of system. In order to overcome fault problems, we can employ fault-tolerant routing algorithm, many fault-tolerant routing algorithms such as Modified X-First, Gradient, Minimal and defect-resilient (MD) and PDA-FTR are available which considers path diversity information and buffer information. In this work we are going to make performance analysis of all this algorithms with respect to parameters such as saturation throughput, area and power efficiency for single and multiple faulty routers NoC systems under different traffic scenarios including both synthetic and real traffics. When we compare performance results of these fault-tolerant routing algorithms, it is found that PDA-FTR has improved average saturation throughput with only 8.9 % average area overhead and 7.1 % average power overhead.

In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.

Energy in wireless sensor networks (WSNs) are quite limited. Since sensor nodes are usually much dense, data sampled by sensor nodes have much redundancy, data aggregation becomes an effective method to eliminate redundancy, minimize the number of transmission, and then to save energy. Many applications can be deployed in WSNs and various sensors are embedded in nodes, the packets generated by heterogenous sensors or different applications have different attributes. The packets from different applications cannot be aggregated. Otherwise, most data aggregation schemes employ static routing protocols, which cannot dynamically or intentionally forward packets according to network state or packet types. The spatial isolation caused by static routing protocol is un favourable to data aggregation. To make data aggregation more efficient, in this paper, we introduce the concept of packet attribute, and then propose an attribute-aware data aggregation (ADA) scheme consisting of a packet-driven timing algorithm and a special dynamic routing protocol. Inspired by the concept of potential in physics and pheromone in ant colony, a potential-based dynamic routing is elaborated to support an ADA strategy it.

Wireless sensor network is an interesting research area that has been extensively discussed because of its importance in the most applications such as environmental monitoring, healthcare purposes, traffic control, and military systems. Sensor network consists of a large number of sensor nodes that are widely distributed in the environment to collect phenomena data. In this thesis, a smart fire system is proposed to predict, control, and alert fire occurrences by using multiple fuzzy-based methods. This system aids less energy to be consumed for transmitting various messages between wireless nodes, network traffic to be reduced over the network, and network lifetime to be prolonged consequently. The proposed routing protocols are, generally, categorized into two groups: static and dynamic. The static protocols are used to transmit data packets between the stationary nodes placed in different locations. The dynamic protocols direct, control, and transmit messages between vehicles and rescue team members. Besides, several fuzzy systems are offered to detect explosion possibility, determine fire probability, measure the intensity and volume of the fire, estimate fire progress, detect the burn possibility, and determine suffocation probability. In addition, the system determines the active and passive nodes as well as detects failure nodes throughout the network. Rescue teams are dispatched to events on the best path, between fire department and event place, that is selected by another fuzzy-based procedure. This procedure leads the rescue and support teams to be dispatched to events in a short time. Simulation and evaluation results show that the proposed fire system has a high performance compared to the most existing fire systems.