MP2P网络的移动节点域间预切换方法

移动P2P网络具有高度动态性,但节点的频繁移动影响整个网络的可达性,降低了网络的服务质量.为了维护节点的可达性需要减少节点移动时的切换时延,为此文中提出了基于超级节点的分层预切换方法HPH.该方法在基于超级节点分层模型的基础上引入移动IPv6的快速切换的思想,对节点的域间移动采用预切换机制,解决网络中因节点频繁移动而带来的负面影响.仿真结果分析表明,较之传统KaZaA切换方法,HPH方法的切换时延降低了20.5％,丢包率降低了10.2％.     

Admission control scheme for handover service in high-speed train communication system

Admission control in high-speed train communication system is quite different from admission control in traditional cellular networks. Conventional admission control strategies cannot be directly applied to this special communication scenario. In this paper, the problem of admission control for handover service is investigated in high-speed train communication environment. An admission control scheme considering bit error rate(BER)and bandwidth borrowing strategy is proposed. On the basis of admission control decision rule taking BER into account, a part of bandwidth obtained by compressing variable rate service in the networks is provided for handover services. The admission control scheme can admit handover services as more as possible while it guarantees the lowest data rate of different services in the networks. Simulation results show that the proposed admission control scheme has a better performance than existing admission control schemes.     

Effects of denial of service attack in mobile ad hoc networks

Mobile ad hoc networks are often deployed in environments where the nodes of the networks are unattended and have little or no physical protection against tampering. The nodes of mobile ad hoc networks are thus susceptible to compromise. The networks are particularly vulnerable to denial of service (DoS) attacks launched through compromised nodes or intruders. In this paper, we investigated the effects of flooding attacks in network simulation 2 (NS-2) and measured the packet delivery ratio and packet delay under different flooding frequencies and different numbers of attack nodes. Simulation results show that with the increase the flooding frequencies and the numbers of attack nodes, network performance drops. But when the frequency of flooding attacks is greater than a value, the performance decrease gets smooth. Meanwhile the packet delay firstly increases and then declines to a value of stability at the end.     

A Layer-Cluster Key Agreement Protocol for Ad Hoc Networks

Mobile ad hoc networks create additional challenges for implementing the group key establishment due to resource constraints on nodes and dynamic changes on topology. The nodes in mobile ad hoc networks are usually low power devices that run on battery power. As a result, the costs of the node resources should be minimized when constructing a group key agreement protocol so that the battery life could be prolonged. To achieve this goal, in this paper we propose a security efficient group key agreement protocol based on Burmester-Desmedt (BD) scheme and layer-cluster group model, referred to as LCKM-BD, which is appropriate for large mobile ad hoc networks. In the layer-cluster group model, BD scheme is employed to establish group key, which can not only meet security demands of mobile ad hoc networks but also improve executing performance. Finally, the proposed protocol LCKM-BD are compared with BD, TGDH (tree-based group Diffe-Hellman), and GDH (group Diffie-Hellman) group key agreement protocols. The analysis results show that our protocol can significantly decrease both the computational overhead and communication costs with respect to these comparable protocols.     

基于NS2无线传感网路由协议模型的设计与研究

建立了一个以数据为中心的路由协议模型,在NS2仿真平台上对其进行了验证分析,并将其性能与传统端对端路由机制进行了比较.通过数学分析和仿真方法得知,在大规模高密度无线传感器网络中以数据为中心的路由协议能更有效地节约能量,延长网络的生命周期.     

A novel vertical handoff algorithm based on fuzzy logic in aid of grey prediction theory in wireless heterogeneous networks

To coordinate the various access technologies in the 4G communication system, intelligent vertical handoff algorithms are required. This paper mainly deals with a novel vertical handoff decision algorithm based on fuzzy logic with the aid of grey theory and dynamic weights adaptation. The grey prediction theory (GPT) takes 4 sampled received signal strengths as input parameters, and calculates the predicted received signal strength in order to reduce the call dropping probability. The fuzzy logic theory based quantitative decision algorithm takes 3 quality of service (QoS) metric, received signal strength (RSS), available bandwidth (BW), and monetary cost (MC) of candidate networks as input parameters. The weight of each QoS metrics is adjusted along with the networks changing to trace the network condition. The final optimized vertical handoff decision is made by comparing the quantitative decision values of the candidate networks. Simulation results demonstrate that the proposed algorithm provides high performance in heterogeneous as well as homogeneous network environments.     

