{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:38:47Z","timestamp":1781109527018,"version":"3.54.1"},"reference-count":11,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"abstract":"<jats:p>A flat structure in MANETs based on proactive or reactive routing schemes face scalability problems with increase in both mobility and network size. Clustering offers hierarchical organization of mobile nodes by forming disjoint groups (clusters). So clustering techniques solve the scalability issue in large MANETs but, requires extra message exchange among mobile nodes for maintenance of cluster structure. Due to mobility in MANETs stability of cluster structure is greatly affected as such it often leads to Ripple effect of reclustering. In this paper, the authors present clustering algorithm that eliminates the requirement of frozen period and minimizes reclustering of entire network by locally repairing cluster structure that gets affected due to moment of head node. They have reduced the number of messages exchanged in their proposed work by including different range of transmission for each node and overall stability of entire structure is enhanced.<\/jats:p>","DOI":"10.4018\/ijrsda.2017100107","type":"journal-article","created":{"date-parts":[[2017,7,14]],"date-time":"2017-07-14T14:13:06Z","timestamp":1500041586000},"page":"101-114","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Clustering in MANETs with Minimum Communication and Reclustering Overhead"],"prefix":"10.4018","volume":"4","author":[{"given":"Mohd Yaseen","family":"Mir","sequence":"first","affiliation":[{"name":"Department of CSE and IT, Veer Surendra Sai University of Technology, Burla, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0519-3863","authenticated-orcid":true,"given":"Satyabrata","family":"Das","sequence":"additional","affiliation":[{"name":"Department of CSE and IT, Veer Surendra Sai University of Technology, Burla, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJRSDA.2017100107-0","doi-asserted-by":"crossref","unstructured":"Belding-Royer, E. M. (2002). Hierarchical routing in ad hoc mobile networks. Wirel. Commun. Mobile Comput., 2(5), 11-21.","DOI":"10.1002\/wcm.74"},{"key":"IJRSDA.2017100107-1","doi-asserted-by":"crossref","unstructured":"Chatterjee, M., Das, S.K., & Turgut, D. (2002). WCA: a weighted clustering algorithm for mobile Ad Hoc networks. Cluster Computing, 5(2), 193-204.","DOI":"10.1023\/A:1013941929408"},{"key":"IJRSDA.2017100107-2","doi-asserted-by":"crossref","unstructured":"Gupta, P., & Kumar, P.R. (2000). The capacity of wireless networks. IEEE Trans. Info.","DOI":"10.1109\/18.825799"},{"key":"IJRSDA.2017100107-3","unstructured":"Hong, X.Y., Xu, K.X., & Gerla, M. (2002). Scalable routing protocols for mobile ad hoc networks. IEEE Netw. Marg."},{"key":"IJRSDA.2017100107-4","doi-asserted-by":"crossref","unstructured":"Konstantopoulos, C., Gavalas, D., & Pantziou, G. (2008). Clustering in mobile ad hoc networks through neighborhood stability-based mobility prediction. In Computer Networks (pp. 1797-1824).","DOI":"10.1016\/j.comnet.2008.01.018"},{"key":"IJRSDA.2017100107-5","doi-asserted-by":"crossref","unstructured":"Neethub, V.V. & Sing, A.K. (2015). Mobility Aware Loose clustering algorithm for mobile Ad Hoc networks. Procedia computer science, 54, 57-64.","DOI":"10.1016\/j.procs.2015.06.007"},{"key":"IJRSDA.2017100107-6","doi-asserted-by":"crossref","unstructured":"Wang, C., Yu, Y., & Xu, Y. (2009, September 24-26). Multi-hop Cluster Based Routing Protocol for MANET 2009. Proceedings of the 5th International Conference on Wireless Communications, Networking and Mobile Computing, Beijing, IEEE.","DOI":"10.1109\/WICOM.2009.5301764"},{"key":"IJRSDA.2017100107-7","doi-asserted-by":"crossref","unstructured":"Wang, Y., Chen, C., Yang, X., & Zhang, D. (2007, October 17-19). WACHM: Weight Based Adaptive Clustering for Large Scale Heterogeneous MANET. Proceedings of the International Symposium on Communications and Information Technologies ISCIT '07, Sydney, Australia (pp. 936-941). IEEE.","DOI":"10.1109\/ISCIT.2007.4392150"},{"key":"IJRSDA.2017100107-8","first-page":"1201","article-title":"An ad network with mobile backbones","volume":"19","author":"K.X.Xu","year":"2001","journal-title":"Proc. IEEE ICC \u201802"},{"key":"IJRSDA.2017100107-9","doi-asserted-by":"crossref","unstructured":"Yu, J.Y. (2006, December 15). An efficient clustering scheme for large and dense mobile ad hoc networks (MANETs). Elsevier Computer Communications, 30(1), 5\u201316.","DOI":"10.1016\/j.comcom.2006.07.014"},{"key":"IJRSDA.2017100107-10","doi-asserted-by":"crossref","unstructured":"Yu, J., & Chong, P. (2005, March). A survey of Clustering Scheme for Mobile ad hoc Networks. IEEE Communication Surveys, 7(1), 32-48.","DOI":"10.1109\/COMST.2005.1423333"}],"container-title":["International Journal of Rough Sets and Data Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=186861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T17:53:15Z","timestamp":1750614795000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJRSDA.2017100107"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":11,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.4018\/ijrsda.2017100107","relation":{},"ISSN":["2334-4598","2334-4601"],"issn-type":[{"value":"2334-4598","type":"print"},{"value":"2334-4601","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10]]}}}