loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
29th Annual IEEE International Conference on Local Computer Networks (LCN'04)
Application-Based Collision Avoidance in Wireless Sensor Networks
Tampa, Florida, USA
November 16-November 18
ISBN: 0-7695-2260-2
Thanos Stathopoulos, UCLA, Department of Computer Science
Rahul Kapur, UCLA, Department of Computer Science
Deborah Estrin, UCLA, Department of Computer Science
John Heidemann, USC, Information Sciences Institute
Lixia Zhang, UCLA, Department of Computer Science
Wireless sensor networks are characterized by collections of small, low-power nodes that collect information about the physical world. Concurrent transmissions caused by the well-known hidden terminal problem result in collisions and packet corruption. Since corrupted packets must be retransmitted, collisions add an additional burden to the already energy constrained system. In this paper, we present an application-based approach to collision avoidance. We propose two specific algorithms; the first one follows TCP's congestion avoidance algorithm and adjusts the transmission rate when a collision occurs, while the second one shifts packet transmission times to minimize collisions. We evaluated both algorithms through simulations and our results show that our approach can reduce the number of collision-induced retransmissions by a factor of 8 and the energy consumption by up to 50%.
Citation:
Thanos Stathopoulos, Rahul Kapur, Deborah Estrin, John Heidemann, Lixia Zhang, "Application-Based Collision Avoidance in Wireless Sensor Networks," lcn, pp.506-514, 29th Annual IEEE International Conference on Local Computer Networks (LCN'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.