用户兴趣感知的内容副本优化放置算法

提出了用户兴趣感知的内容副本优化放置算法。该算法首先基于聚类算法从用户访问日志提取各用户的群体内容兴趣主题,依据其所辖用户的个体兴趣度加权得其群体兴趣度,并对其进行实时更新;然后在非线性优化模型下,以最小化平均响应时间为目标,优先放置群体兴趣度较大的副本,以实现被放置副本与用户内容兴趣主题的最大匹配。在平均响应时间、请求响应匹配度、负载均衡和邻近副本利用率等方面,与1-Greedy-Insert等算法进行对比,仿真结果显示各性能指标平均提升了约30%,验证了算法的有效性。     

一种数据流处理环境下的节点副本放置方法

物联网环境下的许多应用表现为传感数据的连续流式处理,且系统往往通过节点的副本技术保障可用性。但是,运行时副本的备份和放置存在内存和带宽等资源开销,产生处理的延迟。该文给出一种方法,根据运行时的资源消耗以贪心方式放置节点的副本,折中了系统的可用性和开销。实际系统的仿真实验表明,在相同的条件下,该方法相比传统的随机放置,能为系统提供更稳定的可用性。     

MANET基于客观信任度建模的分簇算法与分析

设计了一个客观信任度评估数学模型,然后基于能量和相对运动观点,以最大稳定链路数为测度,提出了一种最大客观信任的移动自组网分簇算法(MOTBCS).此分簇算法仅有效扩展原HELLO消息,额外代价小;并且更好考虑到了自组网中的实际约束条件,更适用于真实环境.模拟试验表明,MOTBCS与同类算法相比,能形成更稳定的簇结构,同时具有更低的通信开销和更好的运行效率.     

CAR：一种MANET环境下的P2P资源定位与获取算法

针对移动自组网(MANET)环境的特殊性,引用DHT思想,设计了一种适于MANET环境的基于地理位置信息的分层散列索引结构GH2I。基于该结构,设计了一种移动对等(MP2P)覆盖网络资源定位与获取算法CAR。从而实现一种MANET环境下的具有较好可扩展性、资源查找与获取高效性以及移动环境适应性的MP2P网络。     

一种基于MANET的多路径优化路由算法

针对AOMDV协议的多路径路由机制和特点,提出一种基于带宽、时延与链路拥塞度约束的多路径优化路由算法。仿真实验结果表明,对于中低速动态的MANET网络环境,算法能在一定程度上延长网络生存时间以及提高分组投递率。     

面向MANET异常检测的分布式遗传k-means研究

针对移动自组网（MANET,mobile ad hoc networks）入侵检测过程中的攻击类型多样性和监测数据海量性问题,提出了一种基于改进k-means算法的MANET异常检测方法。通过引入划分贡献度的概念,可合理地计算各维特征在检测中占有的权重,并将遗传算法与快速聚类检测算法k-means相结合,解决了聚类检测结果容易陷入局部最优的问题,进而,提出了以上检测算法在MapReduce框架下的设计方案,利用种群迁移策略在分布式处理器上实现了并行聚类检测。实验结果证明了该方法的检测准确率和运行效率均优于传统聚类检测方法。     

基于MANET的移动学习及其系统构建研究

移动自组网（MANET）是一种具有高度动态拓扑结构、节点任意移动的无线移动通信网络。针对MANET的特点及其应用,探讨了基于MANET的移动学习及其系统构建,并通过JisT／SWANS平台进行仿真实验,仿真结果证明MANET具有良好的通信性能。基于MANET的移动学习系统,能够实现随时随地、快速、有效的学习及资源共享,促进教育公平和教育资源效益的最大化。     

MANET主机安全自配置协议研究

提出一种基于IPv6的安全地址自配置方案SMAAC(Security MANET Address Auto-Configuration),新节点以口令方式通过节点验证服务器的验证后,由该服务器发放节点授权票据,由邻居节点进行授权票据检验并根据相关硬件信息产生IPv6地址,并完成地址冲突检测,保证网络内节点身份合法性.最后对该方案进行了安全及性能分析与仿真.     

MANET环境下基于能量保护的路由策略及其研究进展

移动Ad hoc网络是由一组带有无线收发装置的移动节点组成的一个支持多跳的临时性的网络自治系统。由于移动自组网的大多数节点是由有限寿命的电池来提供能量,因此节能策略正逐步成为设计和评价路由协议的一个重要依据。通过分析现有移动自组网的节能路由策略,给出了未来该领域的若干研究方向。     

采用定向天线的MANET邻居发现算法研究

