Bücher von Vikrant Sharma

Dans ce travail d'étude, nous nous concentrons sur les problèmes de performance des protocoles de routage, Optimized Link State Routing (OLSR), Ad Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), et Temporally Ordered Routing Algorithm (TORA) dans les réseaux ad-hoc mobiles et autonomes. Nous présentons le routage à vecteur de distance ad hoc à la demande (AODV), un nouvel algorithme pour le fonctionnement de ces réseaux ad hoc. Notre nouvel algorithme de routage est tout à fait adapté à un réseau dynamique à démarrage automatique, comme l'exigent les utilisateurs désireux d'utiliser des réseaux ad hoc. Nous incluons également une méthodologie d'évaluation et des résultats de simulation pour vérifier le fonctionnement de notre algorithme.

In questo lavoro di studio, ci concentriamo sui problemi di prestazioni dei protocolli di routing, Optimized Link State Routing (OLSR), Ad Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR) e Temporally Ordered Routing Algorithm (TORA) in reti ad-hoc mobili e autonome. Presentiamo Ad-hoc On Demand Distance Vector Routing (AODV), un nuovo algoritmo per il funzionamento di tali reti ad-hoc. Il nostro nuovo algoritmo di routing è adatto a una rete dinamica che si avvia da sola, come richiesto dagli utenti che desiderano utilizzare le reti ad-hoc. Dimostriamo che il nostro algoritmo è adatto a grandi popolazioni di nodi mobili che desiderano formare reti ad-hoc. Includiamo anche una metodologia di valutazione e risultati di simulazione per verificare il funzionamento del nostro algoritmo.

En este trabajo de estudio, nos centramos en los problemas de rendimiento de los protocolos de enrutamiento, Optimized Link State Routing (OLSR), Ad Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), y Temporally Ordered Routing Algorithm (TORA) en redes ad-hoc de movilidad y autónomas. Presentamos Ad-hoc On Demand Distance Vector Routing (AODV), un algoritmo novedoso para el funcionamiento de este tipo de redes ad-hoc. Nuestro nuevo algoritmo de encaminamiento es muy adecuado para una red dinámica de arranque automático, como la que necesitan los usuarios que desean utilizar redes ad-hoc. Demostramos que nuestro algoritmo se adapta a grandes poblaciones de nodos móviles que desean formar redes ad-hoc. También incluimos una metodología de evaluación y resultados de simulación para verificar el funcionamiento de nuestro algoritmo.

In dieser Studie konzentrieren wir uns auf Leistungsprobleme von Routing-Protokollen, Optimized Link State Routing (OLSR), Ad-hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR) und Temporally Ordered Routing Algorithm (TORA) in mobilen und eigenständigen Ad-hoc-Netzen. Wir stellen Ad-hoc On Demand Distance Vector Routing (AODV) vor, einen neuartigen Algorithmus für den Betrieb solcher Ad-hoc-Netze. Unser neuer Routing-Algorithmus eignet sich gut für ein dynamisches, selbststartendes Netzwerk, wie es von Nutzern benötigt wird, die Ad-hoc-Netzwerke nutzen wollen, und wir zeigen, dass unser Algorithmus für große Populationen mobiler Knoten geeignet ist, die Ad-hoc-Netzwerke bilden wollen. Wir fügen auch eine Bewertungsmethodik und Simulationsergebnisse hinzu, um die Funktionsweise unseres Algorithmus zu überprüfen.

V dannoj rabote my rassmatriwaem woprosy proizwoditel'nosti protokolow marshrutizacii: optimizirowannoj marshrutizacii po sostoqniqm kanalow (OLSR), marshrutizacii po trebowaniü (AODV), dinamicheskoj marshrutizacii po istochniku (DSR) i algoritma marshrutizacii s wremennym uporqdochiwaniem (TORA) w mobil'nyh i awtonomnyh setqh ad-hoc. My predstawlqem nowyj algoritm Ad-hoc On Demand Distance Vector Routing (AODV), prednaznachennyj dlq raboty w takih setqh ad-hoc. Nash nowyj algoritm marshrutizacii wpolne podhodit dlq dinamicheskoj samozapuskaüschejsq seti, kak äto trebuetsq pol'zowatelqm, zhelaüschim ispol'zowat' seti ad-hoc. My pokazywaem, chto nash algoritm masshtabiruetsq na bol'shie sowokupnosti mobil'nyh uzlow, zhelaüschih sformirowat' seti ad-hoc. My takzhe priwodim metodiku ocenki i rezul'taty modelirowaniq, podtwerzhdaüschie rabotosposobnost' nashego algoritma.

In this study work, we focus on performance issues of routing protocols, Optimized Link State Routing (OLSR), Ad Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Temporally Ordered Routing Algorithm (TORA) in mobility and standalone ad-hoc networks. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks.We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.

Breast cancer is believed to be one in all most far reaching causes of death among women and second highest reason for deaths among humans. Today millions of women are suffering from breast cancer. It is difficult to detect breast cancer in the early stages due to its dormant nature and very few signs and symptoms. Therefore the main reason behind the diagnosis of breast cancer is to decrease the death rate by achieving accurate results. Hence there is a need to automate the diagnostic process to improve the sensitivity and accuracy of the tests. An artificial intelligence based hierarchical fuzzy expert system is developed which consists of risk parameters, subjective parameters, mammograms and cancerous cell images to diagnose breast cancer with precise results.