Methods, Performance Bounds, and Routing Approaches for In Network Aggregation in Wireless Sensor Networks


Journal of Computer and Communication Networks

Received On : 10 May 2025

Revised On : 18 July 2025

Accepted On : 30 August 2025

Published On : 13 October 2025

Volume 01, 2025

Pages : 208-221


PDF
Download

DOI
https://doi.org/10.64026/JCCN/2025020
Article Views
Abstract

In-Network Aggregation (INA) is a process of data collection and analysis within a network architecture that is multi-hop network. The idea behind this process is to decrease the number of resources required to disseminate information and advance the optimality of the model by accumulating information at transitional nodes before forwarding it to the recipient. The process consists of two main methods: (a) the process of reducing the size of information to be sent in a way that minimizes the amount of overhead, and (b) the aggregation and conveyance of packet sizes. INA integrates routing procedures, accretion functions, and data representations as the constituent parts. This research aims to identify INA techniques in multihop networks with the aim of advancing the application of system resources as well as expanding the network size. The study encompasses issues relating to aggregation with or without size reduction, routing protocols, different types of aggregation functions, and different data representation formats. Lastly, this paper provides a detailed discussion that makes it possible to appreciate the strengths and weaknesses of cluster-based, tree-based, multi-path, and combined approaches. It examines the challenges of the reliability-overhead trade-off, thereby providing input on how to enhance the passing of data and use of resources in the WSNs.

Keywords

