research-article

Accelerating the Kamada-Kawai Algorithm for Boundary Detection in a Mobile Ad Hoc Network

Authors:

Se-Hang Cheong,

Yain-Whar SiAuthors Info & Claims

ACM Transactions on Sensor Networks (TOSN), Volume 13, Issue 1

Article No.: 3, Pages 1 - 29

https://doi.org/10.1145/3005718

Published: 19 December 2016 Publication History

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.

References

[1]

C. Chen. 2006. Information Visualization Beyond the Horizon. Springer.

Digital Library

[2]

Y. H. Chen, W. H. Chung, G. K. Ni, H. Zhang, and S. Y. Kuo. 2012. Optimal self boundary recognition with two-hop information for ad hoc networks. In Proceedings of the Wireless Communications and Networking Conference (WCNC). IEEE, 1910--1914.

[3]

S. H. Cheong, K. I. Lee, Y. W. Si, and L. H. U. 2011. Lifeline: Emergency ad hoc network. In Proceedings of the 2011 7th International Conference on Computational Intelligence and Security (CIS). IEEE, 283--289.

Digital Library

[4]

R. Davidson and D. Harel. 1996. Drawing graphs nicely using simulated annealing. ACM Trans. Graph. 15, 4 (1996), 301--331.

Digital Library

[5]

D. Dong, Y. Liu, and X. Liao. 2009. Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods. In Proceedings of the 10th ACM International Symposium on Mobile ad Hoc Networking and Computing. ACM, 135--144.

Digital Library

[6]

P. Eades. 1984. A heuristic for graph drawing. Congressus Numerantium 42 (1984), 149--160.

[7]

H. Edelsbrunner, D. G. Kirkpatrick, and R. Seidel. 1983. On the shape of a set of points in the plane. IEEE Trans. Inf. Theory. 29, 4 (1983), 551--559.

Digital Library

[8]

A. Efrat, D. Forrester, A. Iyer, S. G. Kobourov, C. Erten, and O. Kilic. 2010. Force-directed approaches to sensor localization. ACM Trans. Sensor Netw. 7, 3 (2010), 27.

Digital Library

[9]

Q. Fang, J. Gao, and L. J. Guibas. 2004. Locating and bypassing routing holes in sensor networks. In Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004). IEEE, 2458--2468.

[10]

M. Fayed and H. T. Mouftah. 2009a. Localised alpha-shape computations for boundary recognition in sensor networks. Ad Hoc Netw. 7, 6 (2009a), 1259--1269.

Digital Library

[11]

M. Fayed and H. T. Mouftah. 2009b. Localised convex hulls to identify boundary nodes in sensor networks. Int. J. Sensor Netw. 5, 2 (2009b), 112--125.

Digital Library

[12]

S. P. Fekete, M. Kaufmann, A. Kröller, and K. Lehmann. 2005. A new approach for boundary recognition in geometric sensor networks. In Proceedings of the 17th Canadian Conference on Computational Geometry, 82--85.

[13]

S. P. Fekete, A. Kröller, D. Pfisterer, S. Fischer, and C. Buschmann. 2004. Neighborhood-based topology recognition in sensor networks. In Proceedings of the International Workshop on Algorithmic Aspects of Wireless Sensor Networks 3121 (2004), 123--136.

[14]

T. M. J. Fruchterman and E. M. Reingold. 1991. Graph drawing by force-directed placement. Softw.: Pract. Exper. 21, 11 (1991), 1129--1164.

Digital Library

[15]

P. Gajer, M. T. Goodrich, and S. G. Kobourov. 2004. A multi-dimensional approach to force-directed layouts of large graphs. Computat. Geom. 29, 1 (2004), 3--18.

Digital Library

[16]

D. Harel and Y. Koren. 2001. A fast multi-scale method for drawing large graphs. J. Graph Algor. Appl. 6, 3 (2001), 179--202.

[17]

T. Kamada and S. Kawai. 1989. An algorithm for drawing general undirected graphs. Inf. Proc. Lett. 31, 1 (1989), 7--15.

Digital Library

[18]

S. Kumar and D. K. Lobiyal. 2014. Power efficient range-free localization algorithm for wireless sensor networks. Wireless Netw. 20, 4 (2014), 681--694.

[19]

M. Li and Y. Liu. 2010. Rendered path: Range-free localization in anisotropic sensor networks with holes. IEEE/ACM Trans. Networking 18, 1 (2010), 320--332.

Digital Library

[20]

W. Liu, H. Jiang, X. Bai, G. Tan, C. Wang, W. Liuand, and K. Cai. 2012. Skeleton extraction from incomplete boundaries in sensor networks based on distance transform. In Proceedings of the 32nd IEEE International Conference on Distributed Computing Systems. IEEE, 42--51.

Digital Library

[21]

W. D. Nooy, A. Mrvar, and V. Batagelj. 2005. Exploratory Social Network Analysis with Pajek. Cambridge University Press.

Digital Library

[22]

A. Rafiei, M. Abolhasan, D. Franklin, and F. Safaei. 2011. Boundary node selection algorithms in WSNs. In Proceedings of the 2011 IEEE 36th Conference on Local Computer Networks (LCN). IEEE, 251--254.

Digital Library

[23]

