State about CSMA/CA, Computer Engineering

Assignment Help:

State about CSMA/CA

It belongs to a class of protocols known as multiple access methods. CSMA/CA  stands  for:  Carrier  Sense  Multiple  Access  with  Collision Avoidance.  In  CSMA,  a  station  willing to  transmit  has  to  first  listen  to  channel for a predetermined amount of time so as to check for any activity on channel.  If  channel  is  sensed  "idle"  then  station  is  permitted  to transmit.  If  channel  is  sensed  as  "busy"  station  has  to  defer  its transmission.  This  is  essence  of  both  CSMA/CD  and  CSMA/CA.  In CSMA/CA  (Local  Talk),  once  channel  is  clear,  a  station  transmits a  signal telling all other stations not to transmit, and then sends its packet. In Ethernet 802.3, station continues to wait for a time, and checks to see if channelis still free. If it is free, station transmits, and waits for an acknowledgment signal that packet was received.

 

 


Related Discussions:- State about CSMA/CA

Define alphabet and string, Define Alphabet and String? A finite set of...

Define Alphabet and String? A finite set of symbols is termed as alphabet. An alphabet is frequently signified by sigma, yet can be specified any name. B = {0, 1} here B is

Structure of internet servers address, Structure of Internet Servers Addres...

Structure of Internet Servers Address Structure of an Internet server's address keyed into a client's software is as below: http://www.expertsmind.com Where: htt

Write the html code to webpage to insert scrollable lists, Write the HTML c...

Write the HTML code to accomplish the web page to insert scrollable lists that will always display four entries of the list. The HTML code to accomplish the web page is given b

What are compilers and interpreters, What are compilers and interpreters? ...

What are compilers and interpreters? Compiler and Interpreter: These are two types of language translators. A compiler changes the source program (user-written program) int

State and prove demorgan's second theorem, State and prove Demorgan's secon...

State and prove Demorgan's second theorem   Proof: Demorgan's second theorem   = A‾ + B‾ The two sides of the equation here   = A‾ + B‾ is represented through the logic d

Explain the working of a weighted register d/a converter, With the help of ...

With the help of a neat diagram, explain the working of a weighted-resistor D/A converter. Ans Weighted Register D/A Converter:   Digital input that has 4 bits

What is linear bounded automation, What is linear bounded automation?  ...

What is linear bounded automation?   A linear bounded automation is restricted type of Turing machine where in the tape head isn't permitted to move off the portion of the tape

State the selective clear - logic micro operations, State the SELECTIVE CLE...

State the SELECTIVE CLEAR - logic micro operations The selective-clear operation clears to 0 bits in register A only  where there are corresponding 1's in the register B. For

Microprocessor 8086, i want to know complete detail of 8086 microprocessor ...

i want to know complete detail of 8086 microprocessor such as memory segment ,interface with ram rom ect

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd