Sangman Moh

Prof. Sangman Moh

Department of Computer Engineering, Chosun University, Gwangju, Korea
orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 January 2023 in Drones
Verified
Journal Article
Open access
PDF file
Muhammad Yeasir ArafatMuhammad Yeasir Arafat
Muhammad Yeasir Arafat
MAMuhammad Morshed Alam
Muhammad Morshed Alam
Sangman MohSangman Moh
Sangman Moh
In recent years, unmanned aerial vehicles (UAVs), commonly known as drones, have gained increasing interest in both academia and industries. The evolution of UAV technologies, such as artificial intelligence, component miniaturization, and computer vision, has decreased their cost and increased availability for diverse applications and services. Remarkably, the integration of computer vision with UAVs provides cutting-edge technology for visual navigation, localization, and obstacle avoidance, making them capable of autonomous operations. However, their limited capacity for autonomous navigation makes them unsuitable for global positioning system (GPS)-blind environments. Recently, vision-based approaches that use cheaper and more flexible visual sensors have shown considerable advantages in UAV navigation owing to the rapid development of computer vision. Visual localization and mapping, obstacle avoidance, and path planning are essential components of visual navigation. The goal of this study was to provide a comprehensive review of vision-based UAV navigation techniques. Existing techniques have been categorized and extensively reviewed with regard to their capabilities and characteristics. Then, they are qualitatively compared in terms of various aspects. We have also discussed open issues and research challenges in the design and implementation of vision-based navigation techniques for UAVs.

28 June 2019 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
Muhammad Yeasir ArafatMuhammad Yeasir Arafat
Muhammad Yeasir Arafat
Sangman MohSangman Moh
Sangman Moh
In recent years, unmanned aerial vehicle (UAV) networks have been a focus area of the academic and industrial research community. They have been used in many military and civilian applications. Emergency communication is one of the essential requirements for first responders and victims in the aftermath of natural disasters. In such scenarios, UAVs may configure ad hoc wireless networks to cover a large area. In UAV networks, however, localization and routing are challenging tasks owing to the high mobility, unstable links, dynamic topology, and limited energy of UAVs. Here, we propose swarm-intelligence-based localization and clustering schemes in UAV networks for emergency communications. First, we propose a new three-dimensional (3D) swarm-intelligence-based localization (SIL) algorithm based on particle swarm optimization (PSO) that exploits the particle search space in a limited boundary by using the bounding box method. In the 3D search space, anchor UAV nodes are randomly distributed and the SIL algorithm measures the distance to existing anchor nodes for estimating the location of the target UAV nodes. Convergence time and localization accuracy are improved with lower computational cost. Second, we propose an energy-efficient swarm-intelligence-based clustering (SIC) algorithm based on PSO, in which the particle fitness function is exploited for inter-cluster distance, intra-cluster distance, residual energy, and geographic location. For energy-efficient clustering, cluster heads are selected based on improved particle optimization. The proposed SIC outperforms five typical routing protocols regarding packet delivery ratio, average end-to-end delay, and routing overhead. Moreover, SIC consumes less energy and prolongs network lifetime.

1 February 2022 in Journal of Network and Computer Applications
Verified
Journal Article
Open access
SHS.M. Asiful Huda
S.M. Asiful Huda
Sangman MohSangman Moh
Sangman Moh

25 July 2019 in IEEE Access
Verified
Journal Article
Open access
Muhammad Yeasir ArafatMuhammad Yeasir Arafat
Muhammad Yeasir Arafat
Sangman MohSangman Moh
Sangman Moh
Unmanned aerial vehicles (UAVs) have gained popularity for diverse applications and services in both the military and civilian domains. For cooperation and collaboration among UAVs, they can be wirelessly interconnected in an ad hoc manner, resulting in a UAV network. UAV networks have unique features and characteristics that are different from mobile ad hoc networks and vehicular ad hoc networks. The dynamic behavior of rapid mobility and topology changes in UAV networks makes the design of a routing protocol quite challenging. In this paper, we review the routing protocols for UAV networks, in which topology-based, position-based, hierarchical, deterministic, stochastic, and social-network-based routing protocols are extensively surveyed. The routing protocols are then compared qualitatively in terms of their major features, characteristics, and performance. Open issues and research challenges are also discussed in the perspective of design and implementation.

16 June 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
Muhammad Yeasir ArafatMuhammad Yeasir Arafat
Muhammad Yeasir Arafat
Sangman MohSangman Moh
Sangman Moh
Flying ad hoc networks (FANETs) have emanated over the last few years for numerous civil and military applications. Owing to underlying attributes, such as a dynamic topology, node mobility in 3-D space, and the limited energy of unmanned aerial vehicles (UAVs), a routing protocol for FANETs is challenging to design. Exiting topology-based routing is unsuitable for highly dynamic FANETs. Location-based routing protocols can be preferred for FANETs owing to their scalability, but are based on one-hop neighbor information and do not contemplate the reachability of further appropriate nodes for forwarding. Owing to the rapid mobility of UAVs, the topology frequently changes; thus, some route entries in the routing table can become invalid and the next-hop nodes may be unavailable before a timeout. That is, the routing decision based on one-hop neighbors cannot assure a successful delivery. In this study, we propose a novel $Q$ -learning-based topology-aware routing (QTAR) protocol for FANETs to provide reliable combinations between the source and destination. The proposed QTAR improves the routing decision by considering two-hop neighbor nodes, extending the local view of the network topology. With the ${Q}$ -learning technique, QTAR adaptively adjusts the routing decision according to the network condition. Our simulation results reveal that QTAR outstrips the existing routing protocols in respect of various performance metrics under distinct scenarios.

7 December 2018 in IEEE Access
Verified
Journal Article
Open access
Muhammad Yeasir ArafatMuhammad Yeasir Arafat
Muhammad Yeasir Arafat
Sangman MohSangman Moh
Sangman Moh
In recent years, unmanned aerial vehicles (UAVs) have gained popularity for various applications and services in both military and civilian domains. Multiple UAVs can carry out complex tasks efficiently when they are organized as an ad hoc network, where wireless communication is essential for cooperation and collaboration between UAVs and the ground station. Due to rapid mobility and highly dynamic topology, designing a routing protocol for UAV networks is a challenging task. As the number of UAVs increases, a hierarchical routing called clustering is necessarily required to provide scalability because clustering schemes ensure the basic level of system performance such as throughput, end-to-end delay, and energy efficiency. For approximately a half-decade, several survey articles have been reported on topology-based routing and position-based routing for UAV networks. To the best of the authors’ knowledge, however, there is no survey on cluster-based routing in the literature. In this paper, clusterbased routing protocols for UAV networks are extensively surveyed and qualitatively compared in terms of outstanding features, characteristics, competitive advantages, and limitations. Furthermore, open research issues and challenges on cluster-based routing are discussed.