P. K. Sahoo, K. Y. Hsieh, and J. P. Sheu. 2007. Boundary node selection and target detection in wireless sensor network. In Proceedings of the IFIP International Conference on Wireless and Optical Communications Networks, 2007 (WOCN’07). IEEE, 1--5.

[24]

O. Saukh, R. Sauter, M. Gauger, and P. J. Marrón. 2010. On boundary recognition without location information in wireless sensor networks. ACM Trans. Sensor Netw. 6, 3 (2010), 20.

Digital Library

[25]

D. Schieferdecker. 2014. An Algorithmic View on Sensor Networks: Surveillance, Localization, and Communication. Epubli GmbH, Berlin, Germany.

[26]

Y. Wang, J. Gao, and J. S. B. Mitchell. 2006. Boundary recognition in sensor networks by topological methods. In Proceedings of the 12th Annual International Conference on Mobile Computing and Networking, 122--133

Digital Library

Cited By

Wang ZDeng YDong YKurths JWu J(2025)Spatial network disintegration based on ranking aggregationInformation Processing & Management10.1016/j.ipm.2024.10395562:1(103955)Online publication date: Jan-2025
https://doi.org/10.1016/j.ipm.2024.103955
Song AWaters K(2023)A Tale of Two Cities: How Arlington Won and Baltimore Lost in Battle for Amazon’s HQ2The Entrepreneurial Ecosystem10.1007/978-3-031-25931-9_9(277-297)Online publication date: 1-Jun-2023
https://doi.org/10.1007/978-3-031-25931-9_9
Gryzun LShcherbakov OParfonov YBodnar L(2022)Visualization of algorithms on graphs with a large number of vertices: The features of applications designDevelopment management10.57111/devt.20(4).2022.36-4420:4Online publication date: 20-Dec-2022
https://doi.org/10.57111/devt.20(4).2022.36-44
Show More Cited By

Index Terms

Accelerating the Kamada-Kawai Algorithm for Boundary Detection in a Mobile Ad Hoc Network
1. Networks
  1. Network types
    1. Ad hoc networks

Recommendations

Boundary Node Detection and Unfolding of Complex Non-Convex Ad Hoc Networks

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 article, we propose a Kamada-Kawai-based algorithm called W-KK-MS for boundary ...
CWBound: boundary node detection algorithm for complex non-convex mobile ad hoc networks
Abstract
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. Information related to boundary nodes can be used to design efficient ...
CWBound: boundary node detection algorithm for complex non-convex mobile ad hoc networks

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. Information related to boundary nodes can be used to design efficient ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Sensor Networks

ACM Transactions on Sensor Networks Volume 13, Issue 1

February 2017

242 pages

ISSN:1550-4859

EISSN:1550-4867

DOI:10.1145/3027492

Editor:
Chenyang Lu
Department of Computer Science and Engineering / School of Engineering and Applied Sciences / Washington University / 1 Brookings Drive / St. Louis, MO 63130

Issue’s Table of Contents

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 19 December 2016

Accepted: 01 October 2016

Revised: 01 May 2016

Received: 01 August 2015

Published in TOSN Volume 13, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Research Committee of University of Macau

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
197
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)2

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wang ZDeng YDong YKurths JWu J(2025)Spatial network disintegration based on ranking aggregationInformation Processing & Management10.1016/j.ipm.2024.10395562:1(103955)Online publication date: Jan-2025
https://doi.org/10.1016/j.ipm.2024.103955
Song AWaters K(2023)A Tale of Two Cities: How Arlington Won and Baltimore Lost in Battle for Amazon’s HQ2The Entrepreneurial Ecosystem10.1007/978-3-031-25931-9_9(277-297)Online publication date: 1-Jun-2023
https://doi.org/10.1007/978-3-031-25931-9_9
Gryzun LShcherbakov OParfonov YBodnar L(2022)Visualization of algorithms on graphs with a large number of vertices: The features of applications designDevelopment management10.57111/devt.20(4).2022.36-4420:4Online publication date: 20-Dec-2022
https://doi.org/10.57111/devt.20(4).2022.36-44
Aleixandre-Tudo JCastello-Cogollos L; Aleixandre JAleixandre-Benavent R(2022)Chemometrics in food science and technology: A bibliometric studyChemometrics and Intelligent Laboratory Systems10.1016/j.chemolab.2022.104514(104514)Online publication date: Feb-2022
https://doi.org/10.1016/j.chemolab.2022.104514
Cheong SSi YWong R(2021)Online force-directed algorithms for visualization of dynamic graphsInformation Sciences10.1016/j.ins.2020.12.069556(223-255)Online publication date: May-2021
https://doi.org/10.1016/j.ins.2020.12.069
Shutters SWaters K(2020)Inferring Networks of Interdependent Labor Skills to Illuminate Urban Economic StructureEntropy10.3390/e2210107822:10(1078)Online publication date: 25-Sep-2020
https://doi.org/10.3390/e22101078
Cheong SSi Y(2018)CWBoundThe Journal of Supercomputing10.5555/3288339.328837374:10(5558-5577)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.5555/3288339.3288373
Cheong SSi Y(2018)Snapshot Visualization of Complex Graphs with Force-Directed Algorithms2018 IEEE International Conference on Big Knowledge (ICBK)10.1109/ICBK.2018.00026(139-145)Online publication date: Nov-2018
https://doi.org/10.1109/ICBK.2018.00026

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents