Using group mobility and multihomed mobile gateways to connect mobile ad hoc networks to the global IP Internet

Connecting multihop mobile ad hoc wireless networks (MANETs) to the Internet would enable MANET nodes to share wireless Internet access with mobile hosts that are one‐hop away from their foreign networks. The integration of MANETs and the global Internet, however, faces an obstacle due to their network architectural mismatches regarding their infrastructure, topology, and mobility management mechanisms. Solutions to the integration problem should introduce an intermediate facility with hybrid mechanism, enabling it to connect to both networks. The quality of the multihop wireless Internet access service provided to MANET nodes depends on the design quality of this facility in order for MANET nodes to enjoy their Internet connectivity anywhere and anytime without much disconnections. In this paper, we propose hierarchical architecture that uses group mobility and multihomed mobile gateways, and present and analyse different simulations results. A multihomed mobile gateway can simultaneously connect to multiple Mobile IP foreign agents, provided it is located within their overlapping coverage area. It runs updated versions of the destination‐sequenced distance vector (DSDV) and Mobile IP protocols, and is responsible for providing MANET nodes with wireless Internet access though they are multiple wireless hops away from the edge of the Internet. The rationale behind using multihoming is to increase reliability of the Internet access service and enhance performance of the integrated network. Copyright © 2006 John Wiley & Sons, Ltd.     

MANET与Internet互联中默认路由转发策略的改进

MANET与Internet互联时,需要良好的网关转发策略才能高效转发Internet业务分组.然而传统的默认路由转发策略还存在问题,在分析传统的默认路由转发策略存在问题的基础上,提出改进型的默认路由转发策略.该策略解决了传统默认路由转发方式中的重复发现问题和状态复制问题,并通过仿真验证改进了策略的可行性.     

Protocol-independent multicast packet delivery improvement service for mobile Ad hoc networks

This paper addresses the issue of improving multicast packet delivery in mobile ad hoc networks and proposes an adaptive mechanism called Protocol-Independent Packet Delivery Improvement Service (PIDIS) to recover lost multicast packets. PIDIS provides its packet-delivery improvement services to any multicast routing protocol for mobile ad hoc networks by exploiting the mechanism of swarm intelligence to make intelligent decisions about where to fetch the lost multicast packets from. PIDIS is a gossip protocol, and nodes using PIDIS are only concerned with which neighbor nodes to gossip with to recover the most lost packets, rather than which member nodes to gossip with. Thus, it does not rely on membership information in a multicast scenario, which is often difficult to get. PIDIS employs the beneficial aspects of probabilistic routing and adapts well to mobility. PIDIS achieves probabilistic improvement in multicast packet delivery and, unlike other gossip-based schemes, does not need to maintain information about group members from which lost multicast packets are retrieved. Further, the operations of PIDIS do not rely on any underlying routing protocol or primitive, and can be incorporated into any ad hoc multicast routing protocol. We incorporated PIDIS over ODMRP [On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks, Kluwer Mobile Networks and Applications, 2000], and compared it against Anonymous Gossip (AG) [International Conference on Distributed Computing Systems (ICDCS 2001) Phoenix, Arizona, April 2001] implemented over ODMRP, and ODMRP itself. Our simulation results show that ODMRP + PIDIS is more efficient and performs better than ODMRP + AG and ODMRP in terms of multicast packet delivery, end-to-end delay, and MAC layer overheads. We attribute the better performance and lower MAC overheads of ODMRP + PIDIS to the efficient gossiping made possible by using the swarm intelligence techniques.     

IP电话常见问题及解决方法

本主要介绍了IP电话一期网络在运行中所出现的问题和原因，并提供了解决方法，为二期网络建设和运行维护提供指导性建议。     

Evolution and future directions of the ad hoc on-demand distance-vector routing protocol

