By Topic

A cross-layer distributed TDMA scheduling for data gathering with minimum latency in wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chatterjee, P. ; Inf. Technol. Dept., Govt. Coll. of Eng. & Textile Technol., Kolkata, India ; Das, N.

In a wireless sensor network, given a routing tree for data gathering from individual nodes to the sink node, this paper presents a simple, distributed algorithm for assigning time slot to each node for conflict-free communication, such that the maximum latency in data gathering at the sink is minimized. It requires just a one-time computation during the initialisation of the network provided the nodes remain static. Simulation studies have been done to evaluate the performance in terms of latency, and the average duty cycle.

Published in:

Wireless Communication, Vehicular Technology, Information Theory and Aerospace & Electronic Systems Technology, 2009. Wireless VITAE 2009. 1st International Conference on

Date of Conference:

17-20 May 2009