Optimizations for Location-aided Routing (LAR) in Mobile Ad Hoc Networks
23 Nov 1998-
TL;DR: In this paper, a number of optimizations are proposed to improve the performance of the basic location-aided routing (LAR) protocol in mobile ad hoc networks, focusing on how the basic operation of LAR can be improved.
Abstract: Location-Aided Routing (LAR) algorithm is an approach to utilize location information for mobile hosts, with the goal of decreasing routing-related overhead in mobile ad hoc networks. A number of optimizations are possible to improve performance of the basic LAR protocols. This paper mainly focuses how the basic operation of LAR can be improved by applying those optimization schemes.
Citations
More filters
TL;DR: This work is proposing APS – a localized, distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate position for all nodes in a network where only a limited fraction of nodes have self positioning capability.
Abstract: Many ad hoc network protocols and applications assume the knowledge of geographic location of nodes. The absolute position of each networked node is an assumed fact by most sensor networks which can then present the sensed information on a geographical map. Finding position without the aid of GPS in each node of an ad hoc network is important in cases where GPS is either not accessible, or not practical to use due to power, form factor or line of sight conditions. Position would also enable routing in sufficiently isotropic large networks, without the use of large routing tables. We are proposing APS --- a localized, distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate position for all nodes in a network where only a limited fraction of nodes have self positioning capability.
1,700 citations
TL;DR: This paper surveys each of the localization techniques that can be used to localize vehicles and examines how these localization techniques can be combined using Data Fusion techniques to provide the robust localization system required by most critical safety applications in VANets.
639 citations
25 Feb 1999
TL;DR: The paper addresses the problem of geocasting in mobile ad hoc network (MANET) environments by presenting two different algorithms for delivering packets to a multicast group, and presenting simulation results.
Abstract: The paper addresses the problem of geocasting in mobile ad hoc network (MANET) environments. Geocasting is a variant of the conventional multicasting problem. For multicasting, conventional protocols define a multicast group as a collection of hosts which register to a multicast group address. However for geocasting, the group consists of the set of all nodes within a specified geographical region. Hosts within the specified region at a given time form the geocast group at that time. We present two different algorithms for delivering packets to such a group, and present simulation results.
532 citations
TL;DR: This paper surveys different aspects of bio-inspired mechanisms and examine various algorithms that have been proposed to improve the performance of artificial systems and the remaining challenges to be faced in designing the future heterogeneous systems.
Abstract: A plethora of studies on self-organization has been carried out in broad areas including chemistry, biology, astronomy, medical science, telecommunications, etc., in both academia and industry. Following the studies on swarm intelligence observed in social species, the artificial self-organized systems are expected to exhibit some intelligent features (e.g., flexibility, robustness, decentralized control, self-evolution, etc.) that may have made social species so successful in the biosphere. In this paper, the application of swarm intelligence in communications networks will be studied, and we survey different aspects of bio-inspired mechanisms and examine various algorithms that have been proposed to improve the performance of artificial systems. Some fundamental self-organized networking (SON) mechanisms, designing principles and optimization approaches for artificial systems will then be investigated, followed by some well-known bio-inspired algorithms (e.g., cooperation, division of labor, distributed network synchronization, load balancing, etc.) as well as their applications to the maintenance/operation/optimization of artificial systems being analyzed. Besides, some new emerging technologies, such as the Self-X capabilities and cognitive machine-to-machine (M2M) optimization for the 3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE)/LTE-Advanced systems, are also surveyed. Finally, the remaining challenges to be faced in designing the future heterogeneous systems will be discussed.
22 citations
16 Oct 2000
TL;DR: A new routing protocol based on source-initiated on-demand routing (called RODA-routing protocol with dual paths to support asymmetric links) is presented and Simulation results reveal that RODa copes well with an ad hoc network having asymmetric wireless links under the presence of mobility.
Abstract: The existing routing protocols in mobile ad hoc networks assume that all the nodes have the same transmission range. In other words, the mobile ad hoc network has only symmetric links, which means that two neighboring nodes A and B are within the transmission range of one another. However, since nodes consume battery power independently according to their computing and communication load, there exist asymmetric links, which means that node A is within node B's transmission range, but not vice versa. In this paper, to cope with asymmetric links, a new routing protocol based on source-initiated on-demand routing (called RODA-routing protocol with dual paths to support asymmetric links) is presented. In order to perform route maintenance in an efficient manner, dual paths-forward (source to receiver) and backward (receiver to source) paths-are used to send and receive data packets. In addition, a timer mechanism is introduced to deal with simultaneous and consecutive broken links on both forward and backward paths. Simulation results reveal that RODA copes well with an ad hoc network having asymmetric wireless links under the presence of mobility.
17 citations