Searcharxiv⌕ Search

arXiv subjects

Mubashir Husain Rehmani

Publications and source records attributed to Mubashir Husain Rehmani.

43 records · Page 3Linked to original sources
arXiv2010

A Tutorial on the Implementation of Ad-hoc On Demand Distance Vector (AODV) Protocol in Network Simulator (NS-2)

The Network Simulator (NS-2) is a most widely used network simulator. It has the capabilities to simulate a range of networks including wired and wireless networks. In this tutorial, we present the implementation of Ad Hoc On-Demand Distance Vector (AODV) Protocol in NS-2. This tutorial is targeted to the novice user who wants to understand the implementation of AODV Protocol in NS-2.

cs.NI↗
arXiv2010

A Tutorial on Broadcasting Packets over Multiple-Channels in a Multi-Inferface Network Setting in NS-2

With the proliferation of cheaper electronic devices, wireless communication over multiple-channels in a multi-interface network is now possible. For instace, wireless sensor nodes can now operate over multiplechannels. Moreover, cognitive radio sensor networks are also evolving, which also operates over multiple-channels. In the market, we can find antennas that can support the operation of multiple channels, for e.g. the cc2420 antenna that is used for communication between wireless sensor nodes consists of 16 programmable channels. The proper utilization of multiple-channels reduces the interference between the nodes and increase the network throughput. Recently, a Cognitive Radio Cognitive Network (CRCN) patch for NS-2 simulator has proposed to support multi-channel multi-interface capability in NS-2. In this tutorial, we consider how to simulate a multi-channel multiinterface wireless network using the NS-2 simulator. This tutorial is trageted to the novice users who wants to understand the implementation of multi-channel multi-interface in NS-2. We take the Cognitive Radio Cognitive Network (CRCN) patch for NS-2 simulator and demonstrate broadcasting over multiple-channels in a multi-interface network setting. In our seeting, node braodcasts the Hello packets to its neighbors. Neighboring nodes receive the Hello packets if and only if they are tuned to the same channel. We demonstrate through example that the tuning of receivers can be done in two fashions.

cs.NI↗
arXiv2010

Decoupling data dissemination from the mobile sink's trajectory in wireless sensor networks: Current Research and Open Issues

In this report, firstly, we presents state of the art survey on Data Management and Data Dissemination techniques with Mobile Sink. Moreover we classify these techniques into two ample sub-categories. Under this classification, we identify, review, compare, and highlight these techniques and their pros and cons. We do a SWOT (Strength, Weaknesses, Opportunities, Threats) analysis of each scheme. We also discuss where each scheme is appropriate. Secondly, we presents a new distributed data management scheme which is based upon Random Walk Based Membership Service to facilitate Data Dissemination in Mobile Sink based Wireless Sensor Networks. Our proposed scheme efficiently deals with the aforementioned problems and we also compare the characteristics of our proposed scheme with the state-of-the-art data-dissemination schemes. We propose using Random Walks (RWs) with uniformly distributed views to disseminate data through the WSN with a controlled overhead. This is performed by the use of a Random Walk Based Membership Service - the RaWMS. Our proposal solves then the problems generated when (a) all nodes are storage motes, being no aggregation performed (b) one center node plays the role of storage mote and aggregates data from all the other nodes (c) replication is performed on all nodes in the network. To the best of our knowledge, we are the first to propose an efficient data dissemination approach (in terms of overhead, adaptiveness and representativeness) to allow a mobile sink to gather a representative view of the monitored region covered by n sensor nodes by only visiting any m nodes, where hopefully m << n.

cs.NI↗
arXiv2010

A Cognitive Radio Based Internet Access Framework for Disaster Response Network Deployment

In this paper, we propose a cognitive radio based Internet access framework for disaster response network deployment in challenged environments. The proposed architectural framework is designed to help the existent but partially damaged networks to restore their connectivity and to connect them to the global Internet. This architectural framework provides the basis to develop algorithms and protocols for the future cognitive radio network deployments in challenged environments.

cs.NI↗
arXiv2010

Toward Reliable Contention-aware Data Dissemination in Multi-hop Cognitive Radio Ad Hoc Networks

This paper introduces a new channel selection strategy for reliable contentionaware data dissemination in multi-hop cognitive radio network. The key challenge here is to select channels providing a good tradeoff between connectivity and contention. In other words, channels with good opportunities for communication due to (1) low primary radio nodes (PRs) activities, and (2) limited contention of cognitive ratio nodes (CRs) acceding that channel, have to be selected. Thus, by dynamically exploring residual resources on channels and by monitoring the number of CRs on a particular channel, SURF allows building a connected network with limited contention where reliable communication can take place. Through simulations, we study the performance of SURF when compared with three other related approaches. Simulation results confirm that our approach is effective in selecting the best channels for efficient and reliable multi-hop data dissemination.

cs.NI↗