| Summary: | 碩士 === 逢甲大學 === 資訊工程學系 === 101 === In wireless sensor networks (WSNs), mobile agent-based data collection schemes have been proven to be superior, in terms of data transmission latency and network energy consumption, to the counterparts were performed with traditional client/server architectures. However, most of previous related researches always focused on how to find out one or more energy-efficient paths to transmit, instead ignore the data transmission delay caused by a large amount of data processing. As a consequence, they were not very suitable for real-time applications.
In this paper, we thus propose two energy- and time-efficient mobile agent-based data collection schemes, totally termed as MMADCS (Multiple Mobile Agent based Data Collection Scheme). Based on multiple minimum cost itinerary trees, MMADCS further prunes these trees to distribute the workloads processed between them as evenly as possible, and thus balances node energy consumption and prolongs network lifetime. In addition, for performing simultaneous data collection, MA-broadcasting method is also used to reduce overall transmission delay. We implement two protocols with MMADCS: they are CB-MMADCS and F-MMADCS. The CB-MMADCS builds cluster-based trees first and prunes them. With the contributions of clustering on parallel data aggregation and energy conservation, it can achieve a low transmission delay and energy cost. While, F-MMADCS directly builds trees in traditional flat networks, and prunes them to reach the requirements of energy and time savings.
To validate our proposed CB-MMADCS and F-MMADCS schemes, several simulations have been conducted under different environments with various numbers of nodes. We also compare the results with that of existing counterparts. Simulation results show that both the proposed CB-MMADCS and F-MMADCS schemes significantly outperform some previous schemes, in the aspects of overall transmission delay, network energy consumption, and EDP (Energy Delay Product) cost.
|
|---|
