|
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
|
| Title: | Validation of Clustering Algorithm for Mobile Ad-Hoc Networks Using Colored Petri Nets |
| Authors: | Amirineni, K K
Chinara, S
Rath, S K |
| Keywords: | Colored Petri net (CPN),
Mobile ad hoc network (MANET),
Weighted clustering algorithm (WCA),
Validation |
| Issue Date: | 2010 |
| Citation: | Proceedings 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 Delhi |
| Abstract: | Validation 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... |
| URI: | http://hdl.handle.net/2080/1226 |
| Appears in Collections: | Conference Papers
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| Full_Paper.pdf | | 492Kb | Adobe PDF | View/Open |
|
Show full item record
All items in DSpace are protected by copyright, with all rights reserved.
|
