Mobility support in wireless Internet

The tremendous advancement and popularity of wireless access technologies necessitates the convergence of multimedia (audio, video, and text) services on a unified global (seamless) network infrastructure. Circuit-switched proprietary telecommunication networks are evolving toward more cost-effective and uniform packet-switched networks such as those based on IP. However, one of the key challenges for the deployment of such wireless Internet infrastructure is to efficiently manage user mobility. To provide seamless services to mobile users, several protocols have been proposed over the years targeting different layers in the network protocol stack. In this article we present a cross-layer perspective on the mobility protocols by identifying the key features of their design principles and performance issues. An analysis of the signaling overhead and handoff delay for some representative protocols in each layer is also presented. Our conclusion is that although the application layer protocol is worse than the protocols operating in the lower layers, in terms of handoff delay and signaling overhead, it is better suited as a potential mobility solution for the next-generation heterogeneous networks, if we consider such factors as protocol stack modification, infrastructure change, and inherent operational complexity.     

A terminal-assisted route optimized NEMO management

The NEMO basic support protocol enhances mobile IPv6 (MIPv6) to enable mobile router (MR) to move together with mobile network node (MNN) as a unit. This protocol suffers from pinball routing effect which has triggered research works to enable direct routing between MNNs in the presence of network mobility. Instead of relying on MIPv6, this paper describes network mobility using a novel terminal-assisted IP mobility protocol on MNNs that work cooperatively with MRs and access routers to provide seamless connectivity. This protocol is superior as it neither suffers from pinball routing effect nor requires dedicated infrastructure support such as home agent. It also eliminates the need to dynamically increase the size of IP header in IP tunneling. Through quantitative comparisons with existing protocol, we show that this protocol performs better than existing protocols in terms of average packet delivery overhead and packet generation.     

Integrated Social and QoS Trust-Based Routing in Delay Tolerant Networks

We propose and analyze a class of integrated social and quality of service (QoS) trust-based routing protocols in mobile ad-hoc delay tolerant networks. The underlying idea is to incorporate trust evaluation in the routing protocol, considering not only QoS trust properties but also social trust properties to evaluate other nodes encountered. We prove that our protocol is resilient against bad-mouthing, good-mouthing and whitewashing attacks performed by malicious nodes. By utilizing a stochastic Petri net model describing a delay tolerant network consisting of heterogeneous mobile nodes with vastly different social and networking behaviors, we analyze the performance characteristics of trust-based routing protocols in terms of message delivery ratio, message delay, and message overhead against connectivity-based, epidemic and PROPHET routing protocols. The results indicate that our trust-based routing protocols outperform PROPHET and can approach the ideal performance obtainable by epidemic routing in delivery ratio and message delay, without incurring high message overhead. Further, integrated social and QoS trust-based protocols can effectively trade off message delay for a significant gain in message delivery ratio and message overhead over traditional connectivity-based routing protocols.     

A routing layer-based hierarchical service advertisement and discovery for MANETs

The implementation of mobile ad hoc networks (MANETs) is steadily increasing. MANETs are especially popular in locations that lack a fixed communication infrastructure. To achieve zero-configuration MANETs, as well as quick and easy access to network resources, resources must be well managed by the network. This paper proposes a hierarchical service discovery and advertisement protocol (HSDAP) implemented in the routing layer. HSDAP queries services by piggybacking service REQuest (SREQ) packets on routing packets to reduce overhead and energy consumption. We extend the cluster-based routing protocol (CBRP) to improve service management hierarchy. Simulation results show that adding service discovery and advertisement (SDA) functions to CBRP does not significantly affect overhead. SDA overhead, routing overhead, energy consumption, and SDA delay are significantly less than the extended zone routing protocol. Furthermore, SDA hit ratio of the proposed protocol is greater than 86% for various levels of mobility. The proposed HSDAP is robust and scalable.     

面向5G-Advanced演进的移动性增强技术

为了改善频繁切换造成的数据速率波动、信令开销和时延等问题对用户体验的影响,3GPP业界期望为5G-Advanced系统提供更动态灵活的移动性增强机制.结合4GLTE和5GNR系统中移动性增强技术的演进和当前应用中的缺陷,进一步分析和研究面向5G-Advanced系统的多种移动性增强关键技术及其未来发展趋势.对于站内切换...     

DiFuse: distributed frequency domain user selection for multi-user MIMO networks

