A virtual multiple message ferry backbone routing scheme for mobile ad-hoc networks

A MANET (Mobile Ad-Hoc Network) consists of relocating wireless communication devices without infrastructure installed in its network environment. Due to the mobility of the devices, the network topology changes frequently and consequently results in poor network performance. When the density of nodes in a MANET is sparse, the performance becomes even worse due to the intermittent connected routing problem arising. To cope with this problem, this paper integrates mechanisms of Virtual Multiple Message Ferry Routing (VMMFR) and Virtual Multiple Message Ferry Dispatch Scheduling (VMMFDS) into the routing protocol design of MANETs and proposes a Virtual Multiple Message Ferry Backbone Routing (VMMFBR) scheme for MANETs. Several simulations have been conducted using the network simulator NS-2 to evaluate the performance of the proposed VMMFR mechanism. Due to the VMMFR mechanism providing a reliable and predictable backbone routing for MANETs communications. The results show that the proposed method has a higher packet delivery ratio, low bandwidth consumed, and that there is greater precision of packet delivery time, compared to the traditional MANETs routing protocols (AOMDV and DSR). In addition, some theoretical results for the proposed VMMFDS mechanism to minimize the transfer waiting time are also given in this paper.     

A framework for self-healing and optimizing routing techniques for mobile ad hoc networks

On demand routing protocols provide scalable and cost-effective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate far from the optimal because of the lack of knowledge about the global topology and the mobility of nodes. Routing optimality affects network performance and energy consumption, especially when the load is high. In this paper, we define routing optimality using different metrics such as path length, energy consumption along the path, and energy aware load balancing among the nodes. We then propose a framework of Self-Healing and Optimizing Routing Techniques (SHORT) for mobile ad hoc networks. While using SHORT, all the neighboring nodes monitor the route and try to optimize it if and when a better local subpath is available. Thus SHORT enhances performance in terms of bandwidth and latency without incurring any significant additional cost. In addition, SHORT can be also used to determine paths that result in low energy consumption or to optimize the residual battery power. Thus, we have detailed two broad classes of SHORT algorithms: Path-Aware SHORT and Energy-Aware SHORT. Finally, we evaluate SHORT using the ns-2 simulator. The results demonstrate that the performance of existing routing schemes can be significantly improved using the proposed SHORT algorithms. This research was supported in part by the National Science Foundation under the grants CCR-0296070 and ANI-0296034, and a generous gift from the Hewlett Packard Corporation. A preliminary version of this paper appeared in the proceedings of the ACM MobiHoc 2003. Chao Gui is a Technical Research Staff at Kiyon Inc (www.kiyon.com). His research interests include wireless networking and mobile computing. His current efforts are on industrial implementation of wireless mesh networks and embedded systems. Dr. Gui has received Ph.D. in Computer Science from University of California at Davis in 2005. Dr. Prasant Mohapatra is currently a Professor in the Department of Computer Science at the University of California, Davis. He has also held various positions at Iowa State University, Michigan State University, Intel Corporation, Panasonic Technologies, Institute of Infocomm Research, Singapore, and the National ICT, Australia. Dr. Mohapatra received his Ph.D. in Computer Engineering from the Pennsylvania State University in 1993. He was/is on the editorial boards of the IEEE Transactions on computers, ACM/Springer WINET, and Ad hoc Networks Journal. He has served on numerous technical program committees for international conferences, and served on several panels. He was the Program Vice-Chair of INFOCOM 2004, and the Program Co-Chair of the First IEEE International Conference on Sensor and Ad Hoc Communications and Networks, (SECON-2004). Dr. Mohapatra’s research interests are in the areas of wireless networks, sensor networks, Internet protocols and QoS.     

A design framework and taxonomy for hybrid routing protocols in mobile Ad Hoc networks

Routing protocols for mobile ad hoc networks can be classified into two categories: topological routing and geographic routing. Hybrid routing protocols that take advantage of both schemes have attracted a lot of attention recently. This article provides a systematic survey of these hybrid routing protocols. We first analyze the three types of routing information used in the hybrid routing protocols, namely, topological information, geographic information, and hierarchy information. Then, based on a review of the representative hybrid routing protocols, we summarize the three design options for hybrid routing protocols, namely, radius of the routing zone (1, k, or D), geographic information (position or position plus partition), and routing structure (flat or hierarchical). Finally, we propose a three-dimensional design framework that can accommodate well all of the existing hybrid routing protocols. The framework also helps find the unexplored design space, motivating the design of new hybrid routing protocols.     

A routing framework for providing robustness to node failures in mobile ad hoc networks