The ad hoc on-demand distance-vector (AODV) routing protocol has been designed for use in ad hoc networks, which are presently receiving wide interest within many diverse research communities. These networks represent a significant departure from traditional wired networks due to the distinguishing characteristics of both the wireless channel and mobile devices. Consequently, AODV incorporates many novel features for handling mobility, reduced capacity links, and the variable, indeterminate nature of the signaling range of wireless media. Since its initial design, AODV has evolved in a number of ways for improved performance, robustness, and better scalability. Nevertheless, we see many opportunities for continued improvement. This paper describes the current state of AODV, including its base functionality as well as optional features that improve performance and add capabilities. We also offer some direction for the continued evolution of AODV by presenting areas that can be targeted for future enhancements. Many of the described current and planned features are a result of AODV’s history and evolution within the Internet engineering task force.     

Spanning-tree based autoconfiguration for mobile ad hoc networks

In order to allow truly spontaneous and infrastructureless networking, autoconfiguration algorithm is needed in the practical usage of most mobile ad hoc networks (MANETs). This paper presents spanning-tree based autoconfiguration for mobile ad hoc networks, a novel approach for the efficient distributed address autoconfiguration. With the help of the spanning tree, the proposed scheme attempts to distribute address resources as balanced as possible at the first beginning. Since each node holds a block of free addresses, a newly joining node can obtain a free address almost immediately. Subnet partitioning and merging are well supported. Finally, analysis and simulation demonstrate that our algorithm outperforms the existing approaches in terms of both communication overhead and configuration latency.     

Integrated Mobility Management Methods for Mobile IP and SIP in IP based Wireless Data Networks

With developments in voice over IP (VoIP), IP-based wireless data networks and their application services have received increased attention. While multimedia applications of mobile nodes are served by Session Initiation Protocol (SIP) as a signaling protocol, the mobility of mobile nodes may be supported via Mobile IP protocol. For a mobile node that uses both Mobile IP and SIP, there is a severe redundant registration overhead because the mobile node has to make location registration separately to a home agent for Mobile IP and to a home registrar for SIP, respectively. Therefore, we propose two new schemes that integrate mobility management functionality in Mobile IP and SIP. We show performance comparisons among the previous method, which makes separate registration for Mobile IP and SIP without integration, and our two integrated methods. Numerical results show that the proposed methods efficiently reduce the amount of signaling messages and delay time related to the idle handoff and the active handoff.     

Extending Global IP Connectivity for Ad Hoc Networks

Ad hoc networks have thus far been regarded as stand-alone networks without assumed connectivity to wired IP networks and the Internet. With wireless broadband communications and portable devices with appropriate CPU, memory and battery performance, ad hoc connectivity will become more feasible and demand for global connectivity through ad hoc networking is likely to rapidly grow. In this paper we propose an algorithm and describe a developed prototype for connectivity between an ad hoc network running the ad hoc on-demand distance-vector protocol and a wired IP network where mobile IP is used for mobility management. Implementation issues and performance metrics are also discussed.     

Secure interconnection protocol for integrated Internet and ad hoc networks

Integration of ad hoc networks with the Internet provides global Internet connectivity for ad hoc hosts through the coordination of mobile IP and ad hoc protocols. In a pure ad hoc network, it is difficult to establish trust relationship between two ad hoc hosts due to lack of infrastructure or centralized administration. In this paper, an infrastructure‐supported and distributed authentication protocol is proposed to enhance trust relationships amongst ad hoc hosts. In addition, an effective secure routing protocol (SRP) is discussed to protect the multi‐hop route for Internet and ad hoc communication. In the integrated ad hoc networks with Internet accessibility, the ad hoc routing security deployed with the help of infrastructure has a fundamental impact on ad hoc hosts in term of Internet access, integrity, and authentication. Both analysis and simulation results demonstrate the effectiveness of the proposed security protocol. Copyright © 2007 John Wiley & Sons, Ltd.     

Survivability evaluation of SIGMA and mobile IP

Mobile IP has been developed by IETF to handle mobility of Internet hosts at the network layer. Mobile IP suffers from a number of drawbacks, including low survivability due to single-point failure of Home Agents. Recently, Seamless IP diversity based Generalized Mobility Architecture (SIGMA) was proposed to support low latency, low packet loss mobility of IP hosts. In this paper, we show that the location management scheme used in SIGMA enhances the survivability of the SIGMA-based mobile network. We develop an analytical model to evaluate and compare the survivability of SIGMA with that of Mobile IP. Numerical results show the improvement in system response time and service blocking probability of SIGMA over Mobile IP in the presence of hardware failures and Distributed Denial of Service (DDoS) attacks. The research reported in this paper was funded by NASA Grants NAG3-2922 and NNX06AE44G     

