Conference Paper

InterMR: Inter-MANET routing in heterogeneous MANETs

Dept. of Comput. Sci., UCLA, Los Angeles, CA, USA
DOI: 10.1109/MASS.2010.5663948 Conference: Mobile Adhoc and Sensor Systems (MASS), 2010 IEEE 7th International Conference on
Source: IEEE Xplore

ABSTRACT The advancements of diverse radio technologies and emerging applications have spawned increasing heterogeneity in mobile ad hoc networks (MANETs). But the collaborative nature of communications and operations often requires that these heterogeneous MANETs to be interoperable. Nonetheless, the existing interconnection protocols designed for the Internet (namely inter-domain routing protocol such as BGP) are not adequate for handling the unique challenges in MANETs. In this paper, we present a novel Inter-MANET Routing protocol called InterMR that can handle the heterogeneity and dynamics of MANETs. Our first contribution is an Inter-MANET address scheme based on a variety of node attributes (e.g., symbolic name, property, etc.); this allows dynamic merging/split of network topologies without a separate Name Server. Our second contribution is to provide a seamless routing mechanism across heterogeneous MANETs without modifying the internal routing mechanisms in each MANET. The proposed scheme can transparently adapt to topological changes due to node mobility in MANETs by dynamically assigning the gateway functionalities. We show, by packet-level simulation, that the performance of InterMR can be improved by up to 112% by adaptive gateway assignment functionalities. We also show that InterMR is scalable with only modest overhead by analysis.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Routing loops accounts for a fair share of packet loss in mobile networks, particularly so for heterogeneous mobile networks. Loops occur when nodes build routes based on inconsistent topology databases. The inconsistency is caused by, but not limited to, dissimilar transmission delay, lost signaling messages, mobility, traffic load, and dissimilar frequency for route update messages. The latter cause is a consequence of optimization of control traffic overhead in heterogeneous networks. These networks are networks that consist of links, or network segments, based on radios with unlike transmission technologies. Such networks typically operate in areas that enforce network topologies with non-optimal radio degree for some of the network types. This paper studies the phenomenon of routing loops in mobile heterogeneous networks. It is shown where the loops occur. Methods to reduce the occurrence of the loops, and ways to do local repair, are proposed.
    MILCOM 2013 - 2013 IEEE Military Communications Conference; 11/2013
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless Ad hoc Networks are rapidly growing in popularity because of their flexibility and wide range of applications (Indoor Communications, Intelligent Trans- portation, Emergency Operations, Public Safety, etc.). However, while it becomes easier to set up such net- works, one of the main constraints is the heterogeneity of the nearby devices (or nodes). Moreover, it is still very difficult to make them communicate if these nodes use different routing protocols. In this paper, we present a novel approach that makes use of layer 3 protocols to guarantee interoperability between networks. We introduce the notion of Strip Interoperability, a new mechanism that aims to address this problem by creating a bridge between heterogeneous wireless ad hoc networks. An implementation of our approach through a real case study is shown to illustrate the applicability of our mechanism.
    The 13th IEEE International Symposium on Network Computing and Applications (IEEE NCA14), Cambridge, MA, USA; 08/2014
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In tactical scenarios, different organizations form their own networks and use different protocols based on their specific objectives. This increases network diversity and makes interoperation more intricate. However, the interoperability of multiple tactical MANETs is an important issue when the MANETs are engaged in a common mission. In order to handle the diversity and interconnect different protocols we leverage a special type of node called gateway. The Gateway translates protocols and formats. It bridges any technology gaps and transparently interconnects multiple MANETs. Only a subset of the nodes qualifies for the Gateway role. Yet, it is not cost-effective to use them all simultaneously as gateways because they would generate excessive network overhead and might deplete the already scarce wireless network resources. If we pre-assign a subset of nodes as gateways, we may not be able to handle mobile topology changes. Moreover, we may not be able to satisfy in a cost-effective manner the evolving requirements of the mission. Thus, we need to dynamically elect gateways as network topology and mission requirements change. To this end, the election must be aware of the policy requirements of MANETs and mission. In this paper, we design and implement an election algorithm that can account for various metrics (e.g., network connectivity, energy balancing, secure routing, etc.). Simulation results show that the tuning of the election algorithm parameters plays an important role in the performance under a specific metric.

Preview (2 Sources)

Available from