A radial geometric model for density, connectivity and traffic distribution
Abstract
Area mesh networks offer alternative routing paths beyond those available in linear chains, but they also concentrate data forwarding near gateways. This paper develops the geometry based framework described in MESH2026 using area density, expected usable neighbors, radial rings and traffic aggregation. The work distinguishes geometric reachability from capacity and packet delivery. A simple eight ring example illustrates why uniformly powered relays can fail unevenly, while a gateway placement discussion identifies countermeasures including sectorization and balanced parent selection. Numerical figures are theoretical illustrations, not field observations. The study supplies a reproducible model and proposes the validation measurements required for a deployable sensor network.
Keywords: wireless mesh networks; sensor networks; area mesh gateway energy holes; analytical modeling; reliability; network design.
1 Introduction
Wireless mesh designs connect nodes using multiple wireless links and forwarding relays, but the existence of an alternate link does not by itself guarantee end to end service. Performance depends on radio quality, control traffic, source reporting rates, topology changes and gateway capacity. This study addresses one distinct subset of those coupled design concerns, using the models and engineering constraints developed in MESH2026-v07. Its findings are analytical statements with explicit assumptions rather than claims about a completed controlled deployment.
The objective is to define a technically traceable decision framework that converts the supplied study into testable engineering criteria. The manuscript draws solely on the source report and bibliographic entries present in that report. References retain the original source numbering so each item can be reconciled directly with the underlying bibliography. No new externally obtained sources are introduced.
2 Analytical Scope and Method
The method proceeds by identifying the system boundary, selecting a small number of measurable state variables, deriving a simplified relationship or comparison, and then distinguishing mathematical consequences from assumptions that require experimental verification. Conceptual drawings show component or information relationships; calculated charts visualize nominal conditions. They are not field measurements. This separation is especially important in wireless systems, where terrain, interference, retransmission policy and time synchronization can dominate apparent theoretical advantage.
Source basis: MESH2026-v07, sections 3.3, 3.4, 3.5, 4.1, 4.3. Reference numbers preserve the numbering of its chapter 7 bibliography. The analytical figures are original illustrations of stated assumptions, not experimental observations.

Figure 1. Functional architecture developed from the relevant MESH2026 concepts; schematic, not a tested implementation.
3 Density does not imply quality
Let N nodes occupy an area S. The nominal spatial density is ρ = N/S. For effective radio radius R and probability plink that a geometrically accessible pair is usable, an elementary expected neighbor count is z ≈ ρπR²plink. This relationship is a first order deployment approximation; boundaries, obstacles, antenna orientation and spatial correlations affect actual neighbor distribution. A high average z can conceal coverage holes and cannot itself prove that every sensor can reach the gateway.
More density creates potential route diversity but also more contenders and more neighbor- management overhead. For a duty cycled sensor network, local airtime and scanning can become more limiting than simple graph connectivity. The optimization target must therefore include a usable connected component, quality of the gateway paths, and per relay traffic burden. The study uses radial geometry to illustrate the resulting concentration. [1], [6].

