Self-organizing timing allocation mechanism in distributed wireless sensor networks

Abstract

A novel, distributed timing allocation method [2, 3, 4, 5] has been proposed for packet collision avoidance in wireless sensor networks recently. In this paper, this proposed method is theoretically examined, and a hidden self-organization mechanism is unveiled. As the result, some important fundamental questions regarding this method are reasonably resolved. Namely, our present analysis provides a definite criterion, as to when it functions properly for densely connected networks in real noisy environments.