Open Access Open Access  Restricted Access Subscription or Fee Access

A Study on Development of Matrix Model of WMN for Mesh Clustering and its Validation

(*) Corresponding author

Authors' affiliations



Tracking and tracing network nodes and monitoring network topology pose a huge challenge in Wireless Mesh Networks (WMNs). This becomes even more challenging in the scenario of multiple clusters, which keep performing hand-off handovers among each other for load management or link management purposes. In the dynamic and fragile WMN scenario, loss of connectivity is very common. In the case of multi-hop multi-gateway WMNs, such a scenario is very common. The architecture of the IEEE 802.11s WMN proposes a network wherein each node selects a gateway through which it routes its packets. A node selects the gateway based on its proximity in terms of the number of hop-distance and the Air Time Link Metric. Since the selection of gateway is done by a node on basis of its local information, more than often the scheduling of gateway becomes unfair. This leads to gateway congestion and a drop in the throughput of the network. In this paper, a model of a centralized gateway scheduling scheme is proposed. This paper proposes a matrix model of a clustered WMN. A well-defined gateway service set (cluster) is formed and then this is mapped onto the matrix model of the clustered WMN. In such a centralized scheme, an additional responsibility of tracking the nodes for connectivity is also addressed through this matrix model. This ensures no lost nodes or repeated nodes while the formation of clusters. Thereafter, the paper presents the process for validation of the integrity of WMN and its clusters through a mathematical model of WMN.
Copyright © 2022 Praise Worthy Prize - All rights reserved.


Clustering; Wireless Mesh Networks; Network Graph; Network Matrix

Full Text:



IEEE Standard for Information Technology--Telecommunications and information exchange between systems--Local and metropolitan area networks--Specific requirements Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications Amendment 10: Mesh Networking, IEEE Std. 802.11s-2011. Sept. 10, 2011

N. Saputro, K. Akkaya, and S. Uluagac, Supporting Seamless Connectivity in Drone-assisted Intelligent Transportation Systems, IEEE 43rd Conference on Local Computer Networks Workshops (LCN Workshops), 2018, pp. 110-116.

IEEE Standard for Information Technology--Telecommunications and Information Exchange Between Systems - Local and Metropolitan Area Networks--Specific Requirements - Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, in IEEE Std 802.11-2020 (Revision of IEEE Std 802.11-2016), vol., no., pp.1-4379, 26 Feb. 2021.

Medeiros, D.S.V., Cunha Neto, H.N., Lopez, M.A. et al. A survey on data analysis on large-Scale wireless networks: online stream processing, trends, and challenges. J Internet Serv Appl 11, 6 (2020).

Dijkstra, E. W., A note on two problems in connexion with graphs, Journal Numerische Mathematik 1: 269-271, (1959).

Natarajan Meghanathan, Graph Theory Algorithms for Mobile Ad Hoc Networks, Informatica 36 (2012) 185-200, April 22, 2011.

Rajan, M. A., Chandra, M. Girish, Reddy, Lokanatha C., Hiremath Prakash, Concepts of Graph Theory Relevant to Ad-hoc Networks, International Journal of Computers, Communications & Control, ISSN 1841-9836, E-ISSN 1841-9844 Vol. III (2008), Suppl. issue: Proceedings of ICCCC 2008, pp. 465-469

Islam, M.S., Yoon, Y.J., Hamid, M.A., Hong, C.S., A Secure Hybrid Wireless Mesh Protocol for 802.11s Mesh Networ, In: Gervasi, O., Murgante, B., Laganà, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds) Computational Science and Its Applications - ICCSA 2008. ICCSA 2008. Lecture Notes in Computer Science, vol 5072. Springer, Berlin, Heidelberg.

Ng, Ming & Yau, Kok-Lim, An energy-efficient Hybrid Wireless Mesh Protocol (HWMP) for IEEE 802.11s mesh networks, Proceedings - 2013 IEEE International Conference on Control System, Computing and Engineering, ICCSCE 2013, 17-21.