Research on Improved Low-Energy Adaptive Clustering Hierarchy Protocol in Wireless Sensor Networks

In wireless sensor networks (WSNs), due to the limited battery power of the sensor nodes, the communication energy consumption is the main factor to affect the lifetime of the networks. A reasonable design of the communication protocol can effectively reduce the energy consumption of the network system. Based on low-energy adaptive clustering hierarchy (LEACH), an improved LEACH protocol in WSNs is proposed. In order to optimize the cluster head (CH) election in the cluster setup phase, the improved LEACH takes into account a number of factors, including energy consumption of communication between nodes, remaining energy of the nodes, and the distance between nodes and base station (BS). In the steady phase, one-hop routing and multiple-hop routing are combined to transmit data between CHs to improve energy efficiency. The forward CH is selected as relay node according to the values of path cost. The simulation results show that the proposed algorithm performs better in balancing network energy consumption, and it can effectively improve the data transmission efficiency and prolong the network lifetime, as compared with LEACH, LEACH-C (LEACH-centralized) and NDAPSO-C (an adaptive clustering protocol based on improved particle swarm optimization) algorithms.     

基于EDV-Hop的免测距定位算法研究

为了更好地提高无线传感器网络节点定位精度,降低定位成本,针对APS算法存在的不足,提出一种新的免测距定位算法EDV-Hop,通过限制跳数实现局部范围内的定位信息提取,同时调整平均每跳距离,以此提高定位精度。在网络随机部署和任意节点密度的条件下估算节点位置,并从精度和有效性两个方面进行度量。仿真结果表明,EDV-Hop算法比DV-Hop具有更好的定位性能,它能够减少节点间通信量,降低通信成本,提高定位精度。     

基于遗传算法的道路车辆自组织网络源路由机制

在当前基于交叉路口的城市车辆自组织网络(VANETs)路由协议中，道路上数据包传输大多采用基于地理位置的贪婪转发策略，当数据量较大时，个别节点负载较重，极易引起传输延迟增大乃至丢包的情况.本文提出了一种基于遗传算法的源路由机制，通过记录单体车辆的驾驶信息而非传统方法中的车流均值数据，来预测道路上车辆网络的连通情况，并借助遗传算法，首次基于道路连通性、节点负载和连接跳数这3 点综合考虑，计算得出道路上最佳的源路由节点序列.仿真实验结果表明，在传输率与延迟时间上，性能均优于传统的贪婪路由机制，尤其在车流量为250 veh· lane-1· h-1时，传输率提升约13%.该研究可为智能交通信息通讯提供可靠助力.     

基于遗传算法的道路车辆自组织网络源路由机制

在当前基于交叉路口的城市车辆自组织网络(VANETs)路由协议中，道路上数据包传输大多采用基于地理位置的贪婪转发策略，当数据量较大时，个别节点负载较重，极易引起传输延迟增大乃至丢包的情况.本文提出了一种基于遗传算法的源路由机制，通过记录单体车辆的驾驶信息而非传统方法中的车流均值数据，来预测道路上车辆网络的连通情况，并借助遗传算法，首次基于道路连通性、节点负载和连接跳数这3 点综合考虑，计算得出道路上最佳的源路由节点序列.仿真实验结果表明，在传输率与延迟时间上，性能均优于传统的贪婪路由机制，尤其在车流量为250 veh· lane-1· h-1时，传输率提升约13%.该研究可为智能交通信息通讯提供可靠助力.     

A secure and reliable routing protocol for wireless mesh networks

