Shortest Path Computation in Multicast Network with Multicast Capable and Incapable Delay Associated Nodes
Sonal Yadav1, Sharath Naik2
1Sonal Yadav, M.Tech, Student, Department of Electrical Communication Engineering, Lovely Professional University Phagwara (Punjab), India.
2Sharath Naik, Assistant Professor, Department of Electrical Communication Engineering, Lovely Professional University Phagwara (Punjab), India.
Manuscript received on 13 August 2016 | Revised Manuscript received on 20 August 2016 | Manuscript Published on 30 August 2016 | PP: 109-113 | Volume-5 Issue-6, August 2016 | Retrieval Number: F4688085616/16©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Multicast transmission results in a bandwidth and cost efficient solution for transmission purpose .If we consider the real life scenario then the nodes considered can either be multicast capable nodes or multicast incapable nodes. In this paper, a method is proposed to increase the success rate of finding the minimum cost path within a given network with both multicast incapable and capable nodes. For this, a real life network is considered with 80 nodes complied within it. The nodes considered can either be multicast capable nodes or multicast capable nodes conforming with real life situations .It is shown that if we make use of algorithm proposed in the paper along with delay association and proper bandwidth consideration then success rate of finding the minimum cost path can be increased up to a significant value
Keywords: Multicast Capable Nodes, Multicast Incapable Nodes, Minimum Cost Path
Scope of the Article: WSN