Optimal Partial Aggregation based Energy Delay Compromise Technique for Wireless Sensor Network

摘要

Wireless sensor networks mostly use aggregated node to collect data from sensor nodes in the network. The data aggregation process creates a major problem in normal data transmission such as energy consumption and delay. Many researchers have handled many time data aggregation problems and some aggregation functions used to aggregate multiple data into one or every data into one, which reduce energy consumption. In this paper, we propose optimal partial aggregation technique for compromise of both energy and delay. First, we compute data aggregation node in sensor networks based on the lifetime. The lifetime of sensor nodes depends on time-varying factors, such as consumed energy for sending data from leaves to aggregated node, queuing delay during aggregation, and tree depth delay. The time-varying lifetime is optimized by modified multi-fruit fly optimization algorithm and then higher lifetime nodes are selected as aggregated nodes. Second, the modified time on task (ToT) algorithm is used to minimize waiting time of aggregation delay. Third, a non-dominated sorting gravitational searching algorithm (NSGSA) is used to compute lifetime efficient routing path between source and destination via aggregated nodes. Simulations show that the proposed OPA technique improves energy and delay consumption with efficient lifetime compared with existing data aggregation techniques.