The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we proposed a long-life, shortest path routing method for interval-vehicle communication. Firstly, we form the inter-vehicle network into the layered network to construct the shortest path. Next, we deduce the link with maximal lifetime between two directly linked vehicles according to their velocities and moving directions. Furthermore, the lifetime of one hop neighbors is propagated...
Inter-vehicle communications (IVC) based on mobile ad hoc networks have attracted increasing attention of researchers recently. In this paper, we study the communication performance of IVC networks in multilane dynamic traffic streams. We are concerned with the influence of several traffic factors on multilane communications, such as vehicles' high mobility, traffic directions or relative speed, and...
We propose multicast extensions to the flow oriented routing protocol (M-FORP) and node velocity based stable path (M-NVSP) routing protocol for mobile ad hoc networks. M-FORP predicts the link expiration time and connects the source to each of the multicast receivers through paths with the largest predicted expiration time. M-NVSP connects the source to each of the multicast receivers through paths...
In classical routing strategies for multihop mobile wireless networks packets are routed on a pre-defined route usually obtained by a shortest path routing protocol. In opportunistic routing schemes, for each packet and each hop, the next relay is found by dynamically selecting the node that captures the packet transmission and which is the nearest to the destination. Such a scheme allows each packet...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.