Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Minimal Time and Conflict-Free Schedule for Convergecast in Wireless Sensor Networks
Ist Teil von
2008 IEEE International Conference on Communications, 2008, p.2808-2812
Ort / Verlag
IEEE
Erscheinungsjahr
2008
Quelle
IEEE/IET Electronic Library
Beschreibungen/Notizen
A time division multiple access (TDMA) scheduling technique, which solves collision problem and collects a complete data efficiently, is adopted to assign communication mission into the available time slots. This paper proposes a novel conflict-free convergecast scheduling method to minimize the collecting time in a wireless sensor network. The proposed method first constructs a tree structure in the sensor network and utilizes the tree information to schedule a conflict-free convergecast. The simulated results show that the proposed method can diminish the required timeslots efficiently and achieve a conflict-free convergecast. The contributions of the work are to accelerate the speed of data collection, collect the complete data from the sensor network, reduce the energy consumption of sensors and prolong the network lifetime.