移动网络用户频繁鉴权问题的优化方案探讨

为减少移动用户上网时延,进一步改善用户上网感知,通过分析投诉用户的业务记录,发现3G网络存在频繁鉴权问题。以对比分析不同移动网络的参数设置为路径,在保证网络安全的前提下,对网络参数进行合理优化,大幅减少了不必要的鉴权流程,缩短了用户上网时延,并有效提升了用户的上网体验。     

WCDMA系统鉴权机制的研究

首先介绍了WCDMA系统鉴权的概念，具体分析了他的过程，重点介绍了鉴权与密钥协商(AKA)、算法协商、密钥管理等几个关键问题，分析了其对WCDMA系统安全特性的实现。     

移动视频业务在IMS分组网中的部署与鉴权研究

随着3G网络建设的推进和不断优化,基于移动视频业务的需求也越来越多,而电路域提供的视频业务,无论从带宽还是从画面质量都很难满足业务需求.所以对移动视频业务在IMS分组网中的部署与鉴权进行了初步的探讨.     

网络融合下的鉴权技术研究

为提供整体鉴权管理机制以实现固网与移动网络的融合,在对现有通信网络及IMS的安全鉴权进行研究的基础上,提出以EAP-AKA协议加上SIM卡的鉴权机制和只使用SIM卡的用户识别功能两种方案,形成融合网络的整体鉴权。最后对融合网络的未来鉴权机制做了探讨。     

基于SIM卡的移动互联网应用鉴权研究

智能终端的普及和移动互联网的迅速发展极大地改变了通信服务产业链。面对移动互联网行业,SIM卡作为天然的鉴权工具却无法发挥其优势。我们希望探索一种基于SIM卡的移动互联网应用鉴权机制,利用SIM卡现有能力,将SIM卡通信鉴权的便利性带到移动互联网的应用鉴权中,使用户享受更安全便捷,无感知的应用鉴权方式,同时为众多移动互联网应用提供开放性的平台化接入服务。     

WCDMA网络二次鉴权同步失败问题研究

研究了WCDMA网络的鉴权机制,重点研究了鉴权同步判决机制,探讨了二次鉴权同步失败问题对用户业务感知的影响程度。结合现网的实际情况,分析该问题的发生场景和原因,并提出了可行的解决方案。     

基于鉴权原理的鉴权数据回收再利用

随着中国移动客户规模的快速扩大,依照中国移动业务卡的相关编码规则和技术规范,业务卡中的IMSI鉴权数据是会被使用耗尽的。在实际业务发展中,已经出现了现场写卡、换卡业务无鉴权可用的情况,影响了公司业务的顺利开展。为有效解决IMSI鉴权数据资源紧缺问题,通过分析鉴权原理和业务应用技术规范要求,研发了IMSI鉴权数据回收功能,对移动网络、业务系统中已使用且无效的IMSI鉴权数据资源进行回收,重新得到合理利用,既保障了公司业务的顺利开展,也彻底实时地解决了IMSI鉴权数据资源紧缺的问题。     

融合语音信令鉴权的警用移动报警定位系统

针对报警人在报警时常无法清楚描述位置,影响救助的难题,提出警用移动电话报警定位系统。该系统采用网络独立定位技术,能在3秒内为接警员提供手机报警人的明确位置及周边可视化信息,而且融合语音信令鉴权技术,确保位置服务的合法性,有效保护个人的位置信息的隐私权。     

CDMA中的鉴权和加密

鉴权和加密是移动通信系统必须要面对的问题。随着诸如电子商务等新业务的应用,这些问题 变得越来越重要。本文重点介绍了CDMA中的鉴权:包括CAVE鉴权算法,密钥体系以及鉴权流程,同时对CDMA 中的通信安全性问题也做了阐述。最后本文指出了在第三代移动通信中鉴权和加密的发展趋势。     

头戴式蓝牙耳机的鉴权机制研究

由于蓝牙系统工作在2.4GHZ的公共ISM频带内,其安全性一直是研究的热点问题。鉴权在蓝牙系统安全性方面起着关键的作用,因此,本文介绍了头戴式蓝牙耳机基于链路层的一种鉴权机制。     

基于前转指针的平滑主动位置恢复方案

提出了一种基于前转指针的平滑主动位置恢复方案,以位置数据库的处理能力和有线信令消耗,换取无线资源的节省。无需终端的周期性位置更新操作,即可使移动通信系统获得对位置数据库的容错能力。同时,在故障期内采用前转位置指针,使移动用户感知不到HLR故障的存在,具有持续的出呼叫能力。     

Low-cost binding update scheme based on pointer forwarding in HMIPv6 network

By introducing a mobility anchor point(MAP),hierarchical mobile IPv6(HMIPv6)reduces the binding update signaling cost associated with mobile IPv6,but there still exist deficiencies.For instance,a mobile node(MN)needs to orderly accomplish two binding updates with the MAP and home agent(HA)when the MN performs inter-MAP mobility.This results in a high signaling cost,thus affecting network performance.To reduce the inter-MAP binding update cost of idle MN in HMIPv6,an optimization scheme based on pointer forwarding with a threshold is proposed.The scheme can reduces the binding update cost of idle MN by using the binding update between MAP to replace several home binding updates.The signaling cost difference is derived by analyzing the cost of the basic scheme and the optimization scheme between two successive sessions.Simulation results show that,the optimization scheme can reduce the binding update signaling cost and improve the network performance as long as a suitable threshold is chosen.The discussions on the sensitivity of tele-parameters are also given.     

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.     

