Skip to main content
SpringerLink
Log in

CWBound: boundary node detection algorithm for complex non-convex mobile ad hoc networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

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 routing protocols as well as to prolong the battery power of devices along the boundary of an ad hoc network. In this article, we developed an algorithm, CWBound, which discovers boundary nodes in a complex non-convex mobile ad hoc (CNCAH) networks. Experiments show that the CWBound algorithm is at least three times faster than other state-of-the-art algorithms, and up to 400 times faster than classical force-directed algorithms. The experiments also confirmed that the CWBound algorithm achieved the highest accuracy (above 97% for 3 out of the 4 types of CNCAH networks) and sensitivity (90%) among the algorithms evaluated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Notes

  1. http://www.cis.umac.mo/~fstasp/profile_eric.html.

References

  1. Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E (2002) A survey on sensor networks. IEEE Commun Mag 40(8):102

    Article  Google Scholar 

  2. Solmaz G, Turgut D (2017) Tracking pedestrians and emergent events in disaster areas. J Netw Comput Appl 84:55

    Article  Google Scholar 

  3. MartíN-Campillo A, Crowcroft J, Yoneki E, Martí R (2013) Evaluating opportunistic networks in disaster scenarios. J Netw Comput Appl 36(2):870

    Article  Google Scholar 

  4. Cheong SH, Lee KI, Si YW et al (2011) Lifeline: emergency ad hoc network. In: Computational Intelligence and Security (CIS), 2011 Seventh International Conference on. IEEE, pp 283–289

  5. Mauve M, Widmer J, Hartenstein H (2001) A survey on position-based routing in mobile ad hoc networks. IEEE Netw 15(6):30

    Article  Google Scholar 

  6. Phoummavong P, Utsu K, Chow CO, Ishii H (2016) Location-aided route discovery mechanism based on two-hop neighbor information for ad hoc network. J Supercomput 72(3):1201

    Article  Google Scholar 

  7. Efrat A, Forrester D, Iyer A, Kobourov SG, Erten C, Kilic O (2010) Force-directed approaches to sensor localization. ACM Trans Sens Netw (TOSN) 7(3):27

    Google Scholar 

  8. Cheong SH, Si YW (2016) Accelerating the Kamada–Kawai algorithm for boundary detection in a mobile ad hoc network. ACM Trans Sens Netw (TOSN) 13(1):3

    Google Scholar 

  9. Schieferdecker D (2014) An algorithmic view on sensor networks: surveillance, localization, and communication (epubli)

  10. Rafiei A, Abolhasan M, Franklin D, Safaei F (2011) Boundary node selection algorithms in WSNs. In: Local Computer Networks (LCN), 2011 IEEE 36th Conference on. IEEE, pp 251–254

  11. Sahoo PK, Hsieh KY, Sheu JP (2007) Boundary node selection and target detection in wireless sensor network. In: Wireless and Optical Communications Networks, 2007. WOCN’07. IFIP International Conference on. IEEE, pp 1–5

  12. Fruchterman TM, Reingold EM (1991) Graph drawing by force-directed placement. Softw Pract Exp 21(11):1129

    Article  Google Scholar 

  13. Kamada T, Kawai S (1989) An algorithm for drawing general undirected graphs. Inf Process Lett 31(1):7

    Article  MathSciNet  Google Scholar 

  14. Davidson R, Harel D (1996) Drawing graphs nicely using simulated annealing. ACM Trans Graph (TOG) 15(4):301

    Article  Google Scholar 

  15. Bresenham J, Earnshaw R, Pitteway M (1991) Fundamental algorithms for computer graphics. Springer, Berlin

    Google Scholar 

  16. Saukh O, Sauter R, Gauger M, Marrón PJ (2010) On boundary recognition without location information in wireless sensor networks. ACM Trans Sens Netw (TOSN) 6(3):20

    Google Scholar 

  17. Huang B, Wu W, Gao G, Zhang T (2014) Recognizing boundaries in wireless sensor networks based on local connectivity information. Int J Distrib Sens Netw 10(7):897039

    Article  Google Scholar 

  18. Wang Y, Gao J, Mitchell JS (2006) Boundary recognition in sensor networks by topological methods. In: Proceedings of the 12th Annual International Conference on Mobile Computing and Networking. ACM, pp 122–133

  19. Zhang C, Zhang Y, Fang Y (2006) Detecting coverage boundary nodes in wireless sensor networks. In: Networking, Sensing and Control, 2006. ICNSC’06. Proceedings of the 2006 IEEE International Conference on. IEEE, pp 868–873

  20. Aurenhammer F (1991) Voronoi diagrams—a survey of a fundamental geometric data structure. ACM Comput Surv (CSUR) 23(3):345

    Article  Google Scholar 

  21. Zhao LH, Liu W, Lei H, Zhang R, Tan Q (2016) Detecting boundary nodes and coverage holes in wireless sensor networks. Mob Inf Syst 2016:8310296. https://doi.org/10.1155/2016/8310296

    Article  Google Scholar 

  22. Beghdad R, Lamraoui A (2016) Boundary and holes recognition in wireless sensor networks. J Innov Digit Ecosyst 3(1):1

    Article  Google Scholar 

  23. Afzal S, Beigy H (2014) A localization algorithm for large scale mobile wireless sensor networks: a learning approach. J Supercomput 69(1):98–120. https://doi.org/10.1007/s11227-014-1129-6

    Article  Google Scholar 

  24. Völker M, Wagner D, Schmid J, Gädeke T, Müller-Glaser K (2012) Force-directed tracking in wireless networks using signal strength and step recognition. In: Localization and GNSS (ICL-GNSS), 2012 International Conference on. IEEE, pp 1–8

  25. Park JW, Park DH, Lee C (2013) Angle and ranging based localization method for ad hoc network. J Supercomput 64(2):507

    Article  Google Scholar 

  26. De Nooy W, Mrvar A, Batagelj V (2011) Exploratory social network analysis with Pajek, vol 27. Cambridge University Press, Cambridge

    Book  Google Scholar 

  27. Chimani M, Gutwenger C, Jünger M, Klau GW, Klein K, Mutzel P (2013) The open graph drawing framework (OGDF). In: Handbook of graph drawing and visualization 2011, p 543

  28. Darabkh KA, Albtoush WY, Jafar IF (2017) Improved clustering algorithms for target tracking in wireless sensor networks. J Supercomput 73(5):1952

    Article  Google Scholar 

  29. Jacomy M, Venturini T, Heymann S, Bastian M (2014) ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software. PLoS ONE 9(6):e98679

    Article  Google Scholar 

  30. Fjällström PO (1998) Algorithms for graph partitioning: a survey, vol 3. Linköping University Electronic Press, Linköping

    Google Scholar 

  31. Schloegel K, Karypis G, Kumar V (2003) Graph partitioning for high-performance scientific simulations. In: Dongarra J, Foster I, Fox G, Gropp W, Kennedy K, Torczon L, White A (eds) Sourcebook of parallel computing. Morgan Kaufmann Publishers Inc., San Francisco, CA, pp 491–541

    Google Scholar 

  32. Hendrickson B, Leland RW (1995) A multi-level algorithm for partitioning graphs. In: Proceedings of the 1995 ACM/IEEE Conference on Supercomputing, Supercomputing ’95, ACM, New York. https://doi.org/10.1145/224170.224228

  33. Safro I, Sanders P, Schulz C (2015) Advanced coarsening schemes for graph partitioning. J Exp Algorithmics (JEA) 19:2

    MathSciNet  MATH  Google Scholar 

  34. Noack A (2007) Unified quality measures for clusterings, layouts, and orderings of graphs, and their application as software design criteria. Ph.D. thesis, Brandenburg University of Technology, Cottbus-Senftenberg

  35. Enderle JD, Bronzino JD (2012) Introduction to biomedical engineering. Academic Press, New York

    Google Scholar 

  36. Gajer P, Goodrich MT, Kobourov SG (2004) A multi-dimensional approach to force-directed layouts of large graphs. Comput Geom 29(1):3

    Article  MathSciNet  Google Scholar 

  37. Biemann C (2006) Chinese Whispers: an efficient graph clustering algorithm and its application to natural language processing problems. In: Proceedings of the first workshop on graph based methods for natural language processing. Association for Computational Linguistics, pp 73–80

  38. Bracewell DB, Tomlinson MT, Mohler M (2013) Determining the conceptual space of metaphoric expressions. In: International Conference on Intelligent Text Processing and Computational Linguistics. Springer, Berlin, Heidelberg, pp 487–500

    Chapter  Google Scholar 

