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, the performance of network codingbased gossip algorithms -- i.e. algebraic gossip algorithms -- is analyzed on random geometric graphs under static and mobile environments. The lower bounds for the convergence time of algebraic gossip algorithms are derived based on the conductance, and these bounds are O(n log n log ε -- 1 -- log n log ε -- 1) with node...
Group mobility is quite usual in many realistic mobile and wireless environments, but it is rarely adopted in multipath routing. We propose a Group mobility-based Multipath Routing protocol (GMR) for large and dense mobile ad-hoc networks (MANETs). The GMR protocol adapts intra-group routing and inter-group routing to handle group mobility. The routing table maintained by a group leader is used to...
Conventional routing algorithms in mobile ad hoc networks (MANETs), i.e., multi-hop forwarding, assume the existence of contemporaneous source-destination paths and are not scalable to large networks. On the other hand, in delay tolerant networks (DTNs), routing protocols use the mobility- assisted, store-carry-forward paradigm which allows delivery among disconnected network components. Adaptive...
Routing is the foremost issue in mobile ad hoc networks (MANETs). To guarantee delivery and improve performance, most position-based routing protocols, e.g., greedy-face-greedy (GFG), forward a message in greedy routing mode until the message is forwarded to a local minimum where greedy forwarding is impossible. They then switch to a less efficient mode known as face routing. Face routing requires...
In mobile ad hoc networks, solving the standard problems encountered in fixed networks can be challenging because of the unpredictable motion of mobile nodes. Due to the lack of a fixed infrastructure to serve as the backbone of the network, it is difficult to manage nodes' locations and ensure stable node performance. In this paper, we introduce an extension of an algorithm, multi-path intelligent...
The publish/subscribe (pub/sub for short) paradigm is used to deliver events from a source to interested clients in an asynchronous way. Recently, extending a pub/sub system in wireless networks has become a promising topic. However, most existing works focus on pub/sub systems in infrastructured wireless networks. To adapt pub/sub systems to mobile ad hoc networks, we propose DRIP, a dynamic Voronoi...
Any cast is a communication paradigm that was first introduced to the suit of routing protocols in IPv6 networks. In anycast, a packet is intended to be delivered to one of the nearest group hosts, k-anycast, however, is proposed to deliver a packet to any threshold k members of a set of hosts. In this paper, we propose three k-anycast routing schemes for mobile ad hoc networks. Our research work...
Recent work in mobile ad hoc networks, simply MANETs, has drawn attention to the mobility capability of each node. In the work of Goldenberg et al. (2004), it is proved that the optimal positions of the relay nodes along a single active flow must lie entirely on the line between the source and destination with each node spaced evenly along such a line. Based on this, we propose two distributed schemes...
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.