Aggregation Efficiency-Aware Greedy Incremental Tree Routing for Wireless Sensor Networks

• MIKAMI Shinji

  Graduate School of Natural Science and Technology, Kanazawa University

• AONISHI Takafumi

  Graduate School of Science and Technology, Kobe University

• YOSHINO Hironori

  Graduate School of Science and Technology, Kobe University

• OHTA Chikara

  Faculty of Engineering, Kobe University

• KAWAGUCHI Hiroshi

  Faculty of Engineering, Kobe University

• YOSHIMOTO Masahiko

  Faculty of Engineering, Kobe University

Abstract

In most research work for sensor network routings, perfect aggregation has been assumed. Such an assumption might limit the application of the wireless sensor networks. We address the impact of aggregation efficiency on energy consumption in the context of GIT routing. Our questions are how the most efficient aggregation point changes according to aggregation efficiency and the extent to which energy consumption can decrease compared to the original GIT routing and opportunistic routing. To answer these questions, we analyze a two-source model, which yields results that lend insight into the impact of aggregation efficiency. Based on analytical results, we propose an improved GIT: "aggregation efficiency-aware GIT," or ALIT. We also consider a suppression scheme for exploratory messages: "hop exploratory." Our simulation results show that the AGIT routing saves the energy consumption of the data transmission compared to the original GIT routing and opportunistic routing.

Journal

• IEICE transactions on communications

  IEICE transactions on communications 89 (9), 2741-2751, 2006-09-01

  The Institute of Electronics, Information and Communication Engineers

Keywords

• sensor networks
• aggregation efficiency
• greedy incremental tree routing

Details

• CRID: 1573950402335667584
• NII Article ID: 110007538133
• NII Book ID: AA10826261
• ISSN: 09168516
• Text Lang: en
• Data Source:
  • CiNii Articles