Two-level pointer forwarding strategy for location management in PCS networks

For a IPCS network to effectively deliver services to its mobile users, it must have an efficient way to keep track of the mobile users. The location management fulfills this task through location registration and paging. To reduce the signaling traffic, many schemes such as a local anchor (LA) scheme, per-user caching scheme and pointer forwarding scheme have been proposed in the past. In this paper, we present a new location management scheme which intends to mitigate the signaling traffic as well as reduce the tracking delay in the PCS systems. In this strategy, we choose a set of visitor location registers (VLRs) traversed by users as the mobility agents (MA), which form another level of management in order to make some registration signaling traffic localized. The idea is as follows: instead of always updating to the home location register (HLR), which would become the bottleneck otherwise, many location updates are carried out in the mobility agents. Thus, the two-level pointer forwarding scheme is designed to reduce the signaling traffic: pointers can be set up between VLRs as the traditional pointer forwarding scheme and can also be set up between MAs. The numerical results show that this strategy can significantly reduce the network signaling traffic for users with low CMR without increasing much of the call setup delay.     

基于社会特征周期演化的机会移动网络路由转发策略

针对分布式k团社区检测引起的超大社区问题,提出了具有节点退出机制的?-window社区检测方法,相应提出了?-window中心性估计。通过实验发现?-window社区和?-window中心性具有周期演化特性,利用该特性,提出TTL(time to live)社区检测和TTL中心性估计,以更准确预测消息生存期上节点的相遇。随后,利用TTL社区和TTL中心性作为转发测度,设计了新的机会移动网络路由算法PerEvo。实验结果表明,与现有的基于社会特征的路由算法比较,PerEvo在保持基本不变的传输开销的同时,有效提高了机会移动网络消息投递的成功率。 关键词：机会移动网络;社区;中心性;周期演化;消息转发     

Multifold node authentication in mobile ad hoc networks

An ad hoc network is a collection of nodes that do not need to rely on a predefined infrastructure to keep the network connected. Nodes communicate amongst each other using wireless radios and operate by following a peer‐to‐peer network model. In this article, we propose a multifold node authentication approach for protecting mobile ad hoc networks. The security requirements for protecting data link and network layers are identified and the design criteria for creating secure ad hoc networks using multiple authentication protocols are analysed. Such protocols, which are based on zero‐knowledge and challenge‐response techniques, are presented through proofs and simulation results. Copyright © 2007 John Wiley & Sons, Ltd.     

Reliable and efficient forwarding in ad hoc networks

This paper focuses on packet forwarding in ad hoc networks and proposes a new approach to improve performance of nodes communication. In particular, we present a lightweight mechanism for REliable and Efficient Forwarding (REEF), which mitigates the effects of adverse situations caused by cooperation misbehavior or network fault conditions. It exploits nodes’ local knowledge to estimates route reliability, and multi-path routing to forward packets on the most reliable route. REEF becomes also a security mechanism in case of a security association established between the communication parties. This additional feature makes the mechanism robust, guaranteeing trustworthiness of the reliability estimator and security of data transmission.A new approach to cooperation enforcing is also proposed. The classical method denies service to misbehaving nodes by, for example, not serving their forwarding requests. We approach the problem less drastically, differentiating the quality of service provided to nodes according to their behavior. In other words, traffic of misbehaving nodes will flow through the network slower than that one of reliable nodes.     

Strong roaming authentication technique for wireless and mobile networks

When one considers the broad range of wirelessly connected mobile devices used today, it is clear that integrating such network‐enabled devices into secure roaming over wireless networks is of essential importance. Over the years, many authentication protocols have been suggested to address this issue. Among these protocols, the recently proposed privacy‐preserving universal authentication protocol, Priauth, exceeds the security and efficiency of other authentication techniques. This paper studies the existing roaming authentication protocols and shows that they are not strong enough to provide secure roaming services in three aspects. Further, using Priauth as an example, we propose efficient remedies that fix the weaknesses. The experimental results show that the proposed approaches are feasible in practice. Copyright © 2012 John Wiley & Sons, Ltd.     

移动通信增值服务认证和支付研究

描述了一种适用于移动通信增值服务的认证和支付模型，提供了用户和增值服务提供者之间的双向身份认证机制；利用小额支付中的散列链概念，很好地解决了增值服务的支付问题，并具有一定的防欺骗性。     

一种规避传感器网络选择性转发攻击的方法

在以数据为中心的无线传感器网络中,当恶意节点出现并发起选择性转发攻击时,出现的问题是恶意节点未能转发来到的信息,而丢掉部分和全部的关键信息,会严重破坏数据的收集,降低网络的可用性。提出PDMCS(Polynomial-based Defense Mechanism Countering the Selective Forwarding Attacks),一个轻量级的防止选择性转发攻击的安全方案。方案中,事件数据包被划分成多个数据子包,通过多项式将这些子包转换成不同的数据片,结合动态多路径路由算法把数据发送到基站。使用这样的技术,可以减轻这种攻击的破坏,提高系统的鲁棒性。用理论分析和仿真探究了方案能够权衡通信负载和安全可靠性。仿真实验结果证明方案在面临大量恶意节点时能够获得高的成功接收率,同时通信量也在合理的范围内。