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 SKANDHA
(Asst.Prof)
OBJECTIVE

Achieving optimal throughput and

maximum channel utilization to
competing data flows in Multi-hop
wireless network using DCSMA
(Distributed Carrier Sense Multiple
Access) algorithm.
 INTRODUCTION

In multi-hop wireless networks

 Distributed Scheduling algorithm does not
guarantee the maximal throughput and is
difficult to implement.

 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 .
Features of the algorithm are

Simple

Distributed

Asynchronous.
EXISTING SYSTEM
Existing algorithms…

 MAC layer algorithms

 LQF algorithm
 MAC layer algorithms
 The MAC layer is responsible for moving
data packets to and from one Network
Interface Card (NIC) to another across a
shared channel
 Not easy to achieve the maximal
throughput due to bottleneck problem.
 Scheduling is challenging since the
conflicting relationships between different
links can be complicated.
LQF Algorithm
 This algorithm is related to Maximal Weight
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.
 By using a distributed greedy protocol
similar to IEEE 802.11, throughput can be
achieved.
 PROPOSED SYSTEM: DCSMA
 A distributed algorithm for maximal
throughput
 Based on CSMA/CA, simple and
asynchronous
 Uses only local information: Queue length
 General interference model
 Joint scheduling and rate control
 Optimal utility
 PROPOSED SYSTEM
 A distributed carrier sense multiple access
(DCSMA) algorithm
 Uses general interference model to achieve
the data flow.
 Applied to more general resource sharing
problems.
 When Collisions are ignored it achieves
maximal throughput.
 ADVANTAGES
 Each node uses only 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 : Any Processor above 500

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

Operating System : Windows XP

Framework : Dot net
framework 2.0

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.