Wireless Sensor Networks are widely used nowadays to support the decision-makers in different applications by monitoring and collecting the environmental parameters in specific areas. Sensors are deployed in such areas either randomly or formally. In a high-density Wireless Sensor Network, several sensors are randomly deployed in a small area. This will make the adjacent sensors collect same data and send them to the sink, which will increase the power consumption in those sensors. Adjacent sensors are considered critical because of their effect on the network performance. In this paper, the effect of the adjacent sensors is minimized because of the above-mentioned criticality and performance influence of these sensors. The proposed mechanism is evaluated by using MATLAB simulator and is then compared with the low-energy adaptive clustering hierarchy (LEACH) protocol. Results prove that the proposed mechanism outperforms the LEACH protocol by 21% in terms of the network lifetime and by 18% in terms of the number of the transmitted packets to the cluster heads and reduces the number of the transmitted packets to the base station by approximately 3% by avoiding the duplicated packets.

中文翻译：

---

一种基于相邻传感器的新型机制，可提高无线传感器网络的性能

如今，无线传感器网络通过监视和收集特定区域中的环境参数，在不同应用中为决策者提供支持。传感器随机或正式部署在此类区域。在高密度无线传感器网络中，几个传感器随机部署在一个较小的区域中。这将使相邻的传感器收集相同的数据并将其发送到接收器，这将增加这些传感器的功耗。相邻的传感器由于对网络性能的影响而被认为是至关重要的。在本文中，由于这些传感器的上述关键性和性能影响，使得相邻传感器的影响最小化。通过使用MATLAB模拟器对提出的机制进行了评估，然后将其与低能耗自适应聚类层次结构（LEACH）协议进行了比较。结果证明，所提出的机制在网络生命周期方面优于LEACH协议，在向簇头发送的数据包数量方面比LEACH协议高18％，并且向基站发送的数据包数量减少了大约22％。避免重复的数据包占3％。