Distributed Minimal Time Convergecast Scheduling in Wireless Sensor Networks

— We consider applications of sensor networks wherein data packets generated by every node have to reach the base station. This results in a many-to-one communication paradigm referred to as convergecast. We are interested in determining a TDMA schedule that minimizes the total time required to complete the convergecast. We consider a simple version of the problem wherein every node generates exactly one packet. We propose a distributed convergecast scheduling algorithm that requires at most 3N timeslots, where N represents the number of nodes in the network. Through extensive simulations, we demonstrate that actual number of timeslots needed is

• Type: Conference
• Year: 2006
• Where: ICDCS
• Authors: Shashidhar Gandham, Ying Zhang, Qingfeng Huang
• Keywords: Convergecast Scheduling Algorithm, Distributed And Parallel Computing, ICDCS 2006, Many-to-one Communication Paradigm, Node