福州广电IP骨干网方案介绍

福建属东部沿海经济比较发达的省份，随着经济的迅猛发展，通信业务需求增长呈指数上升趋势。但是，面对未知的宽带城域网市场，各大运营商都还处于探索阶段，争取用户的手段也比较有限，暂时都还没有行之有效的方法迅速占领市场。     

Ad hoc网络中移动骨干网的建立和维护

Ad hoc网络中的移动骨干网的建立和维护是一项复杂的工作.本文首先比较了两种不同类型的骨干网络,然后说明了移动骨干网络的构造目标,接着重点对Ad hoc网络中移动骨干网的建立和维护过程进行了详细的论述,最后对全文进行了小结.     

基于IP的下一代移动网络QoS方案

论述了移动网络中一种新的基于资源管理和预切换概念的QoS体系结构，并对该体系结构的信令接续过程和综合切换模型进行了具体分析。     

IP城域网骨干网建设方案的探讨

介绍了城域网的概念以及建设原则，重点介绍4种骨干网建设的技术方案以及它们具有的特点和适用场合。     

UWB移动自组网络的路由协议研究

UWB技术的出现，为移动自组网络的应用研究带来了机遇和挑战。UWB信号的测距能力使路由协议的设计更加灵活。本文针对UWB技术的特点进行了阐述，总结了现有的UWB路由协议研究，并提出了该领域面临的问题和亟待解决的关键技术。     

移动IP及基于IPv6的切换

本文首先对移动IP的工作原理作了简单的介绍，进而提出作为未来移动网络首选的移动IPv6协议的特点。在此基础上，对基于IPv6的各种切换方案作了深入的探讨，引入了类比于3G移动通信切换的思路，提出了基于IPv6切换的下一步研究方向。     

3G网络之IP骨干网安全的实现

越来越多的人开始谈论3G这个热门话题,大家都在憧憬着3G时代的便利生活和3G带来的巨大商机。作为3G技术领航者之一,爱立信正在用敏锐、全面和专业的眼光去分析3G网络可能面临的方方面面的挑战,并加以解决,这其中安全问题显然居于特殊的位置。     

3G网络安全的实现——IP骨干网篇

在构建3G网络时,网络的安全性至关重要.描述了IP网络存在安全隐患的原因,3G网络的IP骨干网在传输中处理开放和封闭流量的关系,介绍爱立信"Diffserv"多网合一的方案,并以国内运行商目前网络情况给出了爱立信站在安全角度提出3G流量在骨干网上传输的一些建议.     

移动IP技术

详细介绍了移动IP技术的工作原理以及移动IP工作机制中的几项关键技术 :隧道技术、代理搜索、注册 ,并介绍了移动IP的发展动态和应用前景。     

移动IP技术

本文详细介绍了移动IP技术的工作原理以及移动IP工作机制中的几项关键技术-隧道技术、代理搜索、注册,并介绍了移动IP的发展动态和应用前景.     

移动自组网IP地址分配技术综述

对近年来提出的多种移动自组网(MANET)地址分配技术进行了较详细地分类评价和性能比较,包括基于状态维护的算法,基于冲突检测的算法和基于网络分层的算法等,并在最后指出了未来的技术发展方向。     

移动Ad Hoc网络分布式多跳认证授权方案

提出一个分布式的具有多跳认证授权支持的移动Ad Hoc网络方案。该方案利用门限密钥分享技术把认证授权功能完全分散化,每个节点持有一个密钥份额,只有达到门限值规定数量的节点联合起来才能提供认证服务,而认证服务将不仅仅局限于本地节点,多跳范围内的节点也可以参与这项工作。此外,本文还采用多播来取代广播以减少杂项开销。本文解决了多跳认证授权所遇到的技术难题,并通过仿真验证了方案的可行性和有效性。     

移动Ad Hoc网络中的安全问题

移动自组网(Mobile Ad HoC Network)是一种无基础设施的无线网络由于它具有开放的媒质、分布式的合作、动态的拓扑结构和受限的网络能力等特点,所以特别容易受到攻击.为此文章结合移动Ad Hoc网络的特点分析了移动Ad Hoc网络面临的安全威胁,并对移动Ad Hoc网络的安全路由和安全报文传送问题进行了详细讨论.     

RandomCast: An Energy-Efficient Communication Scheme for Mobile Ad Hoc Networks

