An Efficient Multicast Routing Protocol in Wireless Mobile Networks

Providing multicast service to mobile hosts in wireless mobile networking environments is difficult due to frequent changes of mobile host location and group membership. If a conventional multicast routing protocol is used in wireless mobile networks, several problems may be experienced since existing multicast routing protocols assume static hosts when they construct the multicast delivery tree. To overcome the problems, several multicast routing protocols for mobile hosts have been proposed. Although the protocols solve several problems inherent in multicast routing proposals for static hosts, they still have problems such as non-optimal delivery path, datagram duplication, overheads resulting from frequent reconstruction of a multicast tree, etc. In this paper, we summarize these problems of multicast routing protocols and propose an efficient multicast routing protocol based on IEFT mobile IP in wireless mobile networks. The proposed protocol introduces a multicast agent, where a mobile host receives a tunneled multicast datagram from a multicast agent located in a network close to it or directly from the multicast router in the current network. While receiving a tunneled multicast datagram from a remote multicast agent, the local multicast agent may start multicast join process, which makes the multicast delivery route optimal. The proposed protocol reduces data delivery path length and decreases the amount of duplicate copies of multicast datagrams. We examined and compared the performance of the proposed protocol and existing protocols by simulation under various environments and we got an improved performance over the existing proposals.     

Adaptive paging schemes for group calls in mobile broadband cellular systems

In this paper, we analyze the problem of efficient paging for group call searches under realistic mobility patterns. Taking as a basis a location update scheme, based on the definition of an adaptive macro‐location area, adapted to the mobility pattern of the terminals, we characterize the residence probabilities in each location area of a generic macro‐area. With this information, we propose and evaluate different sequential group paging strategies, also taking into account their computational cost. Results show the suitability of some of the proposals (semiadaptive and hybrid schemes) and its applicability to new packet‐based broadband cellular systems. Copyright © 2010 John Wiley & Sons, Ltd.     

Optimal Sequential Paging in Cellular Wireless Networks

In a high-capacity cellular network with limited spectral resources, it is desirable to minimize the radio bandwidth costs associated with paging when locating mobile users. Sequential paging, in which cells in the coverage area are partitioned into groups and paged in a non-increasing order of user location probabilities, permits a reduction in the average radio costs of paging at the expense of greater delay in locating the users. We present a polynomial time algorithm for minimizing paging cost under the average delay constraint, a problem that has previously been considered intractable. We show the conditions under which cluster paging, a simple heuristic technique proposed for use with dynamic location update schemes, is optimal. We also present analytical results on the average delay and paging cost obtained with sequential paging, including tight bounds.     

按概率分批寻呼的位置管理策略

位置管理是移动通信领域的一个具有挑战性的课题,涉及到位置更新和位置查找操作。在假定移动台的呼入是一个泊松过程,移动台在各个蜂窝的逗留时间是符合一般概率分布的随机变量的条件下,求出了移动台在两次呼入之间从一个蜂窝移动到另一个蜂窝的概率,提出了根据移动台进入到各个蜂窝的概率分批进行寻呼的位置管理策略,证明了这种策略的位置管理费用比一些国家现行移动通信系统的位置管理策略的费用小。     

A Location Management Scheme Using Direction Characteristics of Mobile Terminals in Mobile Communication Networks