In-Network Aggregation, Multihop Network, Data Consolidation, Resource Optimization, Routing Protocols, Aggregation Functions, Wireless Sensor Networks.

  1. Z. Yang and Y. Liu, “Understanding Node Localizability of Wireless Ad Hoc and Sensor Networks,” IEEE Transactions on Mobile Computing, vol. 11, no. 8, pp. 1249–1260, Aug. 2012, doi: 10.1109/tmc.2011.122.
  2. A. Sebaa and A. Tari, “Query optimization in cloud environments: challenges, taxonomy, and techniques,” The Journal of Supercomputing, vol. 75, no. 8, pp. 5420–5450, Mar. 2019, doi: 10.1007/s11227-019-02806-9.
  3. I. Solis and K. Obraczka, “In-network aggregation trade-offs for data collection in wireless sensor networks,” International Journal of Sensor Networks, vol. 1, no. 3/4, p. 200, 2006, doi: 10.1504/ijsnet.2006.012035.
  4. A. Deligiannakis, Y. Kotidis, and N. Roussopoulos, “Hierarchical In-Network Data Aggregation with Quality Guarantees,” Advances in Database Technology - EDBT 2004, pp. 658–675, 2004, doi: 10.1007/978-3-540-24741-8_38.
  5. I. Solis and K. Obraczka, “The impact of timing in data aggregation for sensor networks,” 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), pp. 3640-3645 Vol.6, 2004, doi: 10.1109/icc.2004.1313222.
  6. Y. Yang, P. Grover, and S. Kar, “Rate Distortion for Lossy In-Network Linear Function Computation and Consensus: Distortion Accumulation and Sequential Reverse Water-Filling,” IEEE Transactions on Information Theory, vol. 63, no. 8, pp. 5179–5206, Aug. 2017, doi: 10.1109/tit.2017.2710059.
  7. Y. Yang, M. I. Fonoage, and M. Cardei, “Improving network lifetime with mobile wireless sensor networks,” Computer Communications, vol. 33, no. 4, pp. 409–419, Mar. 2010, doi: 10.1016/j.comcom.2009.11.010.
  8. N. Shabbir and S. R. Hassan, “Routing Protocols for Wireless Sensor Networks (WSNs),” Wireless Sensor Networks - Insights and Innovations, Oct. 2017, doi: 10.5772/intechopen.70208.
  9. R. E. Mohamed, A. I. Saleh, M. Abdelrazzak, and A. S. Samra, “Survey on Wireless Sensor Network Applications and Energy Efficient Routing Protocols,” Wireless Personal Communications, vol. 101, no. 2, pp. 1019–1055, May 2018, doi: 10.1007/s11277-018-5747-9.
  10. S. Peter, K. Piotrowski, and P. Langendorfer, “In-network-aggregation as case study for a support tool reducing the complexity of designing secure wireless sensor networks,” 2008 33rd IEEE Conference on Local Computer Networks (LCN), pp. 778–785, Oct. 2008, doi: 10.1109/lcn.2008.4664280.
  11. D. Westhoff and O. Ugus, “Malleability resilient (premium) Concealed Data Aggregation,” 2013 IEEE 14th International Symposium on “A World of Wireless, Mobile and Multimedia Networks” (WoWMoM), pp. 1–6, Jun. 2013, doi: 10.1109/wowmom.2013.6583470.
  12. S. Peter, D. Westhoff, and C. Castelluccia, “A Survey on the Encryption of Convergecast Traffic with In-Network Processing,” IEEE Transactions on Dependable and Secure Computing, vol. 7, no. 1, pp. 20–34, Jan. 2010, doi: 10.1109/tdsc.2008.23.
  13. J. Jose, J. Jose, and Muhammed Ilyas H, “Symmetric concealed data aggregation techniques in wireless sensor networks using Privacy Homomorphism: A review,” 2016 International Conference on Information Science (ICIS), pp. 275–280, Aug. 2016, doi: 10.1109/infosci.2016.7845340.
  14. O. R. Merad Boudia, S. M. Senouci, and M. Feham, “Secure and efficient verification for data aggregation in wireless sensor networks,” International Journal of Network Management, vol. 28, no. 1, Sep. 2017, doi: 10.1002/nem.2000.
  15. Y. Wang, J. Min, and Y. Chen, “Impact of the hybrid gain ensemble data assimilation on meso-scale numerical weather prediction over east China,” Atmospheric Research, vol. 206, pp. 30–45, Jul. 2018, doi: 10.1016/j.atmosres.2018.02.014.
  16. E. Fasolo, M. Rossi, J. Widmer, and M. Zorzi, “In-network aggregation techniques for wireless sensor networks: a survey,” IEEE Wireless Communications, vol. 14, no. 2, pp. 70–87, Apr. 2007, doi: 10.1109/mwc.2007.358967.
  17. A. Raja Basha, “Energy efficient aggregation technique‐based realisable secure aware routing protocol for wireless sensor network,” IET Wireless Sensor Systems, vol. 10, no. 4, pp. 166–174, Aug. 2020, doi: 10.1049/iet-wss.2019.0178.
  18. N. A. Pantazis, S. A. Nikolidakis, and D. D. Vergados, “Energy-Efficient Routing Protocols in Wireless Sensor Networks: A Survey,” IEEE Communications Surveys & Tutorials, vol. 15, no. 2, pp. 551–591, 2013, doi: 10.1109/surv.2012.062612.00084.
  19. A. Boukerche, B. Turgut, N. Aydin, M. Z. Ahmad, L. Bölöni, and D. Turgut, “Routing protocols in ad hoc networks: A survey,” Computer Networks, vol. 55, no. 13, pp. 3032–3080, Sep. 2011, doi: 10.1016/j.comnet.2011.05.010.
  20. G. Fortino, R. Giannantonio, R. Gravina, P. Kuryloski, and R. Jafari, “Enabling Effective Programming and Flexible Management of Efficient Body Sensor Network Applications,” IEEE Transactions on Human-Machine Systems, vol. 43, no. 1, pp. 115–133, Jan. 2013, doi: 10.1109/tsmcc.2012.2215852.
  21. M. R. Jakobsen and K. Hornbaek, “Interactive Visualizations on Large and Small Displays: The Interrelation of Display Size, Information Space, and Scale,” IEEE Transactions on Visualization and Computer Graphics, vol. 19, no. 12, pp. 2336–2345, Dec. 2013, doi: 10.1109/tvcg.2013.170.
  22. G. Anastasi, M. Conti, and M. Di Francesco, “Extending the Lifetime of Wireless Sensor Networks Through Adaptive Sleep,” IEEE Transactions on Industrial Informatics, vol. 5, no. 3, pp. 351–365, Aug. 2009, doi: 10.1109/tii.2009.2025863.
  23. H. Tang, G. Liu, X. Chen, and N. Xiong, “A Survey on Steiner Tree Construction and Global Routing for VLSI Design,” IEEE Access, vol. 8, pp. 68593–68622, 2020, doi: 10.1109/access.2020.2986138.
  24. R. A. Guerin and A. Orda, “QoS routing in networks with inaccurate information: theory and algorithms,” IEEE/ACM Transactions on Networking, vol. 7, no. 3, pp. 350–364, Jun. 1999, doi: 10.1109/90.779203.
  25. D. G. Leibovici, “Defining Spatial Entropy from Multivariate Distributions of Co-occurrences,” Spatial Information Theory, pp. 392–404, 2009, doi: 10.1007/978-3-642-03832-7_24.
  26. X. J. Luo and L. O. Oyedele, “Forecasting building energy consumption: Adaptive long-short term memory neural networks driven by genetic algorithm,” Advanced Engineering Informatics, vol. 50, p. 101357, Oct. 2021, doi: 10.1016/j.aei.2021.101357.
  27. K. Lakshmanna, N. Subramani, Y. Alotaibi, S. Alghamdi, O. I. Khalafand, and A. K. Nanda, “Improved Metaheuristic-Driven Energy-Aware Cluster-Based Routing Scheme for IoT-Assisted Wireless Sensor Networks,” Sustainability, vol. 14, no. 13, p. 7712, Jun. 2022, doi: 10.3390/su14137712.
  28. D. Bilò, L. Gualà, and G. Proietti, “A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree,” Algorithmica, vol. 73, no. 3, pp. 547–570, Jul. 2014, doi: 10.1007/s00453-014-9912-6.
  29. D. R. Godschalk, A. Rose, E. Mittler, K. Porter, and C. T. West, “Estimating the value of foresight: aggregate analysis of natural hazard mitigation benefits and costs,” Journal of Environmental Planning and Management, vol. 52, no. 6, pp. 739–756, Aug. 2009, doi: 10.1080/09640560903083715.
  30. E. L. Boone and B. P. Bullock, “Spatial correlation matrix selection using Bayesian model averaging to characterize inter-tree competition in loblolly pine trees,” Journal of Applied Statistics, vol. 35, no. 9, pp. 967–977, Aug. 2008, doi: 10.1080/02664760802185845.
  31. R.-J. Liu and J. Brookfield, “Stars, Rings and Tiers: Organisational Networks and Their Dynamics in Taiwan’s Machine Tool Industry,” Long Range Planning, vol. 33, no. 3, pp. 322–348, Jun. 2000, doi: 10.1016/s0024-6301(00)00039-x.
  32. B. Zarebavani, K. Cheshmi, B. Liu, M. M. Strout, and M. M. Dehnavi, “HDagg: Hybrid Aggregation of Loop-carried Dependence Iterations in Sparse Matrix Computations,” 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1217–1227, May 2022, doi: 10.1109/ipdps53621.2022.00121.
  33. P. Narvaez, Kai-Yeung Siu, and Hong-Yi Tzeng, “New dynamic algorithms for shortest path tree computation,” IEEE/ACM Transactions on Networking, vol. 8, no. 6, pp. 734–746, 2000, doi: 10.1109/90.893870.
  34. V. K. Quy, V. H. Nam, D. M. Linh, and L. A. Ngoc, “Routing Algorithms for MANET-IoT Networks: A Comprehensive Survey,” Wireless Personal Communications, vol. 125, no. 4, pp. 3501–3525, May 2022, doi: 10.1007/s11277-022-09722-x.
  35. M.-C. Lee and J.-P. Sheu, “An efficient routing algorithm based on segment routing in software-defined networking,” Computer Networks, vol. 103, pp. 44–55, Jul. 2016, doi: 10.1016/j.comnet.2016.03.017.
  36. S. Zou, I. Nikolaidis, and J. J. Harms, “Efficient Data Collection Trees in Sensor Networks with Redundancy Removal,” Ad-Hoc, Mobile, and Wireless Networks, pp. 252–265, 2004, doi: 10.1007/978-3-540-28634-9_20.
  37. R. Lachowski, M. Pellenz, M. Penna, E. Jamhour, and R. Souza, “An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks,” Sensors, vol. 15, no. 1, pp. 1518–1536, Jan. 2015, doi: 10.3390/s150101518.
  38. J. Wang, Y. Gao, W. Liu, A. K. Sangaiah, and H.-J. Kim, “Energy Efficient Routing Algorithm with Mobile Sink Support for Wireless Sensor Networks,” Sensors, vol. 19, no. 7, p. 1494, Mar. 2019, doi: 10.3390/s19071494.
  39. S. Azar, A. Avokh, J. Abouei, and K. N. Plataniotis, “Energy- and Delay-Efficient Algorithm for Large-Scale Data Collection in Mobile-Sink WSNs,” IEEE Sensors Journal, vol. 22, no. 7, pp. 7324–7339, Apr. 2022, doi: 10.1109/jsen.2022.3152180.
  40. P. Sreedevi and S. Venkateswarlu, “An Efficient Intra‐Cluster Data Aggregation and finding the Best Sink location in WSN using EEC‐MA‐PSOGA approach,” International Journal of Communication Systems, vol. 35, no. 8, Feb. 2022, doi: 10.1002/dac.5110.
  41. H. Al-Mahdi, M. Elshrkawey, S. Saad, and S. Abdelaziz, “An Intelligent Energy-Efficient Data Routing Scheme for Wireless Sensor Networks Utilizing Mobile Sink,” Wireless Communications and Mobile Computing, vol. 2024, pp. 1–20, Mar. 2024, doi: 10.1155/2024/7384537.
  42. Y. Xue, Y. Cui, and K. Nahrstedt, “Maximizing Lifetime for Data Aggregation in Wireless Sensor Networks,” Mobile Networks and Applications, vol. 10, no. 6, pp. 853–864, Oct. 2005, doi: 10.1007/s11036-005-4443-7.
  43. K. Akkaya, M. Demirbas, and R. S. Aygun, “The impact of data aggregation on the performance of wireless sensor networks,” Wireless Communications and Mobile Computing, vol. 8, no. 2, pp. 171–193, Sep. 2006, doi: 10.1002/wcm.454.
  44. M. Kumar, P. Mukherjee, K. Verma, S. Verma, and D. B. Rawat, “Improved Deep Convolutional Neural Network Based Malicious Node Detection and Energy-Efficient Data Transmission in Wireless Sensor Networks,” IEEE Transactions on Network Science and Engineering, vol. 9, no. 5, pp. 3272–3281, Sep. 2022, doi: 10.1109/tnse.2021.3098011.
  45. H. Artail, A. Ajami, T. Saouma, and M. Charaf, “A faulty node detection scheme for wireless sensor networks that use data aggregation for transport,” Wireless Communications and Mobile Computing, vol. 16, no. 14, pp. 1956–1971, Jan. 2016, doi: 10.1002/wcm.2661.
  46. W. Ye, J. Heidemann, and D. Estrin, “Medium Access Control With Coordinated Adaptive Sleeping for Wireless Sensor Networks,” IEEE/ACM Transactions on Networking, vol. 12, no. 3, pp. 493–506, Jun. 2004, doi: 10.1109/tnet.2004.828953.
  47. P. V. Vinh and H. Oh, “An Optimized Approach for Time-Constrained and Reliable Bursty Data Acquisition in WMSNs,” International Journal of Distributed Sensor Networks, vol. 11, no. 6, p. 826937, Jun. 2015, doi: 10.1155/2015/826937.
  48. A. Cimitile and G. Visaggio, “Software salvaging and the call dominance tree,” Journal of Systems and Software, vol. 28, no. 2, pp. 117–127, Feb. 1995, doi: 10.1016/0164-1212(94)00049-s.
  49. S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong, “TAG,” ACM SIGOPS Operating Systems Review, vol. 36, no. SI, pp. 131–146, Dec. 2002, doi: 10.1145/844128.844142.
  50. A. Brayner, A. Lopes, D. Meira, R. Vasconcelos, and R. Menezes, “An adaptive in-network aggregation operator for query processing in wireless sensor networks,” Journal of Systems and Software, vol. 81, no. 3, pp. 328–342, Mar. 2008, doi: 10.1016/j.jss.2007.06.021.
  51. C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, “Directed diffusion for wireless sensor networking,” IEEE/ACM Transactions on Networking, vol. 11, no. 1, pp. 2–16, Feb. 2003, doi: 10.1109/tnet.2002.808417.
  52. E. Shakshuki, H. Malik, and M. K. Denko, “Software agent-based directed diffusion in wireless sensor network,” Telecommunication Systems, vol. 38, no. 3–4, pp. 161–174, Apr. 2008, doi: 10.1007/s11235-008-9102-4.
  53. S. Peng and C. P. Low, “Energy neutral directed diffusion for energy harvesting wireless sensor networks,” Computer Communications, vol. 63, pp. 40–52, Jun. 2015, doi: 10.1016/j.comcom.2015.02.017.
  54. M. Chen, T. Kwon, Y. Yuan, Y. Choi, and V. C. M. Leung, “Mobile Agent-Based Directed Diffusion in Wireless Sensor Networks,” EURASIP Journal on Advances in Signal Processing, vol. 2007, no. 1, Oct. 2006, doi: 10.1155/2007/36871.
  55. Xie Meihua and Wang Zhengming, “Fingerprint Enhancement Based on Edge-Directed Diffusion,” Third International Conference on Image and Graphics (ICIG’04), pp. 274–277, doi: 10.1109/icig.2004.68.
  56. A. M. Khedr, A. Aziz, and W. Osamy, “Successors of PEGASIS protocol: A comprehensive survey,” Computer Science Review, vol. 39, p. 100368, Feb. 2021, doi: 10.1016/j.cosrev.2021.100368.
  57. V. Katiyar, N. Chand, Gopal Chand Gautam, and A. Kumar, “Improvement in LEACH protocol for large-scale wireless sensor networks,” 2011 International Conference on Emerging Trends in Electrical and Computer Technology, pp. 1070–1075, Mar. 2011, doi: 10.1109/icetect.2011.5760277.
  58. A. Al-Fuqaha, M. Guizani, M. Mohammadi, M. Aledhari, and M. Ayyash, “Internet of Things: A Survey on Enabling Technologies, Protocols, and Applications,” IEEE Communications Surveys & Tutorials, vol. 17, no. 4, pp. 2347–2376, 2015, doi: 10.1109/comst.2015.2444095.
  59. H. Jeong, M.-G. Kim, and H.-S. Park, “A Data Profile-Based Contention-Free MAC Protocol for the Patient Monitoring Systems on WBANs,” Global Trends in Computing and Communication Systems, pp. 192–201, 2012, doi: 10.1007/978-3-642-29219-4_23.
  60. S. J. Begum and T. Purusothaman, “Hierarchical Tree Structure Based Clustering Schemes for Secure Group Communication,” Mobile Networks and Applications, vol. 21, no. 3, pp. 550–560, Sep. 2015, doi: 10.1007/s11036-015-0649-5.
  61. H. M. N. D. Bandara, A. P. Jayasumana, and T. H. Illangasekare, “A Top-Down Clustering and Cluster-Tree-Based Routing Scheme for Wireless Sensor Networks,” International Journal of Distributed Sensor Networks, vol. 7, no. 1, p. 940751, Jan. 2011, doi: 10.1155/2011/940751.
  62. R. Velmani and B. Kaarthick, “An Efficient Cluster-Tree Based Data Collection Scheme for Large Mobile Wireless Sensor Networks,” IEEE Sensors Journal, vol. 15, no. 4, pp. 2377–2390, Apr. 2015, doi: 10.1109/jsen.2014.2377200.
  63. G. Chalhoub and M. Misson, “Cluster-tree based energy efficient protocol for wireless sensor networks,” 2010 International Conference on Networking, Sensing and Control (ICNSC), pp. 664–669, Apr. 2010, doi: 10.1109/icnsc.2010.5461577.
  64. M. J. Handy, M. Haase, and D. Timmermann, “Low energy adaptive clustering hierarchy with deterministic cluster-head selection,” 4th International Workshop on Mobile and Wireless Communications Network, doi: 10.1109/mwcn.2002.1045790.
  65. D. Chu, A. Deshpande, J. M. Hellerstein, and Wei Hong, “Approximate Data Collection in Sensor Networks using Probabilistic Models,” 22nd International Conference on Data Engineering (ICDE’06), pp. 48–48, 2006, doi: 10.1109/icde.2006.21.
  66. M. Bagaa, M. Younis, A. Ouadjaout, and N. Badache, “Efficient multi-path data aggregation scheduling in wireless sensor networks,” 2013 IEEE International Conference on Communications (ICC), pp. 1560–1564, Jun. 2013, doi: 10.1109/icc.2013.6654736.
  67. S. S. Sruthi and G. Geethakumari, “An Efficient Secure Data Aggregation Technique for Internet of Things Network: An Integrated Approach Using DB-MAC and Multi-path Topology,” 2016 IEEE 6th International Conference on Advanced Computing (IACC), pp. 599–603, Feb. 2016, doi: 10.1109/iacc.2016.116.
  68. D. Messina, M. Ortolani, and G. L. Re, “A Network Protocol to Enhance Robustness in Tree-Based WSNs Using Data Aggregation,” 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, pp. 1–4, Oct. 2007, doi: 10.1109/mobhoc.2007.4428635.
  69. A. Berfield, P. K. Chrysanthis, and D. Mosse, “LSynD: Localized Synopsis Diffusion,” IEEE, May 2007, doi: 10.1109/isorc.2007.41.
  70. A. P. Santhanam, B. C. Neyveli, and M. Chatterjee, “Traffic diffusion analysis for adaptive multi-path routing algorithm in sensor networks,” GLOBECOM ’05. IEEE Global Telecommunications Conference, 2005., pp. 5 pp. – 3101, 2005, doi: 10.1109/glocom.2005.1578327.
  71. V. Kulathumani, M. Nakagawa, and A. Arora, “EZ-AG: structure-free data aggregation in MANETs using push-assisted self-repelling random walks,” Journal of Internet Services and Applications, vol. 9, no. 1, Mar. 2018, doi: 10.1186/s13174-018-0077-4.
  72. M. Shi, X. Jiang, Y. Hu, L. Ling, and X. Wang, “An improved meta-heuristic algorithm for developing high-quality ReaxFF force fields of Fe/Ni transition metals and alloys,” Computational Materials Science, vol. 221, p. 112083, Mar. 2023, doi: 10.1016/j.commatsci.2023.112083.
  73. W. Culhane, K. Kogan, C. Jayalath, and P. Eugster, “Optimal communication structures for big data aggregation,” 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 1643–1651, Apr. 2015, doi: 10.1109/infocom.2015.7218544.
  74. M. Naghibi and H. Barati, “SHSDA: secure hybrid structure data aggregation method in wireless sensor networks,” Journal of Ambient Intelligence and Humanized Computing, vol. 12, no. 12, pp. 10769–10788, Jan. 2021, doi: 10.1007/s12652-020-02751-z.
  75. M. R. Baerwald and B. May, “Characterization of microsatellite loci for five members of the minnow family Cyprinidae found in the Sacramento–San Joaquin Delta and its tributaries,” Molecular Ecology Notes, vol. 4, no. 3, pp. 385–390, Jun. 2004, doi: 10.1111/j.1471-8286.2004.00661.x.