In mobile ad hoc networks (MANETs), every node overhears every data transmission occurring in its vicinity and thus, consumes energy unnecessarily. However, since some MANET routing protocols such as Dynamic Source Routing (DSR) collect route information via overhearing, they would suffer if they are used in combination with 802.11 PSM. Allowing no overhearing may critically deteriorate the performance of the underlying routing protocol, while unconditional overhearing may offset the advantage of using PSM. This paper proposes a new communication mechanism, called RandomCast, via which a sender can specify the desired level of overhearing, making a prudent balance between energy and routing performance. In addition, it reduces redundant rebroadcasts for a broadcast packet, and thus, saves more energy. Extensive simulation using ns-2 shows that RandomCast is highly energy-efficient compared to conventional 802.11 as well as 802.11 PSM-based schemes, in terms of total energy consumption, energy goodput, and energy balance.     

A Trust-Distortion Resistant Trust Management Scheme on Mobile Ad Hoc Networks

Trust management is a promising approach to conduct nodes’ transactions and establish management interactions in mobile ad hoc networks, in which collaboration between nodes is critical to achieve system goals. Lack of centralized management, severe resource constraints (e.g. computing power, energy, bandwidth), and important network dynamics (e.g. topology changes, node mobility, node failure, propagation channel conditions) make the trust management a challenging task in such a network. Mainly, trust management frameworks are prone to attacks trying to deceive nodes’ estimation on other nodes’ trustworthiness, referred to as trust-distortion attacks. In order to inhibit such attacks, we propose a Trust-distortion Resistant Trust Management Scheme (TRTMS) which provides nodes with an accurate estimation on other nodes’ behavior and enables them to handle different trust-distortion attacks in a multi-attack environment. Simulation results prove that TRTMS significantly outperforms the existing alternatives in the literature in presence of simultaneous and contradictory different trust-distortion attacks.     

Multicast Routing in Mobile Ad Hoc Networks

We focus on one critical issue in mobile ad hoc networks that is multicast routing. Advantages and limitations of existing routing protocols are illustrated. Optimal routes, stable links, power conservation, loop freedom, and reduced channel overhead are the main features to be addressed in a more efficient mechanism. In this paper, we propose a new on-demand multicast routing protocol, named Source Routing-based Multicast Protocol (SRMP). Our proposition addresses two important issues in solving routing problems: (i) path availability concept, and (ii) higher battery life paths. SRMP applies a source routing mechanism, and constructs a mesh to connect group members. It provides stable paths based on links' availability according to future prediction of links' states, and higher battery life paths. This protocol succeeded to minimize network load via designing optimal routes that guarantee reliable transmission and active adaptability. A performance comparison study with On-demand Multicast Routing Protocol (ODMRP) and Adaptive Demand-driven Multicast Routing (ADMR) protocol is undertaken. Analysis results show the strength of the SRMP nodes' selection criteria and its efficient energy consumption compared to the other two protocols.     

Ad hoc网络中的路由技术

Ad hoc网络是一些移动节点组成一个多跳的临时性无线自治系统，这种新型的通信网络具有动态变化的拓扑结构和分布控制的网络机制。文中针对Ad hoc网络作了简单的介绍并重点介绍了针对Ad hoc网络特性而提出的路由协议。     

Efficient Broadcasting in Mobile Ad Hoc Networks

This paper presents two efficient flooding algorithms based on 1-hop neighbor information. In the first part of the paper, we consider sender-based flooding algorithms, specifically the algorithm proposed by Liu et al. In their paper, Liu et al. propose a sender-based flooding algorithm that can achieve local optimality by selecting the minimum number of forwarding nodes in the lowest computational time complexity O(n logn), where n is the number of neighbors. We show that this optimality only holds for a subclass of sender-based algorithms. We propose an efficient sender-based flooding algorithm based on 1-hop neighbor information that reduces the time complexity of computing forwarding nodes to O(n). In Liu's algorithm, n nodes are selected to forward the message in the worst case, whereas in our proposed algorithm, the number of forwarding nodes in the worst case is 11. In the second part of the paper we propose a simple and highly efficient receiver-based flooding algorithm. When nodes are uniformly distributed, we prove that the probability of two neighbor nodes broadcasting the same messageneighbor nodes broadcasting the same message exponentially decreases when the distance between them decreases or when the node density increases. The analytical results are confirmed using simulation.     

基于HELLO机制的MANET与Internet高效互联

文章提出一种基于AODV HELLO机制的移动自组网与Internet互联方案。该方案直接在AODV HELLO分组中包含网关信息以及相邻节点列表．从而在无需引入额外控制分组的前提下进行网关发现并同时避免了在路由计算中引入单向链路。结合使用高效的半隧道转发机制，使得互联性能得到显著提升而开销合理，基于NS2的仿真结果显示了其有效性。