13,918 Hits in 8.8 sec

Distributed clustering algorithms in group-based ad hoc networks

R. Massin, C. J. Le Martret, P. Ciblat
2015 2015 23rd European Signal Processing Conference (EUSIPCO)  
Index Terms-Ad hoc network, distributed clustering, operational group.  ...  For dense ad hoc networks, clustering is an appropriate strategy for improving scalability.  ...  The contribution of the paper is to adapt the powerful distributed clustering algorithms GDMAC and VOTE to the context of group-based ad hoc networks.  ... 
doi:10.1109/eusipco.2015.7362538 dblp:conf/eusipco/MassinMC15 fatcat:puj2uo4t25gtvar2pegdajvlzm

Research on MAC Protocols in Cluster-Based Ad Hoc Networks

Yutao Liu, Yue Li, Yimeng Zhao, Chunhui Zhang, Xin Liu
2021 Wireless Communications and Mobile Computing  
Mobile ad hoc networks can be widely used in many scenes, for example, military communication, emergency communication, and 5G wide area coverage as well as ultradense network scenes.  ...  In view of multiservice simultaneous transmission demand for small-scale dense networking scene and large-scale extended networking scene, a MAC protocol based on scheduling of cluster head is proposed  ...  In this paper, MAC protocols in cluster-based ad hoc networks are researched for small-scale dense networking scene and large-scale extended coverage networking scene.  ... 
doi:10.1155/2021/5513469 fatcat:ryhqe35uxbbfjgv7lha7uglcqq

Improving Performance of Mobile Ad Hoc Network Using Clustering Schemes

Mohamed Er-Rouidi, Houda Moudni, Hassan Faouzi, Hicham Mouncif, Abdelkrim Merbouha
2017 International Journal of Informatics and Communication Technology (IJ-ICT)  
Mobile ad hoc network become nowadays more and more used in different domains, due to its flexibility and low cost of deployment.  ...  In this paper, we study some schemes of clustering such as Dominating-Set-based clustering, Energy-efficient clustering, Low-maintenance clustering, Load-balancing clustering, and Combined-metrics based  ...  Dominating-Set-Based Clustering The majority clustering techniques in mobile ad hoc networks are based on dominating sets. Distributed algorithms are designed in order to find small dominating sets.  ... 
doi:10.11591/ijict.v6i2.pp69-75 fatcat:to5clcpzqrbwbpnzjbo3hxlkta

Empirical Study of Clustering Algorithms for Wireless Ad Hoc Networks

C. Tselikis, S. Mitropoulos, C. Douligeris, E. Ladis, K. Georgouleas, C. Vangelatos, N. Komninos
2009 2009 16th International Conference on Systems, Signals and Image Processing  
of the ad hoc nodes.  ...  In this study we evaluate with experiments three generic clustering algorithms, namely the Lowest-ID, the Highest Degree and the Extended Robust Re-clustering Algorithm which is the one proposed.  ...  version of the RRA [1] for the wireless mobile ad hoc network.  ... 
doi:10.1109/iwssip.2009.5367771 fatcat:bt2l2ucfmzdunkvuafm5by7aki

A Probabilistic Algorithm for MANET Clustering

Fahimeh Dabaghi-Zarandi, Behrouz Minaei-Bidgoli, Zohreh Davarzani
2014 International Journal of Future Generation Communication and Networking  
Mobile ad hoc network (MANET) is a type of ad hoc network that MANET nodes can change their locations and configure by themselves on the fly.  ...  A large network is divided into several sub networks applying clustering method. When the topology of the network is dynamic and ad hoc, the process of clustering is very complicated.  ...  Conclusion In this paper, we propose a probabilistic and heuristic algorithm for clustering nodes in the mobile ad hoc network.  ... 
doi:10.14257/ijfgcn.2014.7.6.07 fatcat:oqrckhsb7bbntbvc4rbydpmqwa

Ant Based Adaptive Multicast Routing Protocol (AAMRP) for Mobile Ad Hoc Networks [article]

A. Sabari, K. Duraiswamy,
2009 arXiv   pre-print
Since mobile ad hoc networks are highly dynamic in nature, either of the above two strategies can be adopted at different scenarios.  ...  By reducing the number of group members that participate in the construction of the multicast structure and by providing robustness to mobility by performing broadcasts in densely clustered local regions  ...  Multicast Core Extraction Distributed Ad-Hoc Routing (MCEDAR) [20] .  ... 
arXiv:0912.0984v1 fatcat:hguaie5b2vdt3byluhv2njbsrq

Consistent Re-Clustering in Mobile Ad Hoc Networks

C. Tselikis, C. Douligeris, S. Mitropoulos, N. Komninos
2008 2008 International Wireless Communications and Mobile Computing Conference  
We recommend that for a secure MANET the design of re-clustering algorithms should not only provide for clustering stability, but also for network robustness in terms of network connectivity, of message  ...  In this paper we revisit some considerations relative to the performance of re-clustering algorithms in MANET.  ...  In the grouped ad hoc deployment in order to skew the degree distribution and generate a more concentrated initial ad hoc configuration the node degrees followed the Heavy Tail Pareto distribution.  ... 
doi:10.1109/iwcmc.2008.142 fatcat:gbuggzpgjbcu7nommm4k5hqnfu

Topology Control Using Efficient Power Management

2011 Journal of Computer Science  
Problem statement: Effective Topology control will improve the performance and the capacity of Mobile Ad-hoc networks by building reliable network structure.  ...  In this study, initially the cluster-head is selected based on the factors power level, stability and connectivity.  ...  In the ad-hoc networks, the election of the cluster-head in the cluster reduces the topology maintenance factor.  ... 
doi:10.3844/jcssp.2011.561.567 fatcat:i4tqasii7rdebgejbcvccin6o4

