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 mobile ad-hoc wireless networks (MANETs), a node is expected to forward packets from the source to the destination (on the behalf of the source), over multiple hops, for the benefit of other nodes. The residual battery level of a node in an ad-hoc network is a very critical and crucial resource as the life of the node is determined it. In this paper, our intention is to conserve the battery power...
The main contribution of this work is to propose a distributed and collaborative cache solution in which the decisions to cache objects are performed in a collaborative way. In our solution, objects are classified in private and shared objects. Private objects are managed as in an individual cache system whereas the management of shared objects are performed collectively and are stored in a shared...
Cooperation enforcement in Mobile Ad Hoc Networks (MANET) and Wireless Sensor Networks (WSN) typically relies on separate detection and punishment schemes that isolate selfish nodes from routing and receiving network services. However, cooperative nodes then have to carry all the traffic. We propose a system that enforces cooperation smoothly and assures a fair distribution of bandwidth, as well as...
Securing a Wireless Ad Hoc Network is one of the major concerns for the researchers. Due to wide-ranging characteristics of the ad-hoc networks, it is always at a risk to internal as well as external attacks. Many solutions have been proposed and currently being improved in this area. Most of these solutions involve encryption, secure routing, quality of service etc. Each of them is designed to operate...
Existing service discovery mechanisms for ad hoc networks are often designed with one specific network type in mind. Solutions capable of handling highly mobile nodes usually have high bandwidth requirements, particularly as the number of nodes increases. The bandwidth requirement can be reduced by locally caching state information, but this increases the risk of nodes having outdated state information...
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...
Peer-To-Peer (P2P) and Mobile Ad hoc Networks (MANETs) share the same key concepts of self-organization and decentralization, and both aim to provide connectivity in a completely decentralized manner. Routing algorithms for MANETs can potentially benefit from the combination with P2P overlay routing algorithms. Some efforts have been made to integrate P2P overlay into MANETs, but all work is based...
Routing remains one of the key challenges in vehicular networks due to their special properties such as the high mobility and the intermittent connectivity. Almost all the efficient routing solutions proposed for VANETs are based on geographic information provided by the navigation systems widely deployed in the new generation of vehicles. Typically, in these position-based protocols, a source node...
Distributed mutual exclusion provides access to shared critical resources amongst different mobile nodes in a MANET. Several solutions for fixed networks like token-based and permission-based algorithms have been proposed in the literature. In this paper, we have come up with a novel permission-based algorithm for solving the problem that can handle site failures. Our approach introduces a new message...
In this paper, IDS (Intrusion Detection System) nodes are deployed in MANETs in order to mitigate black hole attacks. The IDS nodes must be set in sniff mode in order to perform the so-called ABM (Anti-Blackhole Mechanism) function, which is mainly used to estimate a suspicious value of a node according to the abnormal difference between the routing messages transmitted from the node. When a suspicious...
The dynamic nature of mobile ad-hoc networks (MANETs) can easily lead to data being inaccessible due to constant route changes and network partitions. One method often used for increasing reliability and availability of data is replication. However, replication comes with costs, those of transferring and storing data and keeping track of consistency between replicas. For that reason, we have identified...
We analyze the dynamics of two mobility datasets in DTN (Delay Tolerant Network), collected from different sources, including one university campus WLAN and two conferences WLANs. We find that the temporal network density of DTN changes with time and approximate varies periodically. We study how the cyclic temporal network density affects information diffusion. The results show that average reachability...
Location-based routing for Mobile Ad hoc Networks (MANETs) use location information in routing decisions. However, location-based routing protocols need location services to query the location information of the communication partner node so that packets could be forwarded properly. In this paper, we propose a proactive flooding-based location service which named Semi-Flooding Location Service (SFLS)...
Although establishing stable routes for routing can improve the performance of mobile an hoc networks (MANETs), the improvement will be weakened to a degree for the stability of route is sensitive to the motion of node. In this paper, based on a basic stability-oriented routing scheme, named FORP, we involved two mobility-adaptive mechanisms in it. One mechanism is the real-time update of stability...
Multi-path routing has been studied thoroughly in the context of wired networks. It has been shown that using multiple paths to route messages between any source-destination pair of nodes (instead of using a single path) balances the load more evenly throughout the network. This paper introduces a traffic estimator which makes calculations based on previously sent packets and we introduce a new model...
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...
Opportunistic routing is a recent routing paradigm that achieves high throughput in the face of universally lossy wireless links in mobile ad hoc networks, however, how to applying this novel technique to reliable wireless multicast is a challenging task. Due to feedback explosion, most existing wireless network multicast protocols don't guarantee the reliable delivery. In this paper, we propose a...
For unpredictable manner of mobile ad hoc network (manet), due to mobility of nodes in network, the shortest path is not necessarily the better path. If we do not consider the stability of routing path, then wireless links may be easily broken. Hence it is important to find a route that endures a longer time. Recently, efforts in this field have dealt the parameters battery power or trust of a node...
Due to the network topology of an ad hoc network changes frequently and unpredictable, the security of multicast routing becomes more challenging than the traditional networks. In this paper, we describes a dynamic multicast height balanced group key agreement that allows a user in a multicast group to dynamically compose the group key and securely deliver multicast data for a multicast source to...
An admission control Algorithm must organize among flows and should afford assurance of how the medium is shared between nodes. In a wired network, nodes can keep an eye on the medium to see how much bandwidth is being used by the network. On the other hand, in an Ad-Hoc network, during communication nodes possibly will use the bandwidth of neighbouring nodes. Consequently, the bandwidth consumption...
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.