Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/accelerating-the-kamada-kawai-algorithm-for-boundary-detection-in-a-znUHo7yi1v
References (31)
-
S. Fekete, M. Kaufmann, A. Kröller, K. Zweig (2005)
A New Approach for Boundary Recognition in Geometric Sensor NetworksArXiv, abs/cs/0508006
-
Marwan Fayed, Hussein Mouftah (2009)
Localised alpha-shape computations for boundary recognition in sensor networksAd Hoc Networks, 7
-
A. Efrat, D. Forrester, A. Iyer, S. Kobourov, C. Erten (2006)
Force-directed approaches to sensor localization -
H. Edelsbrunner, D. Kirkpatrick, R. Seidel (1983)
On the shape of a set of points in the plane -
Qing Fang, Jie Gao, L. Guibas (2004)
Locating and bypassing routing holes in sensor networksIEEE INFOCOM 2004, 4
-
Chaomei Chen (2006)
Information Visualization: Beyond the Horizon -
Wenping Liu, Hongbo Jiang, X. Bai, Guang Tan, Chonggang Wang, Wenyu Liu, Kechao Cai (2012)
Skeleton Extraction from Incomplete Boundaries in Sensor Networks Based on Distance Transform2012 IEEE 32nd International Conference on Distributed Computing Systems
-
Yen-Hsu Chen, W. Chung, Guo-Kai Ni, Hongke Zhang, S. Kuo (2012)
Optimal self boundary recognition with two-hop information for ad hoc networks2012 IEEE Wireless Communications and Networking Conference (WCNC)
-
Marwan Fayed, Hussein Mouftah (2009)
Localised convex hulls to identify boundary nodes in sensor networksInt. J. Sens. Networks, 5
-
Mo Li, Yunhao Liu (2007)
Rendered Path: Range-Free Localization in Anisotropic Sensor Networks With HolesIEEE/ACM Transactions on Networking, 18
-
M. Li, Y. Liu (2010)
Rendered path: Range-free localization in anisotropic sensor networks with holesIEEE/ACM Trans. Networking, 18
-
Tomihisa Kamada, S. Kawai (1989)
An Algorithm for Drawing General Undirected GraphsInf. Process. Lett., 31
-
A. Rafiei, M. Abolhasan, D. Franklin, F. Safaei (2011)
Boundary node selection algorithms in WSNs2011 IEEE 36th Conference on Local Computer Networks
-
O. Saukh, R. Sauter, M. Gauger, P. J. Marrón (2010)
On boundary recognition without location information in wireless sensor networksACM Trans. Sensor Netw., 6
-
W. Nooy, Andrej Mrvar, V. Batagelj (2018)
Exploratory Social Network Analysis with Pajek: Revised and Expanded Edition for Updated Software -
Thomas Fruchterman, E. Reingold (1991)
Graph drawing by force‐directed placementSoftware: Practice and Experience, 21
-
O. Saukh, R. Sauter, M. Gauger, P. Marrón, K. Rothermel (2008)
On Boundary Recognition without Location Information in Wireless Sensor Networks2008 International Conference on Information Processing in Sensor Networks (ipsn 2008)
-
S. Fekete, A. Kröller, D. Pfisterer, S. Fischer, Carsten Buschmann (2004)
Neighborhood-Based Topology Recognition in Sensor NetworksArXiv, cs.DS/0405058
-
Q. Fang, J. Gao, L. J. Guibas (2004)
Locating and bypassing routing holes in sensor networksProceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004). IEEE
-
Shrawan Kumar, D. Lobiyal (2013)
Power efficient range-free localization algorithm for wireless sensor networksWireless Networks, 20
-
D. Harel, Y. Koren (2000)
A fast multi-scale method for drawing large graphs -
D. Schieferdecker (2014)
An Algorithmic View on Sensor Networks - Surveillance, Localization, and Communication -
W. D. Nooy, A. Mrvar, V. Batagelj (2005)
Exploratory Social Network Analysis with PajekCambridge University Press.
-
P. Gajer, M. Goodrich, S. Kobourov (2000)
A multi-dimensional approach to force-directed layouts of large graphs -
P. Sahoo, Kun-Ying Hsieh, J. Sheu (2007)
Boundary Node Selection and Target Detection in Wireless Sensor Network2007 IFIP International Conference on Wireless and Optical Communications Networks
-
Ron Davidson, D. Harel (1996)
Drawing graphs nicely using simulated annealingACM Trans. Graph., 15
-
Dezun Dong, Yunhao Liu, Xiangke Liao (2009)
Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods -
A. Dekkers, E. Aarts (1991)
Global optimization and simulated annealingMathematical Programming, 50
-
Yue Wang, Jie Gao, Joseph Mitchell (2006)
Boundary recognition in sensor networks by topological methods -
Se-Hang Cheong, Kai-Ip Lee, Yain-Whar Si, Leong U (2011)
Lifeline: Emergency Ad Hoc Network2011 Seventh International Conference on Computational Intelligence and Security
-
P. Eades (1984)
A Heuristic for Graph Drawing, 42
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2016 ACM
- ISSN
- 1550-4859
- eISSN
- 1550-4867
- DOI
- 10.1145/3005718
- Publisher site
- See Article on Publisher Site
Abstract
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 classical Kamada-Kawai algorithm does not scale well when it is used in networks with large numbers of nodes. It also produces poor results in non-convex networks. To address these problems, this article proposes an improved version of the Kamada-Kawai algorithm. The proposed extension includes novel heuristics and algorithms that achieve a faster energy level reduction. Our experimental results show that the improved algorithm can significantly shorten the processing time and detect boundary nodes with an acceptable level of accuracy.
Journal
ACM Transactions on Sensor Networks (TOSN) – Association for Computing Machinery
Published: Dec 19, 2016
Keywords: Kamada-kawai