阿根廷vs墨西哥竞猜
 library logo
    • login
    view item 
    •   knowledge commons home
    • electronic theses and dissertations
    • electronic theses and dissertations from 2009
    • view item
    •   knowledge commons home
    • electronic theses and dissertations
    • electronic theses and dissertations from 2009
    • view item
    javascript is disabled for your browser. some features of this site may not work without it.
    quick search

    browse

    all of knowledge commonscommunities & collectionsby issue dateauthorstitlessubjectsdisciplineadvisorcommittee memberthis collectionby issue dateauthorstitlessubjectsdisciplineadvisorcommittee member

    my account

    login

    efficient routing algorithms in vehicular ad hoc networks

    thumbnail
    view/open
    ghaemiy2022m-1a.pdf (4.180mb)
    date
    2021
    author
    ghaemi, yashar
    metadata
    show full item record
    abstract
     
     
    during the last decade, the research on intelligent transportation system (its) has improved exponentially in real-life scenarios to provide optimized transport network performance. it is a matter of importance that the emergency messages being delivered in a timely manner to prevent vehicular traffic problems. the fact is an its system per se could be a part of a vehicular ad hoc network (vanet) which is an extension of the wireless ad hoc network. therefore, similar to the other ad hoc networks, the nodes in the network can send data packets to each other through intermediate forwarding nodes. in all sorts of wireless ad hoc networks, the network topology is subjected to change due to the mobility of network nodes; therefore, an existing explored route between two nodes could be demolished in a minor fraction of time. when it turns to the vanets, the topology likely changes due to the high velocity of nodes. on the other hand, time is a crucial factor playing an important role in message handling between the network’s nodes. in this regard, we propose centralized its multi-path routing protocol for vanets (mprp) that effectively identifies an optimized path for packet delivery to the destination vehicle with a minimal time delay. our algorithm gives a higher priority to the alert messages compared to normal messages. as a result, our algorithm would realize two goals. firstly, speed up the data transmission rate and deliver data packets, particularly warning messages, to the destination vehicle promptly and therefore avoids vehicular problems such as car accidents. [...]
     
    uri
    https://knowledgecommons.lakeheadu.ca/handle/2453/5036
    collections
    • electronic theses and dissertations from 2009 [1612]

    阿根廷vs墨西哥竞猜 library
    contact us | send feedback

     

     


    阿根廷vs墨西哥竞猜 library
    contact us | send feedback