A survey of Mobile IP in cellular and Mobile Ad-Hoc Network environments

The Internet has become ubiquitous and there has been tremendous growth in wireless communications in recent years. Many wireless communication techniques are commercially available, such as the Wireless LAN, Bluetooth, GSM, GPRS and CDMA. Because an all-IP network will be a trend, access to the Internet via wireless communication devices has become an important issue.To reduce power consumption and reuse the limited radio spectrum resources, a cellular network was formed. Cell size is one of the factors in the channel reuse rate. Basically, the channel reuse rate in a smaller cell size is higher than the channel reuse rate in a bigger cell size. Micro-mobility is therefore the inevitable direction for future mobile systems. Frequent and fast movements usually characterize micro-mobility. A cellular architecture would then present a challenge to the frequent handover procedures for a smaller cell size would usually induce a higher handoff frequency.In addition to cellular networks, the ad-hoc network is another network architecture for wireless networks. The ad-hoc network is a non-infrastructure architecture; in which nodes can access services from one another regardless where they are. An excellent routing protocol is crucial for an ad-hoc networking to function at high performance. The main difference between a cellular environment and ad-hoc network is that the ad-hoc method has no fixed infrastructure, allowing nodes to communicate with one another at any time and anywhere.We have mentioned that micro-mobility in a cellular environment would introduce a greater number of handoffs than before. The handoff probability drives the mobile IP mechanism due to signal changes. Using the Mobile IP mechanism, handoff breaking would take place within a micro-mobility environment. Therefore, in this paper, some handoff strategies that take the advantage of the ad-hoc mechanism to improve the handoff performance are investigated.     

Misbehavior Detection in Industrial Wireless Networks: Challenges and Directions

In communications, there has been a paradigm shift toward the widespread adoption of wireless technologies in recent years. This evolution to—often ad-hoc—wireless communication has led to significant benefits in terms of flexibility and mobility. However, alongside these benefits, arise new attack vectors, which cannot be mitigated by traditional security measures. Especially in scenarios where traditional, proactive cryptographic techniques cannot be deployed or have been compromised, reactive mechanisms are necessary to detect intrusions. In this paper, we discuss new directions and future challenges in detecting insider attacks for the exemplary application domain of industrial wireless networks, an enabling technology for current smart factory trends. First, we review existing work on intrusion detection in mobile ad-hoc networks with a focus on physical-layer-based detection mechanisms. Second, we conduct a proof-of-concept study of insider detection in industrial wireless networks using real-world measurements from an industrial facility. Based on the study, we point out new directions for future research.     

A hybrid multiagent routing approach for wireless ad hoc networks

Wireless ad-hoc networks are infrastructureless networks that comprise wireless mobile nodes able to communicate each other outside wireless transmission range. Due to frequent network topology changes in one hand and the limited underlying bandwidth in the other hand, routing becomes a challenging task. In this paper we present a novel routing algorithm devoted for mobile ad hoc networks. It entails both reactive and proactive components. More precisely, the algorithm is based on ant general behavior, but differs from the classic ant methods inspired from Ant-Colony-Optimization algorithm [1]. We do not use, during the reactive phase, a broadcasting technique that exponentially increases the routing overhead, but we introduce a new reactive route discovery technique that considerably reduces the communication overhead. In the simulation results, we show that our protocol can outperform both Ad hoc On-demand Distance Vector (AODV) protocol [2], one of the most important current state-of-the-art algorithms, and AntHocNet protocol [5], one of the most important ant-based routing algorithms, in terms of end-to-end delay, packet delivery ratio and the communication overhead.     

DynaMO: A Topology-Aware P2P Overlay Network for Dynamic,Mobile Ad-Hoc Environments