无线自组网与Internet互连中TCP流公平性分析与改进

通过实验与分析揭示了基于IEEE 802.11 MAC的无线自组网与Internet互连时TCP流间的不公平性现象及其产生原因,并基于网关带宽占用对互连环境下TCP流间的公平性进行定义,提出了一种基于网关动态带宽控制的TCP流公平性解决方案TCP-GAFC。TCP-GAFC只在网关节点上进行实现,无需修改TCP协议和MAC协议,具有很好的适用性和可扩展性。仿真实验表明,TCP-GAFC显著地改进了互连环境下TCP流间的公平性,并能达到合理的总吞吐量。     

An adaptive transmission-scheduling protocol for mobile ad hoc networks

Transmission-scheduling protocols can support contention-free link-level broadcast transmissions and delay sensitive traffic in mobile, multiple-hop packet radio networks. Use of transmission-scheduling protocols, however, can be very inefficient in mobile environments due to the difficulty in adapting transmission schedules. The paper defines a new adaptive and distributed protocol that permits a terminal to adapt transmission assignments to changes in topology using information it collects from its local neighborhood only. Because global coordination among all the terminals is not required and changes to transmission assignments are distributed to nearby terminals only, the protocol can adapt quickly to changes in the network connectivity. The two key parameters that affect the ability of the protocol to adapt to changes in connectivity are the rate of connectivity changes and the number of terminals near the connectivity changes. Using simulation, we determine the ranges for these parameters for which our adaptive protocol can maintain collision-free schedules with an acceptable level of overhead. The stability of the protocol is also characterized by showing that the protocol can quickly return to a collision-free transmission schedule after a period of very rapid changes in connectivity. Our channel-access protocol does not require a contention-based random-access phase to adapt the transmission schedules, and thus its ability to adapt quickly does not deteriorate with an increase in the traffic load.     

Thorough protocol extensions for integrating DSR‐based Mobile Ad Hoc Networks with the Internet

The integration of the Mobile Ad Hoc Networks (MANETs) into 4G systems will help to increase the networking flexibility and coverage of existing infrastructure networks. One of the crucial challenges is modifying existing reactive ad hoc routing protocols to support external routing operations. This paper contributes thorough protocol extensions for connecting DSR‐based MANETs with the Internet (DSR‐IE). DSR routing protocol is extended to effectively support External Route Discovery and External Route Maintenance functions. In particular, a novel External Route Discovery scheme, Comprehensive External Route Judgment, (CERJ) is proposed. Mobile IP is utilized to manage seamless data services. Finally, OPNET simulation models are developed to demonstrate the implementability and effectiveness of the proposed schemes. Copyright © 2009 John Wiley & Sons, Ltd.     

Contention-based forwarding for mobile ad hoc networks

Existing position-based unicast routing algorithms which forward packets in the geographic direction of the destination require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages each node sends out periodically.

Due to mobility, the information that a node receives about its neighbors becomes outdated, leading either to a significant decrease in the packet delivery rate or to a steep increase in load on the wireless channel as node mobility increases. In this paper, we propose a mechanism to perform position-based unicast forwarding without the help of beacons. In our contention-based forwarding scheme (CBF) the next hop is selected through a distributed contention process based on the actual positions of all current neighbors. For the contention process, CBF makes use of biased timers. To avoid packet duplication, the first node that is selected suppresses the selection of further nodes. We propose three suppression strategies which vary with respect to forwarding efficiency and suppression characteristics. We analyze the behavior of CBF with all three suppression strategies and compare it to an existing greedy position-based routing approach by means of simulation with ns-2. Our results show that CBF significantly reduces the load on the wireless channel required to achieve a specific delivery rate compared to the load a beacon-based greedy forwarding strategy generates.     

Hybrid mobile backbone network routing with flow control and distance awareness (MBNR-FC/DA)