Figure 2. Calculated or qualitative illustration of the design mechanism. Axes and assumptions are described in the main text.
4 Radial forwarding concentration
For uniform density ρ and equal ring width Δ, the expected number of nodes in radial ring k is approximately Nk = πρΔ²(2k − 1). If every node sends one report and each report crosses the inner rings, then ring k must forward traffic from itself and all rings outside it. A simple per node burden is Bk = (Σj≥k Nj)/Nk under perfect load balancing. This model ignores aggregation and local peer to peer reports but makes the geometric effect visible.
Near the gateway the inner rings contain relatively few nodes and many packets originating farther away must traverse them. An evenly distributed set of batteries thus receives very uneven charge demand. The effect is sometimes called an energy hole and can arise even while farthest nodes remain functional. Energy-aware parent selection and planned redundancy may delay it, but they cannot create extra radio capacity without changing the load distribution. [2], [71].
Table 1. Scope of the principal design comparison.
Variable Meaning Sensitivity
ρ = N/S Nominal spatial node density Area coverage
R Effective usable link radius Neighbor count and hops
Probability of a usable neighbor plink Connectivity robustness link
Nk Nodes in radial ring k Available relay population
Bk Mean relay burden per ring Near gateway energy demand
5 Gateway and parent placement alternatives
Introducing additional gateways shortens travel distance and redirects traffic across multiple inner regions. It reduces reliance on a unique central sink but requires appropriate placement and reliable inter-gateway communications. Another measure is to increase the number or battery reserve of high-load relays close to collection points. Relay role rotation spreads wear only if the network has genuine alternative radio paths and spare energy in candidates.
Node density may be varied by zone rather than uniform across the site. A higher density near a gateway can distribute load but also increases collision potential in a crowded area. Reporting intervals can be increased for low urgency data, and aggregation can reduce packets at the cost of additional latency, memory and possible information loss. These options should be compared with a common application freshness requirement. [19], [78].
6 Reliability and failure correlation
The presence of several parents does not guarantee independent fault tolerance. Links can fail together because they share vegetation exposure, a narrow physical corridor or a local interference source. A parent-ranking metric should incorporate actual packet reception quality, queue state, relay energy and switching hysteresis. The system also requires loop avoidance and a known response to a gateway outage.
Energy-aware forwarding is often evaluated by minimizing the highest current burden or maximizing the time until the first critical disconnection, rather than maximizing average node lifetime. The important metric is availability of data from the monitored region. A single overloaded inner relay can isolate a large portion of otherwise healthy sensors. This network-level objective changes both placement and lifetime optimization. [86].
Evaluation parameters
A reproducible trial should log per-node packet identifiers, generation and reception timestamps, route changes, radio retransmissions, queue age and battery current. All measurement and reporting intervals, payload formats, antenna geometry and firmware revisions should be recorded. Reliability must be reported with variation over trials, not as a single best-run percentage. A successful link in one season or installation position is not equivalent to a verified network-level service guarantee.
7 Field validation
Deployment tests should map measured RSSI, SNR where relevant, packet delivery probability, neighbor connectivity and relay charge over the actual terrain. Test at different traffic intensities and with deliberate outage of high-betweenness relays. Compare single gateway and multi gateway scenarios using the same density and data freshness targets. Store topology evolution and collect retry counts to determine whether route diversity offsets its signaling cost.
The radial model is not a forecast for irregular geography or uneven reporting. Its value lies in identifying the mechanism and the variables that must be measured. Final engineering acceptance requires application packet delivery, latency and usable battery lifetime, stratified by distance and forwarding role. [71].
8 Reproducible Experiment Design
Single versus distributed gateway trial
Install equal-density sensors in an area with one central gateway, record relay burden by annulus, then place additional gateways to distribute traffic. Keep reporting interval and total node count unchanged. Evaluate whether packet load shifts without causing new contention or unstable parent changes. Include an intentional outage of one inner relay and compare the affected geographical coverage.
All trials should state the hypothesis before measurements begin. In particular, baseline and modified networks must generate a comparable number of application messages under identical payload semantics. Time synchronization, radio configuration, antenna placement and test duration should be documented. Apply a predefined definition of a valid delivery, including how duplicate frames, acknowledgements, partial packets and expired records are treated. Report distributions and uncertainty rather than interpreting isolated examples as population-level network behavior.
The primary measurement vector is: Relay packets per node, first critical battery depletion, parent changes, spatial packet delivery and recovery time. The experiment should archive raw records and configuration files so that independent reviewers can reconstruct packet success, route depth and energy exposure. Failed configurations and unavailable nodes must remain in the results table rather than being discarded as outliers. Where an event is delayed by buffering, store both the origin timestamp and the gateway arrival timestamp to avoid falsely classifying a stale packet as timely delivery.
9 Model Sensitivity and Acceptance Criteria
A design parameter has operational meaning only relative to an application threshold. For packet delivery, an acceptable loss ratio may differ between a periodic weather reading and an emergency alarm. For latency, a median value can be misleading when occasional extreme delay is harmful. Therefore the acceptance plan should name the threshold and its aggregation level: individual node, gateway sector or whole deployment. At minimum, retain a reliability target, a maximum age for useful data, and a minimum expected autonomy for each energy role.
Sensitivity analysis should vary one major assumption at a time and then test coupled effects. Candidate variables include per-hop reception probability, reporting frequency, number of downstream children, active listening duration, gateway count and available battery capacity. An improvement observed under one parameter combination may disappear when the network is congested or when temperature reduces battery availability. The purpose of a sensitivity plot is to identify which physical measurement would most change the final design decision, not to predict field performance without evidence.
A uniform ring model is not a terrain coverage guarantee and cannot substitute for an empirical map of obstruction, connectivity and gateway reachability.
A final acceptance matrix should include four outcomes: the test condition, the expected service limit, the observed numerical result and the engineering decision. The source technical study supports the selection of variables and design mechanisms, but a numerical pass/fail result requires an actual implemented protocol and controlled measurements. The distinction prevents a model assumption from being silently promoted to verified specification.
Evaluation scenario matrix
Scenario Variable held constant Question to resolve
Same radio / payload / gateway Does the reference service meet its Nominal baseline position target?
Increased offered traffic Same node count and physical Does age or packet loss rise before a layout stated limit?
Can useful records still reach the Relay or link interruption Same sensor sample generation gateway?
Same routing and application Which role becomes the limiting Reduced energy reserve service component?
Does adaptation improve the Configuration change Same declared application goal system-level outcome?
The nominal baseline provides a necessary denominator for every claimed improvement. A second, more demanding workload should keep the number and location of devices unchanged, which helps isolate the effect of the altered report rate or route policy. The failure trial should define in advance whether losing the first packet after an outage counts as unacceptable service or whether a bounded recovery period is allowed. A device can legitimately buffer packets for later transfer, but the resulting data age must be visible in the assessment.
Energy experiments should compare the same battery assumptions and device roles. A measured reduction in the charge consumed by a leaf node may be offset by increased listening or forwarding costs in its parent. The appropriate system measure is therefore not simply the largest lifetime estimate in the network; it is the minimum acceptable service continuity across critical coverage points. Temperature, battery cutoff and intermittent backhaul availability may change which node becomes critical even when network geometry is unchanged.
Finally, sensitivity should be reported as an envelope rather than an unexplained single-number promise. State which parameters were deliberately changed, identify the origin of every numerical assumption, and preserve the complete measured distribution if physical tests are later performed. When the source provides only theoretical values, label the result a calculation or hypothesis. This audit trail makes the framework useful for deciding the next experiment and reduces the risk that an optimistic reference scenario will be mistaken for a certified operating limit.
10 Discussion
The analysis points to a recurring challenge: radio reach, packet reliability, bounded latency and energy endurance are not independently optimizable in a shared forwarding network. Improving one dimension can worsen another. Greater redundancy adds possible routes but can increase scanning or contention. More frequent reporting improves data freshness but increases relay burden. Stronger integrity protection changes frame overhead and configuration responsibilities. These effects require a scenario specific performance contract before hardware or protocol claims can be generalized.
The most defensible next step is a measured comparison with a declared baseline and pre- registered acceptance thresholds. Test design should preserve the conditions under which the mathematical assumptions are approximately valid, document deviations, and present limits as prominently as advantages. This article supplies an analytical framework suitable for subsequent empirical investigation but does not claim experimental superiority or compliance certification.
11 Conclusion
The MESH2026 material supports a structured analytical treatment of area mesh network design and mitigation of gateway adjacent energy holes. The resulting framework separates topology, traffic, radio and energy constraints, supplies scenario dependent decision criteria, and defines a path to experimental verification. The final engineering choice should be guided by the application’s maximum data age, required delivery probability, actual relay workload and maintainability under failure. Numerical examples are conditional calculations, and validation against physical deployments remains necessary.
References
[1] A. Cilfone et al., “Wireless Mesh Networking: An IoT-Oriented Perspective Survey on Relevant Technologies,” Future Internet, 11(4), 99, 2019. DOI 10.3390/fi11040099.
[2] D. Benyamina et al., “Wireless mesh networks design—A survey,” IEEE Communications Surveys & Tutorials, 14(2), 299–310, 2012. DOI 10.1109/SURV.2011.042711.00007.
[6] I. F. Akyildiz et al., “Wireless mesh networks: a survey,” Computer Networks, 47(4), 445–487, 2005. DOI 10.1016/j.comnet.2004.12.001.
[19] I. F. Akyildiz and X. Wang, “A survey on wireless mesh networks,” IEEE Communications Magazine, 43(9), S23– S30, 2005. DOI 10.1109/MCOM.2005.1509968.
[71] D. Rodenas-Herraiz et al., “Current Trends in Wireless Mesh Sensor Networks,” Sensors, 13(5), 5958–5995, 2013. DOI 10.3390/s130505958.
[78] J.-P. Vasseur et al., Routing Metrics Used for Path Calculation in Low-Power and Lossy Networks, RFC 6551, 2012. DOI 10.17487/RFC6551.
[86] P. Levis et al., The Trickle Algorithm, RFC 6206, 2011. DOI 10.17487/RFC6206.
[M] MESH2026-v07. Technical study, sections 3.3, 3.4, 3.5, 4.1, 4.3. Unpublished technical material.
Pridaj komentár