基于mobile agent的分布式网络自管理模型

为了解决大规模、异构网络环境下基于“管理员密集”的传统网络管理模式带来的低效率和高出错率问题，提出了一种网络自管理模型，从网络管理的自动初始化和动态自管理两个方面实现对网络自动、自主、自适应的管理；提出了管理定位服务这一关键技术，在多个管理站协同工作的分布式网络环境中为设备自动定位出合适的管理站及初始的管理任务；采用可伸缩的分布式体系结构，适应了大规模网络的规模可变性等特点；基于mobile agent的管理框架进一步提高了管理的自适应性和灵活性。     

用于移动Internet随机接入的一种新方式

介绍了移动通信网络中随机接入的概念，论述了移动Internet随机接入的特点，提出了基站调控的slotted-ALOHA随机接入方式，并从理论分析和计算机仿真两方面与现行的移动通信随机接入方式进行了对比，表明该方式能显著提高随机接入性能，使用代价微小，易于实际应用。     

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

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

LEO卫星IP网中的低延时切换

提出了一种由覆盖全球的无星际链路的低轨(LEO)星座构成卫星IP网,首次提出了一种按信关站来划分网络的策略,并着重讨论了卫星IP网中的星间切换技术,提出用邻站广播技术来实现低延时切换的策略。仿真结果表明,本文提出的策略能大大减少信令交换量和降低切换延时,有效保障了卫星网中实时多媒体业务的QoS。     

基于JavaCard的移动代理安全模型研究

欲阻止恶意主机攻击移动代理,代理中的代码信息和数据信息必须被隐藏起来。同时,还要使它们对于执行环境来说是可访问和可执行的。现有措施大都采用软件方法(如密码技术),但并不足以解决恶意主机问题。一个完全不同的方法就是使用可信赖的且可抵御攻击的JavaCard来保护移动代理。本文讨论用JavaCard保护移动代理的机理,同时给出我们所设计的一个JavaCard的安全模型。     

全IP通信网络中的移动性管理

文章描述了全IP网络各个层次上的移动性管理需求以及全IP网络目前的标准和规范，详细介绍了移动性管理中的宏移动性管理、微移动性管理、空中接口移动性管理。指出了全IP网络中移动管理的研究方向。     

Effective Location Based Services with Dynamic Data Management in Mobile Environments

With the proliferation of mobile computing technologies, location based services have been identified as one of the most promising target application. We classify mobile information service domains based on feature characteristics of the information sources and different patterns of mobile information access. By carefully examining the service requirements, we identify the dynamic data management problem that must be addressed for effective location based services in mobile environments. We then devise a general architecture and cost model for servicing both location independent and location dependent data. Based on the architecture and cost model, we propose a set of dynamic data management strategies that employs judicious caching, proactive server pushing and neighborhood replication to reduce service cost and improve response time under changing user mobility and access patterns. Detail behavior analysis helps us in precisely capturing when and how to apply these strategies. Simulation results suggest that different strategies are effective for different types of data in response to different patterns of movement and information access. Shiow-yang Wu is an associate professor of the Department of Computer Science and Information Engineering at National Dong Hwa University, Hualien, Taiwan, R.O.C. He received the BS and MS degrees in computer engineering from National Chiao Tung University, Hsinchu, Taiwan, ROC, and the PhD degree in computer science from the University of Texas at Austin in 1984, 1986, and 1995, respectively. His research interests include data/knowledge bases, mobile computing, distributed processing, intelligence information systems, and electronic commerce. Kun-Ta Wu was born in Taipei, Taiwan, R.O.C., in 1976. He received the B.S. degree in computer science from Soochow University, Taipei, Taiwan, R.O.C., in 1999 and the M.S. degree in computer science and information engineering from National Dong Hwa University, Hualien, Taiwan, R.O.C., in 2001. Currently, he is an Assistant Researcher in the Domestic Division at Science and Technology Information Center, National Science Council, R.O.C., as a member of Information Gathering and Analysis Group of National Information and Communication Security Taskforce. His research interests include mobile computing, wireless network and information security.     

一种软件源的可信管控模型设计

基于对目前可信计算信任链及度量基准值采集流程存在的问题,提出了软件源的可信管控模型,实现软件的安全认定、度量基准值统一计算采集以及可信第三方的集中管控,为软件的可信运行奠定了基础,降低了可信度量值采集工作的复杂度,对软件源的可信管控实施具有一定的指导意义。此外,进行了软件可信表征格式和基于可信表征的可信度量流程设计,将软件源的可信延伸至软件加载的可信和软件运行的可信,较大程度地提升了软件全生命周期的可信证明强度。     

光突发交换网络中突发组装办案研究

光突发交换（Optcal Burst Switching.OBS）被认为是在下一代光网络中起到至关重要作用的一种交换技术。边缘节点处突发包的组装作为业务接入OBS网络的第一步,是OBS研究的关键课题之一。 该文重点阐述了几种常用的突发组装方案：基于突发长度组装方案、基于组装时间组装方案、混合组装方案及自适应组装方案,并分析了它们的性能和优缺点。最后指出综合考虑网络业务流量、边缘节点的处理速度和信道带宽等因素的更加有效的突发组装算法是重点研究的内容。     

Power-conserving routing of ad hoc mobile wireless networks based on entropy-constrained algorithms

This paper presents an approach to power-conserving routing of ad hoc mobile wireless networks. This approach relies on entropy-constrained routing algorithms, which were developed by utilizing the information-theoretic concept of the entropy to gradually reduce the uncertainty associated with route discovery through a deterministic annealing process. Entropy-constrained routing algorithms were tested using a single performance metric related to the distance between the nodes and to the power consumption associated with packet transmission. This paper also expands the versatility of entropy-constrained routing algorithms by making them capable of discovering routes based on multiple performance metrics. In this study, the second performance metric employed for route discovery relied on the power availability in the nodes of the network. The proposed routing approach was evaluated in terms of the power consumption associated with the routing of packets over an ad hoc mobile network in a variety of operating conditions.