SLGP Header

Optimized Clustering Mechanism for Qos Aware Route Discovery in Manet

IJCSEC Front Page
Author(s):
V.Kalaiyarasi, M.Tamilarasi
Volume
4, Issue 2
Pages:
1372-1377
Year of Publication:
April,2016
International Journal of Computer Science and Engineering Communications
ISSN:
2347-8586
Citation: V.Kalaiyarasi, M.Tamilarasi."Optimized Clustering Mechanism for Qos Aware Route Discovery in Manet" International Journal of Computer Science and Engineering Communications,Vol.4,Issue.2.(2016):1372-1377.
Full Text Download

Abstract
Cooperative communication, which utilizes nearby terminals to relay the overhearing information to achieve the diversity gains, has a great potential to improve the transmitting efficiency in wireless networks. With high-power nodes, MANETs can improve network scalability through load balanced technique, dynamic channel selection, and broadcasting robustness. However, the delay and throughput of power heterogeneous MANETs can be severely impacted by high-power nodes. To deal with the complicated routing access interactions induced by relaying and leverage the benefits of such cooperation, an efficient Cooperative Optimized Clustering Routing Protocol (COCRP) is needed. To reduce the interference raised by high-power nodes, routing protocol COCRP is developed to avoid packet forwarding via high-power nodes. The COCRP is composed of two parts: first one is additional coverage ratio, which is the ratio of the number of nodes that should be covered by a single broadcast Cluster Head to the total number of neighbours; and second one is connectivity factor, which reflects the relationship of network connectivity and the number of neighbours of a given node. This approach combines the advantages of the neighbour coverage knowledge and the probabilistic mechanism, which can significantly decrease the number of retransmissions so as to improve the delay and throughput, and can also improve the routing performance.
Keywords:Dynamic Channel Allocation,COCRP,Cluster Head,performance. Quality of Service,Load Balancing,

References:

  1. Bora Karaoglu and Wendi Heinzelman,”Cooperative Load Balancing and Dynamic Channel Allocation for Cluster-based Mobile Ad-Hoc Networks,” IEEE Trans. Mobile Computing., vol. 14,pp. 951-963, May.2015.
  2. A. Ephremides, and T. Truong, “Scheduling broadcasts in multi- hop radio networks,” IEEE Trans. Commun., vol.38,no. 4, pp. 456–460, Apr. 1990.
  3. A. Sen and M. Huson, “A new model for scheduling packet radio networks,” in Proc.15th Annu. Joint Conf. IEEE Comput. Soc. Netw. Next Generation, vol. 3, Mar. 1996.
  4. Fanyang and Qiazhang “Impact of power and rate selection on the throughput of Ad Hoc networks” in Proc.IEEE 26th Conf. Comput. Commun., vol. 9, pp. 1442–1450, Jul. 2006.
  5. I. Katzela, and M. Naghshineh, “Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey,” IEEE Pers. Commun.,vol. 3, no. 3, pp. 10–31, Jun. 1996.
  6. Jiewu and Fai Dai, “Virtual backbone construction in manets using adjustable transmission ranges over mobile ad hoc networks,” IEEE Trans. Mobile Comput.,vol. 15,pp. 1188–1200, Sep. 2006.
  7. J. Jiang, T.-H. Lai, and N. Soundarajan, “On distributed dynamic channel allocation in mobile cellular networks,” IEEE Trans. Parallel Distrib. Syst., vol. 13, no. 10, pp.1024–1037, Oct. 2002.
  8. J. So and N. H. Vaidya, “Multi-channel MAC for ad hoc networks: Handling multi-channel hidden terminals using a single transceiver,” in Proc. 5th ACM Int. Symp.Mobile Ad Hoc Netw. Comput., pp. 222–233, 2004.
  9. Marija Antic and Aleksandra Smiljanic, “Cost Reduction of Reliable Networks Using load Balanced Routing,” IEEE Communications letters., vol. 14,pp. 263-265, Mar. 2010.
  10. Mark Felegyhazi, Mario Cagalj, and Jean-Pierre Hubaux,“Non-cooperative Multi-Radio Channel Allocation in Wireless Networks,” IEEE INFOCOM, 2007.