Recently, as the number of mobile terminals (or users) keeps explosively increasing, the location management to track the mobile terminals in mobile communication networks is becoming more important. However, previous schemes have used static location information without any consideration about the moving direction of a mobile terminal. For a fixed paging area, this results in unnecessary pagings, thus increasing the location management cost. In this paper, we propose a new location management scheme using the direction characteristics of a mobile terminal. The direction vector is defined to represent the moving direction of a mobile terminal and to compute a distance from the cell where a location update occurs to the current cell. The offset operation of direction vectors is also presented to represent the position of a mobile terminal in a paging area. This allows the mobile terminal to determine whether a location update will be performed or not. The mobile terminal can also vary its own paging area dynamically according to its moving direction whenever it moves across its paging area. In addition, we develop an analytical model for the proposed scheme which captures the direction characteristics of a mobile terminal based on the Markov model. Analytical results show that the proposed scheme can reduce location management cost by forming a dynamic paging area along the moving direction of a mobile terminal when compared to other schemes.Ui-Sung Song received his B.S and M.S. degrees in Computer Science and Engineering from Korea University, Seoul, Korea in 1997 and 1999, respectively. He is currently a Ph.D. candidate in Computer Science and Engineering from Korea University. Also, he is currently a researcher in the Research Institute of Computer Science and Engineering Technology at Korea University. His research interests include mobile IP, PCS networks, and ad-hoc networks.Joon-Min Gil received his B.S. and M.S. degrees in Computer Science from Korea University, Chochiwon, Korea in 1994 and 1996, respectively. He received his Ph.D. degree in Computer Science and Engineering from Korea University, Seoul, Korea in 2000. From 2001 to 2002, he was a visiting research associate in the Department of Computer Science at the University of Illinois at Chicago, U.S.A. He is currently a senior research engineer in Supercomputing Center at Korea Institute of Science & Technology Information, Daejeon, Korea. His recent research interests include distributed and mobile computing, wireless networks, Internet computing, P2P networks, and grid computing.Chong-Sun Hwang received his M.S. degree in Mathematics from Korea University, Seoul, Korea in 1970, and his Ph.D. degree in Statistics and Computer Science from the University of Georgia in 1978. From 1978 to 1980, he was an assistant professor at South Carolina Lander State University. He is currently a full professor in the Department of Computer Science and Engineering at Korea University, Seoul, Korea. Since 2004, he has been a Dean in the College of Information and Communications at Korea University. His research interests include distributed systems,distributed algorithm, and mobile computing systems     

Dynamic Location Management for Mobile Computing

This paper presents a dynamic and individualized location update scheme that considers each user's mobility patterns. The mobility patterns are used to create individualized location areas for each user. The proposed scheme is flexible and can be used in network with arbitrary cell topologies. The scheme, along with other existing schemes is simulated using realistic users' mobility and call arrival patterns, and network topology. The simulated environment consists of 90 cells representing the geographical area of the San Francisco bay, and 66,550 mobile users representing the typical classes of users that are normally present in a real cellular network. Results show the proposed scheme gives lower overall signaling costs, resulting in savings on the limited radio bandwidth that may have otherwise been used for location updates and paging.     

一种分层多跳无线网中的移动性管理策略

该文介绍一种分层多跳无线网与其他骨干网络互连情况下的网络层移动性管理方案。它使用了包含逻辑家乡代理的宏移动性管理和将位置管理与路由和寻呼机制结合起来的微移动性管理的思想,以提高网络在战场等特殊情况下使用的可靠性和抗毁性,减小位置管理的开销,节省无线信道的带宽。     

Internet Connectivity for Ad Hoc Mobile Networks

The growing deployment rate of wireless LANs indicates that wireless networking is rapidly becoming a prevalent form of communication. As users become more accustomed to the use of mobile devices, they increasingly want the additional benefit of roaming. The Mobile IP protocol has been developed as a solution for allowing users to roam outside of their home networks while still retaining network connectivity. The problem with this solution, however, is that the deployment of foreign agents is expensive because their coverage areas are limited due to fading and interference. To reduce the number of foreign agents needed while still maintaining the same coverage, ad hoc network functionality can cooperate with Mobile IP such that multihop routes between mobile nodes and foreign agents can be utilized. In this work, we present a method for enabling the cooperation of Mobile IP and the Ad hoc On-Demand Distance Vector (AODV) routing protocol, such that mobile nodes that are not within direct transmission range of a foreign agent can still obtain Internet connectivity. In addition, we describe how duplicate address detection can be used in these networks to obtain a unique co-located care-of address when a foreign agent is not available.     

Optimal decision strategies for paging in mobile cellular networks

A high‐level technical survey of paging in mobile cellular communication networks is presented in this paper. We view paging as an optimal decision problem and explore different strategies based on sequential decisions. The examined schemes concentrate on different perspectives of the problem, depending on the type of decisions and the amount of information available or exploitable by the system. This approach provides a useful categorization and an easy conceptual basis for their theoretical investigation, necessary for the deployment of advanced paging algorithms. Because of its suggested generality, the discussed framework is also laid as reference for further research. As modern networks evolve, more emphasis will be given towards optimization in all aspects of a network system. The schemes presented greatly reduce paging costs and can be used in cooperation with known location update strategies to make part of a real network location management system. Copyright © 2006 John Wiley & Sons, Ltd.     

