An energy-aware data aggregation scheme for grid-based wireless sensor networks

Authors:
Neng-Chung Wang;Po-Chi Yeh;Yung-Fa Huang
Affiliations:
National United University, Miao-Li, Taiwan Roc;Chaoyang University of Technology, Taichung, Taiwan Roc;Chaoyang University of Technology, Taichung, Taiwan Roc
Venue:
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Year:
2007

Citing 7
Cited 0

Location-aided routing (LAR) in mobile ad hoc networks

Wireless Networks
Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
SAFE: A Data Dissemination Protocol for Periodic Updates in Sensor Networks

ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Energy-centric enabling tecumologies for wireless sensor networks

IEEE Wireless Communications
A survey on sensor networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless sensor networks (WSNs) are made up of many small and highly sensitive nodes that have the ability to react quickly. In WSNs, sink mobility brings new challenges to large-scale sensor networks. In this paper, we propose an energy-aware data aggregation scheme (EADA) for grid-based wireless sensor networks with a mobile sink. In the proposed scheme, each sensor node with location information and limited energy is considered. Our approach utilizes location information and selects a special gateway in each area of a grid responsible for forwarding messages. We restrict the flooding region to decrease the overhead for route decision by utilizing local information. Simulation results show that the proposed routing scheme outperforms the coordination-based data dissemination scheme (CODE) [11].