Design and investigation of scalable multicast recursive protocols for wired and wireless ad hoc networks

multicast tree member nodes to the header of the control and data packets. However,
these solutions create a new dimension in the scalability problem as the group size can
become too big. As the header size rapidly increase, this will increase the routing
overhead in the network as well as increase the processing time of the packet at each
node.

6.2 Contributions of the thesis

This thesis provides solutions based on the Dynamic Branching Tree (DBT) concepts.
These proposed solutions include:-

• Scalable Recursive Multicast protocol (SReM), this protocol is proposed to
provide a scalable multicast packet delivery over wired network. The cost analysis
and the simulation proved that this protocol decreased the processing cost,
delivery cost, header size, end to end delay and increase the packet delivery ratio.
In conclusion, this protocol provides an efficient scalable multicast data packet
delivery.

• Mobility Scalable Recursive Multicast protocol (MoSReM), this protocol is
proposed to provide a mobility for the end hosts which guarantee an efficient
roaming process.

• Scalable Ad hoc Recursive Multicast protocol (SARM), this proposed protocol
provides an efficient solution for scalability issue in ad hoc environment where all
nodes are in movement. The simulation results show that this protocol improves
the packet delivery ratio, end to end delay and decreases the packet header size.

Through this thesis, the scalability feature of the proposed protocols has been tested and
compared to other representative protocols in the wired and wireless ad hoc networks. It
can be concluded that the new proposed protocols gave an efficient improvement for
scalable multicast data packet delivery for wired and wireless ad hoc networks.

Based on the cost analysis and simulation based for the proposed protocols and
performance evaluation using ns2 simulation environment, the following points can be
concluded

123

<<   134   135   136   137   138   139   140   >>

More intriguing information