Papers for

telecommunications network planners

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Auction method allocates routes in networks with limited capacity

Auction-based allocation of routes in capacity-constrained networks

Abstract: We study the route-set allocation problem between end nodes in capacity-constrained flow networks with transfer costs. We introduce an origin--destination (OD) bidding language, in which a participant bids for bounded conic combinations of inlet--outlet--quantity licences and the mechanism performs the routing through a network-flow optimising winner-determination problem. We then study payment rules for the OD mechanism. Under a restricted model with openly and uniformly priced sources and bidders who are indifferent to the source of the gas, the Vickrey--Clarke--Groves (VCG) payment is core-stable; the key structural fact is that in this regime some optimal aggregate flows never use a physical pipe in both directions, so the winner-determination problem reduces to a single-commodity network flow whose value is submodular in the set of active bidders. If source access is allowed to depend on the individual consumer -- a realistic feature, e.g. when gas deals are embedded in bilateral political bargaining -- the reduction fails and VCG payments may lie strictly outside the core. For this general model we propose a dual (nodal) pricing rule derived from the shadow prices of the flow-conservation constraints, and prove it is always core-stable, at the cost of dominant-strategy incentive compatibility. Illustrative examples accompany each result.

Wed 14 OctComputer Science and Game Theory
The gist
When networks have limited capacity and transfer costs, deciding who gets to use routes can be tricky. The authors study how to allocate these routes using auctions where participants bid for route licenses combined with amounts of flow. They show that under some conditions, a known payment system ensures stable and fair outcomes, but in more realistic cases where sources vary per user, they propose a different pricing method that guarantees stability but sacrifices some incentives. Examples illustrate their findings.
Open → 2610.20125v1

Rf exposure peaks near antenna height in building floors studied

Vertical Assessment of RF-EMF Exposure in a Building Adjacent to a Multi-Operator Shared Base Station

Abstract: This paper extends a previously published proposed approach for estimating worst-case exposure scenarios in buildings using publicly available Base Station (BS) parameters, applying it to a critical case involving a multi-operator shared site. Radiofrequency Electromagnetic Fields (RF-EMF) exposure was assessed on every floor of a 20-story building facing the site, revealing significantly higher levels near the center of the antennas' estimated vertical zone of interest, with a peak of 31.86 V/m, 23.95 times higher than the street-level peak value. However, due to uncertainties in the input parameters, measurements across all locations within the zone of interest are required to accurately identify the floor of maximum exposure. The results demonstrate the usefulness of the proposed estimation approach and highlight the need for improved methods that consider BS antenna configurations and current technical information to ensure accurate assessments of exposure to RF-EMF.

Fri 11 SeptNetworking and Internet Architecture
The gist
The paper looks at how much radio signal energy from cell towers reaches different floors of a tall building next to shared antennas. It found that some middle floors get much stronger radio signals than the ground floor, about 24 times higher in one spot. However, because some information about the antennas wasn’t exact, the authors say actual measurements are still needed to find the exact floors with the highest exposure. Their method helps estimate where exposure could be worst but also says more detailed info about antennas would improve accuracy.
Open → 2609.12783v1