C. E. Perkins and E. M. Royer, Ad-hoc on-demand distance vector routing, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications, 1999, pp. 90-100.

S Amutha, Kannan Balasubramanian, Secured energy optimized Ad hoc on-demand distance vector routing protocol, Computers & Electrical Engineering, Volume 72, 2018, Pages 766-773, ISSN 0045-7906.

M Premkumar, M P Chitra, X Alisha Celestin, T Kausalya, M N Nandhini Priya, Game theory based Ad-hoc On Demand Distance Vector Routing Protocol to Extend the Wireless Sensor Networks Life Time, Indonesian Journal of Electrical Engineering and Informatics (IJEEI), Vol 7 No. 3, September 2019, ISSN 2089-3272.

Deo, N., Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall India, New Delhi (1974), latest edition 2000

Shweta Singh and Ravindra Bhatt, Adjacency Matrix Based Energy Efficient Scheduling using S-MAC Protocol in Wireless Sensor Networks, International Journal of Computer Networks & Communications (IJCNC), March 2012, Volume 4, No. 2, March 2012.

Caleffi, Marcello & Ferraiuolo, Giancarlo & Paura, Luigi, On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc Networks, Proc. of WRECOM '07: Wireless Rural and Emergency Communications Conference, Roma (Italy), October 2007.

Z. Liu, J. Kim, B. Lee, and C. Kim, A Routing Protocol Based on Adjacency Matrix in Ad Hoc Mobile Networks, 2008 International Conference on Advanced Language Processing and Web Information Technology, Dalian Liaoning, pp. 430-436.

Takruri, M., Ismail, S., Awad, M., Al-Hattab, M., Hamad, N., A Comparative Study of Energy Consumption Required for Localization in Wireless Sensor Networks, (2019) International Journal on Communications Antenna and Propagation (IRECAP), 9 (4), pp. 301-310.

Consolini, L., Medagliani, P., Ferrari, G. Adjacency Matrix-Based Transmit Power Allocation Strategies in Wireless Sensor Networks, Sensors 2009, 9, 5390-5422.

G. Mao and B. D. O. Anderson, Graph-Theoretic Models and Tools for the Analysis of Dynamic Wireless Multihop Networks, 2009 IEEE Wireless Communications, and Networking Conference, Budapest, pp. 1-6.

Harary, F. Graph theory, Addison-Wesley, Reading, MA. (1969).

K. R. Parthasarthy, Basic Graph Theory, Tata Mc Graw Hills Publishing Company, New Delhi, India, 1994

Alheyasat, O., A Hybrid K-Mean and Graph Metrics Algorithm for Node Sleeping Scheduling in Wireless Sensor Network (WSN), (2021) International Journal on Communications Antenna and Propagation (IRECAP), 11 (3), pp. 181-188.

Bing He; Bin Xie; Agrawal, D.P., Optimizing the Internet Gateway Deployment in a Wireless Mesh Network, IEEE International Conference on Mobile Adhoc and Sensor Systems, MASS 2007, pp.1,9, 8-11 Oct. 2007.

Bejerano, Y., Han, S.J., Kumar, A., Efficient Load-Balancing Routing for Wireless Mesh Networks. IEEE Journal of Computer Networks 51 (10), 2007.

Pandey S., Pande V., Kadambi G., Bate S., Partitioning and Internetworking Wireless Mesh Network with Wired Network for Delivery Maximization and QoS Provisioning. In: Wyld D., Zizka J., Nagamalai D. (eds) Advances in Computer Science, Engineering & Applications. Advances in Intelligent Systems and Computing, vol 167. 2012 Springer, Berlin, Heidelberg.

Udit Agarwal, Umesh Pal Singh, 'Graph Theory,' Laxmi Publications, 2009. Available at:


  • There are currently no refbacks.

Please send any question about this web site to
Copyright © 2005-2024 Praise Worthy Prize