alexa Performance of Cellular Multicast using the Mobile Ad-
ISSN ONLINE(2278-8875) PRINT (2320-3765)

International Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering
Open Access

OMICS International organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific Societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

Open Access Journals gaining more Readers and Citations

700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ Readers

This Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)

Research Article

Performance of Cellular Multicast using the Mobile Ad- hoc Networks

D. B. Jagannadha Rao1, Durgadevi Sathi2
  1. Associate Professor, Department of C A, Sreenidhi Institute of Science and Technology, Hyderabad, India
  2. Assistant Professor, Department of I T, Sreenidhi Institute of Science and Technology, Hyderabad, India
Related article at Pubmed, Scholar Google


To overcome the limitations of cellular networks, cellular networks integrated with the ad hoc networks. The basic idea is to allow the cellular receivers experiencing poor channel conditions to use the ad hoc network to connect to those cellular receivers that are experiencing good cellular channel conditions. Base station manages multiple groups, whereas hybrid networks can be used when ad hoc networks cannot accommodate all the groups and base station has to select a subset of groups to maximizing bandwidth savings and utilization of the ad hoc networks. We proposed the group selection problem is formulated as a multidimensional knapsack problem, and an integer linear programming (ILP) formulation and a polynomial- time dynamic algorithms. Simulation studies demonstrate that the dynamic algorithm is able to achieve very good performance under various conditions than the ILP approach. ILP always gives optimal solutions, but it becomes time consuming for large groups and high capacities. The dynamic algorithm wins by distinguishing between good and bad groups using the utility function. It selects groups which consume less bandwidth or larger groups to optimize the objective function. We have to implement the distributed dynamic algorithm in real systems and checking the feasibility and performance of this approach.


Share This Page

Additional Info

Loading Please wait..
Peer Reviewed Journals
Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals
International Conferences 2017-18
Meet Inspiring Speakers and Experts at our 3000+ Global Annual Meetings

Contact Us

© 2008-2017 OMICS International - Open Access Publisher. Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version