Sharif Digital Repository

Mobile ad hoc networks (MANETs) have become very interesting during last years, but the security is the most important problem they suffer from. Asymmetric cryptography is a very useful solution to provide a secure environment in multihop networks where intermediate nodes are able to read, drop or change messages before resending them. However, storing all keys in every node by this approach is inefficient, if practically possible, in large-scale MANETs due to some limitations such as memory or process capability. In this paper, we propose a new probabilistic key management algorithm for large-scale MANETs. To the best of our knowledge, this is the first method which probabilistically uses... 

Mobile ad hoc networks (MANETs) have received considerable attention while their special characteristics make them vulnerable against different attacks. Providing security in such networks becomes a challenge and cryptography is an essential solution for it, to implement a cryptosystem, key management is the main challenge. In this paper a new deterministic scheme for key management in MANETs is proposed. Since public and private keys in this algorithm have an unforgeable relationship, there is no need for any certificate. Proposed scheme distributes the role of the key generation center (KGC) among all nodes, therefore the private key is issued by distributed KGCs (DKGCs) and the node... 

Mobile ad hoc networks (MANETs) have been turned into very attractive area of research in the duration of recent years, whereas security is the most challenging point that they undergo. Cryptography is an essential solution for providing security within MANETs. However, storing all keys in every node, if practically possible, is inefficient in large scale MANETs due to some limitations such as memory or process capability. This paper extends our previous idea which was a novel probabilistic key management algorithm that stores only a few randomly chosen keys instead of all ones. In this paper, several different scenarios are proposed for key selection in which they are more practical, and... 

Modeling arbitrary connectivity changes of mobile ad hoc networks (MANETs) makes application of automated formal verification challenging. We introduced constrained labeled transition systems (CLTSs) as a semantic model to represent mobility. To model check MANET protocol with respect to the underlying topology and connectivity changes, we here introduce a branching-time temporal logic interpreted over CLTSs. The temporal operators, from Action Computation Tree Logic with an unless operator, are parameterized by multi-hop constraints over topologies, to express conditions on successful scenarios of a MANET protocol. We moreover provide a bisimilarity relation with the same distinguishing... 

Mobile Ad hoc NETworks (MANET) due to different characteristics from wired networks are more vulnerable to security attacks. Construction of Intrusion Detection Systems (IDS) for MANETs is complicated by the fact that they are lack of fixed infrastructure and lack of central management for authentication and distribution of cryptographic keys. On the other hand, the network lifetime is an important issue in MANETs because of the energy power of mobile nodes is limited. In this paper is presented a proposed Method that in the first step, authorized nodes are detected by non-interactive zero knowledge technique and in the second step, nodes with the highest battery power from among authorized... 

In this paper, we study the problem of leader selection in the presence of selfish nodes in mobile ad-hoc networks (MANETs). In order to encourage selfish nodes to assume the leadership role, some form of incentive mechanism is required. We present an incentive-based leader selection mechanism in which incentives are incorporated in the form of credit transfer to the leader, which motivates nodes to compete with each other for assuming the leadership role. The competition among nodes is modeled as a series of one-on-one incomplete information, alternating offers bargaining games. Furthermore, we propose an efficient algorithm in order to reduce the communication overhead imposed on the... 

We introduced Computed Network Process Theory to reason about protocols for mobile ad hoc networks (MANETs). Here we explore the applicability of our framework in two regards: model checking and equational reasoning. The operational semantics of our framework is based on constrained labeled transition systems (CLTSs), in which each transition label is parameterized with the set of topologies for which this transition is enabled. We illustrate how through model checking on CLTSs one can analyze mobility scenarios of MANET protocols. Furthermore, we show how by equational theory one can reason about MANETs consisting of a finite but unbounded set of nodes, in which all nodes deploy the same... 

Mobile Ad-hoc Networks (MANETs) are forming dynamically by joining or leaving the nodes into/from the network without any fix infrastructure. It is also possible that each mobile node act as a host or router. This kind of wireless network is prone to various security threats or attacks due to its unique characteristics like dynamic topology, open medium, lack of central monitoring, etc. So security is a vital scope in MANET to protect communication between mobile nodes. Ad-hoc On-demand Distance Vector (AODV) is one of the on-demand reactive routing protocols in MANET that initially was improved without considering security protection. Significant attempts have been done to secure AODV... 

Public key management scheme in mobile ad hoc networks (MANETs) is an inevitable solution to achieve different security services such as integrity, confidentiality, authentication and non reputation. Probabilistic asymmetric key pre-distribution (PAKP) is a self-organized and fully distributed approach. It resolves most of MANET's challenging concerns such as storage constraint, limited physical security and dynamic topology. In such a model, secure path between two nodes is composed of one or more random successive direct secure links where intermediate nodes can read, drop or modify packets. This way, intelligent selection of intermediate nodes on a secure path is vital to ensure security... 

