National Conference on Advancement in Electronics & Telecommunication Engineering |
Foundation of Computer Science USA |
NCAETE - Number 4 |
May 2012 |
Authors: Mijahed Nasser Aljober, R. C. Thool, Atul Negi |
5665dff4-a2b2-4514-9eac-e803d97bb2f0 |
Mijahed Nasser Aljober, R. C. Thool, Atul Negi . A Sufficient and Scalable Multicast Routing Protocol in Wireless Mesh Networks MeshSPT (Shortest Path Tree algorithm for wireless Mesh network). National Conference on Advancement in Electronics & Telecommunication Engineering. NCAETE, 4 (May 2012), 8-14.
The accelerated progress in wireless technologies and the increasing growth of the Internet, wireless networks, especially Wireless Mesh Networks (WMNs) are going through an important evolution . In a WMN, designing efficient and scalable multicast protocol still a major task for researchers. In this work, we propose a protocol named MESHSPT (Shortest Path Tree algorithm for wireless Mesh network) for efficient and scalable multicast routing inside the mesh backbone of a WMN. The MESHSPT protocol builds source-based trees based on the network topology. It prevents flooding and employs an effective mechanism to prevent the implosion and exposure problems when a tree is constructed and when nodes join and leave. Our simulation results show that the MESHSPT protocol outperforms existing protocols such as ODMRP (On-Demand Multicast Routing Protocol), MNT (Minimum Number of Transmissions) in terms of throughput, and end-to-end delay.