This study proposes an efficient secure routing protocol which considers symmetric and asymmetric links for wireless mesh networks （WMNs）. A wireless mesh network is a group of wireless mesh routers and several kinds of wireless devices （or nodes）. Individual node cooperates by forwarding packets to each other, allowing nodes to communicate beyond the symmetric or asymmetric links. Asymmetric link is a special feature of WMNs because the wireless transmission ranges of different wireless devices may be different. The asymmetric link enhances WMN coverage. Providing security in WMNs has become an important issue over the last few years. Existing research on this topic tends to focus on providing security for routing and data content in the symmetric link. However, most studies overlook the asymmetric link in these networks. This study proposes a novel distributed routing protocol beyond symmetric and asymmetric links, to guarantee the security and high reliability of the established route in a hostile environment, such as WMNs, by avoiding the use of unreliable intermediate nodes. The routes generated by the proposed protocol are shorter than those in prior works. The major objective of the proposed protocol is to allow trustworthy intermediate nodes to participate in the path construction protocol. The mesh clients out of mesh router wireless transmission range may discover a secure route to securely connect to the mesh router for Internet access via the proposed protocol. The proposed protocol enhances wireless mesh network coverage and assures security.     

A Secure Multi-Routing Platform for Ad Hoc Network

In an ad hoc network, it is usually difficult to optimize the assignment of network routing resources using a single type of routing protocol due to the differences in network scale, node moving mode and node distribution. Therefore, it is desirable to have nodes run multiple routing protocols simultaneously so that more than one protocols can be chosen to work jointly. For this purpose,a multiple routing platform for Ad hoc networks is proposed on a higher level of current routing protocols. In order to ensure the security of the platform, a security mechanism and its formal analysis by BAN logic is given. The simulation results of the network performance demonstrate that the proposed multi-routing platform is practicable in some complex applications.     

一种在CDMA辅助下实现WLAN无缝切换的机制

随着无线局域网（WLAN）技术的发展,越来越多的用户可以在移动过程中通过WLAN获得网络接入服务,这就需要对WLAN切换的支持,而单纯基于接收信号强度（RSS）的切换机制难以克服乒乓效应及其他一些服务质量下降问题.本文提出一种CDMA辅助下的WLAN无缝切换（即低延时、低丢包率）机制（CAHO）,该机制在用户发生相邻WLAN之间的切换过程中使用CD-MA连接来避免性能下降问题.为了评价该机制,我们建立一个实验床,并与传统的WLAN切换机制及Multiscan切换机制进行了比较.实验结果表明,CAHO机制能够有效地解决丢包、服务中断及乒乓切换等问题.     

Efficient peer-to-peer file sharing in 3G networks

In 3G networks upgraded with high speed packet access (HSPA) technology, the high access bandwidth and advanced mobile devices make it applicable to share large files among mobile users by peer-to-peer applications. To receive files as quickly as possible is essential for mobile users in file sharing applications, since they are subject to unstable signal strength and battery failures. While many researches present peer-to-peer file sharing architectures in mobile environments, few works focus on decreasing the time spent in disseminating files among users. In this paper, we present an efficient peer-to-peer file sharing design for HSPA networks called efficient file sharing (EFS) for 3G networks. EFS can decrease the dissemination time by efficiently utilizing the upstream-bandwidth of mobile nodes. It uses an adaptive rearrangement of a node’s concurrent uploading transfers, which causes the count of the node’s concurrent uploading transfers to lower while ensuring that the node’s upstream-bandwidth can be efficiently utilized. Our simulations show that, EFS achieves much less dissemination time than other protocols including Bullet Prime and a direct implementation of BitTorrent for mobile environments.     

基于复杂网络同步城市快速路协调控制研究

基于复杂网络同步,本文研究城市快速路多入口匝道协调控制问题.采用元胞传输模型建立城市快速路节点耦合的复杂网络动力学模型,以同步为目标设计多入口匝道协调控制器并确定控制策略,其中牵制节点对应需施加控制信号的入口匝道,推导出城市快速路网络系统同步的稳定性条件,以此得到牵制节点和反馈增益矩阵.通过具体例子仿真验证了本文协调控制方法的有效性,能以较小的控制范围代价达到抑制交通拥堵从而提高道路通行效率的目的,控制效果优于传统协调控制方式,可进一步推广到大规模城市交通网络系统.     

