Congestions Control Through Cloud Computing With MANET: Mr. Ajey Singh, Dr. Maneesh Shrivastava
Congestions Control Through Cloud Computing With MANET: Mr. Ajey Singh, Dr. Maneesh Shrivastava
Abstract
Adhoc network is collection of temporary nodes that
are capable of dynamic forming temporary network,
self-organize, and infrastructure less with nodes
contains routing capability. As cloud computing
services rapidly expand their customer base, it has
become important to share cloud resources, so as to
provide them economically. In cloud computing
services, multiple types of resources, such as
processing ability, bandwidth and storage, need to
be allocated simultaneously. If there is a surge of
requests, a competition will arise between these
requests for the use of cloud resources. This leads to
the disruption of the service and it is necessary to
consider a measure to avoid or relieve congestion of
cloud computing environments. This dissertation
proposes a new congestion control method for cloud
computing environments which reduces the size of
packet drop rate for congested resource type instead
of restricting all service requests as in the existing
networks. We apply Queue based technique and
differentiate between the queue based technique
with cloud queue based technique .Here we use NS2.31 simulator for simulation of MANET and take
comparative analysis between cloud and wireless
network mechanism.
Keywords
Mobile adhoc network, Cloud Computing, QBT
1. Introduction
161
International Journal of Advanced Computer Research (ISSN (print): 2249-7277 ISSN (online): 2277-7970)
Volume 2 Number 2 June 2012
International Journal of Advanced Computer Research (ISSN (print): 2249-7277 ISSN (online): 2277-7970)
Volume 2 Number 2 June 2012
C=1/3x (packetsize)/(packetsize+RTSsize+CTSsize
Channel::contention(Packet* p, Handler* h)
//Contention Definition
{
Step 1: Scheduler& s = Scheduler::instance();
//Create Instance variable s
Step2:
double now = s.clock();
// through S we get System Time
Step3:
if (now > cwstop)
// Check Congestion Window
{
//If True
cwstop = now + delay;
+ACKsize)xChannelCapacity
Which is about 0.425Mbps for a Channel Capacity of
2Mbps, and 1500,40,39,47 packet sizes for data
packet, RTS,CTS and ACK packets respectively. In
case that interference range is up to 2 hops away, the
capacity is even worst. In such a case in a 7 node
chain node 3 experiences interference from 5 other
nodes, while node 1 from only 3 nodes. This means
that node 1 has better service rate than node 3 and can
inject more traffic to the network that node 3 can
handle. In such a case congestion occurs.
numtx = 0;
// initialize number of Tx =0
}
numtx++;
// Increase no. of Tx Value
Step4:
}
International Journal of Advanced Computer Research (ISSN (print): 2249-7277 ISSN (online): 2277-7970)
Volume 2 Number 2 June 2012
Step3:
Step5:
5. Result
We get Simulator Parameter like Number of nodes,
Dimension, Routing protocol, traffic etc. According
to below table 5.1 we simulate our network.
Table 5.1 Simulation parameter
Step8:
if (drop) {
//If Drop Than return True
return 1;
}
}
Step9:
pkt = p;
//p pass
to pkt value
trace ? trace->recv(p, 0) : recv(p,
0);
return 0;
}
Number of nodes
Dimension
of
simulated area
Routing Protocol
Simulation time
(seconds)
Mac
Layer
property
30
800600
AODV
25
802.11
,
TDMA,CSMA/CA
3. Simulation Environment
The simulator we have used to simulate the ad-hoc
routing protocols in is the Network Simulator 2 (ns)
from Berkeley. To simulate the mobile wireless radio
environment we have used a mobility extension to ns
that is developed by the CMU Monarch project at
Carnegie Mellon University.
4. Network Simulator
Network simulator 2 is the result of an on-going
effort of research and development that is
administrated by researchers at Berkeley. It is a
discrete event simulator targeted at networking
164
International Journal of Advanced Computer Research (ISSN (print): 2249-7277 ISSN (online): 2277-7970)
Volume 2 Number 2 June 2012
5.3 Result2
5.1 Nam visualization
The simulation described in this project was tested
using the ns-2 test-bed that allows users to create
dynamic topologies. By changing the logical
topology of the network, ns-2 users can conduct tests
in an ad hoc network without having to physically
move the nodes.
In our simulation we use thirty mobile nodes with
random deployment and random motion of each
node, here we create three TCP senders and two UDP
sender nodes with 10 connection, in this figure blue
circle shows radio range of the particular node. If
routing packet broadcast via the sender node firstly
check the neighbour node belongs to radio range or
not if neighbour node is in radio range so our routing
packet send to neighbour else not. After the routing
discovery process actual FTP data transmit through
shortest path
5.4 Result3
5.5 Result5
By using cloud with queue management technique
we find that packet drop rate is reduced.
5.2 Result1
165
International Journal of Advanced Computer Research (ISSN (print): 2249-7277 ISSN (online): 2277-7970)
Volume 2 Number 2 June 2012
Number of packet
Comparision test
SEND RECV
Before
Update
ROUT
PDF NRL
INGP
KTS
Updated
11604 8737 5926 75.29 0.68
Cloud
5.6 Result6
Table 5.2 Overall Summaries
Overall Summary
Parameter
SEND
RECV
ROUTINGPKTS
PDF
NRL
=
=
=
=
=
Before
Update
6938
5131
4862
73.96
0.95
Updated
Cloud
11604
8737
5926
75.29
0.68
References
[1] W. B. Zhu, X. M. Zhang, and N. N. Li, Improve TCP
performance with link-aware warning method in mobile ad
hoc networks, in Proc. IEEE WICOM, 2008, pp. 14.
[2] J. Li, C. Blake, D. D. Couto, H. Lee, and R. Morris,
Capacity of ad hoc wireless networks, in Proc. ACM
MobiCom, Jul. 2001, pp. 6169.
[3] Bianchi,G. Dipt. di Ingegneria Elettrica, Palermo Univ,
Performance analysis of the IEEE 802.11 distributed
coordination function, IEEE Journal ,2000.
[4] W. Ye, J. Heidemann, and D. Estrin, An EnergyEfficient MAC Protocol for Wireless Sensor Networks in
Proceedings of IEEE INFOCOM02, June 2002.
166