The mobile backbone network (MBN) architecture has been introduced to synthesize robust, scalable and efficient mobile ad hoc wireless networks that support multimedia flows. Backbone capable nodes are dynamically elected to construct a mobile backbone (Bnet). In this article, we present a hybrid routing mechanism for such networks, identified as MBN routing with flow control and distance awareness (MBNR-FC/DA) scheme. Flows that travel a distance longer than a threshold level are routed across the Bnet. This induces a significant reduction in the route discovery control overhead, yielding a highly scalable operation. In turn, a limited span global route discovery process is invoked for routing shorter distance flows. Discovered global routes use effectively the capacity of non-backbone wireless links. Such an operation serves to upgrade the network’s throughput capacity level when the backbone network does not provide global topological covering. The hybrid routing protocol introduced and studied in this paper, also employs combined nodal congestion control and flow admission control schemes to guide admitted flows across areas that are less congested, and to avoid overloading the network. We present a centralized procedure as well as a distributed adaptive scheme for the calculation of the distance threshold level under varying traffic loading and backbone coverage conditions. We show our schemes to make efficient use of network-wide capacity resources by dynamically selecting proper distance threshold levels, yielding outstanding delay–throughput performance.     

Hierarchical multicast techniques and scalability in mobile Ad Hoc networks

Many potential applications of Mobile Ad Hoc Networks (MANETs) involve group communications among the nodes. Multicasting is an useful operation that facilitates group communications. Efficient and scalable multicast routing in MANETs is a difficult issue. In addition to the conventional multicast routing algorithms, recent protocols have adopted the following new approaches: overlays, backbone-based, and stateless. In this paper, we study these approaches from the protocol state management point of view, and compare their scalability behaviors.To enhance performance and enable scalability, we have proposed a framework for hierarchical multicasting in MANET environments. Two classes of hierarchical multicasting approaches, termed as domain-based and overlay-driven, are proposed. We have considered a variety of approaches that are suitable for different scenarios such as multicast group sizes and number of groups. Results obtained through simulations demonstrate enhanced performance and scalability of the proposed techniques.     

Using a new protocol to enhance path reliability and realize load balancing in mobile ad hoc networks

In this paper we introduce a novel end-to-end approach for achieving the dual goal of enhanced reliability under path failures, and multi-path load balancing in mobile ad hoc networks (MANETs). These goals are achieved by fully exploiting the presence of multiple paths in mobile ad hoc networks in order to jointly attack the problems of frequent route failures and load balancing. More specifically, we built a disjoint-path identification mechanism for maintaining multiple routes between two endpoints on top of the Stream Control Transmission Protocol (SCTP), and the Dynamic Source Routing (DSR) protocol. A number of additional modifications are incorporated to the SCTP protocol in order to allow its smooth operation. The proposed approach differs from previously related work since it consists of an entirely end-to-end scheme built on top of a transport layer protocol. We provide both analytical and simulation results that prove the efficiency of our approach over a wide range of mobility scenarios.     

Improvements on “IP – IAPP”: A fast IP handoff protocol for IEEE 802.11 wireless and mobile clients