CRediT Author Statement

The authors confirm contribution to the paper as follows:

Conceptualization: Fabio Caccioli Capra and Vincenzo Anselmi; Methodology: Fabio Caccioli Capra and Vincenzo Anselmi; Data Curation: Vincenzo Anselmi; Writing-Original Draft Preparation: Vincenzo Anselmi; Visualization: Vincenzo Anselmi; Investigation: Fabio Caccioli Capra and Vincenzo Anselmi; Supervision: Vincenzo Anselmi; Validation: Fabio Caccioli Capra and Vincenzo Anselmi; Writing-Reviewing and Editing: Fabio Caccioli Capra and Vincenzo Anselmi; All authors reviewed the results and approved the final version of the manuscript.

Acknowledgements

Author(s) thanks to Dr. Vincenzo Anselmi for this research completion and support.

Funding

No funding was received to assist with the preparation of this manuscript.

Ethics Declarations

Conflict of interest

The authors have no conflicts of interest to declare that are relevant to the content of this article.

Availability of Data and Materials

Data sharing is not applicable to this article as no new data were created or analysed in this study.

Author Information

Contributions

All authors have equal contribution in the paper and all authors have read and agreed to the published version of the manuscript.

Corresponding Author



Rights and permissions

This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0).
https://creativecommons.org/licenses/by/4.0/.

