Delay-constraint topology control in wireless sensor networks format

Authors:
Hongli Xu;Liusheng Huang;Junmin Wu;Gang Wang;Wang Liu
Affiliations:
Univ. of Science & Technology of China, Hefei, P.R. China;Univ. of Science & Technology of China, Hefei, P.R. China;Univ. of Science & Technology of China, Hefei, P.R. China;Univ. of Science & Technology of China, Hefei, P.R. China;Univ. of Science & Technology of China, Hefei, P.R. China
Venue:
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Year:
2008

Citing 6
Cited 2

Algorithmic aspects of topology control problems for ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications 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
Heuristic algorithms for real-time data aggregation in wireless sensor networks

Proceedings of the 2006 international conference on Wireless communications and mobile computing
QoS topology control for nonhomogenous ad hoc wireless networks

EURASIP Journal on Wireless Communications and Networking
Approximating k-hop minimum-spanning trees

Operations Research Letters

Topology control for delay-constraint data collection in wireless sensor networks

Computer Communications
A new distributed topology control algorithm based on optimization of delay and energy in wireless networks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies delay-constraint topology control (DTC) in wireless sensor networks. That is, the delay of transmission is guaranteed through topology control. This problem has been proved to be NP-Completeness, and the previous works are in-adequate and lack of the theoretical analysis. In this paper, we present the DTCP algorithm with the minimal increased-energy method. We analyze that the energy cost of DTCP algorithm is at most (2n/T)α -- 2(2n/T)α-2 + 1 times as that of minimal spanning tree for the linear networks, where n is the number of the nodes in the network, T is the required delay from source to the sink node, α is determined by hardware and environments. Besides these, we design two localized algorithms for DTC problem. The experimental results show that DTCP algorithm can reduce about 31% energy over HBH algorithm under the same conditions.