Due to the key differences between wired and ad-hoc wireless networks, traditional networking services and techniques are not always easily portable from an infrastructure based network to a wireless environment. One of the most prominent examples is the TCP transport protocol, which performs only poorly in wireless ad-hoc networks. The Peer-to-Peer (P2P) overlay networks recently developed all target the Internet where a lot of performance issues can be neglected or can be completely ignored. In addition, assumptions made for infrastructure based networks cannot be made in an ad-hoc environment, such as a fixed set of nodes which are always available. This article presents a P2P network tailored towards mobile ad-hoc environments. It utilizes proximity information to efficiently generate an overlay structure which reflects the underlying physical network topology. This way, physical routing path lengths stretched by the overlay routing process are reduced. As a novelty it does not rely on a fixed set of nodes and adapts to changes in the physical network topology. A prominent property of the overlay construction process is that the communication overhead is reduced to a minimum. Additionally, the P2P network presented maintains an even Overlay ID distribution which is deliberately given up by some solutions previously developed for wired networks. The basis of this new overlay network is Pastry, a P2P substrate based on the concept of a distributed hash table. Two different bootstrap strategies were developed and analyzed, both explicitly designed to work in dynamic and mobile networks such as ad-hoc networks.     

Congestion Control Framework for Ad-Hoc Wireless Networks

During the last few years, bandwidth and traffic control have immerged as issues of great importance in ad-hoc wireless networks, requiring sophisticated managing techniques. Moreover, due to the increasing variety of applications and consequently respective need for bandwidth control, such issues are expected to become even more critical in the near future. Main characteristics of MANETs such as multi-hop communication and supporting dynamically varying topologies rapidly and unpredictably change or remain static over long periods of time augments the complexity of the problem as well as the need to efficiently handle it. In order to circumvent those problems, many researchers turn their attention to cross-layer design which provides the possibility to create lightweight and flexible substrate for the demanding ad-hoc wireless networks. This design approach provides critical features that suit the characteristics of ad-hoc wireless networks. This paper proposes a novel, lightweight and efficient cross-layer architecture for congestion control at wireless ad-hoc networks. The performance of this framework is evaluated considering characteristic ad-hoc routing protocols, such as AODV and DSR, in static as well as mobile network topologies using the well known network simulator NS2.     

A Scalable and Reliable Multicast Routing Protocol for Ad-hoc Wireless Networks

Multicasting is an essential service for ad-hoc wireless networks. In a multicasting environment with multiple senders, receivers or meeting members, traditional multicast routing protocols must pay great overhead for multiple multicast sessions. This work presents a scalable and reliable multicasting protocol for ad-hoc wireless networks. A virtual backbone is used as a shared structure for multiple sessions. A clustering scheme is used to reduce the routing path length. A novel scheme is developed to effectively multicast packets using forwarding gates. Furthermore, a lost packet recovery scheme is developed for reliable packet transmission. This scheme can be used to improve the reliability of traditional non-acknowledged multicasting approach. Experiments were conducted to evaluate the proposed multicasting scheme and the results demonstrate that our scheme outperforms other schemes in terms of packet delivery ratio, packet delivery time, control overhead, multicast efficiency, and cost effect. Furthermore, our approach is stable for networks with high mobility and the lost packet recovery scheme is cost-effective. Chyi-Ren Dow was born in 1962. He received the B.S. and M.S. degrees in information engineering from National Chiao Tung University, Taiwan, in 1984 and 1988, respectively, and the M.S. and Ph.D. degrees in computer science from the University of Pittsburgh, USA, in 1992 and 1994, respectively. Currently, he is a Professor in the Department of Information Engineering, Feng Chia University, Taiwan. His research interests include mobile computing, ad-hoc wireless networks, agent techniques, fault tolerance, and learning technology. Jyh-Horng Lin was born in 1975. He received the B.S. and M.S. degrees in information engineering from Feng Chia University, Taiwan, in 1998 and 2000, respectively. He is currently a candidate for the Ph.D. degree in the Department of Information Engineering, Feng Chia University, Taichung, Taiwan. His research interests include mobile computing and ad-hoc wireless networks. Kun-Tai Chen was born in 1978. He received the B.S. and M.S. degrees in information engineering from Feng Chia University, Taiwan, in 2000 and 2002, respectively. He is currently an engineer in the VIA technologies, Inc. Hsinchu branch, Taiwan. His research interests include mobile computing, ad-hoc wireless networks and video decoding. Sheng-Chang Chen was born in 1979. He received his B.S. degree and M.S. degree in information engineering from Feng Chia University, Taiwan, in 2001 and 2002. He is currently a Ph.D. degree in information engineering from Feng Chia University, Taiwan. His research interests include mobile computing, ad-hoc wireless network and fault tolerance technique. Shiow-Fen Hwang was born in 1963. She received her B.S., M.S. and Ph.D. degrees in Applied Mathematics from National Chiao Tung University, Taiwan, in 1985, 1987 and 1991, respectively. Currently, she is an Associate Professor in the Department of Information Engineering, Feng Chia University, Taiwan. Her research interests include interconnection networks, mobile computing, and computer algorithms.     

On the performance of heterogeneous MANETs

Recent decades have witnessed the birth of major applications of wireless communication technology, further supported by the increasing capabilities of portable devices, low cost and ubiquitous presence. Despite radio technology diversity, a great deal of existing research focuses on a single and isolated wireless technology at a time, where homogeneous elements are identified by IP addresses. This work presents a heterogeneous technology routing (HTR) Framework, targeted towards scenarios where the heterogeneity of devices and networking technologies is present. Our contribution is many fold. It consists of a framework, which encompasses a process for bootstrapping networks, a routing protocol capable of dealing with multiple network interfaces, and a tuning with multipath extensions. We evaluate the performance of the bootstrap, routing and multipath mechanisms by way of simulation and an actual testbed implementation. The multipath evaluation simulates HTR networks with WiMAX, 3GPP LTE and Wi-Fi support. Results show that our proposal can effectively improve the data delivery ratio for ad-hoc networks and that it reduces the end-to-end delay without major impact on network energy consumption. As part of HTR tuning, we investigate next the impacts of tuning the HELLO refresh interval timer on route convergence and its subsequent energy consumption reduction during this phase. We also compare our tuned HTR with the widely used optimized link state routing protocol. Results show that varying the HELLO refresh interval can improve the convergence time and reduce the energy consumption without major impact on network behavior. Our proposal also includes a new distributed address allocation algorithm, namely, the dynamic node configuration protocol (DNCP). This paper conducts a comparative analysis between the Prime, Prophet and the DNCP schemes using static and dynamic topologies in terms of network setup time, energy consumption and control message overhead. Results show that the DNCP had a lower battery power consumption and less control message overhead while it slightly suffers with regard to setup.

     

移动代理技术在Ad Hoc无线网络中的应用研究

Ad Hoc无线网络是一组具有路由和转发功能的移动节点组成的一个多跳的临时性自治系统,是一种无中心的无线网络。现有的主动路由协议或者按需路由协议都不能很好地满足Ad Hoc网络的需要。介绍了Ad Hoc无线移动网络和移动代理技术。在分析了现有的2种路由协议后,提出了在按需路由协议中加入移动代理技术来增强Ad Hoc无线网络的性能。在这些结果的基础上,提出了移动代理通信协议。     

Guest Editorial Special Section on Wireless Technologies in Factory and Industrial Automation—Part II

The three papers in this special section focus on wireless technologies in factory and industrial automation. The papers which appear in this second part cover everything from protocol design and evaluation to the design and assessment of system-level solutions for wireless sensor networks in industrial automation.     

Adaptive load distribution approach based on congestion control scheme in ad-hoc networks

