Abstract-In this paper, we address the Topology Control with Hitch-hiking (TCH) problem. Hitch-hiking [1] is a novel model introduced recently that allows combining partial messages to decode a complete message. By effective use of partial signals, a specific topology can be obtained with less transmission power. The objective of the TCH problem is to obtain a stronglyconnected topology with minimum total energy consumption. We prove the TCH problem to be NP-complete and design a distributed and localized algorithm (DTCH) that can be applied on top of any symmetric, strongly-connected topology to reduce total power consumption. We analyze the performance of our approach through simulation.
For example, in REF , the TCH (Topology Control with Hitch-hiking) is used to obtain a strongly connected topology minimizing energy dissipated in transmission with partial signals.
Topology control in ad hoc wireless networks with hitch-hiking
2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004.
2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004.
Computer Science