Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access

We examine threshold-based transmission strategies for distributed opportunistic medium access in a scenario with fairly general probabilistic interference conditions. Specifically, collisions between concurrent transmissions are governed by arbitrary probabilities, allowing for a form of channel capture and covering binary interference constraints as an important special case. We address the problem of setting the threshold values so as to optimize the aggregate throughput utility of the various users, and particularly focus on a weighted logarithmic throughput utility function (Proportional Fairness). We provide an adaptive algorithm for finding the optimal threshold values in a distributed fashion, and rigorously establish the convergence of the proposed algorithm under mild statistical assumptions. Moreover, we discuss how the algorithm may be adapted to achieve packet-level stability with only limited exchange of queue length information among the various users. We also conduct extensive numerical experiments to corroborate the theoretical convergence results.14 page(s

Analysis of Black Hole Attack in MANET Based on Simulation through NS3.26

This research paper presentsanalysis of Black hole attacks in Mobile Adhoc network (MANET) routing protocol Ad Hoc On-Demand Distance Vector (AODV). Weuse 25 nodes in wireless sensor network with no attack, one attack, three attacks and five numbers of attacks nodes treated with reactive routing protocol AODV. A Simulations have been conducted in ns-3.26, which is the latest version of ns3 network simulator on Ubuntu 16.04.2 LTS version platform. The performance resultsare analyzed based on Throughput, Packet loss and Delay time with same simulation time for different numbers of malicious nodes in black hole attacks on MANET?s

Distributed adaptive algorithms for optimal opportunistic medium access

We examine threshold-based transmission strategies for distributed opportunistic medium access, and specifically address the problem of setting the threshold values so as to optimize the aggregate throughput utility of the various users. In the case of weighted logarithmic throughput utility (Proportional Fairness) we provide an adaptive algorithm for finding the optimal threshold values in a distributed fashion. Moreover, we discuss how the algorithm may be adapted to achieve packet-level stability with only limited exchange of queue length information among the various users. We also present numerical results to demonstrate the convergence of the proposed adaptive algorithm