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 the design of mobile ad hoc networks, a challenging problem is how to route information reliably and efficiently from one node to another in moderate to high level of mobility. In this paper, we propose a new routing protocol, called link effective available time (LEAT) routing. First, we propose a method to find the link available time during an epoch by measuring the distances between the two...
We describe a novel geometric localized routing (GLR) protocol in disruption (delay) tolerant network (DTN). Although DTNs do not guarantee the connectivity of the network all the time, geometric location information still could be used to make routing decisions in a store and forward way. Geometric planar spanners, especially local Delaunay triangulation can also be used in DTN to provide a good...
Broadcasting is a vital communication mechanism in mobile ad hoc networks, as it is the key element for exchanging control packets to support some services such as management and routing protocols. Simple Flooding, which is mostly used as the broadcasting mechanism, is neither resource efficient nor reliable especially in high populated and dense networks. The distance-based (DB) scheme is one of...
In this paper, we propose a new node allocation scheme that is based on a probabilistic approach to protect a mobile ad hoc network (MANET) from partitioning. This scheme adopts the normal distribution for node placement and we refer to it as the normally(N)-distributed node allocation scheme (N-NAS). The proposed scheme is able to achieve high connectivity and good degree of coverage by controlling...
The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and delay tolerant networks (DTNs), where end-to-end multi-hop paths may not exist and communication routes may only be available through time and mobility. We use analytical tools to derive generic theoretical upper bounds for the information propagation speed in large scale mobile and intermittently...
We propose an algorithm to predict the link lifetime in MANETs by the Unscented Kalman Filter (UKF). The algorithm recursively computes the UKF states, modeled as a nonlinear system, using periodically measured distances as inputs. The UKF states are then utilized to compute the estimates of the remaining link lifetime. Evaluation of the proposed algorithm demonstrates robust performance in computing...
This paper proposes a scenario based, adaptive and distributed clustering algorithm SCAM (Scenario-based Clustering Algorithm for Mobile ad hoc networks). A distributed algorithm based on (k, r) - DominatingSet is used for the selection of clusterheads and gateway nodes, here k is the minimum number of clusterheads per node in the network and r is the maximum number of hops between the node and the...
Hexagonal grid is a popular and powerful network model in various networks and especially in the mobile ad-hoc networks (MANETs). To the best of our knowledge, however, there is no suitable coordinate system for the hexagonal grids. So it has been a big challenge to solve the node location problem for hexagonal grids in MANETs. In this paper, we propose an intuitive and simple two-dimensional logical...
Wireless mesh networks (WMN) is a new type of wireless access network that combines the advantages of wireless local area networks (WLAN) with those of mobile ad hoc networks (MANET). The localization of mobile nodes in WMN has not been paid much attention as of yet in comparison with that of WLAN and MANET. As an essential component of user mobility support, localization in WMN should be more accurate...
Since mobility may cause radio links to break frequently, one pivotal issue for routing in mobile ad hoc networks is how to select a reliable path that can last longer. Several metrics have been proposed in previous literatures, including link persistence, link duration, link availability, link residual time, and their path equivalents. In this paper, we present a novel algorithm for predicting continuous...
Ubiquitous network connectivity is challenged in areas outside of the range of wireless base stations and cellular networks. In such networks the mobile nodes are disconnected for significantly long periods of time. In this paper, we propose an approach where mobile nodes deposit/retrieve messages to/from known point locations in the geographic region. Messages are delivered from a source by being...
In this article, we have concentrated on selecting there liable path from source to destination in a mobile ad-hoc net work (MANET) framework using Dempster-Shafer Theory (DST) of evidence. The belief and plausibility functions are used here for calculating the suitable path for sending data packet from source to destination selecting the proper neighborhood on the basis of radio range of the source...
The mapping of cellular architecture into mobile ad hoc network (MANET) leads to the design of Linked Cluster Architecture (LCA), where every cluster has a head node associated with zero or more member nodes. In order to achieve a faster cluster setup, we consider mobility of nodes as the deciding parameter for selecting the heads and their associated members. A node having the lowest mobility among...
This paper proposes a novel node localization algorithm that collaborates with street maps to estimate the locations of mobile nodes. It uses simple motion equations for moving objects in two dimensions to estimate the location of nodes, and then verifies the estimated location using street maps. This localization algorithm reduces the number of periodic beacons propagated into the network and reduces...
Ad hoc networks are self-configuring networks of mobile nodes, connected by wireless links. Suppose each mobile node can make observations within a circular area of radius robs centred on its own location. The area coverage of the network is defined as the total area observed by the mobile nodes. We investigate a distributed scalable method based on local interactions with minimal sensing and low...
In delay tolerant network, a complete routing path from a source to a destination can not be guaranteed at most of the time. Therefore, traditional routing method for ad hoc network is not applicable in these situations. Current approaches for such networks are primarily based on redundant transmissions and single copy direct routing. However, they incur either high overhead due to excessive transmissions...
In this paper we have presented a physical implementation of a topology control algorithm for MANETs. Mobile nodes follow the characteristics of the nomadic community mobility model. The proposed algorithm maintains the topology without any control message. There is no need to change routing table as connectivity of the network is maintained all through. Every node in the network is free to travel...
There has been great interest in service composition to exploit resources of distributed nodes in mobile ad hoc networks. During composite service execution, the execution path for composite service is very important because of its significant influence on network overhead and the percentage of failure. In this paper, we study the execution path selection problem, which focuses on selecting a short...
A flooding which is one of the packet transmission methods broadcasts a packet to all nodes within a transmission range and can guarantee a short delay. However, the fundamental flooding algorithm has a shortcoming that causes excessive traffic because all nodes transmit a packet at least once. In this paper, we propose a totally fresh approach to constrain duplicate transmission by searching neighboring...
In Geographic Routing protocols (e.g. GPSR), a node makes packet forwarding decisions based on the coordinates of its neighbors and the packetpsilas destination. Geo-routing uses greedy forwarding as a default; if this fails (e.g. the packet is trapped in a dead end caused by holes and/or obstacles), a recovery scheme based on perimeter routing is invoked. This however often leads to degraded performance...
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.