Download references

Acknowledgements

This research was funded by the Research Committee of University of Macau, Grants MYRG2016-00148-FST and MYRG2017-00029-FST.

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, University of Macau, Avenida Da Universidade, Taipa, Macau, China

    Se-Hang Cheong & Yain-Whar Si

Authors
  1. Se-Hang Cheong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yain-Whar Si
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yain-Whar Si.

Appendix: Chinese Whispers algorithm

Appendix: Chinese Whispers algorithm

We used the Chinese Whispers algorithm for clustering which is proposed by [37]. The algorithm partitions the nodes of a graph into clusters. The Chinese Whispers algorithm is able to good clustering results on large networks within an acceptable number of iterations [38]. The time complexity of the Chinese Whispers algorithm is \(O(n \times E)\), where n is the number of nodes and E is the number of edges in the network. This algorithm uses the following steps to partition the nodes into clusters. On initialisation, every node is labelled with a random, unique, class (cluster). For example, node-1 is labelled as class \(\#1\), node-2 is labelled as class \(\#2\) and so on. In each iteration, a randomly selected node is assigned to a class in its local neighbourhood. The class selected to be assigned is the one with the highest total edge weight of all classes in the neighbourhood of the node. Step 2 is repeated until the class assigned to the nodes remains the same for a specified number (f) of iterations (i.e. a local minimum is reached). However, the algorithm may not always be able to converge to a local minimum. In that case, a stopping criterion is used to terminate the iterations. The pseudocode for the Chinese Whispers algorithm is given in Algorithm 4.

figure d

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cheong, SH., Si, YW. CWBound: boundary node detection algorithm for complex non-convex mobile ad hoc networks. J Supercomput 74, 5558–5577 (2018). https://doi.org/10.1007/s11227-018-2494-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-018-2494-3

Keywords

Search

Navigation