在无线多跳移动自组织网(MANET)中采用定向天线(特别是波束成形天线)有一系列优点。这一技术能增加单跳传输的距离、减小干扰、提高空间复用度,从而能显著增大系统容量。然而,适应于采用全向天线的传统MANET的媒质接入控制(MAC)、功率控制、邻居发现、路由等方法必须作相应的修改。在分析前人相关研究的基础上,针对MANET使用定向天线情况下的邻居发现机制及算法进行了深入研究,提出了2种采用定向天线的MANET的邻居发现算法———非辅助TD模式的定向邻居发现算法与非辅助TRD模式的定向邻居发现算法。这2种算法与目前已提出的其他定向邻居发现算法的最大区别是,它们不需要依赖GPS或其他辅助信息就能独立实现邻居发现。     

移动自组网地址配置问题的研究

MANET（Mobile Ad hoc Network）中没有一个永久的中心机构，其网络拓扑结构不断变化，所以必须有一种能够对网络主机地址动态自配置和管理的协议。给出了在MANET中动态地址自配置与管理的方法，不同方案的特点及适应情况，最后对目前Ad hoc网络地址配置研究进行总结和展望。     

Credit-based slot allocation for multimedia mobile ad hoc networks

This paper studies resource management for multimedia mobile ad hoc networks (MANET). In particular, we focus on providing fair scheduling with quality-of-service (QoS) support for MANET. We consider two types of flows: guaranteed and best effort flows. The goal is to satisfy the QoS requirements of guaranteed flows and to provide global fairness for best effort flows. In this paper, a credit-based fair scheduling mechanism called credit-based slot allocation protocol (CSAP) is proposed. In CSAP, nodes are logically grouped into clusters, each with a scheduler. Each scheduler assigns time slots to nodes in its cluster based on the first tier algorithm. The node scheduled to send at the next time slot then in turn assigns the time slot to a relayed flow determined by the second-tier algorithm. Each multihop flow is treated as multiple single-hop flow segments. These segments are then correlated such that a downstream segment will not be allocated a slot unless the upstream segments have all been allocated. We evaluate the performance of CSAP by simulations. The results show that CSAP meets the QoS requirements of guaranteed flows, provides global fairness for best effort flows, and improves overall system throughput.     

Friend-assisted intrusion detection and response mechanisms for mobile ad hoc networks

Nowadays, a commonly used wireless network (i.e., Wi-Fi) operates with the aid of a fixed infrastructure (i.e., an access point) to facilitate communication between nodes. The need for such a fixed supporting infrastructure limits the adaptability and usability of the wireless network, especially in situations where the deployment of such an infrastructure is impractical. Recent advancements in computer network introduced a new wireless network, known as a mobile ad hoc network (MANET), to overcome the limitations. Often referred as a peer to peer network, the network does not have any fixed topology, and through its multi hop routing facility, each node can function as a router, thus communication between nodes becomes available without the need of a supporting fixed router or an access point. However, these useful facilities come with big challenges, particularly with respect to providing security. A comprehensive analysis of attacks and existing security measures suggested that MANET are not immune to a colluding blackmail because such a network comprises autonomous and anonymous nodes. This paper addresses MANET security issues by proposing a novel intrusion detection system based upon a friendship concept, which could be used to complement existing prevention mechanisms that have been proposed to secure MANETs. Results obtained from the experiments proved that the proposed concepts are capable of minimising the problem currently faced in MANET intrusion detection system (IDS). Through a friendship mechanism, the problems of false accusations and false alarms caused by blackmail attackers in intrusion detection and response mechanisms can be eliminated.     

HEAP: A packet authentication scheme for mobile ad hoc networks

In mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs), it is easy to launch various sophisticated attacks such as wormhole, man-in-the-middle and denial of service (DoS), or to impersonate another node. To combat such attacks from outsider nodes, we study packet authentication in wireless networks and propose a hop-by-hop, efficient authentication protocol, called HEAP. HEAP authenticates packets at every hop by using a modified HMAC-based algorithm along with two keys and drops any packets that originate from outsiders. HEAP can be used with multicast, unicast or broadcast applications. We ran several simulations to compare HEAP with existing authentication schemes, such as TESLA, LHAP and Lu and Pooch’s algorithm. We measured metrics such as latency, throughput, packet delivery ratio, CPU and memory utilization and show that HEAP performs very well compared to other schemes while guarding against outsider attacks.     

A localized certificate revocation scheme for mobile ad hoc networks

The issue of certificate revocation in mobile ad hoc networks (MANETs) where there are no on-line access to trusted authorities, is a challenging problem. In wired network environments, when certificates are to be revoked, certificate authorities (CAs) add the information regarding the certificates in question to certificate revocation lists (CRLs) and post the CRLs on accessible repositories or distribute them to relevant entities. In purely ad hoc networks, there are typically no access to centralized repositories or trusted authorities; therefore the conventional method of certificate revocation is not applicable.In this paper, we present a decentralized certificate revocation scheme that allows the nodes within a MANET to revoke the certificates of malicious entities. The scheme is fully contained and it does not rely on inputs from centralized or external entities.     

Impact of node distance on selfish replica allocation in a mobile ad-hoc network

