ASPG Menu
search

American Scientific Publishing Group

verified Journal

International Journal of Wireless and Ad Hoc Communication

ISSN
Online: 2692-4056
Frequency

Continuous publication

Publication Model

Open access · Articles freely available online · No author fees or charges

International Journal of Wireless and Ad Hoc Communication
Full Length Article

Volume 11 • Issue 1 • PP: 01–11 • 2027

Pareto-Based Joint Optimization of Node Activity and Communication in Dense IoT Sensor Networks

Upendra Kumar Singh 1* ,
Monika Nanda 2
1Department of Computer Science and Engineering, SRMS College of Engineering and Technology, Bareilly, Uttar Pradesh, India
2Department of Electronics and Communication Engineering, Birla Institute of Applied Sciences, Bhimtal, Nainital, Uttarakhand, India
* Corresponding Author.
verified

Open Access & Copyright

© 2027 The Author(s). Published by ASPG. This article is licensed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).

Received: June 25, 2026 Revised: September 14, 2026 Accepted: November 05, 2026

Abstract

Dense IoT sensor networks face a fundamental trade-off between energy efficiency, communication delay, and packet delivery reliability. As network density increases, controlling node activity and communication behavior becomes increasingly important because energy-saving decisions can affect forwarding availability and communication performance. This study presents a Pareto-based framework for jointly optimizing node activity and communication decisions in dense IoT sensor networks. The proposed formulation considers total energy consumption, average end-to-end delay, and packet delivery reliability as competing objectives, with NSGA-II employed as the multi-objective optimization engine. The study evaluates three network densities comprising 50, 100, and 200 nodes. For each density, a selected Pareto configuration is independently validated using five random seeds and 1000 simulation rounds per seed. The validated configurations consume 8.6090 J, 28.1479 J, and 70.6780 J of mean energy for 50, 100, and 200 nodes, respectively, while the corresponding mean delays are 0.08458 s, 0.13441 s, and 0.19901 s. The mean PDR values are 36.4393%, 46.6317%, and 42.5616%, respectively. The results show that increasing network density leads to substantially higher energy consumption and delay, while packet delivery reliability does not improve monotonically. The findings demonstrate that joint activity and communication control provides distinct Pareto operating points and that multi-seed validation is important for assessing their stability under stochastic network conditions. The study provides a transparent density-wise analysis of the energy–delay–reliability trade-off in dense IoT sensor networks.

Keywords

Wireless Sensor Networks Internet of Things (IoT) Multi-Objective Optimization NSGA-II Duty-Cycle Control Energy-Efficient Routing Pareto Optimization

References

[1] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: A survey,” Com-puter Networks, vol. 38, no. 4, pp. 393–422, 2002.

[2] S. A. Abbas, L. Farzinvash, and M. Zolfy, “A two-phase genetic algorithm approach for sleep scheduling, rout-ing, and clustering in heterogeneous wireless sensor networks,” Network, vol. 5, no. 4, p. 50, 2025.

[3] M. K. Roberts, S. Jeevanandham, J. Lloret, and F. Dahan, “An innovative dual-phased synergistic en-ergy management approach for WSNs using enhanced sleep/awake scheduling and adaptive routing process,” Simulation Modelling Practice and Theory, vol. 142, p. 103120, 2025.

[4] W. R. Heinzelman, A. P. Chandrakasan, and H. Bal-akrishnan, “Energy-efficient communication protocol for wireless microsensor networks,” in Proceedings of the 33rd Hawaii International Conference on System Sciences, 2000, pp. 1–10.

[5] M. A. Tawfeek, I. Alrashdi, M. Alruwaili, L. Jamel, G. F. Elhady et al., “Improving energy efficiency and routing reliability in wireless sensor networks using modified ant colony optimization,” EURASIP Journal on Wire-less Communications and Networking, vol. 2025, p. 22, 2025.

[6] A. A. Lata, M. Kang, and S. Shin, “FCM-OR: A local density-aware opportunistic routing protocol for energy-efficient wireless sensor networks,” Electronics, vol. 14, no. 9, p. 1841, 2025.

[7] C. Rao, M. Kan, P. Zhou et al., “A novel multi-objective energy-efficient clustering optimization scheme based on heuristic intelligence for wireless sensor networks,” Scientific Reports, vol. 15, p. 36988, 2025.