Optimal user selection is important in increasing the capacity of Multi-User Multi-Input Multi-Output Wi-Fi networks, yet it faces a significant challenge; the multi-user diversity gain can be overwhelmed by the formidable Channel State Information (CSI) acquisition overhead. To lessen the overhead, existing schemes adopt the greedy user selection which generally takes the projected norm as the user selection metric, since it considers both the channel power gain and the orthogonality. However, the projected norm suffers from occasional poor user selection, since it does not take the optimal sum capacity gain into account. This paper proposes a new distributed user selection protocol called DiFuse. To employ the sum capacity gain as the user selection metric in DiFuse, each user cleverly computes its own estimated capacity gain by overhearing the CSI feedback from others. The users then simultaneously transmit their feedbacks at the frequency domain via the distributed feedback contention, which effectively reduces the feedback overhead. Then the AP collectively utilizes them for user selection that achieves the maximum positive increment to the sum capacity gain. We implemented the prototype of DiFuse on the USRP N210, and evaluated its performance via both testbed experiments and trace-driven emulations. The results showed that DiFuse outperforms the throughput of the existing scheme called OPUS by 1.8\({\times }\) on average, while maintaining better fairness.     

Using statistical data for reliable mobile communications

We examine the extent to which statistical mobility information can increase the reliability of the service experienced by users in mobile networks. Interrupted or dropped calls are an aspect of reliability that stems from the mobility of users. An existing user can move to a cell where there are no resources available to support their call. A natural solution is the reservation of resources in multiple cells that the user is likely to move to. This scheme is called selective reservations and it relies on predicting the next move of the user. Recently, there has been some work on estimating the movement probabilities (also known as the mobility profile) of the user. In this paper, we quantify the usefulness of the mobility profile to improve the reliability of the service perceived by the mobile users. We identify two parameters which characterize the profile: Accuracy and Focus. Accuracy expresses the probability that the host will move as we expect it to. Focus describes how well we can identify patterns in the movement of the users. In our simulations, we examine the effect of the quality of the predictions on the performance of the system. We show that Accuracy and Focus have great impact on the performance of selective reservations. We also show how flexibility in hand‐offs can help in decreasing the dropping probability, and how this can be facilitated by letting the users make a second try at moving in case it fails the first time. Copyright © 2001 John Wiley & Sons, Ltd.     

Weighted dominating set based routing for ad hoc communications in emergency and rescue scenarios

Disasters create emergency situations and the services provided must be coordinated quickly via a communication network. Mobile adhoc networks (MANETs) are suited for ubiquitous communication during emergency rescue operations, since they do not rely on infrastructure. The route discovery process of on-demand routing protocols consumes too much bandwidth due to high routing overhead. Frequent route changes also results in frequent route computation process. Energy efficiency, quick response time, and scalability are equally important for routing in emergency MANETs. In this paper, we propose an energy efficient reactive protocol named Weighted-CDSR for routing in such situations. This protocol selects a subset of network nodes named Maximum Weighted Minimum Connected Dominating Set (MWMCDS) based on weight, which consists of link stability, mobility and energy. The MWMCDS provides the overall network control and data forwarding support. In this protocol, for every two nodes u and v in the network there exists a path between u and v such that all intermediate nodes belong to MWMCDS. Incorporating route stability into routing reduces the frequency of route failures and sustains network operations over an extended period of time. With fewer nodes providing overall network control and data forwarding support, the proposed protocol creates less interference and consumes less energy. The simulation results show that the proposed protocol is superior to other protocols in terms of packet delivery ratio, control message overhead, transmission delay and energy consumption.     

A tree-based mobility management using message aggregation based on a skewed wait time assignment in infrastructure based MANETs

For the effective mobility management of mobile nodes in Infrastructure-based Mobile Ad Hoc Networks, every mobile node is obliged to send a registration message to the Internet Gateway (IG) periodically. Not only do the registration messages and the additional control messages to establish paths from mobile nodes to the IG to send the registration messages incur a considerable amount of control overhead, but also they impose high traffic congestion on the mobile nodes in the vicinity of the IG which is referred to as the “funneling effect.” The control overhead and the funneling effect make it hard to handle mobility management with little impact on the performance of a routing protocol. Therefore, in this paper we propose a tree-based mobility management approach using a message aggregation technique that employs a novel timing model suitable for tree topology, referred to as a skewed wait time assignment technique, in order to maximize message aggregation. Despite its superior performance, this wait time assignment technique differs from the other techniques in that it does not require clock synchronization over nodes. By resorting to simulations, we show that the proposed approach can significantly alleviate the funneling effect as well as improve the performance of mobility management compared with the Tree-based and Quasi-tree based mobility management schemes.     

基于泊松点过程分布的多蜂窝协作系统中干扰对齐技术研究

在多蜂窝MIMO(Multiple-Input Multiple-Output)协作通信系统中,该文研究了基站站点服从泊松点过程(PPP)分布时,协作基站(BSs)和用户对采用干扰对齐技术的中断概率和网络吞吐量性能,推导了完全信道状态信息(CSI)和部分CSI两种情况下的上述性能的解析表达式,并分析了系统性能与协作参数的单调关系。仿真分析发现:在完全CSI情况下,网络吞吐量随着基站密度、协作基站数、天线数的增加而增加;在部分CSI情况下,由于综合考虑了信道训练和有限反馈带来的资源开销以及量化CSI引入的信道失真,存在一个使网络吞吐量最大的最优协作基站数,当天线数较少或用户移动速度较小时,应有较多的基站参与协作,当天线数较多或用户移动速度较大时,应适当减少协作基站数。     

ECBRP: An Efficient Cluster-Based Routing Protocol for Real-Time Multimedia Streaming in MANETs

The dynamic characteristics of wireless networks and stringent QoS requirements of multimedia applications identify significant challenges for providing QoS guarantees for real-time multimedia streaming in such wireless environment. QoS routing protocols can decisively contribute to the QoS provision of network systems. This paper proposes an efficient cluster-based routing protocol (ECBRP) for real-time multimedia streaming in mobile ad hoc networks. First, to improve the stability of clusterheads, we introduce a new algorithm of cluster formation, in consideration of the node mobility and connectivity. Second, a link-broken detection mechanism is designed, which is able to distinguish whether packet loss is due to mobility or congestion, and to make proper reaction. This mechanism contributes to reduce route overhead, and to increase the decodable ratio of video frame at the application layer as well. Third, the routing protocol is enhanced via an adaptive packet salvage strategy, in order to alleviate the congestion in consideration of the characteristics of multimedia traffic. Our simulation experiment results demonstrate that the ECBRP leads to more stable cluster formation than the CBRP, and 80% decreases in the frequency of clusterhead changes against CBRP. As a result, the quality of real-time multimedia streaming is improved significantly, in terms of decodable frame ratio, delay and delay jitter, etc.     

Quasi-tree mobility management for internet connectivity of mobile ad hoc networks

The location of mobile nodes must be managed to enable Internet connectivity of mobile ad hoc networks. Node mobility can be managed efficiently using a tree topology in which a mobile node registers with an Internet gateway along a tree path without using flooding. However, a node that loses connectivity to its parent has to find and connect to a new parent through a join-handshaking process. This tends to increase control overhead and impose some delay on on-going communication. Furthermore, the node may join its descendant because of the synchronization delay in updating topology change, creating a loop that significantly increases control overhead. We improve these problems by maintaining a quasi-tree topology in which a node maintains multiple parents. We also present a technique for detection and resolution of loops. The simulation results show that the quasi-tree mobility management approach far outperforms the traditional approaches and is highly robust against the significant increases in tree size and node mobility.     

基于不同移动模型的移动自组网多播路由协议性能研究

为了研究移动自组网中多播路由协议在不同移动模型下的性能,选取随机路点移动模型、高斯马尔科夫移动模型和参考点组移动模型,将三种移动模型的移动场景加入到NS2中,对基于部分网络编码的实时多播协议PNCRM进行仿真.结果表明,PNCRM协议在随机路点移动模型和高斯马尔科夫移动模型中的数据包投递率明显高于参考点组移动模型,但是参考点组移动模型的总开销和端到端延时是最优的.这样我们就可以根据不同的性能指标要求选择合适的移动模型.     

A Novel RFID Tag Identification Protocol: Adaptive n-Resolution and k-Collision Arbitration

Since radio frequency identification (RFID) technology has become increasingly common in numerous applications, including large-scale supply chain management, improving the efficiency of RFID tag identification is an important task. In practical settings, the identification of RFID tags often occurs in a dynamic environment, in which tags move through a specific interrogation range. However, the literature contains few studies on the design of efficient identification protocols in dynamic environments. This study proposes a novel tag identification protocol that is particularly efficient in dynamic environments. the proposed protocol involves two anti-collision techniques: adaptive n-Resolution (AnR) and k-Collision Arbitration (kCA). These two techniques significantly improve the tag identification delay and communication overhead. This improvement is primarily due to the use of a newly designed challenge-response bit sequence mechanism and the information obtained from the previous tag identification procedure. As a result, AnR requires only a constant number of interrogation times regardless of the number of target tags, while kCA further improves the efficiency of tag identification with \(k\) -splitting collision arbitration. Rigorous analysis and simulation experiments show that this tag identification protocol significantly outperforms related methods (by at least 48.85 % identification delay and 23.87 % communication overhead can).     

Fast adaptive routing supporting mobile senders in Source Specific Multicast

IP multicast deployment recently progresses, but group services often remain restricted to limited domains and fail to comply with route-optimizing mobility management of the next generation Internet. Source Specific Multicast (SSM) facilitates transparent inter-domain routing and is expected to globally disseminate to many users and services. However, mobility support for Source Specific Multicast is still known to be a major open problem. In this paper, we propose the Enhanced Tree Morphing (ETM) protocol for extending SSM routing to mobile multicast sources. The scheme dynamically adapts SSM forwarding states to sender mobility, and transforms (morphs) source specific distribution trees into new, optimal trees rooted at a relocated source. ETM is simple, robust and secure, while it admits superior performance in packet forwarding at a low signaling overhead. Extensive evaluations based on a full protocol implementation, and simulations based on real-world topology data are performed, granting full insight into the properties of packet loss and delay stretch, protocol convergence times and router state evolution during single and rapidly repeated handovers. In a constant bit rate scenario, an ETM source handover typically leads to a slightly increasing delay of the first data packet, only. When operating on realistic network topologies, the protocol uniformly converges within less than 50 ms, thereby sustaining robustness under rapid source movement at all speeds common to our mobile world. Further optimizations are identified for FMIPv6 and for multihomed nodes.     

Multiuser diversity with capture for wireless networks: protocol and performance analysis

In a wireless network, with the aid of rate adaptation, multiuser diversity can be exploited by allowing the mobile user with the best channel to use the channel. However, the overhead that results from polling mobile stations to obtain channel state information (CSI) in large networks can outweigh the multiuser diversity gain. In this paper, we propose a wireless medium access control protocol, namely multiuser diversity with capture (MDC), which explicitly employs the capture effect to obviate the overhead problem. We analyze the good put performance of MDC and compare it with the medium access diversity (MAD) scheme proposed in the literature. Our results show that MDC is effective in networks with radio receivers possessing reasonably good capture properties and in networks where the number of mobile stations is reasonably large.     

Host mobility key management in dynamic secure group communication

The key management has a fundamental role in securing group communications taking place over vast and unprotected networks. It is concerned with the distribution and update of the keying materials whenever any changes occur in the group membership. Wireless mobile environments enable members to move freely within the networks, which causes more difficulty to design efficient and scalable key management protocols. This is partly because both member location dynamic and group membership dynamic must be managed concurrently, which may lead to significant rekeying overhead. This paper presents a hierarchical group key management scheme taking the mobility of members into consideration intended for wireless mobile environments. The proposed scheme supports the mobility of members across wireless mobile environments while remaining in the group session with minimum rekeying transmission overhead. Furthermore, the proposed scheme alleviates 1-affect-n phenomenon, single point of failure, and signaling load caused by moving members at the core network. Simulation results shows that the scheme surpasses other existing efforts in terms of communication overhead and affected members. The security requirements studies also show the backward and forward secrecy is preserved in the proposed scheme even though the members move between areas.     

Trading latency for energy in densely deployed wireless ad hoc networks using message ferrying

Wireless mobile ad hoc networks (MANETs) have the potential for use in important application environments, such as remote environmental monitoring, where energy resources are limited. Efficient power management is necessary to allow these networks to operate over a long period of time. One of the key factors affecting the design of power management mechanisms is the routing protocol in use within the network. In this paper, we investigate the Message ferrying (MF) routing paradigm as a means to save energy while trading off data delivery delay. In MF, special nodes called ferries move around the deployment area to deliver messages for nodes. While this routing paradigm has been developed mainly to deliver messages in partitioned networks, here we explore its use in a connected MANET. The reliance on the movement of ferries to deliver messages increases the delivery delay if a network is not partitioned. However, delegating message delivery to ferries provides the opportunity for nodes to save energy by aggressively disabling their radios when ferries are far away. To exploit this feature, we present a power management framework, in which nodes switch their power management modes based on knowledge of ferry location. We evaluate the performance of our scheme using ns-2 simulations and compare it with a multihop routing protocol, dynamic source routing (DSR). Our simulation results show that MF achieves energy savings as high as 95% compared to DSR without power management and still delivers more than 98% of messages. In contrast, a power-managed DSR delivers many fewer messages than MF to achieve similar energy savings. In the scenario of heavy traffic load, the power-managed DSR delivers less than 20% of messages. MF also shows robust performance for highly mobile nodes, while the performance of DSR suffers significantly. Thus, delay tolerant applications can use MF rather than a multihop routing protocol to save energy efficiently when both routing approaches are available.