Please use this identifier to cite or link to this item: http://nopr.niscair.res.in/handle/123456789/29640
Title: Performance analysis of new multiple access protocols using genetic algorithm
Authors: Gunavathi, K
Shanmugam, A
Issue Date: Oct-1998
Publisher: NISCAIR-CSIR, India
Abstract: Genetic Algorithms are robust search and optimization methods that have emerged to be effective for real-world problems. Most of the technical fields involve some form of optimization that is required in the process of design. As, design is an open ended problem with many solutions, the quest is to find out the best solution according to some criterion. During the last decade from 1986 to 1996, the extent of change in local area networking has been phenomenal. There is a need for a high-speed network that will extend beyond the area covered by a LAN, but not restricted to normal methods of wide area networking. In this paper, four new and effective multiple access protocols for bus LANs have been proposed. Two of the protocols are proposed for single channel shared systems and two other protocols are proposed for multi channel shared systems. The multichannel protocols are of DAMA kind and are of new proposals of its kind. The protocols are modelled as optimization problems and are analyzed for their best and worst performances through Genetic Algorithms. The protocols ensure high throughput and reduced bounded packet delay compared to the known multiple access protocols of the bus network. The fairness, collision-free transmission, distributed control along with the high throughput, bounded and reduced packet delay makes the protocols to be the best alternatives for the existing collision prone protocols of the bus networks.
Page(s): 255-266
URI: http://hdl.handle.net/123456789/29640
ISSN: 0975-1017 (Online); 0971-4588 (Print)
Appears in Collections:IJEMS Vol.05(5) [October 1998]

Files in This Item:
File Description SizeFormat 
IJEMS 5(5) 255-266.pdf2.61 MBAdobe PDFView/Open


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