A DISTRIBUTED CSMA ALGORITHM

FOR THROUGHPUT AND UTILITY

MAXIMIZATION IN WIRELESS
NETWORKS

TEAM MEMBERS
S.VICKY DANIEL (07H51A05B4)
P.RATALA RAJU (08H55A0508)
S.MAHESH BABU (08H55A0505)
S.PRASAD (07H51A0588)

PROJECT GUIDE:
Mr.SIVA SKANDA
(Asst.Prof)
 OBJECTIVE
 The main objective is DCSMA uses
interference model to achieve the data
flow.

 To combine the proposed scheduling

algorithm with congestion control using a
novel technique to achieve fairness as
well as maximal throughput.
 INTRODUCTION

In multi-hop wireless networks

 Designing distributed Scheduling algorithms to achieve
the maximal throughput.

 Traditional maximal-weight scheduling (MWS), is

difficult to implement in distributed networks.
A distributed greedy protocol similar to IEEE
802.11 does not guarantee the maximal
throughput.

So we introduce a distributed carrier sense

multiple access (DCSMA) scheduling algorithm
that can achieve the maximal throughput
distributively .
The major advantages of the algorithm are

Simple

Distributed

Asynchronous.
EXISTING SYSTEM
In older days they used two types of
algorithm.

 MAC layer algorithm

 LQF algorithm
 MAC layer algorithm
 The MAC layer is responsible for moving
data packets to and from one Network
Interface Card (NIC) to another across a
shared channel.
 MAC-layer scheduling is the bottleneck of
the problem.
 In particular, it is not easy to achieve the
maximal throughput.
 Scheduling is challenging since the
conflicting relationships between different
links can be complicated.
LQF Algorithm
 The algorithm is related to Maximal
Scheduling.
 By using a distributed greedy protocol
similar to IEEE 802.11, can be achieved the
throughput .
 Algorithm is related to Maximal Scheduling.
 Different from Maximal Scheduling, the
Longest-Queue-First (LQF) algorithm takes
into account the queue lengths of the
nonempty queues. It shows good
throughput performance in simulations.
 PROPOSED SYSTEM
 To introduce a distributed carrier sense
multiple access (DCSMA) algorithm for a
general interference model.

 DCSMA, applied to more general resource

sharing problems.

 Collisions are ignored.

 Achieve maximal throughput.

 ADVANTAGES
 Each node only uses its local information
(e.g., its backlog).

 Easy to implement, based on CSMA

random access.

 Time is not divided into synchronous slots.

 SYSTEM REQUIREMENTS
Hardware requirements:

 Processor above : Any Processor

500 MHz.
 Ram : 128Mb.
 Hard Disk : 10 Gb.
 Compact Disk : 650 Mb.
Software requirements:

Operating System : Windows XP Prof

Coding Language : DOT NET

REFERENCES
 L.Jiang and J.Warland “A DISTRIBUTED
CSMA ALGORITHM FOR THROUGHPUT
AND UTILITY MAXIMIZATION IN
WIRELESS NETWORKS” in Proc 46th Annu.
 J. W. Lee, M. Chiang. Utility-optimal and
random access control, IEEE Trans,
Wireless commun, Vol 6.