Node clustering algorithm in mobile grid

Author(s):  
Du Li-Juan ◽  
Ju Hong-Jun
2013 ◽  
Vol 17 (4) ◽  
pp. 785-788 ◽  
Author(s):  
Andreas Drakos ◽  
Chris Matrakidis ◽  
Theofanis G. Orphanoudakis ◽  
Alexandros Stavdas

2012 ◽  
Vol 49 ◽  
pp. 140-150 ◽  
Author(s):  
Joana Mencos ◽  
Oscar Gratacós ◽  
Mercè Farré ◽  
Joan Escalante ◽  
Pau Arbués ◽  
...  

2017 ◽  
Vol 28 (01) ◽  
pp. 1750006 ◽  
Author(s):  
Xingyuan Wang ◽  
Xiaomeng Qin

Community detection and analysis have attracted wide public concerns over the recent years. Meanwhile, many related algorithms in complex networks have been proposed. However, most of them concentrate on undirected and unweighted networks. Concerning the significant theoretical value and potential application foreground for directed-weighted networks, in this paper, a novel hierarchical communities detection algorithm (termed as DCBAI) has been proposed on the basis of asymmetric intimacy between nodes. Community structures are effectively detected by node clustering algorithm in directed-weighted network, and a set of optimal communities are generated. In addition, a new and asymmetric parameter is adopted to measure the intimate relationship between nodes. We make some simulation using the proposed algorithm in real-world networks and artificial networks, and the result obtained proves that the parameter can describe the direct and indirect relationships between two nodes. Eventually, comparison with similar algorithms shows that our proposed algorithm has better performance.


Author(s):  
Misbahuddin Misbahuddin ◽  
Anak Agung Putri Ratna ◽  
Riri Fitri Sari

In multi-hop routing, cluster heads close to the base station functionaries as intermediate nodes for father cluster heads to relay the data packet from regular nodes to base station. The cluster heads that act as relays will experience energy depletion quicker that causes hot spot problem. This paper proposes a dynamic multihop routing algorithm named Data Similarity Aware for Dynamic Multi-hop Routing Protocol (DSA-DMRP) to improve the network lifetime, and satisfy the requirement of multi-hop routing protocol for the dynamic node clustering that consider the data similarity of adjacent nodes. The DSA-DMRP uses fuzzy aggregation technique to measure their data similarity degree in order to partition the network into unequal size clusters. In this mechanism, each node can recognize and note its similar neighbor nodes. Next, K-hop Clustering Algorithm (KHOPCA) that is modified by adding a priority factor that considers residual energy and distance to the base station is used to select cluster heads and create the best routes for intra-cluster and inter-cluster transmission. The DSA-DMRP was compared against the KHOPCA to justify the performance. Simulation results show that, the DSA DMRP can improve the network lifetime longer than the KHOPCA and can satisfy the requirement of the dynamic multi-hop routing protocol.


Electronics ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 394 ◽  
Author(s):  
Waleed Ahsan ◽  
Muhammad Fahad Khan ◽  
Farhan Aadil ◽  
Muazzam Maqsood ◽  
Staish Ashraf ◽  
...  

In a vehicular ad-hoc network (VANET), the vehicles are the nodes, and these nodes communicate with each other. On the road, vehicles are continuously in motion, and it causes a dynamic change in the network topology. It is more challenging when there is a higher node density. These conditions create many difficulties for network scalability and optimal route-finding in VANETs. Clustering protocols are being used frequently to solve such type of problems. In this paper, we proposed the grasshoppers’ optimization-based node clustering algorithm for VANETs (GOA) for optimal cluster head selection. The proposed algorithm reduced network overhead in unpredictable node density scenarios. To do so, different experiments were performed for comparative analysis of GOA with other state-of-the-art techniques like dragonfly algorithm, grey wolf optimizer (GWO), and ant colony optimization (ACO). Plentiful parameters, such as the number of clusters, network area, node density, and transmission range, were used in various experiments. The outcome of these results indicated that GOA outperformed existing methodologies. Lastly, the application of GOA in the flying ad-hoc network (FANET) domain was also proposed for next-generation networks.


Electronics ◽  
2020 ◽  
Vol 9 (11) ◽  
pp. 1813
Author(s):  
Jeongeun Kim ◽  
Chanyoung Ju ◽  
Hyoung Il Son

Multi-robot systems (MRSs) are currently being used to perform agricultural tasks. In this regard, the deployment of heterogeneous MRSs will be essential for achieving more efficient and innovative farming in the future. In this paper, we propose a multiplicatively weighted (MW) Voronoi-based task-allocation scheme for heterogeneous agricultural robots. The seed points for area partitioning using a Voronoi diagram are obtained by performing node clustering using a k-means clustering algorithm. Heterogeneous robots have different specifications for performing various tasks. Thus, the proposed MW Voronoi-based area partitioning for heterogeneous robots is applied by considering various weighting factors. The path for each robot is computed such that the robot follows the nodes, and the computed paths serve as inputs for the workload distribution strategy that assigns paths to the robots. Simulations and field experiments were conducted to verify the effectiveness of the proposed approach.


Sign in / Sign up

Export Citation Format

Share Document