SecMR – a secure multipath routing protocol for ad hoc networks

Multipath routing in ad hoc networks increases the resiliency against security attacks of collaborating malicious nodes, by maximizing the number of nodes that an adversary must compromise in order to take control of the communication. In this paper, we identify several attacks that render multipath routing protocols vulnerable to collaborating malicious nodes. We propose an on-demand multipath routing protocol, the secure multipath routing protocol (SecMR), and we analyze its security properties. Finally, through simulations, we evaluate the performance of the SecMR protocol in comparison with existing secure multipath routing protocols.     

考虑光学邻近效应的详细布线算法

提出了一种考虑光学邻近效应的详细布线算法.该算法在布线过程中,充分考虑了线网走线相对位置及布线线形对其光学邻近效应的影响,通过相应的光刻模拟模型定义了用于估计光学邻近效应(optical proximity effect,OPE)的OPE费用函数,并采用OPE费用阈值控制Steiner树的生长方向和走线路径的选择,同时兼顾线网长度.为提高算法效率,避免布线过程中反复调用光学模拟程序带来的算法运行速度慢的问题,对可能的走线模式建立了计算OPE费用所需的光强查找表格,使算法的运行速度大大提高.在实际的工业用例上的实验结果表明,本文所提出的详细布线算法使布线结果中的OPE问题得到很大程度的改善,有利于后处理过程中的光学邻近效应校正技术的运用,算法的运行时间是可以接受的.     

移动Ad Hoc网络基于IPv6的Internet接入技术研究

针对实现移动用户无线上网的需求，通过对移动AdHoc网络的体系结构和路由技术的研究，以及对移动IPv6协议的工作原理及其与IPv4特性的比较分析，提出了AdHoc网络基于IPv6的Intemet接入方法，并对其地址自动配置、路由发现、网关发现、协议转换和分组转换等关键技术进行了分析，同时针对这两种技术相结合存在的广播和多跳问题提出了改进方法，并对今后的工作进行了展望。     

基于遗传算法提高网络资源利用率的选播QoS路由算法

选播通信提供了一种从一组具有相同选播地址的服务中选取最佳服务的机制。在研究选播通信服务模型的基础上利用改进的遗传算法实现了有QoS保证的选播路由,并进一步优化了网络的资源利用。仿真结果表明,这种算法是有效且可行的。     

GSM系统中TCH自适应均衡解调算法的研究

针对移动信道多径效应造成的严重的符号间干扰（ISI）问题，研究了基于最大似然序列估计（MLSE）的GSM系统中TCH自适应均衡解调算法，并对这种自适应均衡解调算法在Jake移动信道模型环境下的性能进行了分析和计算机仿真，仿真结果表明，该自适应均衡解调算法能够很好地克服符号间干扰（ISI）问题，性能良好。     

A location‐aware peer‐to‐peer overlay network

This work describes a novel location‐aware, self‐organizing, fault‐tolerant peer‐to‐peer (P2P) overlay network, referred to as Laptop. Network locality‐aware considerations are a very important metric for designing a P2P overlay network. Several network proximity schemes have been proposed to enhance the routing efficiency of existing DHT‐based overlay networks. However, these schemes have some drawbacks such as high overlay network and routing table maintenance overhead, or not being completely self‐organizing. As a result, they may result in poor scalability as the number of nodes in the system grows. Laptop constructs a location‐aware overlay network without pre‐determined landmarks and adopts a routing cache scheme to avoid maintaining the routing table periodically. In addition, Laptop significantly reduces the overlay maintenance overhead by making each node maintain only the connectivity between parent and itself. Mathematical analysis and simulations are conducted to evaluate the efficiency, scalability, and robustness of Laptop. Our mathematical analysis shows that the routing path length is bounded by log_d N, and the joining and leaving overhead is bounded by d log_d N, where N is the number of nodes in the system, and d is the maximum degree of each node on the overlay tree. Our simulation results show that the average latency stretch is 1.6 and the average routing path length is only about three in 10 000 Laptop nodes, and the maximum degree of a node is bounded by 32. Copyright © 2006 John Wiley & Sons, Ltd.     

Adaptive quality of service‐based routing approaches: development of neuro‐dynamic state‐dependent reinforcement learning algorithms

In this paper, we propose two adaptive routing algorithms based on reinforcement learning. In the first algorithm, we have used a neural network to approximate the reinforcement signal, allowing the learner to take into account various parameters such as local queue size, for distance estimation. Moreover, each router uses an online learning module to optimize the path in terms of average packet delivery time, by taking into account the waiting queue states of neighbouring routers. In the second algorithm, the exploration of paths is limited to N‐best non‐loop paths in terms of hops number (number of routers in a path), leading to a substantial reduction of convergence time. The performances of the proposed algorithms are evaluated experimentally with OPNET simulator for different levels of traffic's load and compared with standard shortest‐path and Q‐routing algorithms. Our approach proves superior to classical algorithms and is able to route efficiently even when the network load varies in an irregular manner. We also tested our approach on a large network topology to proof its scalability and adaptability. Copyright © 2006 John Wiley & Sons, Ltd.     

Performance of delay‐sensitive traffic in multi‐layered satellite IP networks with on‐board processing capability

In this article, performance of delay‐sensitive traffic in multi‐layered satellite Internet Protocol (IP) networks with on‐board processing (OBP) capability is investigated. With OBP, a satellite can process the received data, and according to the nature of application, it can decide on the transmission properties. First, we present a concise overview of relevant aspects of satellite networks to delay‐sensitive traffic and routing. Then, in order to improve the system performance for delay‐sensitive traffic, specifically Voice over Internet Protocol (VoIP), a novel adaptive routing mechanism in two‐layered satellite network considering the network's real‐time information is introduced and evaluated. Adaptive Routing Protocol for Quality of Service (ARPQ) utilizes OBP and avoids congestion by distributing traffic load between medium‐Earth orbit and low‐Earth orbit layers. We utilize a prioritized queueing policy to satisfy quality‐of‐service (QoS) requirements of delay‐sensitive applications while evading non‐real‐time traffic suffer low performance level. The simulation results verify that multi‐layered satellite networks with OBP capabilities and QoS mechanisms are essential for feasibility of packet‐based high‐quality delay‐sensitive services which are expected to be the vital components of next‐generation communications networks. Copyright © 2007 John Wiley & Sons, Ltd.     

An adaptive multiuser detector for DS‐CDMA systems in multipath fading channels

In this paper, we investigate the performance of an adaptive multistage detection scheme for direct‐sequence code‐division multiple‐access (DS‐CDMA) systems. The first stage consists of an adaptive multiuser detector which is based on the linear constrained minimum variance (LCMV) criterion. The interference cancellation (IC) occurs in the second stage. The performance of the iterative receiver over both flat and frequency‐selective fading channels is investigated and compared to the single‐user bound. In all cases, and under heavy system loads with near‐far problems, the iterative receiver is shown to offer substantial performance improvement and large gain in user‐capacity relative to the standard LCMV. In flat‐fading channels, our results show that the performance of the iterative detector is very close to the single‐user bound. For the frequency‐selective channel, this performance is noted to be in the order of 1 dB far from the single‐user bound. Copyright © 2007 John Wiley & Sons, Ltd.     

Ad hoc网络安全与攻击探讨

介绍了Ad hoc网络的体系结构和特点,分析了其存在的网络安全问题,总结了对Ad hoc网络的多种攻击方法,并提出了几种改善Ad hoc网络安全的策略。