International Journal of Engineering and Technology

Multicast provides an effective group communication mechanism in IP layer to reduce the redundant packets transmission compared with the unicast. The knapsack problem is a problem in combinatorial optimization when we have given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. This paper discusses 0-1 Knapsack approach to use by NEMO’s multicast agent (MA) to ensure the forwarding data to their destinations in combinational optimize selection manner, and acceptable throughput.