Nodes in a mobile ad hoc network are often vulnerable to failures. The failures could be either due to fading effects, battery drainage, or as a result of compromised nodes that do not participate in network operations. Intermittent node failures can disrupt routing functionalities. As such, it is important to provide redundancy in terms of providing multiple node-disjoint paths from a source to a destination. In line with this objective, we first propose a modified version of the widely studied ad hoc on-demand distance vector routing protocol to facilitate the discovery of multiple node-disjoint paths from a source to a destination. We find that very few of such paths can be found. Furthermore, as distances between sources and destinations increase, bottlenecks inevitably occur and thus, the possibility of finding multiple paths is considerably reduced. We conclude that it is necessary to place what we call reliable nodes (in terms of both being robust to failure and being secure) in the network to support efficient routing operations. We propose a deployment strategy that determines the positions and the trajectories of these reliable nodes such that we can achieve a framework for reliably routing information. We define a notion of a reliable path which is made up of multiple segments, each of which either entirely consists of reliable nodes, or contains a preset number of multiple paths between the end points of the segment. We show that the probability of establishing a reliable path between a random source and destination pair increases tremendously even with a small number of reliable nodes when we use our algorithm to appropriately position these reliable nodes.     

LINK PERDURABILITY BASED ROUTING FOR MOBILE AD HOC NETWORKS

Ad Hoc networks are prone to link failures due to mobility. In this letter, a link perdurability based routing scheme is proposed to try dealing with this problem. This scheme uses signal strength measurements to estimate the route life time and hence chooses a stable route, and is implemented in two typical ad hoc routing protocols to evaluate its performance.The simulation results have shown that this scheme can improve these protocols‘ packet delivery ratio in cases where there are frequent link failures.     

接触时间感知的移动WSNs路由

多数无线传感网络应用中需要处理节点移动性,为此,面向移动无线传感网络(M-WSNs),提出基于接触时间的区路由(CTAR)。CTAR路由先利用源节点和目的节点的相对位置信息形成活动区,只有区内的节点才能参与路由;然后,利用节点的移动矢量信息选择能够最大化接触时间的邻居节点作为下一跳转发节点。仿真数据表明,与RoF协议相比,CTAR协议的数据包传递率得到有效提高。     

Destination-aware metric based social routing for mobile opportunistic networks

Wireless Networks - Although centrality is widely used to differentiate the importance of nodes for social-aware routing in mobile opportunistic networks (MONs), it is destination-agnostic since...     

A cross-layer framework for position-based routing and medium access control in heterogeneous mobile ad hoc networks

Many Mobile Ad Hoc Networks (MANETs) are composed of nodes with heterogeneous communication capabilities in terms of transmission power, data rate, battery life, reliability, etc. Heterogeneous MANETS (H-MANETs) often encounter problems in both Medium Access Control (MAC) and routing layers due to link asymmetry. But meanwhile, H-MANETs have many advantages including: scalability, robustness, and connectivity. In this paper we present a two-layer approach which spans the MAC and network layers for H-MANETs to minimize the problems caused by link asymmetry and exploit the advantages of H-MANETs simultaneously. At the network layer, we design a hierarchical Location service (LS) protocol and a node density adaptive position-based routing protocol. At the MAC layer we propose a new MAC protocol which uses two communication channels and closely ties in with the network layer to solve the MAC problems caused by link asymmetry. We evaluate our approach using both probabilistic analysis and simulations.     

A distributed routing algorithm for mobile wireless networks

We present a loop-free, distributed routing protocol for mobile packet radio networks. The protocol is intended for use in networks where the rate of topological change is not so fast as to make flooding the only possible routing method, but not so slow as to make one of the existing protocols for a nearly-static topology applicable. The routing algorithm adapts asynchronously in a distributed fashion to arbitrary changes in topology in the absence of global topological knowledge. The protocol's uniqueness stems from its ability to maintain source-initiated, loop-free multipath routing only to desired destinations with minimal overhead in a randomly varying topology. The protocol's performance, measured in terms of end-to-end packet delay and throughput, is compared with that of pure flooding and an alternative algorithm which is well-suited to the high-rate topological change environment envisioned here. For each protocol, emphasis is placed on examining how these performance measures vary as a function of the rate of topological changes, network topology, and message traffic level. The results indicate the new protocol generally outperforms the alternative protocol at all rates of change for heavy traffic conditions, whereas the opposite is true for light traffic. Both protocols significantly outperform flooding for all rates of change except at ultra-high rates where all algorithms collapse. The network topology, whether dense or sparsely connected, is not seen to be a major factor in the relative performance of the algorithms.The work of A. Ephremides was supported in part by the National Science Foundation under grants D-CDR-8803012 and EEC94-02384.     

A routing architecture for mobile integrated services networks

