An Efficient Shortest Multimodal Route Path Identification for Vehicular Networks (Paperback)

An Efficient Shortest Multimodal Route Path Identification for Vehicular Networks By S. Sivakumar Cover Image
List Price: $33.00
Our Price: $28.05
(Save: $4.95 15%)
Warehouse, In Stock | Usually Ships in 1-5 Days | New


Data mining is defined as the examination step of the Knowledge Discovery inDatabases process (KDD). Data mining is an interdisciplinary subfield of computer science where the computational process of creating patterns in large data sets linking techniques at the intersection of artificial intelligence, machine learning, statistics, and database systems. The main aim of the data mining process is to remove information from a data set and changeitintoalogicalstructureforadditionaluse. Startingfromthe raw analysis step, it engages database and data management features, data pre- processing, model and inference considerations, interestingness metrics, complexity considerations, post-processingofdiscoveredstructures, visualization, andonlineupdating.Khalid Zahedi and Abdul Samad Ismail (2011) designed route mantenance method for link breakage prediction. Routing is the choice of the finest route path for transmitting of vehicular packets from source nodes to te destination end. In packet switching networks, routing helps packet forwarding, the transportationofreasonablytackled packets from their source toward final destination by means of theintermediate nodes usually the hardware devices called routers, bridges, gateways, firewalls, or switches. Many routing algorithms employs only one network path at a time, but multipath routing techniques enable the use of multiple alternative paths. From order to make the efficient route path, the two techniques have to be followed.They are: - Route Discovery- Route Maintenance

Product Details
ISBN: 9798210070432
Publisher: Blurb
Publication Date: February 24th, 2022
Pages: 220
Language: English