A New Wireless Packet Scheduling Algorithm Based on EDF and Its Application in Multi-bottleneck Networks

Most of current wireless packet scheduling algorithms aim at resource allocation as fairly as possible or maximizing throughput. This paper proposed a new packet scheduling algorithm that aims at satisfying delay requirement and is the improvement of earliest due first (EDF) algorithm in wired networks. The main idea is to classify the packets based on their delay bound, scheduling the most "urgent" class of user and the users that have the best channel condition with higher priority. This algorithm can easily integrate with common buffer management algorithms, when buffer management algorithm cannot accept new arrival packets, try to modify scheduling policy. Packet scheduling algorithms in multiple bottleneck wireless networks were also discussed. A new variable multi-hop factor was defined to estimate the congestion situation (including channel condition) of future hops. Multi-hop factor can be integrated into packet scheduling algorithms as assistant and supplement to improve its performance in multi-bottleneck wireless networks.     

ANALYSIS OF A CUMULANT-BASED 2D-RAKE RECEIVER FOR CDMA SYSTEM OVER FREQUENCY-SELECTIVE FADING CHANNELS

Code divisionmultipleaccess (CDMA )isaspread spectrummultipleaccessschemethatisex pectedtogainasignificantshareofthecellularmar ket.CDMAhasseveralattractivepropertiesforper sonalcommunications.Andifallmobileradiosig nalsarrivingatthebasestationaresynchronizedtowithinafraction ,thesynchronousCDMA (S CD MA)systemscanenhancethebandwidthefficiencytoa greaterdegreebyemployingorthogonalcodewords.However,S CDMAsystemshavefunda mentaldifficultieswhenutilizedinafrequency se lectivefadingenviron…     

基于无线传感器网络技术的山区高速公路边坡监测方案

基于2．4GHz ZigBee通信协议的无线传感器网络技术设计的高速公路边坡稳定性实时监测系统方案,由自组多跳的多无线传感器节点构成数据采集传输簇群,通过GPRS模块将数据传输至远程监控中心辅助决策,对此已完成通讯测试和模拟组网调试．充分证明了该方案设计能够满足边坡稳定性实时监控的需要。     

认知无线电网络MAC接入性能分析

认知无线电网络中授权用户享有频谱的优先使用权,一旦授权用户出现认知,用户必须中断正使用的频谱,造成正在传输的MAC帧丢失,认知无线电网络直接采用现有的IEEE802.11 DCF协议,无法解决由于中断引发的认知用户MAC帧丢失问题,当认知用户再次获得频谱接入机会时,将重新竞争接入,导致频谱切换延时较大.为解决该问题,本文改进了IEEE 802.11 DCF协议,提出增加冻结缓存机制,以此解决用户信道切换的延时较大问题.当无线链路出现中断时,改进的DCF协议通过冻结节点,中断当前计时器并缓存当前状态信息,认知用户和基站之间链路一旦恢复则继续传输中断前的MAC帧,从而避免了认知用户的重新竞争接入.仿真结果表明改进的DCF协议在频谱切换时能增大接入吞吐量,减小接入延时,提高了DCF机制在认知网络中的应用性能.     

一种基于TDD的无线mesh网络随机自学习调度算法

基于时分多址（TDD）的无线mesh网络是实现无线多跳网络和宽带无线接入的一种关键技术.为用户提供一种可以保障稳定通信的有效的分布式算法是影响基于TDD的无线mesh网络性能的关键因素.本文针对TDD的无线mesh网络提出一种随机自学习分布式调度算法,这种算法是一种基于信息学习的随机选择算法.在网络中,任一节点都要根据其邻居节点控制消息中所携带的数据,学习邻居节点的调度信息,从而判断可用时隙.若上次信息传输成功,则节点仍然沿用上次的传输时隙;反之,节点在可用时隙中随机选择一个时隙发送控制消息.仿真结果表明,与IEEE802.16标准中定义的算法相比,提出的随机自学习分布式调度算法能实现更高的吞吐量.