A drawback of the conventional Internet routing architecture is that its route computation and packet forwarding mechanisms are poorly integrated with congestion control mechanisms. Any datagram offered to the network is accepted; routers forward packets on a best-effort basis and react to congestion only after the network resources have already been wasted. A number of proposals improve on this to support multimedia applications; a promising example is the Integrated Services Packet Network (ISPN) architecture. However, these proposals are oriented to networks with fairly static topologies and rely on the same conventional Internet routing protocols to operate. This paper presents a routing architecture for mobile integrated services networks in which network nodes (routers) can move constantly while providing end-to-end performance guarantees. In the proposed connectionless routing architecture, packets are individually routed towards their destinations on a hop by hop basis. A packet intended for a given destination is allowed to enter the network if and only if there is at least one path of routers with enough resources to ensure its delivery within a finite time. Once a packet is accepted into the network, it is delivered to its destination, unless resource failures prevent it. Each router reserves resources for each active destination, rather than for each source–destination session, and forwards a received packet along one of multiple loop-free paths towards the destination. The resources and available paths for each destination are updated to adapt to congestion and topology changes. This mechanism could be extended to aggregate dissimilar flows as well. This revised version was published online in June 2006 with corrections to the Cover Date.     

Geometric spanners for routing in mobile networks

We propose a new routing graph, the restricted Delaunay graph (RDG), for mobile ad hoc networks. Combined with a node clustering algorithm, the RDG can be used as an underlying graph for geographic routing protocols. This graph has the following attractive properties: 1) it is planar; 2) between any two graph nodes there exists a path whose length, whether measured in terms of topological or Euclidean distance, is only a constant times the minimum length possible; and 3) the graph can be maintained efficiently in a distributed manner when the nodes move around. Furthermore, each node only needs constant time to make routing decisions. We show by simulation that the RDG outperforms previously proposed routing graphs in the context of the Greedy perimeter stateless routing (GPSR) protocol. Finally, we investigate theoretical bounds on the quality of paths discovered using GPSR.     

A location-based routing method for mobile ad hoc networks

Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad hoc networks. However, location-based routing is difficult when there are holes in the network topology and nodes are mobile or frequently disconnected to save battery. Terminode routing, presented here, addresses these issues. It uses a combination of location-based routing (terminode remote routing, TRR), used when the destination is far, and link state-routing (terminode local routing, TLR), used when the destination is close. TRR uses anchored paths, a list of geographic points (not nodes) used as loose source routing information. Anchored paths are discovered and managed by sources, using one of two low overhead protocols: friend assisted path discovery and geographical map-based path discovery. Our simulation results show that terminode routing performs well in networks of various sizes. In smaller networks; the performance is comparable to MANET routing protocols. In larger networks that are not uniformly populated with nodes, terminode routing outperforms, existing location-based or MANET routing protocols.     

A survey of routing techniques for mobile communications networks

Mobile wireless networks pose interesting challenges for routing system design. To produce feasible routes in a mobile wireless network, a routing system must be able to accommodate roving users, changing network topology, and fluctuating link quality. We discuss the impact of node mobility and wireless communication on routing system design, and we survey the set of techniques employed in or proposed for routing in mobile wireless networks.     

A dynamic reconfigurable routing framework for wireless sensor networks

Sensornet deployments of the future are expected to deliver a multitude of services, ranging from reliable sensing, real time streams, mission critical support, network reprogramming and so on. Naturally, no one routing protocol can sufficiently cater to the network layer functionalities expected. Severe resource constraints further limit the possibility of multiple routing protocols to be implemented. Further, vertically integrated designs of present protocols hinder synergy and code-reuse among implementations. In this paper, we present an architecture that allows applications to send different types of flows, often with conflicting communication requirements. A flow’s requirements are made visible to our framework by using just 3 bits in the packet header. The core architecture is a collection of highly composable modules that allows rapid protocol development and deployment. We show that our framework can provide: (i) flow based network functionality that ensures each flow gets an application specific network layer which is dynamically knit as per the flow’s needs, (ii) modular organization that promotes code-reuse, run time sharing, synergy and rapid protocol development and (iii) pull processing that allows flows to dictate their traffic rate in the network, and implement flexible scheduling policies. This creates a framework for developing, testing, integrating, and validating protocols that are highly portable from one deployment to another. Using our framework, we show that virtually any communication pattern can be described to the framework. We validate this by gathering requirements for one real world application scenario: predictive maintenance (PdM). The requirements are used to generate a fairly complete and realistic traffic workload to drive our evaluation. Using simulations and 40 node MicaZ testbed experiments, we show that our framework can meet the deployments demands at granularities not seen before in sensornets. We measure the costs of using this framework in terms of code size, memory footprints and forwarding costs on MicaZ motes.     

