<?xml version="1.0" encoding="UTF-8"?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-karahan-nmrg-semantic-sensing-privacy-00" category="info" submissionType="IETF" version="3" xml:lang="en" tocInclude="true" sortRefs="true" symRefs="true">
  <front>
    <title abbrev="Semantic Sensing Privacy">Privacy and Network Management Considerations for Semantic Sensing Outputs in AI-Native Networks</title>
    <seriesInfo name="Internet-Draft" value="draft-karahan-nmrg-semantic-sensing-privacy-00"/>
    <author initials="S. N." surname="Karahan" fullname="S&#252;meye Nur Karahan" asciiFullname="Sumeye Nur Karahan">
      <organization abbrev="Turk Telekom Mobil" ascii="Turk Telekom Mobil A.S.">T&#252;rk Telekom Mobil A.&#350;.</organization>
      <address>
        <postal>
          <city>Ankara</city>
          <country>Turkey</country>
        </postal>
        <email>sumeyenur.karahan@turktelekom.com.tr</email>
      </address>
    </author>
    <date year="2026" month="November" day="16"/>
    <area>General</area>
    <workgroup>Network Management Research Group</workgroup>
    <keyword>semantic sensing</keyword>
    <keyword>ISAC</keyword>
    <keyword>privacy</keyword>
    <keyword>network management</keyword>
    <abstract>
      <t>Radio sensing in ISAC and AI-assisted networks produces semantic outputs such as target position, velocity, class, and identifiers. These outputs can reveal sensitive information about people who take no part in any communication service, especially when they are released repeatedly, combined across sources, or shared across administrative domains. This document describes the privacy risks of releasing such outputs and the network management functions needed to control their release: policy, enforcement at trust boundaries, consumer authorisation, accounting, and auditing. It surveys protection approaches and lists open research questions. It does not define a protocol or an algorithm.</t>
    </abstract>
  </front>
  <middle>
  <section anchor="sec-1" numbered="true" toc="default">
    <name>Introduction</name>
    <t>Networks can now infer the state of physical objects from radio observations. Integrated sensing and communication (ISAC), joint communication and sensing, and AI-assisted radio sensing can provide target detection, position, velocity, motion class, and uncertainty estimates. Applications range from cooperative transportation to industrial automation and digital representations of the physical environment.</t>
    <t>Sensing outputs differ from ordinary application data in one important way: the network may describe a person who supplied no data, has no relationship with the requesting application, and does not know that sensing takes place. A position estimate shows presence at a place. Repeated position and velocity reports can reveal trajectories and visits. Even without a name, a stable identifier, precise timestamps, or motion patterns can be enough to link reports and re-identify a person.</t>
    <t>Privacy problems can arise at every stage of the data lifecycle. Radio observations may be retained. Sensing features may be combined with other sources. AI models may derive higher-level attributes. Applications may ask for results at different levels of detail. Encrypting the transport does not decide whether an authorised recipient should get precise target information, and perturbing one position field does not protect a record whose other fields are correlated with it.</t>
    <t>Existing guidance such as <xref target="RFC6973"/> gives general principles for privacy analysis. NMRG work on AI and network management lists data privacy, heterogeneous telemetry, distributed AI, and operational integration as research concerns <xref target="I-D.irtf-nmrg-ai-challenges"/>, and the distributed AI deployment work shows why it matters where data are processed and what crosses administrative boundaries <xref target="I-D.irtf-nmrg-ai-deploy"/>. Semantic sensing is a concrete case where these concerns meet.</t>
    <t>This document therefore looks at how the disclosure of derived sensing information is managed. It does not propose a new sensing waveform or location-privacy algorithm. Its intended contribution to NMRG is the management of privacy controls across network functions, consumers, and administrative domains.</t>
    <t>Section <xref target="sec-2" format="counter"/> gives objectives, scope, and terminology. Section <xref target="sec-3" format="counter"/> describes the sensing pipeline and its privacy threats. Section <xref target="sec-4" format="counter"/> surveys protection approaches. Section <xref target="sec-5" format="counter"/> covers architecture and management functions. Section <xref target="sec-6" format="counter"/> relates the topic to NMRG work. Section <xref target="sec-7" format="counter"/> lists open research challenges, Section <xref target="sec-8" format="counter"/> gives illustrative use cases, and Sections <xref target="sec-9" format="counter"/> and <xref target="sec-10" format="counter"/> cover security and IANA considerations.</t>
  </section>
  <section anchor="sec-2" numbered="true" toc="default">
    <name>Objectives, Scope, and Terminology</name>
    <section anchor="sec-2.1" numbered="true" toc="default">
      <name>Objectives</name>
      <t>This document aims to:</t>
      <ol spacing="normal" type="(%d)">
        <li>Describe how sensitive semantic sensing outputs are, including presence, position, velocity, identifiers, confidence, and combinations of these.</li>
        <li>Describe protection options without selecting one mechanism for all applications.</li>
        <li>Identify the logical functions and management responsibilities involved in releasing sensing outputs to authorised consumers under policy.</li>
        <li>Formulate research questions on repeated disclosure, privacy accounting, inter-domain exchange, consistency of derived information, and the effect of privacy controls on application utility.</li>
      </ol>
    </section>
    <section anchor="sec-2.2" numbered="true" toc="default">
      <name>Scope and Non-Goals</name>
      <t>The scope starts with sensing observations and derived records and ends with the decision to disclose a result to a consumer. The focus is on outputs that describe individual targets or small groups in fine detail. Both network-internal consumers and external applications are considered.</t>
      <t>This document does not define a protocol, message schema, interface, management information model, cryptographic primitive, or radio measurement procedure. It does not require any particular network function to implement a privacy enforcement point. It does not provide a legal basis for processing personal data, describe how to obtain consent, or recommend a universal privacy parameter. The use cases are illustrative and are not evidence of implemented systems or measured performance.</t>
    </section>
    <section anchor="sec-2.3" numbered="true" toc="default">
      <name>Terminology</name>
      <dl spacing="normal">
        <dt>Semantic sensing output</dt>
        <dd>A structured inference or estimate about a sensed target or environment, such as position, velocity, class, confidence, detection state, or target identifier.</dd>
        <dt>Sensing producer</dt>
        <dd>A function that receives observations and produces measurements or derived outputs.</dd>
        <dt>Consumer</dt>
        <dd>An application, network management function, or other entity that requests or receives a sensing output.</dd>
        <dt>Trusted sensing domain</dt>
        <dd>A technical and administrative boundary inside which raw observations and precise outputs are accessible under trusted controls.</dd>
        <dt>Privacy Enforcement Point (PEP)</dt>
        <dd>A logical function that checks disclosure policy and may filter, aggregate, generalise, perturb, delay, or suppress outputs before they cross a trust boundary. It is unrelated to a transport-layer performance-enhancing proxy.</dd>
        <dt>Privacy policy</dt>
        <dd>Rules on permitted consumers and purposes, allowed attributes and precision, reporting frequency, retention, and release conditions.</dd>
        <dt>Linkability</dt>
        <dd>The ability to associate several observations with one target, through a persistent identifier or through statistical inference.</dd>
        <dt>Event-level protection</dt>
        <dd>A privacy property defined for a single release under stated assumptions.</dd>
        <dt>Trajectory-level protection</dt>
        <dd>A privacy property or goal for a series of related observations over a defined time window.</dd>
        <dt>Geo-indistinguishability</dt>
        <dd>A metric-based privacy property that bounds how distinguishable the outputs for two possible locations are, as a function of the distance between them <xref target="GEOIND"/>.</dd>
        <dt>Privacy accounting</dt>
        <dd>Tracking the cumulative privacy effect of related disclosures, including formal composition where a mechanism supports it.</dd>
      </dl>
    </section>
  </section>
  <section anchor="sec-3" numbered="true" toc="default">
    <name>Semantic Sensing Pipeline and Privacy Risks</name>
    <section anchor="sec-3.1" numbered="true" toc="default">
      <name>From Radio Observations to Semantic Outputs</name>
      <t>A sensing system turns raw radio observations into features, and features into an inferred physical state. Examples are channel observations, range-Doppler features, detection results, coordinates, and trajectories. AI components can combine measurements over time or across sources to add semantic detail.</t>
      <t><xref target="fig-1"/> shows a logical pipeline. It is not a protocol stack and does not imply that each function runs on a separate node.</t>
      <figure anchor="fig-1">
        <name>Controlled disclosure of semantic sensing outputs</name>
        <artwork><![CDATA[
Radio observations
       |
       v
Detection, tracking, AI processing
       |
       v
Semantic target records
       |
       v
+--------------------------+     +----------------------------+
| Privacy Enforcement      |<----| Policy, consumer           |
| Point (logical PEP)      |     | authorisation, audit       |
+------------+-------------+     +----------------------------+
             |
             | permitted output
             v
Consumers (applications, network management functions)
]]></artwork>
      </figure>
      <t>A PEP acts when outputs are delivered, but earlier controls also matter. Limiting raw-data retention and avoiding unnecessary tracking reduce exposure before any release decision is made. Where the disclosure boundary lies depends on where the producer, the trusted domain, and the consumers are deployed.</t>
    </section>
    <section anchor="sec-3.2" numbered="true" toc="default">
      <name>Attributes and Their Risks</name>
      <t>Position shows where a target was observed. Velocity and heading show motion and, with timestamps, constrain past and future positions. Target class shows whether the target is a pedestrian, a vehicle, or something else. Confidence fields show how far an observer can rely on a report. Persistent identifiers make reports easy to associate. Fields that are harmless alone can still allow re-identification or precise tracking when combined.</t>
      <t>Sensitivity depends on context. The same spatial precision may be harmless for an industrial robot in a test hall and sensitive for a pedestrian near a home. Policy therefore has to consider the subject, the purpose, the attributes released, and the disclosure context, not only spatial accuracy.</t>
    </section>
    <section anchor="sec-3.3" numbered="true" toc="default">
      <name>Threat Model</name>
      <t>The consumers considered here are authorised but honest-but-curious: they follow the rules but try to infer more than their service needs. Unauthorised recipients that obtain data through a failure of access control are also considered. A consumer may hold maps, movement models, records from other sources, or earlier releases, and may combine overlapping observations received through different applications.</t>
      <t>The relevant attacks are:</t>
      <ul spacing="normal">
        <li>Single-report inference: estimating a target's precise state from one released record.</li>
        <li>Temporal aggregation: recovering a trajectory from several noisy or coarse records.</li>
        <li>Record linkage: joining reports through identifiers, timestamps, or statistical motion association.</li>
        <li>Cross-source combination: combining precise and coarsened outputs, or outputs of different sensing systems.</li>
        <li>Inference from unchanged attributes: using velocity, class, timing, or confidence to narrow down a perturbed position.</li>
        <li>Side-channel inference: using resource allocation, radio timing, beam information, or metadata that the output transformation does not cover.</li>
        <li>Cross-domain accumulation: collecting records from administrative domains whose privacy policies are not aligned.</li>
      </ul>
      <t>A PEP can follow its policy correctly while a consumer still infers sensitive information from permitted releases. Correct policy execution and meaningful privacy protection are different properties. If a producer or PEP is compromised, output-level protection is bypassed entirely, and security measures outside any statistical release mechanism are needed (Section <xref target="sec-9" format="counter"/>).</t>
    </section>
    <section anchor="sec-3.4" numbered="true" toc="default">
      <name>Repeated Disclosure and Correlation</name>
      <t>A mechanism that works for one report can fail over many. Averaging independently perturbed measurements of a stationary target reduces the estimation error. For a moving target, temporal filtering and physical motion constraints make a series of noisy positions more informative than any single one. Linking attacks do not require a persistent identifier, although an identifier makes them easier.</t>
      <t>Privacy analysis therefore needs to state the release window, the linkability assumptions, and the side information available to the consumer. Event-level guarantees and trajectory-level goals are different and must not be used interchangeably. This matters most where continuous sensing is offered as a managed service.</t>
    </section>
  </section>
  <section anchor="sec-4" numbered="true" toc="default">
    <name>Privacy Protection Approaches</name>
    <t>No single protection covers every attribute and threat. The approaches below are complementary. They can be selected and combined according to the consumer's legitimate need, the trust boundaries, and the privacy and utility requirements.</t>
    <section anchor="sec-4.1" numbered="true" toc="default">
      <name>Data Minimisation, Aggregation, and Purpose-Limited Views</name>
      <t>An application often needs fewer fields than a sensing function produces. A traffic-density service may need regional counts rather than coordinates and identifiers. A policy can limit the fields released, coarsen the location, lower the update rate, omit stable identifiers, or suppress small groups whose members could be singled out.</t>
      <t>Aggregates such as occupancy, density, flow direction, and event counts reduce direct exposure of individual records. A purpose-limited view restricts what a consumer may request and how often.</t>
      <t>These measures are not formal guarantees. A coarse location combined with exact velocity and frequent timestamps can still allow tracking. Small populations, differencing of overlapping queries, and repeated snapshots allow inference from aggregates. Suppression can itself reveal that a target is present. Thresholds and update rules should be evaluated against realistic adversary access, and views for different consumer classes must be enforced consistently and be auditable.</t>
    </section>
    <section anchor="sec-4.2" numbered="true" toc="default">
      <name>Identifier and Lifecycle Controls</name>
      <t>Rotating or omitting identifiers makes explicit linkage harder, but a trajectory can still be linked through physical continuity, timestamps, and location. Expiry of records, retention limits, access logging, and limits on onward disclosure address other dimensions of risk. They remain useful when a formal perturbation mechanism is also used.</t>
    </section>
    <section anchor="sec-4.3" numbered="true" toc="default">
      <name>Differential Privacy and Geo-Indistinguishability</name>
      <t>Differential privacy (DP) bounds how much a mechanism's output distribution can change between adjacent inputs <xref target="DWORK06"/>. The definition of adjacency decides what is protected: add/remove-record adjacency, substitution adjacency, and metric proximity protect different things.</t>
      <t>Geo-indistinguishability adapts a DP-style guarantee to a location metric <xref target="GEOIND"/>. For a randomised mechanism M, locations x and x', an output set S, and a distance d, it requires</t>
      <artwork><![CDATA[
Pr[M(x) in S] <= exp(epsilon * d(x,x')) * Pr[M(x') in S].
]]></artwork>
      <t>A smaller epsilon gives stronger indistinguishability at a fixed distance and generally more perturbation. Epsilon has units of inverse distance when d is measured in distance units. The property constrains output distributions. It does not make estimating a location impossible.</t>
      <t>For three-dimensional Euclidean coordinates, an isotropic mechanism has a noise-vector density proportional to exp(-epsilon * ||z||_2). The direction of the noise is uniform on the sphere, and its radius follows a gamma distribution with shape 3 and rate epsilon, so the mean radius is 3/epsilon. The three coordinate components are not independent one-dimensional Laplace samples. Earlier work on three-dimensional geo-indistinguishability is in <xref target="YAN2024"/>.</t>
      <t>Choosing epsilon only from a tolerated mean error is not a sufficient policy decision. Setting epsilon = 3/A gives a mean perturbation radius of A. It does not bound the error and does not make a given inference attack weak. The calibration must also consider the full error distribution, the baseline sensing error, the adversary's side information, and the application's requirements. Unbounded noise cannot promise that every perturbation stays below a strict safety threshold.</t>
      <t>The guarantee covers only the chosen location mechanism on its input and output space. Detection state, exact velocity, stable identifiers, repeated reports, and unprotected correlated features are not covered.</t>
    </section>
    <section anchor="sec-4.4" numbered="true" toc="default">
      <name>Combinations and Selection</name>
      <t>Approaches can be combined, for example by aggregating a target set, suppressing identifiers, lowering the update rate, and perturbing coordinates where individual locations must still be released. Such a chain does not automatically give an end-to-end guarantee. The adversary's access to original and derived outputs must be specified first. Mechanisms should be compared on the protected subject or event, the formal guarantee or policy goal, utility, computational cost, update rate, and operational constraints.</t>
      <t>A privacy management function could offer an approved set of release profiles instead of exposing raw parameters to consumers. A profile might fix the allowed fields, spatial granularity, maximum sampling rate, retention policy, and accounting method. A common representation of such profiles is a research question, not something defined here.</t>
    </section>
  </section>
  <section anchor="sec-5" numbered="true" toc="default">
    <name>Architectural and Network Management Considerations</name>
    <section anchor="sec-5.1" numbered="true" toc="default">
      <name>Privacy Enforcement as a Logical Responsibility</name>
      <t>A PEP is not necessarily a separate device or protocol endpoint. It is a logical function at the boundary where data leave a trusted domain. It can check authorisation and purpose, build the permitted view, apply an approved transformation, record the release, and deliver or reject the request. It cannot protect against information that the same consumer obtains through another route.</t>
      <t>The architecture should say who defines policy, who evaluates it, who applies transformations, and who audits decisions. A small deployment may combine these roles; a large one may separate them. A PEP late in the pipeline protects downstream consumers but not exposure inside the pipeline, so trust assumptions and data-flow visibility should be explicit.</t>
    </section>
    <section anchor="sec-5.2" numbered="true" toc="default">
      <name>Centralised, Edge-Based, and Cross-Domain Placement</name>
      <t>In a centralised arrangement, precise outputs go to a trusted service that applies privacy controls before publishing. This simplifies consistent enforcement but enlarges the trusted collection domain and may add communication cost and latency. In an edge-based arrangement, filtering or perturbation happens near the producer and only approved outputs travel onward. This reduces the movement of precise data but requires consistent distribution of policy to many enforcement points. A cross-domain arrangement adds a second administrative domain with its own policy.</t>
      <t><xref target="fig-2"/> shows the three arrangements. Arrows show possible disclosure paths, not a required protocol or a 3GPP functional mapping.</t>
      <figure anchor="fig-2">
        <name>Alternative placements of disclosure controls</name>
        <artwork><![CDATA[
(a) Centralised            (b) Edge-based

Sensing sites              Site A         Site B
     |                       |              |
     v                       v              v
Trusted collector          PEP A          PEP B
     |                       |              |
     v                       +------+-------+
Central PEP                         |
     |                              v
     v                         Consumers
Consumers

(c) Cross-domain

Domain A                          Domain B
+------------------+              +------------------+
| Sensing + PEP A  |------------->| Policy gateway / |
| Local policy A   | protected    | release controls |
+------------------+ output       | Local policy B   |
                                  +--------+---------+
                                           |
                                           v
                                     Consumers B
]]></artwork>
      </figure>
      <t>Deployments can mix these arrangements. The key question is whether sensitive or precise outputs cross a boundary before the relevant policy is applied, and whether a consumer can tell what the received data mean and what their limits are.</t>
    </section>
    <section anchor="sec-5.3" numbered="true" toc="default">
      <name>Consumer Authorisation and Purpose</name>
      <t>Access control has to address more than whether a consumer may receive any data. The same consumer may be allowed regional occupancy but not individual trajectories. The authorisation context can include identity, declared purpose, role, area, period, output attributes, precision, and update rate. Limits on onward sharing and retention should be part of it where they can be enforced.</t>
      <t>Consumer classes need different output products. A traffic planner can usually work with aggregate flows, while an operational controller may need timely state information. Such differences are not blanket permission to release exact personal data. Access needs and lawful authority must be assessed separately.</t>
    </section>
    <section anchor="sec-5.4" numbered="true" toc="default">
      <name>Policy Distribution and Lifecycle</name>
      <t>An operator may run many PEP instances for different sensing sites, edge clusters, or applications. Policies must be distributed, versioned, checked for conflicts, and updated when authorisations or service requirements change. A PEP needs a defined response to missing, expired, or inconsistent policy, such as withholding detail, returning a lower-precision view, or escalating. This document does not specify one fallback for all cases.</t>
      <t>Updates to models or sensing functions can change the accuracy or content of outputs and so require reassessment of release profiles. A management workflow should tie model lifecycle changes to policy validation and monitoring. This matches the NMRG concern with integrating AI into existing management procedures <xref target="I-D.irtf-nmrg-ai-challenges"/>.</t>
    </section>
    <section anchor="sec-5.5" numbered="true" toc="default">
      <name>Disclosure Accounting and Multiple Consumers</name>
      <t>One consumer may receive a sequence of reports, and several consumers may request overlapping views of the same target. If noise is applied independently per request and the reports are collated, more is revealed than intended. Accounting should distinguish independent observations, repeated releases of the same information, and releases to separate but possibly colluding recipients.</t>
      <t>A formal privacy budget has meaning only for a specified mechanism, adjacency relation, and composition model. Rate limits and caps on the number of authorised views are policy limits, not formal DP budgets. The management question is how an operator can assess cumulative disclosure without keeping sensitive identifiers longer than needed, and without letting the accounting system become a tracking tool.</t>
    </section>
    <section anchor="sec-5.6" numbered="true" toc="default">
      <name>Metadata, Observability, and Auditing</name>
      <t>Consumers may need metadata on units, coordinate reference system, timestamp precision, quality indicators, permitted use, and whether the released state has been altered. Revealing that a mechanism is used, and its settings, does not by itself weaken a properly defined DP guarantee, but excess metadata can reveal protected information through correlation. Metadata minimisation and quality-of-information reporting need to be assessed together.</t>
      <t>Observability can record the policy version, the consumer, the output category, the enforcement status, and aggregate counters. Audit logs should not by default contain unperturbed target records. Retention periods, log granularity, access restrictions, and deletion procedures are deployment decisions. An audit trail shows that a rule was applied. It does not show that the rule gives enough privacy.</t>
    </section>
    <section anchor="sec-5.7" numbered="true" toc="default">
      <name>Cross-Domain Policy Coordination</name>
      <t>Domains differ in trust, purpose, retention rules, and protection methods. One domain may supply coarse occupancy while another supplies target-level records, and combining them can defeat the assumptions under which each was released. A domain boundary therefore calls for a new policy evaluation and for a description of the assumptions that travel with a dataset.</t>
      <t>Research is needed on finding compatible release policies and on accounting for disclosures across domains without assuming one global trusted operator. Intent and policy mechanisms in network management <xref target="RFC9315"/> are a possible conceptual basis. This document does not map to any management protocol.</t>
    </section>
    <section anchor="sec-5.8" numbered="true" toc="default">
      <name>Utility and Operational Constraints</name>
      <t>Sensing is often requested to support actions, not just to publish data. More uncertainty or a lower reporting rate can degrade target association, collision warning, equipment monitoring, or control quality. Policy should separate safety-critical real-time consumers from analysis applications that can accept coarse or delayed data. Being safety-critical does not by itself entitle a consumer to unrestricted data.</t>
      <t>A privacy-aware service may have to represent both sensing uncertainty and privacy-induced uncertainty. These do not simply add as scalars; covariance, nonlinear tracking, and the downstream estimator may matter. Where hard accuracy or timing requirements exist, independent unbounded perturbation may be unsuitable without separate error handling, risk assessment, or a different privacy strategy.</t>
    </section>
  </section>
  <section anchor="sec-6" numbered="true" toc="default">
    <name>Relationship to NMRG Work on AI and Network Management</name>
    <t>The NMRG study of AI and network management identifies challenges in data representation and privacy, distributed computation, operational integration, trust in AI outputs, and automation <xref target="I-D.irtf-nmrg-ai-challenges"/>. The distributed AI deployment draft examines how placement across local, edge, and cloud resources affects how information is handled <xref target="I-D.irtf-nmrg-ai-deploy"/>. Semantic sensing privacy adds a related management problem: how to govern the release of AI-derived information about physical targets across those environments. Neither document addresses radio sensing or ISAC specifically. This document does not extend their scope; it takes semantic sensing outputs as one concrete case of the privacy and data-handling concerns they raise.</t>
    <t>These documents have the following points of contact with this one:</t>
    <ul spacing="normal">
      <li>Data heterogeneity: output schemas, accuracy metadata, and target attributes differ by sensing technology, which makes a consistent privacy policy hard to write.</li>
      <li>Distributed execution: inference and enforcement can run in different places, which creates trust-boundary and policy-coordination problems.</li>
      <li>Real-time constraints: privacy transformations change data quality at operating timescales.</li>
      <li>Operational integration: operators need policy lifecycle management, observability, auditing, and procedures for model changes.</li>
      <li>Cost: local enforcement reduces movement of sensitive data but adds processing and management overhead.</li>
    </ul>
    <t>None of this implies that the existing NMRG documents already solve semantic sensing privacy. A useful research outcome would be a common description of the disclosure problem: what must be protected, what a consumer legitimately needs, which controls are applied, and what remains exposed.</t>
  </section>
  <section anchor="sec-7" numbered="true" toc="default">
    <name>Open Research Challenges</name>
    <section anchor="sec-7.1" numbered="true" toc="default">
      <name>Protected Subject and Adjacency</name>
      <t>A formal privacy statement must say whether it protects target presence, a single position, a whole trajectory, a person's participation, or a group. Each goal needs its own definition of neighbouring inputs and probably its own mechanism. The definitions must allow for sensing errors, missed detections, and targets appearing and disappearing.</t>
    </section>
    <section anchor="sec-7.2" numbered="true" toc="default">
      <name>Joint Position and Motion Disclosure</name>
      <t>Position and velocity are linked by physical dynamics. Perturbing position while sending exact velocity weakens location protection. Perturbing both independently can create inconsistent or physically impossible trajectories. Joint release methods are needed with explicit guarantees and explicit utility.</t>
    </section>
    <section anchor="sec-7.3" numbered="true" toc="default">
      <name>Repeated Reports and Composition</name>
      <t>An event-level mechanism does not give trajectory-level privacy. Open questions include how to allocate disclosure across sampling times, how to handle long-lived targets, and whether temporal structure can be preserved without allowing averaging or filtering attacks. Prior information and tracking dynamics should be part of the evaluation.</t>
    </section>
    <section anchor="sec-7.4" numbered="true" toc="default">
      <name>Identifier Management and Cross-Source Linkage</name>
      <t>Rotating identifiers limits direct linkage but cannot remove association through motion and context. A deployment may receive outputs from overlapping radio sensors, cameras, and network management applications. Cross-source correlation and authorised data fusion belong in the privacy analysis as normal cases.</t>
    </section>
    <section anchor="sec-7.5" numbered="true" toc="default">
      <name>Common Release-Policy Descriptions</name>
      <t>A shared vocabulary for consumers, purposes, protected attributes, precision, frequency, retention, and transformation profiles could let heterogeneous systems interpret policy consistently. It is not clear which parts can be expressed independently of the sensing technology and which need domain-specific detail. This document proposes no wire encoding.</t>
    </section>
    <section anchor="sec-7.6" numbered="true" toc="default">
      <name>Cross-Domain Accounting and Enforcement</name>
      <t>Several domains may apply different controls to overlapping data. Open questions include policy conflicts, accounting for combined releases, auditing without excessive retention, and which constraints can be checked locally and which need coordination.</t>
    </section>
    <section anchor="sec-7.7" numbered="true" toc="default">
      <name>Privacy-Aware Quality-of-Information Reporting</name>
      <t>Applications need enough information to judge output quality. The uncertainty of a private location includes sensing error and protection-induced error, but detailed metadata or repeated confidence updates can leak information. Research should determine which uncertainty and quality indicators can be shared safely and usefully.</t>
    </section>
    <section anchor="sec-7.8" numbered="true" toc="default">
      <name>Empirical Evaluation and Reproducibility</name>
      <t>Mechanisms should be compared under realistic reporting rates, target densities, sensing uncertainty, mobility, map constraints, and colluding consumers. Useful metrics include re-identification and tracking success, quality of aggregate statistics, localisation error distributions, application task performance, computational overhead, and enforcement failures. Simulations and synthetic trajectories support reproducibility. Public release of real sensing records needs its own privacy assessment.</t>
    </section>
  </section>
  <section anchor="sec-8" numbered="true" toc="default">
    <name>Illustrative Use Cases</name>
    <section anchor="sec-8.1" numbered="true" toc="default">
      <name>Cooperative Transportation and Road-Side Sensing</name>
      <t>Road-side units detect moving objects and derive position, direction, and motion state. A road-operations application may need only counts or flows, while a cooperative safety application needs timely detail. The management problem is to give each consumer a view that fits its purpose, without routinely exposing precise, linkable pedestrian or vehicle trajectories to all of them.</t>
      <t>An edge PEP can publish aggregate flows for planning and a separate authorised state view for safety processing. The management system must specify which consumers get which fields, how often, and under what conditions. An evaluation should test whether removing identifiers and reducing precision really reduces linkage when external road maps and repeated reports are available.</t>
    </section>
    <section anchor="sec-8.2" numbered="true" toc="default">
      <name>Industrial and Campus Sensing</name>
      <t>Factories and campuses can use radio sensing for asset monitoring, occupancy, and safety awareness. Staff, visitors, and equipment share the space, and several administrative or application domains may be involved. A production-monitoring application may need machine occupancy or movement events but not identifiable worker trajectories.</t>
      <t>Controls near the producer can release aggregated occupancy or event alerts to wider IT systems and keep target-level data in a restricted domain. The example shows the need for policy differentiation, retention rules, auditing, and attention to site safety. Technical perturbation does not settle employment or legal privacy obligations.</t>
    </section>
    <section anchor="sec-8.3" numbered="true" toc="default">
      <name>AI-Assisted Network Management and Digital Representations</name>
      <t>AI-assisted management can combine network telemetry with environmental observations to understand service conditions or simulate network responses. A management function may benefit from regional mobility trends or occupancy estimates without needing individual target histories. Network digital twins and planning tools may take in sensing-derived features alongside topology and performance data.</t>
      <t>A privacy-aware interface can limit releases to what planning needs, while a separate trusted operational context handles any justified finer-grained state. AI models can infer sensitive properties from apparently coarse features, so evaluations must consider the combined input and accumulated history of the management application. This case most directly links semantic sensing privacy to NMRG's AI and network management work.</t>
    </section>
  </section>
  <section anchor="sec-9" numbered="true" toc="default">
    <name>Security Considerations</name>
    <t>This document describes a privacy-management problem and introduces no protocol. Deployments of disclosure controls still need security properties that keep the assumptions of the privacy analysis valid.</t>
    <ul spacing="normal">
      <li>Trusted sensing domain: Producers, storage, and enforcement functions may hold precise measurements. Authentication, least privilege, access control, integrity protection, and restricted storage are needed so that release controls cannot be bypassed. Output perturbation cannot repair a leak of the original data.</li>
      <li>Authorisation and policy integrity: A consumer must not be able to obtain more precise output by misstating its role or purpose or by exploiting inconsistent policies. Policy updates and versions should be authenticated and auditable. Stale or faulty policy can cause unintended disclosure.</li>
      <li>Repeated and multi-consumer releases: Permitted outputs can add up to a trajectory, and colluding consumers can pool independent releases. Per-request authorisation alone does not account for cumulative risk (Sections <xref target="sec-3.4" format="counter"/> and <xref target="sec-5.5" format="counter"/>).</li>
      <li>Model and inference integrity: Manipulated sensing models or inputs can change outputs and privacy classifications. Changes in detection accuracy, association, or output semantics can invalidate privacy assumptions even when the PEP works correctly.</li>
      <li>Metadata and side channels: Timestamps, identifiers, power estimates, beam information, and packet metadata can reveal information that a location transformation does not protect. Location protection should not be described as end-to-end privacy for a sensing system without evaluating these channels.</li>
      <li>Availability and safety: Excessive processing, denial of service, or inappropriate suppression of reports can impair dependent applications. Safety-critical deployments need their own safety analysis.</li>
      <li>Privacy of management functions: Audit logs, accounting records, and policy evaluation traces can contain sensitive target or consumer information. They need minimisation, access control, and limited retention, so that the privacy control plane does not become a store of individual trajectories.</li>
    </ul>
    <t>These considerations should be read together with general Internet privacy guidance <xref target="RFC6973"/>. They do not replace jurisdiction-specific data protection requirements.</t>
  </section>
  <section anchor="sec-10" numbered="true" toc="default">
    <name>IANA Considerations</name>
    <t>This document has no IANA actions.</t>
  </section>
  </middle>
  <back>
    <references>
      <name>Informative References</name>
      <reference anchor="DWORK06" target="https://doi.org/10.1007/11681878_14">
        <front>
          <title>Calibrating Noise to Sensitivity in Private Data Analysis</title>
          <author initials="C." surname="Dwork" fullname="Cynthia Dwork"/>
          <author initials="F." surname="McSherry" fullname="Frank McSherry"/>
          <author initials="K." surname="Nissim" fullname="Kobbi Nissim"/>
          <author initials="A." surname="Smith" fullname="Adam Smith"/>
          <date year="2006"/>
        </front>
        <refcontent>Proceedings of TCC 2006</refcontent>
        <seriesInfo name="DOI" value="10.1007/11681878_14"/>
      </reference>
      <reference anchor="GEOIND" target="https://doi.org/10.1145/2508859.2516735">
        <front>
          <title>Geo-Indistinguishability: Differential Privacy for Location-Based Systems</title>
          <author initials="M. E." surname="Andr&#233;s" fullname="Miguel E. Andr&#233;s"></author>
          <author initials="N. E." surname="Bordenabe" fullname="Nicol&#225;s E. Bordenabe"/>
          <author initials="K." surname="Chatzikokolakis" fullname="Konstantinos Chatzikokolakis"/>
          <author initials="C." surname="Palamidessi" fullname="Catuscia Palamidessi"/>
          <date year="2013"/>
        </front>
        <refcontent>ACM CCS 2013</refcontent>
        <seriesInfo name="DOI" value="10.1145/2508859.2516735"/>
      </reference>
      <reference anchor="YAN2024" target="https://doi.org/10.1002/cpe.8111">
        <front>
          <title>Towards achieving geo-indistinguishability for 3D GPS location: A 3D Laplace mechanism approach</title>
          <author initials="Y." surname="Yan" fullname="Yan Yan"/>
          <author initials="P." surname="Yan" fullname="Pengbin Yan"/>
          <author initials="A." surname="Mahmood" fullname="Adnan Mahmood"/>
          <author initials="F." surname="Xu" fullname="Fang Xu"/>
          <author initials="Q. Z." surname="Sheng" fullname="Quan Z. Sheng"/>
          <date year="2024"/>
        </front>
        <refcontent>Concurrency and Computation: Practice and Experience, Vol. 36, No. 14, e8111</refcontent>
        <seriesInfo name="DOI" value="10.1002/cpe.8111"/>
      </reference>
      <reference anchor="RFC6973" target="https://www.rfc-editor.org/info/rfc6973">
        <front>
          <title>Privacy Considerations for Internet Protocols</title>
          <author initials="A." surname="Cooper" fullname="A. Cooper"/>
          <author initials="H." surname="Tschofenig" fullname="H. Tschofenig"/>
          <author initials="B." surname="Aboba" fullname="B. Aboba"/>
          <author initials="J." surname="Peterson" fullname="J. Peterson"/>
          <author initials="J." surname="Morris" fullname="J. Morris"/>
          <author initials="M." surname="Hansen" fullname="M. Hansen"/>
          <author initials="R." surname="Smith" fullname="R. Smith"/>
          <date month="July" year="2013"/>
        </front>
        <seriesInfo name="RFC" value="6973"/>
        <seriesInfo name="DOI" value="10.17487/RFC6973"/>
      </reference>
      <reference anchor="RFC9315" target="https://www.rfc-editor.org/info/rfc9315">
        <front>
          <title>Intent-Based Networking - Concepts and Definitions</title>
          <author initials="A." surname="Clemm" fullname="A. Clemm"/>
          <author initials="L." surname="Ciavaglia" fullname="L. Ciavaglia"/>
          <author initials="L. Z." surname="Granville" fullname="L. Z. Granville"/>
          <author initials="J." surname="Tantsura" fullname="J. Tantsura"/>
          <date month="October" year="2022"/>
        </front>
        <seriesInfo name="RFC" value="9315"/>
        <seriesInfo name="DOI" value="10.17487/RFC9315"/>
      </reference>
      <reference anchor="I-D.irtf-nmrg-ai-challenges" target="https://datatracker.ietf.org/doc/html/draft-irtf-nmrg-ai-challenges-06">
        <front>
          <title>Research Challenges in Coupling Artificial Intelligence and Network Management</title>
          <author initials="J." surname="Fran&#231;ois" fullname="J. Fran&#231;ois"/>
          <author initials="A." surname="Clemm" fullname="A. Clemm"/>
          <author initials="D." surname="Papadimitriou" fullname="D. Papadimitriou"/>
          <author initials="S." surname="Fernandes" fullname="S. Fernandes"/>
          <author initials="S." surname="Schneider" fullname="S. Schneider"/>
          <date month="July" day="6" year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-irtf-nmrg-ai-challenges-06"/>
      </reference>
      <reference anchor="I-D.irtf-nmrg-ai-deploy" target="https://datatracker.ietf.org/doc/html/draft-irtf-nmrg-ai-deploy-04">
        <front>
          <title>Considerations of network/system for AI services</title>
          <author initials="Y." surname="Hong" fullname="Y-G. Hong"/>
          <author initials="J." surname="Youn" fullname="J-S. Youn"/>
          <author initials="S." surname="Hong" fullname="S-W. Hong"/>
          <author initials="P." surname="Martinez-Julia" fullname="P. Martinez-Julia"/>
          <author initials="Q." surname="Wu" fullname="Q. Wu"/>
          <date month="November" day="2" year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-irtf-nmrg-ai-deploy-04"/>
      </reference>
    </references>
  </back>
</rfc>