Many data replication techniques have been proposed to minimize performance degradation caused by network partitioning in a mobile ad-hoc network. Most of them assume that all mobile nodes collaborate fully in terms of sharing their memory space. However, in reality, some nodes may selfishly decide to only cooperate partially, or not at all, with other nodes. Recently, a new approach to selfish replica allocation has been proposed to handle node selfishness. However, there is still much room for improvement. We empirically observe that the previous selfish replica allocation strategy suffers from long query delay and poor data accessibility, because it utilizes only non-selfish nodes that may be faraway nodes. In this paper, we propose a novel replica allocation strategy in the presence of selfish nodes, that takes into account both selfish behavior and node distance. Moreover, through a novel node leveling technique, we utilize the memory space of all connected nodes, including selfish nodes. The conducted simulations demonstrate that the proposed strategy outperforms existing replica allocation techniques in terms of data accessibility, query delay, and communication cost.     

Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks

One possibility direction to assist routing in Mobile Ad Hoc Network (MANET) is to use geographical location information provided by positioning devices such as global positioning systems (GPS). Instead of searching the route in the entire network blindly, position-based routing protocol uses the location information of mobile nodes to confine the route searching space into a smaller estimated range. The smaller route searching space to be searched, the less routing overhead and broadcast storm problem will occur. In this paper, we proposed a location-based routing protocol called LARDAR. There are three important characteristics be used in our protocol to improve the performance. Firstly, we use the location information of destination node to predict a smaller triangle or rectangle request zone that covers the position of destination in the past. The smaller route discovery space reduces the traffic of route request and the probability of collision. Secondly, in order to adapt the precision of the estimated request zone, and reduce the searching range, we applied a dynamic adaptation of request zone technique to trigger intermediate nodes using the location information of destination node to redefine a more precise request zone. Finally, an increasing-exclusive search approach is used to redo route discovery by a progressive increasing search angle basis when route discovery failed. This progressive increased request zone and exclusive search method is helpful to reduce routing overhead. It guarantees that the areas of route rediscovery will never exceed twice the entire network. Simulation results show that LARDAR has lower routing cost and collision than other protocols. Tzay-Farn Shih was with Department of Electrical Engineering, National Taiwan University. Tzay-Farn Shih received the B.S. degree in Information Management from Chinese Culture University, Taiwan, in 1992, the M.S. degree in Computer Science Engineering from Tatung University, Taiwan, in 1996, and the Ph.D. degree in Electrical Engineering from National Taiwan University, Taiwan, in 2006. He is presently an assistant professor of Computer Science and Information Engineering at Chaoyang University of Technology, where he initially joined in August 2006. He is currently an overseas member of the Institute of Electronics, Information and Communication Engineers (IEICE). His current research interests include computer simulation, computer networks routing protocol, wireless networks, Mobile Ad Hoc networks and sensor networks. Hsu-Chun Yen was born in Taiwan, Republic of China, on May 29, 1958. He received the B.S. degree in electrical engineering from National Taiwan University, Taiwan, in 1980, the M.S. degree in computer engineering from National Chiao-Tung University, Taiwan, in 1982, and the Ph.D. degree in computer science from the University of Texas at Austin, U.S.A., in 1986. He is presently a Professor of Electrical Engineering at National Taiwan University, where he initially joined in August 1990. From August 1986 to July 1990, he was an Assistant Professor of Computer Science at Iowa State University, Ames, Iowa, U.S.A. His current research interests include Petri net theory, formal methods, design and analysis of algorithms, and complexity theory. Dr. Yen is an editor of International Journal of Foundations of Computer Science (IJFCS, World Scientific Publisher).     

Security in vehicular ad hoc networks [security in mobile ad hoc]

Vehicular communication networking is a promising approach to facilitating road safety, traffic management, and infotainment dissemination for drivers and passengers. One of the ultimate goals in the design of such networking is to resist various malicious abuses and security attacks. In this article we first review the current standardization process, which covers the methods of providing security services and preserving driver privacy for wireless access in vehicular environments (WAVE) applications. We then address two fundamental issues, certificate revocation and conditional privacy preservation, for making the standards practical. In addition, a suite of novel security mechanisms are introduced for achieving secure certificate revocation and conditional privacy preservation, which are considered among the most challenging design objectives in vehicular ad hoc networks.     

Future trust management framework for mobile ad hoc networks [security in mobile ad hoc]

In mobile ad hoc networks nodes should collaborate with each other to support the functions of the network. The trust management framework, which evaluates the trust of participating nodes, is used to force nodes to cooperate in a normal way. We make an effort to design a robust and attack-resistant trust management framework for the future. In this article we describe the vulnerabilities of and possible attacks on existing frameworks. An objective trust management framework is proposed to overcome these vulnerabilities. We provide a theoretical basis and skeleton for this framework. The performance evaluation and security analysis are provided showing the effectiveness and robustness of the OTMF compared with existing frameworks.