An Energy Balance-aware Event Query Algorithm based on Chinese Remainder Theorem

We discuss the use of the Chinese Remainder Theorem for a novel query scheme in wireless sensor networks. Unfixed location events and queries in wireless sensor networks have drawn tremendous attention in recent years. To achieve efficiency, high query success rate and maximizing the network lifetime, we propose an energy balance-aware event query algorithm based on Chinese Remainder Theorem. In the proposed algorithm, a sensor node only needs to care about the neighbor nodes within its communication range while not knowing the status of the entire network, and each node has a unique two-dimensional coordinate values that can be easily identified and efficiently queried. Therefore, the proposed algorithm has the characteristics as follows: less redundant data, less query energy consumption, high accuracy query quality, a longer network lifetime and ease of implementation. The simulation experiments by OMNET++ network simulator show that, compared with the classic routing algorithm, the proposed algorithm can query events quickly and effectively, while minimizing and balancing the energy consumption, and prolonging the network lifetime.