The ‘load distribution’ proposition in mobile ad-hoc networks (MANETs) is accomplishing great stimulation. This is because of the phenomenal facets it possesses including advanced network resilience, reliability and performance. Though there are other leading network layer routing protocols, but they radically utilise single-path communication paradigm, which is why they fail in achieving efficient load distribution in a network. Via this paper, we propose an efficient cross-layer adaptive load distribution approach to capitalise network’s channel utilisation and to rapidly adapt to dynamic wireless channel characteristic changes. The proposed method modifies the load balanced congestion adaptive routing (LBCAR) protocol and is developed using dynamic load distribution technique, by pioneering (i) novel parameters, which report for the availability of route pertaining to minimum traffic load and better link lifetime and also adapt according to varying available network resources; (ii) an absolute dynamic method to lessen the redundant route oscillations which further reduces the routing instabilities. The simulation results demonstrate the usefulness of the proposed method and yields better results in comparison to LBCAR and standard instead of dynamic ource outing, it is dynamic source routing (DSR) protocol.     

A Constraint Formulation for Minimum-Energy Multicast Routing in Wireless Multihop Ad-hoc Networks

Energy conservation is a critical issue in wireless multihop ad-hoc networks, which have nodes powered by batteries only. One major metric for energy conservation is to route a communication session along the routes that require the lowest total energy consumption. To do this, we introduce in this paper a new concept called Virtual Relay. Based on this new concept, we present a constraint formulation for the minimum-energy multicast routing problem in terms of mixed integer linear programming. Experiment results show that in a typical multihop ad-hoc network with 50 nodes, the optimal solutions can always be solved in a timely manner, and it also provides a way to evaluate the realistic performance of different heuristic algorithms. Song Guo received the B.S. degree in computer science from Huazhong University of Science and Technology, Wuhan, China, in 1995 and the M.S. degree in electrical and computer engineering from Beijing University of Posts and Telecommunications, Beijing, China, in 1998. Since 2001 he has been a Ph.D. student in the School of Information Technology and Engineering at University of Ottawa, Canada. His main research interests lie in mobile ad-hoc routing protocols and algorithms, power-aware design and optimization for ad-hoc wireless networks, and performance evaluation. Oliver Yang is a Professor in the School of Information Technology and Engineering at University of Ottawa, Ontario, Canada. Dr. Yang received his Ph.D. degree in Electrical Engineering from the University of Waterloo, Ont., Canada in 1988. He has worked for Northern Telecom Canada Ltd. and has done various consulting. His research interests are in modeling, analysis and performance evaluation of computer communication networks, their protocols, services and interconnection architectures. The CCNR Lab under his leadership has been working on various projects in the traffic control, traffic characterization, switch architecture and traffic engineering issues in both wireless and photonic networks. This has been reported in more than 200 technical papers. Dr. Yang is also interested in queuing theory, simulations, computational algorithms and their applications such as reliability and traffic analysis. Dr. Yang is currently the editor of IEEE Communication Magazine.     

移动自组网基于动态蜂窝的QoS路由协议

本文为移动自组网提出了一个基于动态蜂窝的QoS路由协议，它利用移动跟踪技术实现了一个分布式动态蜂窝生成协议；采用一个多Qos路由探测算法选择一条能够最大满足QoS要求的路由，并在这条路由上建立端．端主动资源预留；使用移动预测和被动资源预留技术预测源结点和目的结点可能进入的蜂窝集合，并在这些蜂窝集合与目的结点和源结点之间提前进行端．端被动资源预留；融合蜂窝动态检测技术与QoS路由修补技术自动发现和修补断裂的QoS路由．由于该路由协议模仿了固定蜂窝网络中的操作，所以，大大改善了QoS路由的性能．仿真结果表明：在满足QoS条件下，它明显提高了包传输率，减轻了路由负载．     

Fast RSVP: Efficient RSVP Mobility Support for Mobile IPv6

