Eliiyi, Deniz TürselArslan, HilalAkram, Vahid KhalilpourUğurlu, Onur2022-02-152022-02-152020978-1-7281-7206-42165-0608https://hdl.handle.net/20.500.14034/230https://doi.org/10.1109/SIU49456.2020.930224828th Signal Processing and Communications Applications Conference (SIU) -- OCT 05-07, 2020 -- ELECTR NETWORKA wireless multi-hop network is a collection of nodes that communicate by message passing over multiple links. Sending a message to a remote node can consume some energy from all intermediary nodes. In a network, the nodes with minimum distance to all other nodes are called Jordan central nodes. Selecting the central nodes as sink or base station can considerably reduce the overall energy consumption and increase the network life time. This paper proposes a new parallel algorithm to find all central nodes of a network by finding BFS trees of a subset of nodes. The roots of the trees with smallest height are selected as Jordan central nodes. After finding each tree the algorithm eliminates some nodes from the search space. Available processors construct the BFS tree for different nodes in parallel and eliminate a group of unvisited nodes after creating each tree. The implementation results of the algorithm using different number of processors on topologies with up to 250 nodes showed that the proposed algorithm can find all central nodes by examining less than 20% of nodes in less than 0.034 seconds.trinfo:eu-repo/semantics/closedAccessWireless Multi-hop NetworkNetwork CentralityBreadth First SearchParallel ComputingConference ObjectN/AWOS:0006531361002222-s2.0-85100303957N/A