One of the most critical issues in introducing Wireless LAN (WLAN) real-time and delay sensitive applications, such as Voice over IP (VoIP), is guaranteeing IP service continuation during inter-subnet Basic Service Set (BSS) transitions. Even though WLANs offer very high channel bandwidth, they exhibit long network-layer handoff latency. This is a restraining factor for mobile clients using interactive multimedia applications such as VoIP or video streaming. In a previous work, we presented a novel fast and efficient IP mobility solution, called “IP-IAPP”, which offers constant IP connectivity to the 802.11 mobile users and successfully preserves their ongoing sessions, even during subnet handoffs (fast recovery of active connections). It is an 802.11-dependent IP mobility solution, which accelerates the network reconfiguration phase after subnet handoffs and significantly reduces the IP handoff latency. It restores L3 connectivity almost simultaneously to the L2 connectivity after a subnet handoff, due to a zero-delay movement detection method. As a result, even the most demanding next generation WLAN applications such as Voice over WLAN (VoWLAN) suffer insignificant disruption. In this paper we present an improved version of the IP-IAPP mobility mechanism (new optimized protocol procedures). Certain extensions have also been incorporated to the initial proposal, for the provision of more advanced services: (a) secure inter-AP IP-IAPP communications, (b) zero patching on the clients s/w, and (c) support of clients which use a dynamic IP address. Performance measurements out of further and more complex testing verify that the proposed method outperforms other existing mobility solutions, and still introduces the lesser imperative amendments to the existing 802.11 wireless LAN framework. Ioanna F. Samprakou received her B. Eng in Computer Engineering and Informatics in 2000 and her MSc. in the same area in 2003 from the University of Patras, Greece. She is currently a Ph.D canditate at the University of Patras. She has joined Atmel SA in 2002, where she is a Senior Wireless System Eng at the System Concept and Design group. She specializes in wireless technologies, and mobile communications, and holds a patent in the field of IP mobility. She has led teams in developing wireless 802.11 products such as Wi-Fi APs, STAs, and VoIP phones. Previously she has worked for the Research & Academic Computer & Technology Institute of Patras (RACTI) as an R&D computer engineer. She is a member of the Technical Chamber of Greece. Christos J. Bouras obtained his Diploma and PhD from the Computer Science and Engineering Department of Patras University (Greece). He is currently an Associate Professor in the above department. Also he is a scientific advisor of Research Unit 6 in Research Academic Computer Technology Institute (CTI), Patras, Greece. His research interests include Analysis of Performance of Networking and Computer Systems, Computer Networks and Protocols, Telematics and New Services, QoS and Pricing for Networks and Services, e – learning, Networked Virtual Environments and WWW Issues. He has extended professional experience in Design and Analysis of Networks, Protocols, Telematics and New Services. He has published 200 papers in various well-known refereed conferences and journals. He is a co-author of 7 books in Greek. He has been a PC member and referee in various international journals and conferences. He has participated in R&D projects such as RACE, ESPRIT, TELEMATICS, EDUCATIONAL MULTIMEDIA, ISPO, EMPLOYMENT, ADAPT, STRIDE, EUROFORM, IST, GROWTH and others. Also he is member of, experts in the Greek Research and Technology Network (GRNET), Advisory Committee Member to the World Wide Web Consortium (W3C), IEEE Learning Technology Task Force, IEEE Technical Community for Services Computing WG 3.3 Research on Education Applications of Information Technologies and W 6.4 Internet Applications Engineering of IFIP, Task Force for Broadband Access in Greece, ACM, IEEE, EDEN, AACE and New York Academy of Sciences. Theodore E. Karoubalis. received his B. Eng in Computer Engineering and Informatics in 1992 and his Ph.D. in the same area in 1996 from the University of Patras, Greece. He has joined ATMEL Hellas SA at 1998. Since 1998 he is the Manager of PSLi software dpt. and since 2002 he is the manager of System and Concepts dpt. His interests include systems on chip, embedded applications, wireless systems etc. He is a member of IEEE and the Technical Chamber of Greece.     

Wireless IP and Its Challenges for the Heterogeneous Environment

The tremendous momentum toward building a mobile wireless Internet using the Internet Protocol (IP) has thrust many challenges upon the technology developers and the operators. These challenges encompass the 2.5G, 3G, and future solutions and standards. Some of the key issues deal with supporting IP traffic across different wireless and MAC protocols, end-to-end QoS and mobility, traffic engineering and scalability, protection/restoration, operations and management, authentication/privacy/security, billing, and content and context aware networking. This article addresses the drivers, the issues, and solutions (wherever possible) in the above areas, and concludes with a summarization of the challenges that lie ahead.     

移动IP网络中基于遗传算法的多步寻呼策略及性能分析

在移动IP网络中,层次移动IP协议可降低移动IP位置管理的信令消耗。该文研究支持寻呼的HMIPv6,提出了时延限制下的多步寻呼策略以及基于遗传算法的多步寻呼方案——根据移动节点的位置概率分布,采用遗传算法对寻呼区域内的所有子网进行分组,每步寻呼一个组,使平均寻呼信令开销达到或接近最优。此外,对HMIPv6、单步寻呼的HMIPv6以及基于遗传算法的多步HMIPv6寻呼方案的信令开销进行了比较分析,得出寻呼节省信令开销的必要条件。最后,给出一组数值结果以说明所提出的寻呼策略的有效性。