Degree-Based Clustering Algorithms for Wireless Ad Hoc Networks Under Attack

C. Tselikis, S. Mitropoulos, N. Komninos, C. Douligeris
2012 IEEE Communications Letters  
In this paper we investigate the behavior of degreebased clustering algorithms with respect to their stability and attack-resistance.  ...  In addition, we extend our proposal with a cooperative consistent clustering algorithm which integrates security into the clustering decision achieving attacker identification and classification.  ...  (P) to simulate groupe-dense scenarios, e.g., military ad hoc applications in which the nodes with higher connectivity are more important.  ... 
doi:10.1109/lcomm.2012.031912.112484 fatcat:mwxf2ftavzc4dj6joon2sfjole

A Clustering-based Group Key Agreement Protocol for Ad-Hoc Networks

Maarit Hietalahti
2008 Electronical Notes in Theoretical Computer Science  
Clustering has brought scalability to ad hoc networks in many ways, now we look at its benefits to group key agreement.  ...  In this paper, several solutions for authenticated key establishment in clustered ad hoc networks are surveyed and a new efficient solution for clustered group key establishment is presented.  ...  Related Group Key Establishment Schemes for Clustered Ad Hoc Networks A generic model for key establishment in clustered ad hoc networks works along these lines: First, nodes form clusters with some clustering  ... 
doi:10.1016/j.entcs.2008.05.005 fatcat:fxtce24ib5dszcztb5rrngwmxu

Clustering Wireless Sensor and Wireless Ad Hoc Networks using Dominating Tree Concepts

Ishwar Baidari, H. B. Walikar, Shridevi Shinde
2012 International Journal of Computer Applications  
In mobile ad hoc networks the moment of the network nodes may quickly change the topology resulting in the increase of the overhead message in topology maintenance, the clustering schemes for mobile ad  ...  The most important criterion for achieving the maximum performance in wirless sensor and ad-hoc networks is to clustering the nodes.  ...  With an ad hoc clustering network, the nodes are separated into groups called clusters. In each cluster, one node is elected as a CH to act as a local controller.  ... 
doi:10.5120/9396-3345 fatcat:zxwkyk25gbdg3k3czhsvyrjf7q

Enhancenig OLSR routing protocol using K-means clustering in MANETs

Y. Hamzaoui, M. Amnai, A. Choukri, Y. Fakhri
2020 International Journal of Electrical and Computer Engineering (IJECE)  
We propose an algorithm of clustering based in the new mobility metric and K-Means method to distribute the nodes into several clusters; it is implemented to standard OLSR protocol giving birth a new protocol  ...  Most of them are based on traditional method of routing, which doesn't guarantee basic levels of Qos, when the network becomes larger, denser and dynamic.  ...  DESCRIPTION OF APPROCH CLUSTERING ALGORITHM In the absence of any assumption about the distribution of nodes in a mobile ad hoc network, an unsupervised classification of nodes into classes is required  ... 
doi:10.11591/ijece.v10i4.pp3715-3724 fatcat:gbu42q3m4vg3rp262wtohf3qbe

Distributed tracking in wireless ad hoc sensor networks

Chee-Yee Chong, Feng Zhao, S. Mori, S. Kumar
2003 Sixth International Conference of Information Fusion, 2003. Proceedings of the  
We target tracking, distributed tracking hope to demonstrate that high performance tracking algorithms can be implemented in such ad hoc sensor network.  ...  data instead of sensor data. wireless ad hoc sensor networks.  ...  Because of the low cost, many of these sensors can be 3.1 Model deployed rapidly in an ad hoc manner to form a dense network in the area of interest.  ... 
doi:10.1109/icif.2003.177479 fatcat:bgnpejxsurcxpplxjfcblzlwla

On Scalability and Mobility Management of Hierarchical Large-Scale Ad Hoc Networks [chapter]

Ming-Hui Tsai, Tzu-Chiang Chiang, Yueh-Min Huang
2005 Lecture Notes in Computer Science  
Moreover, we describe a protocol to establish the virtual broadcast domains by using the IPv6 addressing concept in ad hoc networks and perform IP-based network communications in a multi-switch backbone  ...  With the increased interest in the mobile wireless communication, the development of large-scale ad hoc networks has drawn a lot of attention and the scalability of ad hoc networks has been the subject  ...  Algorithm (LCC) [24] , (4) Distributed Clustering Algorithm (DCA) [25] , and (5) Weighted Clustering Algorithm (WCA), [26] .  ... 
doi:10.1007/11596042_74 fatcat:gsh6bznx6vab5as6eznmjuzag4

Ad Hoc and Neighborhood Search Methods for Placement of Mesh Routers in Wireless Mesh Networks

Fatos Xhafa, Christian Sanchez, Leonard Barolli
2009 2009 29th IEEE International Conference on Distributed Computing Systems Workshops  
Given a deployment area where to distribute the mesh router nodes and a number of fixed clients a priori distributed in the given area, ad hoc methods explore different topologies such as placement in  ...  In this work we evaluate ad hoc and neighborhood search methods for placement of mesh routers in WMNs.  ...  In the second, we evaluated the quality of ad hoc methods as initializing methods of genetic based algorithms.  ... 
doi:10.1109/icdcsw.2009.37 dblp:conf/icdcsw/XhafaSB09 fatcat:4vasb676evdnvioqbry7uajdgq
« Previous Showing results 1 — 15 out of 13,918 results