Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9550
Title: PERFORMANCE STUDY OF LAMS & TYPE - I LAMS - DLC PROTOCOLS
Authors: Rao, Sanjay Kumar Madhava
Keywords: ELECTRONICS AND COMPUTER ENGINEERING;LAMS;LAMS - DLC PROTOCOLS;LOW EARTH ORBIT ENVIRONMENT
Issue Date: 1997
Abstract: The conventional go-back-N ARQ is inadequate for error control on satellite channels due to the large round trip delay and high bit rate. The throughput efficiency of the system drops rapidly as the channel error rate increases. Even HDLC-SREJ is also not suitable for satellite channels due to its waiting time at the end of window for RR signal from receiver. A new Data link layer protocol, LAMS-DLC, suited to the low earth orbit (LEO) environment offering service class known as reliable datagram was proposed by Christopher ward et al. This protocol provides zero-loss, zero-duplicate packet transmission with a minimum delay by relaxing reliability constraint, in-sequence delivery. This dissertation deals with simulation studies to compare it's performance characteristics with the existing HDLC-SREJ protocol. A new data link control protocol named Type-I LAMS which performs very well even in a degraded channel is also suggested. This was accomplished by combining the existing forward error correction (FEC) schemes with the LAMS-DLC protocol. FEC schemes use error-correcting codes for combating transmission errors. The merits and demerits of the two protocols were highlighted by the study. Results show that LAMS-DLC performs well at low bit error rates, and Type-I LAMS performs well at high bit error rates, but looses throughput efficiency in low bit error region.
URI: http://hdl.handle.net/123456789/9550
Other Identifiers: M.Tech
Research Supervisor/ Guide: Sarje, A. K.
metadata.dc.type: M.Tech Dessertation
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD247445.pdf4.23 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.