Optimal Distributed Location Management in Mobile Networks

An important issue in the design of future Personal Communication Services (PCS) networks is the efficient management of location information. In this paper, we consider a distributed database architecture for location management in which update and query loads of the individual databases are balanced. We obtain lower bounds to the worst-case delay in locating a mobile user, to the average delay, and to the call blocking probability. We then propose a dynamic location management algorithm that meets these lower bounds. The optimality of this algorithm with respect to these three performance measures, as well as simplicity, make it an appealing candidate for distributed location management in PCS networks.     

Fast Handover Mechanism for Seamless Multicasting Services in Mobile IPv6 Wireless Networks

This paper proposes a fast handover mechanism to provide a seamless multicast service for Mobile IPv6 hosts. With the proposed Fast handover based on a Mobile IP-Multi casting (FMIP-M) protocol, the selection of a new multicast service method, service preparation, and initialization procedures are all performed during the fast handover period, thereby enabling a reliable and efficient multicast service. When mobile hosts move to other networks, they can encounter data loss, out-of-synch problems for multicast data, and multicast service exchange latency. Therefore, the proposed FMIP-M allows the new access router to select a suitable multicast service method according to the multicast service-related network conditions and supports a reliable multicast transmission by compensating for data losses from the previous access router. An analysis is conducted of the overheads associated with a fast multicast handover, including the signaling cost and multicast packet-forwarding cost, where the costs are formulated based on timing diagrams, and compared with a fast handover using Mobile IPv6. The performance analysis and numerical results confirm that the proposed FMIP-M provides a fast multicast handover and reliable service with a relatively small signaling cost and packet-delivery cost.     

A Model for Enhancing Connection Rerouting in Mobile Networks

In active networks (ANs) programs can be injected into routers and switches to extend the functionalities of the network. This allows programmers to enhance existing protocols and enables the rapid deployment of new protocols. The main objective of this paper is to show why ANs are ideal in solving the problem of connection rerouting and how current end-to-end based approaches can be enhanced. In this paper we propose a new model called active connection rerouting (ACR). In the ACR model, programs are dynamically injected into switches/routers in mobile networks to faciliate efficient connection rerouting during mobile host (MH) migration. We show how connection rerouting can be performed efficiently within the network. The ACR model uses a two stage optimization process: (i) path extension and (ii) lazy optimization. Unlike previous work on two stage connection rerouting ACR has the following properties: elimination of loops within switches/routers and incremental optimization which minimizes buffer requirements and maximized path reuse. ACR performs well in all topologies. Our experimental results show that ACR is efficient and scalable and it performs well in all topologies.     

An efficient HARQ scheme for applications in multicast communication systems

This paper deals with the performance evaluation and optimization of an efficient hybrid automatic repeat request (HARQ) scheme suitable for applications delivered over lossy multicast communication channels. In particular, different from previously investigated strategies, this paper proposes a modified HARQ scheme based on the symbol combining principle (MHARQ‐SC) where multiple copies of a same packet are consecutively transmitted at each transmission opportunity. By considering as the performance metrics, the mean packet delivery delay, and the energy consumption per information packet, this paper presents suitable performance evaluation and optimization strategies tailored for multicast communications. For the sake of comparisons, it has been also analyzed, under the same operational conditions, the performance of different HARQ schemes optimized for multicast communications. Numerical results have been provided to validate the proposed performance evaluation and optimization approaches in the case of the MHARQ‐SC scheme. An important result devised here is that the reported analytical results clearly highlight the performance gain of the proposed strategy in comparison with all the other considered alternatives. Copyright © 2013 John Wiley & Sons, Ltd.     

蜂窝移动通信系统核心网络的演进与全IP核心网络

分析了现有移动通信网络存在的问题，阐述了第2代移动通信核心网向第3代移动通信核心网演进的必然性：讨论了第2代移动通信核心网向第3代移动通信核心网演进所采用的演进策略，介绍了两种可供选择的全IP核心网络的参考结构。     

On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks

An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile ad hoc networks. ODMRP is a mesh-based, rather than a conventional tree-based, multicast scheme and uses a forwarding group concept; only a subset of nodes forwards the multicast packets via scoped flooding. It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP performance with other multicast protocols proposed for ad hoc networks via extensive and detailed simulation.     

移动无线传感器网络节点的定位

文中在MCB（Monte—Carlo Localization Boxed）定位算法的基础上提出了一种新的移动无线传感器网络（Mobile Wireless Sensor Networks）节点的定位算法——权重MCB算法。MCB算法在定位过程中,在采样和滤波阶段用到了一阶锚节点和二阶锚节点的位置信息,而没有应用到邻居节点的位置信息。权重MCB在定位过程中不仅用到了一阶锚节点和二阶锚节点的位置信息,还应用到了一阶邻居节点的采样集合里的采样点（即一阶邻居节点的估计位置）,从而改进了定位精度。对比MCB算法,权重MCB算法对定位精度的改进为13％～18％。     

分布式紧耦合虚拟专用网可靠性计算方法

为了评估构建在互联网络基础上,具有多个服务质量约束要求的分布式紧耦合虚拟专用网可靠性能,该文提出一套可靠性指标计算方法。首先,在赋有权值参数的互联网络中,计算出所有满足约束条件的分布式紧耦合节点之间路由。然后,根据这些路由建立满足服务质量要求的网络邻接矩阵,对邻接矩阵进行分解与整合等变换,求得满足约束条件的不交化网络状态集。最后,根据不交化网络状态集得到可靠性指标的计算式,进而完成可靠性指标计算。由于所有过程都实现了代数化或逻辑代数化计算,所以易于计算机编程实现。论述了算法关键环节的正确性。通过算例、实验以及与传统算法结果比较等方式,说明新算法能够非常贴切地反映出分布式紧耦合虚拟专用网的可靠性。     

Checkerboard-Like Routing Protocol for Ad Hoc Mobile Wireless Networks

The main purposes of this article are to relieve broadcast problem, to immunize to some prerequisites, and to reduce the number of transmitted control packets. Broadcasting control packets network-wide is the most direct and common method for finding the required destination node in ad hoc mobile wireless networks; however, this causes a lot of waste of wireless bandwidth. To remedy the problem, routing protocols demanding some prerequisites are proposed; nonetheless, hardly can they be used if these prerequisites are missed or become stale. To efficiently reduce the number of transmitted control packets, our routing protocol partitions the network into interlaced gray districts and white districts by the aid of GPS and inhibits an intermediate node residing in a white district from re-transmitting the received control packets. However, a mobile node residing in a gray district is responsible for re-transmitting them till they reach the destination node. Our routing protocol does not demand any prerequisite except the use of GPS. Each mobile node can always obtain its own location information; furthermore, the information may neither be missed nor become stale. Our routing protocol is easy to be implemented, saves precious wireless bandwidth, and reduces almost half a number of control packets as compared with pure flooding routing protocols.Ying-Kwei Ho received the B.S. degree and M.S. degree in applied mathematics and in electrical engineering from the Chung-Cheng Institute of Technology in 1987 and 1993 respectively and the Ph.D. degree in computer engineering and science from the Yuan-Ze University, Taiwan, R.O.C. He joined the Army of Taiwan, R.O.C. in 1987 and worked as a software engineer. From 1993 to 1997, he was an instructor in the War Game Center of Armed Forces University, Taiwan, R.O.C. He is currently an assistant professor of the Department of Computer Science at Chung-Cheng Institute of Technology. His research interests include mobile computing, wireless network performance simulation and evaluation, and modeling and simulation.Ru-Sheng Liu received the B.S. degree in electrical engineering from the National Cheng-Kung University, Taiwan, in 1972 and the M.S. and Ph.D. degrees in computer science from the University of Texas at Dallas, Richardson, Texas, in 1981 and1985, respectively. He is currently an associate professor in the Department of Computer Engineering and Science at Yuan-Ze University, Chungli, Taiwan. His research interests are in the areas of mobile computing, internet technology, and computer algorithms.