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.
Due to mobility, communication links between mobile nodes are transient and network maintenance overhead is a major performance bottleneck for data transmission. Low node density makes it difficult to establish end-to-end connection, thus impeding a continuous end-to-end path between a source and a destination. This creates a modern type of DTN, which was originally intended for communication in outer...
In Vehicular Ad-hoc Network (VANET), the multi-hop routing frequently breaks off, which has a negative effect on the reliability and transmission quality of the network. The paper proposes a new routing algorithm based on the geographical position, called Multi-Priority Opportunistic Directional Routing (MPODR). The algorithm improves the existing Opportunistic Directional Forwarding Strategy from...
Wireless Mesh Networks are a wireless multi-hop networks in which the nodes are characterized by theirs stability. In this sort of network the minimum cost tree connects sources and receivers by implying a minimum number of forwarding nodes. This paper introduces an adaptation to the popular multicast protocol ODMRP (On-Demand Multicast Routing Protocol) named OODMRP (Optimized On-Demand Multicast...
Intermittent connectivity is common in certain wireless access networks. Existing network protocols are not resilient to disruption of communication links and communication often fails when faced with sporadic connectivity. Thus in recent years there is a growing interest in Intermittently Connected Mobile Networks (also know as Mobile Opportunistic Networks) and many routing protocols have been proposed...
Routing is one of the most challenging open problems in Vehicular Ad hoc NETworks (VANETs) because of the short-lived wireless connectivity environment. Store-carry-and-forward approach using buses on regular routes is considered as one of the most promising emerging routing policy that can significantly improve delivery performance and reliability in VANETs. While none of existing solutions considers...
Delay and Tolerant Networks (DTNs) have been proposed to address data communication challenges in network scenarios, where no instantaneous end-to-end path is guaranteed because of frequent and long duration network partitions. Typical protocols forward a message to multiple nodes to improve message delivery rate. However, a large number of replications consume many system resources that are quite...
In this paper, we present a geographic routing algorithm which can adapt to different levels of mobility by changing its parameters according to the network in which it is running. Routing decisions are based on directions and geographical positions of the nodes and there is no need for an external location system. Discoveries are done using unicast messages resulting in few control messages being...
Over the past years, location-based routing protocols have been studied extensively in mobile ad hoc networks (MANETs). However, how to efficiently provide the location information for nodes is still a challenge. So far, many protocols have been proposed to solve this problem, most of which offer exact routing location information, and are complicated to implement in practice. In this paper, we propose...
Delay Tolerant Network (DTN) is a network paradigm used to deliver messages when network connectivity is not guaranteed. In a DTN, communication is made possible by carriers, mobile nodes that physically carry messages from a network partition to another. Selecting carriers that provide the best delivery probability is a crucial issue. However, if carriers misbehave, the integrity and availability...
Geographic message forwarding in vehicular ad hoc networks (VANET) has attracted much attention and become one of the most promising research areas recent years. In this paper, inspired with the intuition that drivers' route are with high regularity, we propose a prediction-based message forwarding strategy named Seer. Seer trains a 2nd-order Markov model based on long-term historic trip GPS data...
There have been proposed many geographic multicasting protocols for wireless ad hoc sensor networks. Most of these protocols tend to exploit a Source-initiated Geographic Multicasting (SGM) approach which consists of three phases: first, a source collects the position information of all destination nodes; second, the source constructs a multicast tree through the position information; third, the source...
In recent work it has been shown that the use of virtual coordinates or identifiers for efficient routing and data management has several advantages compared to the use of predefined addresses or geographical coordinates. However, these advantages only hold for single domain networks with limited mobility. In this paper, we discuss the challenges arising from using virtual coordinates for routing...
Many disaster recovery and military operations require the frequent movement of specialized personnel and equipment from one operations zone to another. Technology can play a significant role in facilitating resource organization and movements to where the need arises. In this study, we adopt the concept of service discovery in mobile ad hoc networks (MANET) and adapt it to the nature of such operations...
Mobile Ad-hoc Networks (MANETs) enable users in physical proximity to each other to exchange data without the need for expensive communication infrastructures. Each user represents a node in the network, and executes a neighbor discovery Typically, nodes broadcast beacon messages that are received by other participants within the sender’s communication range. Routing strategies are computed on-line...
Delay Tolerant Network (DTN) is a network in which end-to-end connectivity may not be guaranteed because of the frequent and long duration partitions. SMART routing, which is a selective controlled-flooding scheme, utilizes travel companions of the destinations and improves the delivery opportunities, but its flooding overhead can be further controlled. In this paper, we propose A-SMART routing which...
The past few years have seen an increasing interest in the development of vehicular ad hoc networks resulting in many routing protocols proposals. Scalability issues in such networks are attracting increasing attention these days. To improve data delivery performance in large scale networks, we propose SIFT, a trajectory based routing scheme that requires sparse infrastructure and rely on low quality...
A practical scenario to realize Ad hoc network based on the Linux operation system is proposed in this paper. A practical test network composed of several nodes is built and DSR (Dynamic Source Routing) protocol is selected to run on the test network. Meanwhile, in order to obtain better support for real time multimedia services, an improved DSR protocol considering delay demand is also testified...
In this work we deal with the problem of dynamic decentralized self-optimization of forwarding protocols in delay-tolerant networks. We consider the two-hop forwarding protocol and we model the routing problem as an optimization one. We describe, under mild assumptions on the contact process among mobile nodes, the connection between the number of copies of a message and the cumulative probability...
We extend the analysis of the scaling laws of wireless ad hoc networks to the case of correlated nodes movements, which are commonly found in real mobility processes. We consider a simple version of the Reference Point Group Mobility model, in which nodes belonging to the same group are constrained to lie in a disc area, whose center moves uniformly across the network according to the i.i.d. model...
This paper is concerned with fully distributed reputation-based mechanisms that improve security in MANETS. We introduce a number of optimisations to the current reputation schemes used in MANETs such as selective deviation tests and adaptive expiration timer that aim to deal with congestion and quick reputation convergence. We propose to use two different centrality measures for evaluation of the...
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.