Sharif Digital Repository

Wireless ad hoc networks are vulnerable against many types of attacks including black hole. In this paper we investigate the effect of this attack on ad hoc networks. Furthermore, we use hash chain to prevent this type of attack in a network that uses AODV as a routing protocol and results of applying this method has been investigated. Simulation results using OPNET simulator indicates that packet delivery ratio, in the presence of malicious nodes, reduces remarkably and proposed approach can prevent the effect of black hole attacks  

The paper deals with a new reliable data transport protocol for wireless sensor networks, referred as RDTP. One of the most prominent challenges in wireless sensor networks is reliable transport of data from sensor nodes to sink node. For designing protocols for such networks hardware, some constraining factors associated with energy and processing power must be taken into consideration. There are two generic methods, ARQ and FEC to achieve reliable data transport. Here, a reliable data transport protocol for wireless sensor networks is proposed, in which an efficient moduli set in redundant residue number system has been employed. The modulus set is exploited as a means for adding... 

The standardized IPv6 Routing Protocol for Low-power and Lossy Networks (RPL) has enabled efficient communications between thousands of smart devices, sensors, and actuators in a bi-directional, and end-to-end manner, allowing the connection of resource constraint devices in multi-hop IoT infrastructures. RPL is designed to cope with the major challenges of Low-power and Lossy Networks (LLNs), specifically their energy-efficiency. However, RPL is facing with severe congestion and load balancing problems, leading to a low Packet Delivery Ratio (PDR) in the network. For the first time since the declaration of RPL, in this paper we explain that ignoring the specifications of the reception and... 

The rapid developments in wireless communications have introduced the vehicular ad hoc networks as an efficient tool to improve the safety of traffic through Dedicated Short Range Communications systems on highways. This paper addresses the broadcast mode of the 802.11p protocol and it quantitatively analyzes the impact of the highway vehicular traffic on its performance in terms of the packet delivery ratio and the packet transmission delay. To this aim, we propose to consider the number of the contending vehicles as a traffic-dependent stochastic counting process, which can be computed by analyzing the inter-vehicle spacing distribution in different traffic conditions. Based on the... 

We address the performance of the 802.11p protocol in terms of the packet delivery ratio (PDR) and the packet reception ratio (PRR) for broadcasting safety messages in highway environments. Regarding the semi-sparse and intermediate traffic, we try to answer to questions such as what are the upper, dominant and lower bounds of PDR and PRR in each traffic condition? How they may deviate from their average values? and What fraction of vehicles may experience such bounds? To answer to such questions, we propose to consider the communication graph formed among vehicles as a special type of the complex networks and we apply the recently proposed obligatory attachment ruleto synthesize such... 

Information-centric network (ICN) has become a basic research topic with regard to the future architecture of the Internet. Storage and routing data is an important feature of ICN, as it improves network performance and content distribution. One of the challenges in this type of network is the routing problem. The objective of this paper is to propose a routing algorithm in the named data network. Owing to the impressive results presented by the enhanced heuristic methods, tabu search has been selected to develop the proposed algorithm. This work has been carried out in five major steps, Creating the initial solution, The mechanisms of generating a neighborhood, Evaluating the neighbor... 

Although many Medium Access Control (MAC) protocols have been specifically designed for WSNs where energy awareness is an essential consideration, only a few of them have considered the presence of mobile nodes or dynamic network topology in their protocols. However, they have usually considered occasional mobility, in which a few number of nodes may start moving at very low speeds and then remained immobile for a long period of time. In this paper, we propose a modified version of LMAC as Mobile-LMAC (MLMAC) to improve its performance in the scenarios include continuous mobility. The protocol is compared to SMAC and LMAC by simulation. The results show that the proposed MLMAC protocol has... 

In New applications of Mobile Ad hoc Networks (MANETs), nodes may decide not to cooperate in routing protocols in order to save their limited resources while still using the network to relay their own traffic. Exhibiting such a selfish behavior by even a few nodes may degrade network performance and other cooperating nodes may find themselves unfairly loaded. To cope with such a situation, we propose a Stable path, Low overhead, Truthful, and Cost efficient (SLTC) routing protocol which stimulates nodes to cooperate and act truthfully by utilizing the game theoretic notion of mechanism design. To the best of our knowledge, SLTC is the first protocol attaining the message complexity of O(nd),... 

In the IEEE 802.11 standard, network nodes experiencing collisions on the shared medium need a mechanism that can prevent collisions and improve the throughput. Furthermore, a backoff mechanism is used that uniformly selects a random period of time from the contention window (cw) that is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. Prior research has proved that the BEB scheme suffers from a fairness problem and low throughput, especially under high traffic load. In this paper, we present a new backoff control mechanism that is used with the IEEE 802.11 distributed coordination function (DCF). In particular, we propose a dynamic, deterministic contention window... 

The IEEE 802.11 medium access control (MAC) protocol defines a contention-based distribution channel access mechanism that shares the wireless medium for mobile stations. In this paper, we present a novel backoff mechanism, which divides contention window range to the different level based on the history of channel status. Instead of doubling and resetting the CW, we change the CW range by taking into account last three channel states. We test the new scheme against legacy IEEE 802.11 with NS-2 network simulator. The simulation results have shown 30.77% improvement in packet delivery ratio and 31.76% in delay and 30.81% in throughput compared to the IEEE 802.11 DCF