On supporting obstacle-free and sharing tree for information collection in WSNs

Authors:
Chih-Yung Chang;Yu-Chieh Chen;Sheng-Wen Chang;Shih-Chun Kuo
Affiliations:
Tamkang University, Taiwan;Tamkang University, Taiwan;Tamkang University, Taiwan;Tamkang University, Taiwan
Venue:
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Year:
2008

Citing 7
Cited 0

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
A dynamic core based multicast routing protocol for ad hoc wireless networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Obstacle-free geocasting protocols for single/multi-destination short message services in ad hoc networks

Wireless Networks
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Impact of Network Density on Data Aggregation in Wireless Sensor Networks

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Demand-scalable geographic multicasting in wireless sensor networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constructing a share tree from sink node to a group of data source nodes can explore the potential of data aggregation in wireless sensor networks (WSNs). In literature, plenty of researches developing mechanisms to construct a share tree, however, most of them can not resist obstacles which might damage the constructed tree topology and thus block the data transmission. This paper proposes a disturbed mechanism, namely obstacle-free sharing tree reconstruction protocol (OFST), to locally repair the injured share tree so that the reconstructed share tree can resist obstacles and explore the data aggregation potential. For a given three disconnected sub-tree, the proposed OFST initially identifies the share region where all points in the region can play the role of share point for resisting the existed obstacle and exploring the data aggregation potential. Based on the concept of steiner point, a theoretical study on selecting the best share point from the share region is presented for connecting the three sub-trees. Simulation results reveal that the proposed OFST protocol can effectively overcome the obstacle and explore the data aggregation potential, and hence reduce the energy consumption and prolong the network lifetime of the WSN.