Hybrid ants-like search algorithms for P2P media streaming distribution in ad hoc networks

Media streaming delivery in wireless ad hoc networks is challenging due to the stringent resource restrictions,po-tential high loss rate and the decentralized architecture. To support long and high-quality streams,one viable approach is that a media stream is partitioned into segments,and then the segments are replicated in a network and served in a peer-to-peer(P2P) fashion. However,the searching strategy for segments is one key problem with the approach. This paper proposes a hybrid ants-like search algorithm(HASA) for P2P media streaming distribution in ad hoc networks. It takes the advantages of random walks and ants-like algorithms for searching in unstructured P2P networks,such as low transmitting latency,less jitter times,and low unnecessary traffic. We quantify the performance of our scheme in terms of response time,jitter times,and network messages for media streaming distribution. Simulation results showed that it can effectively improve the search efficiency for P2P media streaming distribution in ad hoc networks.     

一种增强移动自组网Internet连接的改进型方案

针对移动自组网因单向链路以及盲目转播网关发现分组而造成的与Internet互联性能下降,提出了一种增强型互联方案.同时结合了先应和后应网关发现策略优点的混合网关发现策略被用来获取良好的Internet连接并保持低开销.而通过交换携带有额外增加的对称邻居节点列表和非对称邻居节点列表字段的AODV hello分组,单向链路得以从路由计算中予以清除而广播风暴也同时得到抑制.基于ns-2的仿真结果表明此改进型Internet连接方案在单向链路数量及节点移动速度均变化的应用环境下能取得较其他方案为优的互联性能.     

一种基于CDMA的多信道自组网MAC协议

This paper proposes a novel multichannel medium access control(MAC)protocol based on CDMA that improves network performance and reduces collision probability in wireless ad hoc networks.In the scheme,the code channel is divided into common channel,broadcast channel and several data channels.Simulation results show that the proposed protocol can achieve significantly better performance than the IEEE 802.11 standard.     

移动自组网AODV多路径路由研究

AODV协议是唯一通过IETF批准成为RFC文档的移动自组网按需控制路由协议．分析AODV路由协议工作过程及优缺点，并介绍了几种典型的基于AODV的多路径路由改进协议，最后对这些多路径协议进行优缺点分析及性能比较。     

大规模ad hoc网络下的高效的主动RSA方案

A previous proactive RSA scheme for large-scale ad hoc network has been shown to be faulty. In this paper, we present a new proactive RSA scheme for ad hoc networks, which includes four protocols： the initial key distribution protocol, the share refreshing protocol, the share distribution protocol, and the signature generation protocol. This scheme has two advantages： the building blocks are secure, and the system is efficient.     

Experimental evaluation of an on-demand multipath routing protocol for video transmission in mobile ad hoc networks

We propose an on-demand multiparth routing algorithm in a mobile ad hoc network for video transmission and evaluate its real world performance in video streaming application. There have been a number of multipath routing protocols extended from AODV which is a well-known single path routing protocol. Multipath routing protocols indicate good performance in the reduction of route discovery latency and unnecessary routing packets in simulations. We show that the route establishment using source route lists provided by us (Hu and Johnson, 2002) can reduce the route discovery latency, select stable routes automatically, and work well for live video streaming without limitation of the hop count based approaches. We evaluate this proposed method compared with the original AODV by using eight laptop PCs and demonstrate live streaming experiments.     

Secure and efficient multi-message and multi-receiver ID-based signcryption for rekeying in ad hoc networks

In this paper, the security technology of ad hoc networks is studied.To improve the previous multi-receiver signcryption schemes, an ID-based multi-message and multi-receiver signcryption scheme for rekeying in ad hoc networks is proposed.In this scheme, a sender can simultaneously signcrypt n messeges for n receivers, and a receiver can unsigncrypt the ciphertext to get his message with his own private key.An analysis of this scheme indicates that it achieves authenticity and confidentiality in the random oracle model while being of lower computation and communication overhead.Finally, for the application of our scheme in ad hoc, a threshold key updating protocol for ad hoc networks is given.     

无线自组织网络中带宽约束的分布式按需组播路由协议(英文)

为了满足无线自组织网络中的组播数据流带宽需求,提出了无线ad hoc网络中带宽约束的分布式按需组播路由协议.该协议中,每个节点的资源预留表将记录接入自身、邻居节点和隐蔽节点的数据流的带宽需求,然后从该节点的全部可用带宽中减去资源预留表中预留的带宽,计算出剩余的可用带宽,且BCMR在带宽约束的前提下分布式地搜索最短时延路径.仿真结果表明,BCMR在分组投递率和时延方面性能较好,能满足实时通信的要求,可用于低移动性的无线ad hoc网络组播应用中.     

无线ad hoc网络最小均方负载均衡路由算法

Routing algorithm is a challenge for a mobile ad hoc network (MANET), but current routing protocols for MANETsconsider the path with minimum number of hops as the optimal path to a given destination. This strategy does not balancethe traffic load over a MANET, and may result in some disadvantages such as creating congested area, depleting power fasterand enlarging time delay in the nodes with heavy duties. In this paper, we propose a routing scheme that balances the loadover the network by selecting a path based on its mean load-square, the proposed routing metric can reflect not only the loadof the path, but also the load distribution along the path. Simulation results show effectiveness of this routing scheme onbalancing the load over all nodes in the network.     

Congestion control for ATM multiplexers using neural networks:multiple sources/single buffer scenario

A new neural network based method for solving the problem of congestion control arising at the user network interface (UNI) of ATM networks is proposed in this paper. Unlike the previous methods where the coding rate for all traffic sources as controller output signals is tuned in a body, the proposed method adjusts the coding rate for only a part of the traffic sources while the remainder sources send the cells in the previous coding rate in case of occurrence of congestion. The controller output signals include the source coding rate and the percentage of the sources that send cells at the corresponding coding rate. The control methods not only minimize the cell loss rate but also guarantee the quality of information (such as voice sources) fed into the multiplexer buffer. Simulations with 150 ADPCM voice sources fed into the multiplexer buffer showed that the proposed methods have advantage over the previous methods in the aspect of the performance indices such as cell loss rate (CLR) and voice quali