An efficient load balancing method for ad hoc networks

Routing is the most basic and essential operation of any ad hoc network. A mobile ad hoc network presents many challenges, because of the severe resource limitations such as dynamic and varying topology, lack of centralized control, insecure medium, and limited battery power, among others. Therefore, optimization and conservation is the key to success of any ad hoc network operation. In this paper, we propose and define 2 new metrics for ad hoc networks: bandwidth utilization ratio and load index. These metrics can be used as an indicator to measure and monitor the network usability and to improve its efficiency by efficient load distribution. They can be used to predict the additional load that can be accommodated in the network, without causing any congestion or overflows. We also propose a new load balancing routing scheme for ad hoc networks, called efficient load balancing method. This method tries to offset the load on different paths using load index as a metric. Load index is defined as a measure of a node's degree of involvement in the message routing process, which is indicative of its load. To make this algorithm efficient, we limit our routes to a few efficient ones only. This number of alternate routes used, out of the pool of all available routes, is defined as degree of distribution. Simulation results adequately prove the efficiency of proposed method, vis‐à‐vis 2 other load balancing approaches, and these are verified statistically at 99% confidence interval. A p × q factorial design is used to verify that simulation results are the actual measurements and not due to some unknown errors.     

Quality‐of‐service‐aware cluster‐based service discovery approach for mobile ad hoc networks

This paper presents a quality‐of‐service (QoS) distributed service discovery approach for mobile ad hoc network environments. The approach builds upon a clustered topology, where the clusterhead (CH) is assigned additional roles having to do with maintaining a directory of services in the network and aggregating and computing QoS scores about service providers (SPs) from requesting nodes (RNs) and the providers themselves. To reduce the amount of overhead traffic, the design makes extensive use of piggybacking for relaying and updating the CHs with QoS scores. A mobile device that is interested in a certain service submits a request to its CH, which uses cached QoS data to return a ranked list of SPs that offer the type of requested service. On the basis of its interaction with the SP, the device sends the CH next time it makes a request a score reflecting its perception of the SP's QoS. Over time, the CH develops robust QoS data that it uses to help devices obtain the best available service. Theoretical analysis and experimental evaluation based on simulations prove the advantages of the proposed system and the effectiveness of its operations. Copyright © 2013 John Wiley & Sons, Ltd.     

基于 IBE 的移动自组网安全接入机制

文中研究基于IBE的移动自组网安全接入机制,解决移动自组网拓扑动态变化、高时效性、快速切换等条件下的高效认证问题。对比分析各种认证机制的优缺点以及适用的环境,针对移动自组网内部的接入认证、动态组网认证、跨域认证,分别设计相关的认证流程及安全接入实现途径,保证骨干网、接入子网互联互通时的安全可控,为建设移动自组网安全防护体系提供理论依据和技术支撑。     

A clique-based secure admission control scheme for mobile ad hoc networks (MANETs)

Wireless mobile ad hoc networks (MANETs) do not have centralized infrastructure and it is difficult to provide authentication services. In this paper, we apply Certificate Graph (CG) and identity-based security in designing an admission control scheme for MANETs. We first use one-hop message exchange to build CG at each mobile node. Then we select maximum clique nodes in CG as distributed Certificate Authorities (CAs). We use identity-based key agreement from pairings to protect each session. Then we prove the security by Canetti–Krawczyk (CK) model-based analysis. We demonstrate the effectiveness and feasibility of our protocol through computer simulations.     

Behavioural equivalences and interference metrics for mobile ad-hoc networks

Connectivity and communication interference are two key aspects in mobile ad-hoc networks (MANETs). This paper proposes a process algebraic model targeted at the analysis of both such aspects. The framework includes a probabilistic process calculus and a suite of analytical techniques based on a probabilistic observational congruence and an interference-sensitive preorder. The former enables the verification of behavioural equivalences; the latter makes it possible to evaluate the interference level of behaviourally equivalent networks. The result is a comprehensive and effective framework for the behavioural analysis and a quantitative assessment of interference for wireless networks in the presence of node mobility. We show our techniques at work on two realistic case studies.     

一种基于信誉的移动自组网区分服务激励机制

为了有效解决移动自组网节点在自觉提供服务方面的自私行为问题,该文提出了一种基于信誉的区分服务激励机制。该机制通过建立一种分簇全局信誉模型,并结合节点能力将服务与信誉进行等级关联,提供差异化服务;信誉级别越高的节点可以使用级别越高的服务,使用服务或者故意不提供服务会减少节点的信誉,节点需要积极提供可靠服务提高信誉才能保障服务的使用。仿真结果表明所提机制能有效抵制节点的自私行为,激励节点积极提供可靠服务。     

Status adaptive routing with delayed rebroadcast scheme in AODV-based MANETs

An efficient solution is proposed in this article to determine the best reliable route and to prolong the lifetime of the mobile Ad-hoc networks （MANETs）. In the proposed solution, the route discovery process of the Ad-hoc on-demand distance vector routing protocol （AODV） has been modified using a novel delayed rebroadcast scheme. It combines the shortest route selection criterion of AODV with the real network status including the wireless link quality, the remaining power capacity, as well as the traffic load at each node. Simulation results show that the proposed scheme can significantly extend the network lifetime and provide fewer packet losses than the conventional AODV protocol.     

Threshold-based intrusion detection in ad hoc networks and secure AODV

Mobile ad hoc networks (MANETs) play an important role in connecting devices in pervasive environments. MANETs provide inexpensive and versatile communication, yet several challenges remain in addressing their security. So far, numerous schemes have been proposed for secure routing and intrusion detection, with only simulations to validate them; little work exists, in implementing such schemes on small handheld devices. In this paper, we present our approach of securing a MANET using a threshold-based intrusion detection system and a secure routing protocol. We present a proof-of-concept implementation of our IDS deployed on handheld devices and in a MANET testbed connected by a secure version of AODV over IPv6 – SecAODV. While the IDS helps detect attacks on data traffic, SecAODV incorporates security features of non-repudiation and authentication, without relying on the availability of a Certificate Authority (CA) or a Key Distribution Center (KDC). We present the design and implementation details of our system, the practical considerations involved, and how these mechanisms can be used to detect and thwart malicious attacks.