Radio Frequency Identification (RFID) plays a key role in the Internet of things (IoT). The type of scenario that needs to use many readers to cover a large area is a dense RFID environment scenario. In supply-chain management, companies such as Wal-Mart use dense RFID reader systems to track products [1]. Collisions usually happen in dense RFID reader systems, which reduce the number of tags that can be read by the system. Many algorithms were designed to eliminate the collisions in a dense RFID environment. A Maximum-Weight-Independent-Set-Based Algorithm (MWISBA) [2] is used to solve the dense RFID readers' arrangement uses a graph-based algorithm to get the MWIS. However, MWISBA does not consider interference range, it can only avoid reader-to-tag collisions. Based on MWISBA, an improved algorithm called MWISBAII [3] can avoid both reader-to-tag collisions and reader-to-reader collisions. However, both MWISBA and MWISBAII are centralized algorithms. In this paper, we propose a distributed realization of MWISBAII. In our distributed algorithm, each reader can communicate with other neighbor readers to share and collect information; making the local decision afterwards. The experimental results show that our distributed algorithm can get almost the same performance as the MWISBAII.