We propose \emph{PRISM} (\textbf{Pseudorandom Residue-based Indexed Scheduling Method}), a deterministic topology-discovery framework for single-hop wireless networks with bounded interference. Each receiver has at most \(L\) interfering transmitters among \(K\) transmitters and identifies them through singleton transmissions. PRISM assigns finite-field labels to transmitters and schedules transmissions via modular multiplication and a second prime modulus. It achieves full discovery in \(O(L(1+δ)\log K)\) rounds in expectation with failure probability \(K^{-δ}\), and in \(O(L^2\log K)\) rounds deterministically. Simulations show \(\approx 0.9L\log K\) scaling, with \(q/L\approx1.2\) minimizing mean completion time and \(q/L\approx1.4\text{--}1.6\) improving tail performance.

翻译：我们提出PRISM（伪随机余数索引调度方法），一种用于有界干扰单跳无线网络的确定性拓扑发现框架。每个接收器在K个发送器中最多有L个干扰发送器，并通过单例传输识别这些干扰源。PRISM为发送器分配有限域标签，并通过模乘和第二素数模调度传输。该方法以期望O(L(1+δ)log K)轮次（失败概率为K^{-δ}）实现完全发现，且确定性复杂度为O(L^2 log K)。仿真结果显示约0.9L log K的扩展性，其中q/L≈1.2可最小化平均完成时间，而q/L≈1.4-1.6可改善尾部性能。