[8] Y. Zhang, L. Yang, and Y. Tan, “Energy-efficient adap-tive routing in heterogeneous wireless sensor networks via hybrid PSO and dynamic clustering,” Journal of Cloud Computing, vol. 14, p. 46, 2025.

[9] M. J. Kavitha, M. R. Geetha, and R. I. Sajan, “Knowledge-based adaptive routing for energy efficiency and attack detection in ad hoc wireless sensor networks,” Computer Networks, vol. 259, p. 111086, 2025.

[10] I. Samoylenko, V. Fedorenko, and V. Samoylenko, “Adaptive data relay transmission in wireless sensor net-works for reliable crop growth monitoring,” Computers and Electronics in Agriculture, vol. 234, p. 110367, 2025.

[11] B. Rana, Y. Singh, P. K. Singh, K. Z. Ghafoor, and

S. Shrestha, “A hybrid approach for energy-efficient routing in IoT using duty cycling and improved ant colony,” IET Communications, vol. 19, no. 1, pp. 1–19, 2025.

[12] S. Thakur, N. I. Sarkar, and S. Yongchareon, “AI-driven energy-efficient routing in IoT-based wireless sensor networks: A comprehensive review,” Sensors, vol. 25, no. 24, p. 7408, 2025.

[13] W. Zeng, Z. Wang, S. Yang, D. He, and S. Chan, “ICMH-CHR: An intra-cluster multi-hop based cluster head rotation protocol for wireless sensor networks,” Ad Hoc Networks, vol. 174, p. 103829, 2025.

[14] L. Yang, D. Zhang, L. Li, and Q. He, “Energy efficient cluster-based routing protocol for WSN using multi-strategy fusion snake optimizer and minimum spanning tree,” Scientific Reports, vol. 14, no. 1, p. 16786, 2024.

[15] Z. Wang, Y. Yang, X. Luo, D. He, and S. Chan, “Energy-efficient clustering and routing for wireless sensor net-works by applying a spider wasp optimizer,” Ad Hoc Networks, vol. 174, p. 103841, 2025.

[16] K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002.

Cite This Article

Choose your preferred format

format_quote
Kumar Singh, Upendra , Nanda, Monika . "Pareto-Based Joint Optimization of Node Activity and Communication in Dense IoT Sensor Networks." International Journal of Wireless and Ad Hoc Communication, vol. 11, no. 1, 2027, pp. 01–11. DOI: https://doi.org/10.54216/IJWAC.110101
Kumar Singh, U., Nanda, M. (2027). Pareto-Based Joint Optimization of Node Activity and Communication in Dense IoT Sensor Networks. International Journal of Wireless and Ad Hoc Communication, Volume 11(Issue 1), 01–11. DOI: https://doi.org/10.54216/IJWAC.110101
Kumar Singh, Upendra , Nanda, Monika . "Pareto-Based Joint Optimization of Node Activity and Communication in Dense IoT Sensor Networks." International Journal of Wireless and Ad Hoc Communication Volume 11, no. Issue 1 (2027): 01–11. DOI: https://doi.org/10.54216/IJWAC.110101
Kumar Singh, U., Nanda, M. (2027) 'Pareto-Based Joint Optimization of Node Activity and Communication in Dense IoT Sensor Networks', International Journal of Wireless and Ad Hoc Communication, Volume 11(Issue 1), pp. 01–11. DOI: https://doi.org/10.54216/IJWAC.110101
Kumar Singh U, Nanda M. Pareto-Based Joint Optimization of Node Activity and Communication in Dense IoT Sensor Networks. International Journal of Wireless and Ad Hoc Communication. 2027;Volume 11(Issue 1):01–11. DOI: https://doi.org/10.54216/IJWAC.110101
U. Kumar Singh, M. Nanda, "Pareto-Based Joint Optimization of Node Activity and Communication in Dense IoT Sensor Networks," International Journal of Wireless and Ad Hoc Communication, vol. Volume 11, no. Issue 1, pp. 01–11, 2027. DOI: https://doi.org/10.54216/IJWAC.110101
policy

Publisher's Note

The statements, opinions, and data presented in this article are solely those of the author(s) and do not necessarily represent those of ASPG, the journal, or its editors. ASPG and the editors disclaim responsibility for any harm arising from the use of any ideas, methods, instructions, or products described in this article, to the fullest extent permitted by applicable law.

Digital Archive Ready