Modified least loaded routing in virtual path based ATM networks

We consider a Virtual Path (VP) based ATM network supporting multiple traffic classes with heterogeneous traffic characteristics. Using simple FIFO scheduling policy at the ATM multiplexer, we assume that all traffic require identical end‐to‐end quality of service (QoS) requirement. The concept of effective bandwidth is used to determine the required bandwidth to guarantee the specified QoS requirement. We study the problem of using dynamic routing to VP‐based ATM networks by transforming it into an equivalent multi‐rate circuit‐switched network problem. To further simplify the analysis, we restrict the choice of path to single‐link and two‐link routes. We propose a dynamic routing algorithm based on the Least Loaded Routing (LLR) with packing. Simulation results are used to compare the performance of this algorithm with other dynamic routing schemes. This revised version was published online in June 2006 with corrections to the Cover Date.     

QoS routing based on multi-class nodes for mobile ad hoc networks

In this paper, we present a new quality of service (QoS) routing protocol for mobile ad hoc networks (MANETs). Most of the existing routing protocols assume homogeneous nodes in MANETs, i.e., all nodes have the same communication capabilities and characteristics. However, in many ad hoc networks, nodes are not the same. Some nodes have longer transmission range, larger transmission bandwidth, and are more reliable and robust than other nodes. We take advantage of the non-homogeneous property to design more efficient QoS routing protocol. And node location information is used to aid routing. We also develop a new algorithm to calculate end-to-end bandwidth for a given path. Our QoS routing protocol contains end-to-end bandwidth calculation and bandwidth reservation. QoS route is discovered and setup only when it is needed. Extensive simulation studies demonstrate the good performance of the QoS routing protocol.     

移动WSNs的能耗区路由

节点的移动对移动无线传感网络(MWSNs)路由设计提出了挑战.为此,提出基于接触时间的能耗区路由(CECA).CECA路由采用休眠-唤醒机制,降低了节点能耗.CECA路由利用源节点与信宿的位置信息构成圆角矩形区域,且只允许区域内的节点才能参与路由.通过节点移动信息,计算接触时间,并利用接触时间设置定时器,进而通过定时器...     

QoS routing based on mobile agent for LEO satellite IP networks

Current quality of service (QoS) routing schemes for low earth orbit (LEO) satellites IP networks either neglect the varying population density or fail to guarantee end-to-end delay. As a remedy, QoS routing protocol based on mobile agent (QoSRP-MA) is proposed. QoSRP-MA is a source-based routing protocol. Once connection requests arrive, QoS mobile agents are dispatched from ingress satellite to explore routes, which migrate using satellite routing tables. Upon arriving in egress satellite, QoS mobile agents migrate back towards ingress satellite to reserve bandwidth. To construct satellite routing tables, load balancing routing algorithm based on mobile agent (LBRA-MA) is presented. In LBRP-MA, at regular intervals mobile agents launched on all satellites migrate autonomously to evaluate path cost and update routing tables. Moreover, path cost between source and destination is evaluated considering satellite geographical position as well as inter-satellite link (ISL) cost. Furthermore, ISL congestion index is considered to update routing table. Through simulations on a Courier-like constellation, it shows that QoSRP-MA can achieve guaranteed end-to-end delay bound with higher throughput, lower connection failing ratio and signaling overhead compared to high performance satellite routing (HPSR) scheme.     

QoS-aware routing based on bandwidth estimation for mobile ad hoc networks

Routing protocols for mobile ad hoc networks (MANETs) have been explored extensively in recent years. Much of this work is targeted at finding a feasible route from a source to a destination without considering current network traffic or application requirements. Therefore, the network may easily become overloaded with too much traffic and the application has no way to improve its performance under a given network traffic condition. While this may be acceptable for data transfer, many real-time applications require quality-of-service (QoS) support from the network. We believe that such QoS support can be achieved by either finding a route to satisfy the application requirements or offering network feedback to the application when the requirements cannot be met. We propose a QoS-aware routing protocol that incorporates an admission control scheme and a feedback scheme to meet the QoS requirements of real-time applications. The novel part of this QoS-aware routing protocol is the use of the approximate bandwidth estimation to react to network traffic. Our approach implements these schemes by using two bandwidth estimation methods to find the residual bandwidth available at each node to support new streams. We simulate our QoS-aware routing protocol for nodes running the IEEE 802.11 medium access control. Results of our experiments show that the packet delivery ratio increases greatly, and packet delay and energy dissipation decrease significantly, while the overall end-to-end throughput is not impacted, compared with routing protocols that do not provide QoS support.