1 citations · 4 across the 11 of their papers we have counts for
11 papers
Detecting Coverage Holes in Wireless Sensor Networks Using Connected Component Labeling and Force-Directed Algorithms
Jiacheng Xu, Xiongfei Zhao, Hou-Wan Long +2
Contour detection in Wireless Sensor Networks (WSNs) is crucial for tasks like energy saving and network optimization, especially in security and surveillance applications. Coverag…
Force-directed algorithms for schematic drawings and placement: A survey
Se-Hang Cheong, Yain-Whar Si
Force-directed algorithms have been developed over the last 50 years and used in many application fields, including information visualisation, biological network visualisation, sen…
Coverage hole detection in WSN with force-directed algorithm and transfer learning
Yue-Hui Lai, Se-Hang Cheong, Hui Zhang +1
Coverage hole detection is an important research problem in wireless sensor network research community. However, distributed approaches proposed in recent years for coverage hole d…
CWBound: boundary node detection algorithm for complex non-convex mobile ad hoc networks
Se-Hang Cheong, Yain-Whar Si
Efficient message forwarding in mobile ad hoc network in disaster scenarios is challenging because location information on the boundary and interior nodes is often unavailable. Inf…
Online force-directed algorithms for visualization of dynamic graphs
Se-Hang Cheong, Yain-Whar Si
Force-directed (FD) algorithms can be used to explore relationships in social networks, visualize money markets, and analyze transaction networks. However, FD algorithms are mainly…
An image classification approach for hole detection in wireless sensor networks
Se-Hang Cheong, Kim-Hou Ng, Yain-Whar Si
Hole detection is a crucial task for monitoring the status of wireless sensor networks (WSN) which often consist of low-capability sensors. Holes can form in WSNs due to the proble…
Snapshot Visualization of Complex Graphs with Force-Directed Algorithms
Se-Hang Cheong, Yain-Whar Si
Force-directed algorithms are widely used for visualizing graphs. However, these algorithms are computationally expensive in producing good quality layouts for complex graphs. The…
Saving lives: design and implementation of lifeline emergency ad hoc network
Se-Hang Cheong, Yain-Whar Si, Leong-Hou U
This paper aims to propose a system for automatically forming ad hoc networks using mobile phones and battery-powered wireless routers for emergency situations. The system also pro…
Boundary Node Detection and Unfolding of Complex Non-Convex Ad Hoc Networks
Se-Hang Cheong, Yain-Whar Si
Complex non-convex ad hoc networks (CNCAH) contain intersecting polygons and edges. In many instances, the layouts of these networks are not entirely convex in shape. In this artic…
Lifeline: Emergency Ad Hoc Network
Se-Hang Cheong, Kai-Ip Lee, Yain-Whar Si +1
Lifeline is a group of systems designed for mobile phones and battery powered wireless routers for forming emergency Ad hoc networks. Devices installed with Lifeline program can au…
Accelerating the Kamada-Kawai algorithm for boundary detection in a mobile ad hoc network
Se-Hang Cheong, Yain-Whar Si
Force-directed algorithms such as the Kamada-Kawai algorithm have shown promising results for solving the boundary detection problem in a mobile ad hoc network. However, the classi…