Random access:-It is also called contention method.In this method, stations compete for the medium. If two stations transmit data at the same time, then a collision
results—both stations then must determine when to retransmit data.
In this no station is superior to another station and
none is assigned the control over another.No station permits, or does not permit,another station to send. a station that has data to send uses a procedure
defined by the protocol to make a decision on whether or not to send.
If two station transmit data at the some time ,then a collision results,both station then must somehow determine when to transmit data,this decision depends on the state of the medium(idle or busy).
In this scheme, each stations must:-
•- Determine when to access the medium.
• -Determine what to do if the medium is busy.
• -Have some way of determining whether transmission succeeded or not.
•- Have some way of dealing with collisions (access conflicts with other stations).
results—both stations then must determine when to retransmit data.
In this no station is superior to another station and
none is assigned the control over another.No station permits, or does not permit,another station to send. a station that has data to send uses a procedure
defined by the protocol to make a decision on whether or not to send.
If two station transmit data at the some time ,then a collision results,both station then must somehow determine when to transmit data,this decision depends on the state of the medium(idle or busy).
In this scheme, each stations must:-
•- Determine when to access the medium.
• -Determine what to do if the medium is busy.
• -Have some way of determining whether transmission succeeded or not.
•- Have some way of dealing with collisions (access conflicts with other stations).
No comments:
Post a Comment