Neighbourhood watch is a concept that allows a community to distribute a complex security task in between all members. Members of the community carry out individual security tasks to contribute to the overall security of it. It reduces the workload of a particular individual while securing all members and allowing them to carry out a multitude of security tasks. Wireless sensor networks (WSNs) are composed of resource-constraint independent battery driven computers as nodes communicating wirelessly. Security in WSNs is essential. Without sufficient security, an attacker is able to eavesdrop the communication, tamper monitoring results or deny critical nodes providing their service in a way to cut off larger network parts. The resource-constraint nature of sensor nodes prevents them from running full-fledged security protocols. Instead, it is necessary to assess the most significant security threats and implement specialised protocols. A neighbourhood-watch inspired distributed security scheme for WSNs has been introduced by Langend\"orfer. Its goal is to increase the variety of attacks a WSN can fend off. A framework of such complexity has to be designed in multiple steps. Here, we introduce an approach to determine distributions of security means on large-scale static homogeneous WSNs. Therefore, we model WSNs as undirected graphs in which two nodes connected iff they are in transmission range. The framework aims to partition the graph into $n$ distinct security means resulting in the targeted distribution. The underlying problems turn out to be NP hard and we attempt to solve them using linear programs (LPs). To evaluate the computability of the LPs, we generate large numbers of random {\lambda}-precision unit disk graphs (UDGs) as representation of WSNs. For this purpose, we introduce a novel {\lambda}-precision UDG generator to model WSNs with a minimal distance in between nodes.

翻译：邻里守望是一种允许社区在全体成员间分配复杂安全任务的概念。社区成员各自执行独立的安全任务，共同维护整体安全。这种方式减轻了个体的工作负荷，同时保障所有成员的安全，并使其能够承担多项安全任务。无线传感器网络（WSN）由资源受限的独立电池驱动计算机节点组成，节点间通过无线方式通信。WSN的安全性至关重要。缺乏足够的安全防护时，攻击者能够窃听通信、篡改监测结果，或通过拒绝关键节点的服务来切断较大范围的网络连接。传感器节点的资源受限特性使其无法运行完整的安全协议。因此，必须评估最重大的安全威胁并实施专门协议。Langendörfer提出了一种受邻里守望启发的WSN分布式安全方案，其目标是提升WSN抵御攻击种类的多样性。此类复杂框架需分步骤设计。本文提出一种方法，用于确定大规模静态同构WSN中安全手段的分布。为此，我们将WSN建模为无向图，当且仅当两节点处于传输范围内时存在连接。该框架旨在将图划分为$n$种不同的安全手段，从而实现目标分布。底层问题被证实为NP困难问题，我们尝试使用线性规划（LP）求解。为评估LP的可计算性，我们生成大量随机${\lambda}$精度单位圆盘图（UDG）作为WSN的表示。为此，我们引入一种新型${\lambda}$精度UDG生成器，以模拟节点间存在最小距离的WSN。