CFP last date
20 May 2024
Reseach Article

A Framework for Load Sharing in Clustered Ad Hoc Networks

by Ratish Agarwal, Mahesh Motwani, Roopam Gupta
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 78 - Number 8
Year of Publication: 2013
Authors: Ratish Agarwal, Mahesh Motwani, Roopam Gupta
10.5120/13512-1284

Ratish Agarwal, Mahesh Motwani, Roopam Gupta . A Framework for Load Sharing in Clustered Ad Hoc Networks. International Journal of Computer Applications. 78, 8 ( September 2013), 31-37. DOI=10.5120/13512-1284

@article{ 10.5120/13512-1284,
author = { Ratish Agarwal, Mahesh Motwani, Roopam Gupta },
title = { A Framework for Load Sharing in Clustered Ad Hoc Networks },
journal = { International Journal of Computer Applications },
issue_date = { September 2013 },
volume = { 78 },
number = { 8 },
month = { September },
year = { 2013 },
issn = { 0975-8887 },
pages = { 31-37 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume78/number8/13512-1284/ },
doi = { 10.5120/13512-1284 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:51:05.944331+05:30
%A Ratish Agarwal
%A Mahesh Motwani
%A Roopam Gupta
%T A Framework for Load Sharing in Clustered Ad Hoc Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 78
%N 8
%P 31-37
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In ad hoc networks, Clustering provides a hierarchical structure in which certain nodes are assigned the extra task (such as routing) of the network. Ordinary nodes do not participate in the routing instead they rely on coordinators of the clusters (clusterheads) for packet delivery. If a suitable tap is not applied on the number of nodes that join a clusterhead as its members, formation of bottleneck can takes place at the overloaded clusterheads. The performance of the network may get affected due to the bottleneck. This paper proposes a cluster formation algorithm in which, if the number of members of a clusterhead exceeds the predefined threshold value, a procedure of cluster division is executed. This relieves the clusterheads from the burden of excessive members. Simulation study of the proposed algorithm justifies the facts by observing an improvement in the performance in terms of E2E delay, PDF and throughput.

References
  1. M. Gerla and J. T. Tsai, "Multiuser, Mobile, Multimedia RadioNetwork" Wireless Networks, 1995, vol. 1, pp. 255–65.
  2. A. D. Amis, R. Prakash, T. H. P Vuong, D. T. Huynh. "Max-Min D-Cluster Formation in Wireless Ad Hoc Networks" In proceedings of IEEE Conference on Computer Communications (INFOCOM) 2000, Vol. 1. pp. 32-41.
  3. G. Chen, F. Nocetti, J. Gonzalez, and I. Stojmenovic, "Connectivity based k-hop clustering in wireless networks" proceedings of the 35th Annual Hawaii International Conference on System Sciences, 2002, Vol. 7, pp. 188. 3.
  4. F. Li, S. Zhang, X. Wang, X. Xue, H. Shen, "Vote- Based Clustering Algorithm in Mobile Ad Hoc Networks", In proceedings of International Conference on Networking Technologies, 2004.
  5. T. Ohta, S. Inoue, and Y. Kakuda, "An Adaptive Multihop Clustering Scheme for Highly Mobile Ad Hoc Networks," in proceedings of 6th ISADS, 2003.
  6. I. Er and W. Seah. "Mobility-based d-hop clustering algorithm for mobile ad hoc networks" IEEE Wireless Communications and Networking Conference, 2004, Vol. 4, pp. 2359-2364.
  7. P. Basu, N. Khan, and T. D. C. Little, "A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks" in proceedings of IEEE ICDCSW' 2001, pp. 413–18.
  8. A. B. MaDonald and T. F. Znati, "A Mobility-based Frame Work for Adaptive Clustering in Wireless Ad Hoc Networks" IEEE JSAC, 1999, vol. 17, pp. 1466–87.
  9. C. -C. Chiang, "Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel" in proceedings of IEEE SICON'1997.
  10. C. R. Lin and M. Gerla, "Adaptive Clustering for Mobile Wireless Networks" IEEE JSAC, vol. 15, pp. 1265–75.
  11. J. Y. Yu and P. H. J. Chong, "3hBAC (3-hop between Adjacent Clusterheads): a Novel Non-overlapping Clustering Algorithm for Mobile Ad Hoc Networks" in proceedings of IEEE Pacrim'2003, vol. 1, pp. 318–21.
  12. T. J. Kwon et al. , "Efficient Flooding with Passive Clustering an Overhead-Free Selective Forward Mechanism for Ad Hoc/Sensor Networks" in proceedings of IEEE, 2003, vol. 91, no. 8, pp. 1210–20.
  13. A. D. Amis and R. Prakash, "Load-Balancing Clusters in Wireless Ad Hoc Networks" in proceedings of 3rd IEEE ASSET'2000, pp. 25–32.
  14. J. Wu et al. , "On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks" J. Commun. and Networks, 2002, vol. 4, no. 1, pp. 59–70.
  15. J. -H. Ryu, S. Song, and D. -H. Cho, "New Clustering Schemes for Energy Conservation in Two-Tiered Mobile Ad-Hoc Networks," in proceedings of IEEE ICC'2001, vo1. 3, pp. 862–66.
  16. M. Chatterjee, S. Das, and D. Turgut. WCA: A weighted clustering algorithm for mobile ad hoc networks, Cluster computing Journal, 2002, vol. 5(2), pp. 193–204.
  17. Yu-Xuan Wang, Forrest Sheng Bao, "An Entropy-Based Weighted Clustering Algorithm and Its Optimization for Ad Hoc Networks" Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, 2007.
  18. S. K. Dhurandher and G. V. Singh" Weight-based adaptive clustering in wireless ad hoc networks" IEEE, 2005.
  19. F. D. Tolba, D. Magoni and P. Lorenz " Connectivity, energy & mobility driven Weighted clustering algorithm " in proceedings of IEEE GLOBECOM, 2007.
  20. Ivan Stojmenovic and Jie Wu, 'Broadcasting and Activity Scheduling in Ad Hoc Networks", in Mobile Ad hoc networking, S. Basagni, M. Conti, S. Giordano, I. Stojmenovic (Editors), IEEE Press and John Wiley and Sons, Inc. , New York, 2003.
Index Terms

Computer Science
Information Sciences

Keywords

Mobile ad hoc network clustering clusterhead load energy