Task-based self-organizing algorithms have been proposed as a solution for the management of mobile ad-hoc networks (MANETs). Such algorithms assign tasks to nodes by sequentially selecting the best nodes as leaders. Since the correct functionality of such algorithms depends on the truthfulness of participant nodes, any misbehavior can disrupt the operation of the network due to absence of a centralized monitoring unit. In this paper, we consider the problem of malicious behavior in leader-based MANETs. Current solution analyzes the behavior of the leader by means of some checker nodes. This approach is vulnerable since a malicious checker can ruin the character of a normal behaving leader,... 

Dynamic nature of mobile ad hoc networks combined with their lack of centralized infrastructure make security problem the most challenging issue in such networks. The main contribution of this paper is to propose a secure and efficient key management algorithm, able to satisfying the requirement of such networks and facing their specific characteristics. The proposed algorithm is a fully distributed ID-based system which is built based on elliptic curve cryptography. The main advantage of the proposed algorithm, that gives it the superiority in its field of research, is the improvement of the performance and the security strength together. The proposed algorithm is implemented with much... 

This paper introduces Adaptive Path Selection and Loading (APSL) as a multi-path data transmission scheme for mitigating the effects of misbehaving nodes in mobile ad-hoc networks. In APSL, misbehavior resilience is achieved by adaptively loading Reed-Solomon (RS) coded data into multiple node-disjoint paths. In order to maximize packet delivery ratio, paths are loaded according to Path State Information (PSI) which dynamically estimates the availability and stability of each path. We evaluated APSL through simulation in terms of packet delivery ratio, normalized average end-to-end delay and overhead. APSL can achieve more than 90% packet delivery ratio. Compared to adaptive single path and... 

Mobile Ad Hoc Networks (MANETs) are networks with selforganizing capabilities and without a fixed infrastructure. Wireless nodes communicate among themselves using multi-hop radio relaying, without requiring the packets to pass through a central access point or a base station. In a highly mobile and infrastructure-less scenario, pre-configuration of addresses is not possible. Therefore node addresses need to be configured dynamically with minimum delay and packet loss. Existing solutions for IP address auto-configuration do not address security issues. In this paper we propose a secure address autoconfiguration for Mobile Ad hoc Networks (MANET) based on Virtual Address Space Mapping [1].... 

MANET, which stands for Mobile Ad-hoc Network, is composed of a group of self-organized and wireless nodes that do not possess any predictable and fixed infrastructure. When nodes want to communicate with each other, they have to pass on their messages directly or indirectly. In case the destination node is out of the transmission range, the source node has to rely on intermediate nodes, which, in this case, is called indirect transmission. On the other hand, if the destination node is the neighboring node, there is no need to employ intermediate nodes, which, in this case, is called direct transmission. Over the past years, security issues in MANETs have received a great deal of attention... 

Intrusion Detection Systems (IDS) for Mobile Ad hoc NETworks (MANETs) are necessary when they are deployed in reality. In This paper, we have presented a combined method of selecting IDS agent nodes in mobile ad hoc networks. Since, the IDS agents in MANET due to more activities need to more battery power. In our method, first, compromised nodes are detected and then the nodes with the highest energy power from among valid nodes as IDS agent nodes are considered. So, with this method, some valid nodes contribute in intrusion detection activities and costs of the network monitoring will be reduced and the network lifetime will be increased. © 2009 IEEE  

Mobile ad hoc networks allow to create very dynamic communication systems, which are independent from any fixed infrastructure. One of the most important issues regarding the management of an ad hoc network is the configuration of the system according to the way users move. Since a centralized control structure does not exist, we need to determine how the IP addresses must be assigned to the nodes in the network. In this paper we add a security mechanism to VASM protocol based on zero knowledge approach. A hash function has very low running time. So this so this scheme is very light-weight. The VASM protocol uses coordinate value of point in main address sheet for generating addresses. The... 

An ad hoc network is a multi-hop wireless network formed by a collection of mobile nodes without the intervention of fixed infrastructure. Reliable Multicast plays a significant role in many applications of Mobile Ad Hoc Networks (MANETs). In recent years, a number of protocols have been proposed to deliver multicast packets reliably. In this paper we intend to propose a reliable multicast algorithm with local recovery approach, because importance of on-demand routing protocol we use this method in our algorithm. By using this algorithm nodes can join to multicast group in minimum time and data delivery will be increase. This method achieves fast recovery when route breakage happens, so... 

A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a self-configuring network without using any existing infrastructure. Since MANETs are not currently deployed on a large scale, research in this area is mostly simulation based. Among other simulation parameters, the mobility model plays a very important role in determining the protocol performance in MANET. Thus, it is essential to study and analyze various mobility models and their effect on MANET protocols. In this paper we introduce a new framework for simulation of mobility models in mobile Ad-Hoc networks. This simulator can generate mobility traces in various mobility models. The mobility traces can be...