DSpace@nitr >
National Institue of Technology- Rourkela >
Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/1226

Full metadata record

DC FieldValueLanguage
contributor.authorAmirineni, K K-
contributor.authorChinara, S-
contributor.authorRath, S K-
date.accessioned2010-04-19T07:43:54Z-
date.available2010-04-19T07:43:54Z-
date.issued2010-
identifier.citationProceedings of the 4th National Conference; INDIACom-2010 , Computing For Nation Development, February 25 – 26, 2010, Bharati Vidyapeeth’s Institute of Computer Applications and Management, New Delhien
identifier.urihttp://hdl.handle.net/2080/1226-
description.abstractValidation of protocols is essential to ensure that the protocol is unambiguous, complete and functionally correct. One approach to ensure the correctness of an existing protocol is to create a formal model for the protocol, and analyze the model to determine if indeed the protocol provides the defined services correctly. Due to the dynamic nature, concurrency and different levels of abstraction associated with the Mobile Ad-Hoc Network (MANET) protocols, it is difficult to design a model for MANET protocols with existing techniques like UML and other modeling languages. Colored Petri Nets (CPN) is a suitable modeling language for this purpose. This is a promising tool for describing and studying information processing systems that are characterized as being concurrent, asynchronous, distributed, parallel, nondeterministic and stochastic. As a graphical tool, CPNs can be used as a visual-communication aid similar to flow charts, block diagrams and networks. In addition, tokens are used in these nets to simulate the dynamic and concurrent activities of the system. This paper considers a weighted clustering algorithm (WCA) for MANETs which takes into consideration the ideal degree, transmission power, mobility and battery power of a mobile node. In MANET a node can move in and out and thus the MANETs topology (graph) dynamically changes. This paper considers a Topology Approximation (TA) mechanism to address this problem of mobility and perform simulations of typical protocol called On-Demand WCA. Our simulation reports validate the correctness of both TA mechanism in terms of dynamically changing topology of MANETs and WCA in terms of number of cluster heads and dominant set updates.en
format.extent503949 bytes-
format.mimetypeapplication/pdf-
language.isoen-
subjectColored Petri net (CPN),en
subjectMobile ad hoc network (MANET),en
subjectWeighted clustering algorithm (WCA),en
subjectValidationen
titleValidation of Clustering Algorithm for Mobile Ad-Hoc Networks Using Colored Petri Netsen
typeArticleen
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
Full_Paper.pdf492KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.

 

Powered by DSpace Feedback