Zhang, H.Shen, H.Tian, H.2007-08-142007-08-142006Wireless algorithms, systems, and applications : first international conference, WASA 2006, Xi'an, China, August 15-17, 2006 ; proceedings / Xiuzhen Cheng, Wei Li, Taieb Znati (eds.), pp. 151-162.354037189397835403718920302-97431611-3349http://hdl.handle.net/2440/36908The original publication is available at www.springerlink.comData gathering is a critical operation in wireless sensor networks for extracting useful information from the operating environment. In this paper, we study the problem of data gathering in multi-hop linear sensor networks. We employ a simple model based on random channel access scheme to tackle the high degree of channel contention and high probability of packet collision induced by bursty traffic. In our model, each node optimally attempts a transmission, and our goal is to tune the attempt probability for each sensor node with the objective to minimize the data gathering duration on condition that each link can provide guaranteed per-hop packet delivery reliability. We formulate this problem as an optimization problem and propose a distributed solution which relies on only two hop neighbors information. Based on this model, a simple and scalable protocol RADG (Random Access Data Gathering) is designed. Simulation results show that our algorithm has fast convergence speed. Moreover, RADG is robust to link error in essence and particularly suitable to monitor environments with high degree of interference.enConference paper002006567110.1007/11814856_162-s2.0-3374968345049615Shen, H. [0000-0002-3663-6591] [0000-0003-0649-0648]