Advances in Algorithm Theory and Computer Networks

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "E1: Mathematics and Computer Science".

Deadline for manuscript submissions: 31 December 2025 | Viewed by 7215

Special Issue Editors


E-Mail Website
Guest Editor
Centro de Investigación en Computación, Instituto Politécnico Nacional, Ciudad de México 07700, México
Interests: combinatorial optimization; computer networks; algorithm theory; machine learning
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

We invite you to participate in our Special Issue of Mathematics titled "Advances in Algorithm Theory and Computer Networks." This issue seeks to bridge the gap between theory and practice, highlighting the interplay between mathematics, algorithmic theory, and computer networks. Submissions should focus on novel algorithmic theories, computational frameworks, and network architectures that ensure network scalability, efficiency, and adaptability. Contributions should emphasize mathematical rigor while addressing real-world applicability.

We welcome the submission of original research and review papers on topics including, but not limited to, the following: machine learning for algorithmic challenges in networks, including the ML-driven optimization of network routing, resource allocation, and congestion control; applications of reinforcement learning, deep learning, and federated learning for adaptive network management, anomaly detection, and security in large-scale networks; information-theoretic approaches, including the theoretical limits of data transmission, compression, and storage in decentralized networks; game-theoretic models and results, including strategic decision-making in network resource allocation, security, and distributed control; equilibrium analysis for multi-agent systems and competitive network environments; distributed and centralized algorithms for NP-hard problems in networks; next-generation network architectures, including algorithms for information-centric networking (ICN), edge computing, and agentic communications; architectures supporting low latency and high-bandwidth applications (e.g., video-on-demand); the theoretical and practical challenges of future networks, including the scalability of algorithms for networks with billions of heterogeneous devices; and energy efficiency, security, and resilience in decentralized, self-organizing systems.

Prof. Dr. Rolando Menchaca-Méndez
Dr. Marcela Quiroz-Castellanos
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • algorithm theory
  • computer networks
  • machine learning in computer networks
  • distributed combinatorial optimization
  • algorithmic foundations of next-generation network architectures

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

31 pages, 7033 KiB  
Article
On the Use of the Game of Life to Improve the Performance of Event-Driven Wireless Sensor Networks
by Hugo Ivan Fernandez-Cid, Mario Eduardo Rivero-Angeles, German Tellez-Castillo and Juan Carlos Chimal-Eguia
Mathematics 2025, 13(16), 2561; https://doi.org/10.3390/math13162561 - 10 Aug 2025
Viewed by 154
Abstract
Wireless Sensor Networks are composed of a set of sensors distributed within an area that monitor physical variables of the environment and send back information to a central node. Nodes cannot always remain active since they would swiftly drain the system’s energy. As [...] Read more.
Wireless Sensor Networks are composed of a set of sensors distributed within an area that monitor physical variables of the environment and send back information to a central node. Nodes cannot always remain active since they would swiftly drain the system’s energy. As such, some works have proposed the use of different on/off schemes to monitor the phenomena of interest efficiently but also to conserve energy as much as possible. To this end, the use of on/off protocols has been used before, but has no relation to the characteristics of the monitored events. However, in scenarios where the phenomena to monitor occur in a certain pattern or specific region, the use of more suited techniques to activate the nodes can yield better results. In this sense, we propose the use of cellular automata (CA), based on the Game of Life (GoL), in order to turn the nodes on and off, according to the patterns described by the automata. Cellular automata are discrete models consisting of a lattice or grid of cells in a finite number of states that remain or change into another state following pre-established rules commonly associated with the states of their neighbors. As such, we propose to activate/deactivate the nodes following the natural behavior of the GoL scheme. Since the initial state of the cellular automata directly modifies the pattern evolution of the GoL, we consider several possible patterns that can occur in practical systems in order to prove the effectiveness of our proposal. We evaluate the system performance in terms of successful event report probability and energy consumption, comparing our results to the conventional on/off schemes with a certain probability of nodes being in the on state. With this premise, we think CA is a good alternative to determine the on/off process in WSNs. We compared the system performance of the GoL patterns compared to the classical approach and found the cases where the GoL scheme performs better. Full article
(This article belongs to the Special Issue Advances in Algorithm Theory and Computer Networks)
Show Figures

Figure 1

Back to TopTop