In recent years, with the development of mobile communication technologies and the increase of available wireless transmission bandwidth, deploying multimedia services in next generation mobile IPv6 networks has become an inevitable trend. RSVP (resource reservation protocol) proposed by the IETF is designed for hardwired and fixed networks and can not be used in mobile environments. This paper proposes a protocol, called Fast RSVP, to reserve resources for mobile IPv6. The protocol adopts a cross-layer design approach where two modules (RSVP module and Mobile IPv6 module) at different layers cooperate with each other. Fast RSVP divides a handover process with QoS guarantees into two stages: (1) setup of the resource reservation neighbor tunnel and (2) resource reservation on the optimized route. It can help a mobile node realize fast handover with QoS guarantees as well as avoid resource wasting by triangular routes, advanced reservations and duplicate reservations. In addition, fast RSVP reserves “guard channels” for handover sessions, thus greatly reducing the handover session forced termination rate while maintaining high performance of the network. Based on extensive performance analysis and simulations, Fast RSVP, compared with existing methods of resource reservation in mobile environments, performs better in terms of packet delay and throughput during handover, QoS recovery time after handover, resource reservation cost, handover session forced termination rate and overall session completion rate.     

Virtual base stations for wireless mobile ad hoc communications: an infrastructure for the infrastructure‐less

In this paper, we propose a new protocol for wireless mobile ad hoc networks, which establishes a dynamic wireless mobile infrastructure. The proposed protocol, namely, the virtual base stations (VBS) protocol, mimics and maintains the operation of the conventional fixed infrastructure in cellular networks. In the VBS protocol, a mobile node is elected from a set of nominees to act as a temporary base station within its zone. We provide proofs for the correctness of the VBS protocol, and show lower and upper bounds for its global convergence time. Likewise, we study the characteristics and performance of VBS by means of simulation. It is shown that VBS scales well to large networks of mobile stations, and that it outperforms other infrastructure‐formation protocols in terms of stability. The VBS protocol would facilitate the development of a comprehensive and promising framework for quality of service (QoS) management in wireless mobile ad hoc networks once the proper integration of the MAC protocol with the routing and call admission control mechanisms is established. The VBS architecture lays the groundwork for assigning bandwidth, and/or implementing priorities, and hence for QoS‐based routing by conveying the quality of a path prior to call setup. Copyright © 2001 John Wiley & Sons, Ltd.     

On the use of wireless networks at low level of factory automation systems

Wireless communication systems are rapidly becoming a viable solution for employment at the lowest level of factory automation systems, usually referred to as either "device" or "field" level, where the requested performance may be rather critical in terms of both transmission time and reliability. In this paper, we deal with the use of wireless networks at the device level. Specifically, after an analysis of the communication requirements, we introduce a general profile of a wireless fieldbus. Both the physical and data link layers are taken directly from existing wireless local area networks and wireless personal area networks standards, whereas the application layer is derived from the most popular wired fieldbuses. We discuss implementation issues related to two models of application layer protocols and present performance results obtained through numerical simulations. We also address some important aspects related to data security and power consumption.     

An efficient anonymous communication protocol for peer-to-peer applications over mobile ad-hoc networks

An efficient anonymous communication protocol, called MANET Anonymous Peer-to-peer Communication Protocol (MAPCP), for P2P applications over mobile ad-hoc networks (MANETs) is proposed in this work. MAPCP employs broadcasts with probabilistic-based flooding control to establish multiple anonymous paths between communication peers. It requires no hop-by-hop encrypt ion/decryption along anonymous paths and, hence, demands lower computational complexity and power consumption than those MANET anonymous routing protocols. Since MAPCP builds multiple paths to multiple peers within a single query phase without using an extra route discovery process, it is more efficient in P2P applications. Through analysis and extensive simulations, we demonstrate that MAPCP always maintains a higher degree of anonymity than a MANET anonymous single-path routing protocol in a hostile environment. Simulation results also show that MAPCP is resilient to passive attacks     

Design and Analysis of an Efficient Communication Strategy for Hierarchical and Highly Changing Ad-hoc Mobile Networks

In this work we introduce two practical and interesting models of ad-hoc mobile networks: (a) hierarchical ad-hoc networks, comprised of dense subnetworks of mobile users interconnected by a very fast yet limited backbone infrastructure, (b) highly changing ad-hoc networks, where the deployment area changes in a highly dynamic way and is unknown to the protocol. In such networks, we study the problem of basic communication, i.e., sending messages from a sender node to a receiver node. For highly changing networks, we investigate an efficient communication protocol exploiting the coordinated motion of a small part of an ad-hoc mobile network (the runners support) to achieve fast communication. This protocol instead of using a fixed sized support for the whole duration of the protocol, employs a support of some initial (small) size which adapts (given some time which can be made fast enough) to the actual levels of traffic and the (unknown and possibly rapidly changing) network area, by changing its size in order to converge to an optimal size, thus satisfying certain Quality of Service criteria. Using random walks theory, we show that such an adaptive approach is, for this class of ad-hoc mobile networks, significantly more efficient than a simple non-adaptive implementation of the basic runners support idea, introduced in [9,10]. For hierarchical ad-hoc networks, we establish communication by using a runners support in each lower level of the hierarchy (i.e., in each dense subnetwork), while the fast backbone provides interconnections at the upper level (i.e., between the various subnetworks). We analyze the time efficiency of this hierarchical approach. This analysis indicates that the hierarchical implementation of the support approach significantly outperforms a simple implementation of it in hierarchical ad-hoc networks. Finally, we discuss a possible combination of the two approaches above (the hierarchical and the adaptive ones) that can be useful in ad-hoc networks that are both hierarchical and highly changing. Indeed, in such cases the hierarchical nature of these networks further supports the possibility of adaptation.     

基于ZigBee无线技术的智能家居系统设计

论述了基于ZigBee无线通讯的智能家居控制系统设计,以Android手机为控制中心,ZigBee无线通讯为桥梁,实现一种星型的ZigBee网络在智能家居中的应用。该系统以TI公司的CC2530单片机为主控,通过ZigBee自组网,终端设备将采集到的数据通过Z-stack协议栈,发送到ZigBee协调器,通过串口将数据发送到电脑及手机上并显示出来,实现了对设备的集中管理与控制。测试结果表明,ZigBee组网成功,终端节点能轻易地检测到各子模块连接的传感器信号,并可通过手机控制节点信号。     

Evaluating the communication performance of an ad hoc wirelessnetwork

Adaptive and self-organizing wireless networks are gaining in popularity. Several media access and routing protocols were proposed for such networks and the performance of such protocols were evaluated based on simulations. In this paper, we evaluate the practicality of realizing an ad hoc wireless network and investigate on performance issues. Several mobile computers were enhanced with ad hoc routing capability and were deployed in an outdoor environment and communication performance associated with ad hoc communications were evaluated. These computers periodically send beacons to their neighbors to declare their presence. We examined the impact of varying packet size, beaconing interval, and route hop count on route discovery time, communication throughput, end-to-end delay, and packet loss. We had also performed mobility experiments and evaluated the route reconstruction time incurred. File transfer times associated with sending information reliably (via TCP) over multihop wireless links are also presented. The experimental results obtained revealed that it is feasible to augment existing wireless computers with ad hoc networking capability. End-to-end performance in ad hoc routes are less affected by beaconing intervals than packet size or route length. Similarly, communication throughput is more dependent on packet size and route length with the exception at very high beaconing frequencies. Packet loss, on the other hand, is not significantly affected by packet size, route length or beaconing frequency. Finally, route discovery time in ad hoc wireless networks are more dependent on channel conditions and route length than variations in beaconing intervals     

个人通信系统中的一种移动用户登记认证协议

假冒和窃听攻击是无线通信面临的主要威胁。在个人通信系统中,为了对无线链路提供安全保护,必须对链路上所传送的数据/话音进行加密,而且在用户与服务网络之间必须进行相互认证。近年来,人们在不同的移动通信网络(如GSM,IS-41,CDPD,Wireless LAN等)中提出了许多安全协议。然而,这些协议在个人通信环境中应用时存在不同的弱点。本文基于个人通信系统的双钥保密与认证模型,设计了用户位置登记认证协议;并采用BAN认证逻辑对协议的安全性进行了形式化证明,也对协议的计算复杂性进行了定性分析。分析表明,所提出的协议与现有的协议相比具有许多新的安全特性。