This license permits unrestricted use, sharing, distribution, reproduction, and adaptation in any medium or format, including for commercial purposes, provided that appropriate credit is given to the original author(s) and the source, a link to the license is provided, and any changes made are indicated.

Copyright

© 2025 Fabio Caccioli Capra and Vincenzo Anselmi. The author(s) retain copyright of the work. The author(s) grant the Journal of Computer and Communication Networks (JCCN) and its publisher, Ansis Publications, the right of first publication and the right to identify itself as the original publisher of the article.

Cite this Article

Fabio Caccioli Capra and Vincenzo Anselmi, “Methods, Performance Bounds, and Routing Approaches for In Network Aggregation in Wireless Sensor Networks”, Journal of Computer and Communication Networks, pp. 208-221, 2025, doi: 10.64026/JCCN/2025020.

Journals
JCCN JDBIM JSSF
Policies
Publication Ethics Copyright Policy Open Access Policy Article Posting Policy Advertising Policy Privacy Policy Data Availability Policy
Ethics
Conflicts of interest/Competing interests Allegations of Misconduct Appeals Process Complaints Process Peer Review Process Authorship Criteria Terms and Conditions
Resources
Digital Preservation Ansis ManuscriptHub Contact Us
Information
Authors Editors Librarians Societies Journal News
© Ansis Publications, All Right Reserved. Designed By Ansis Publications
Home About Us Resource Contact