Paper Info
Title
Distributed Minimal Time Convergecast Scheduling for Small or Sparse Data Sources
Abstract
base station to collect all the data generated by sensor nodes. As a consequence many-to-one communication pattern, referred to as convergecast, is prevalent in sensor networks. In this paper, we address the challenge of fast and reliable convergecast on top of the collision-prone CSMA MAC layer. More specifically, we extend previous work by considering the following two situations: (1) the length of the packets generated by nodes is much smaller than the maximum length of a data frame that can be transmitted in one time slot and (2) not every node in the network has data to transmit and for those that have, may have lots of data that require more than one packet. The first situation leads to the possibility of improvement by data piggybacking/aggregation; the second scenario arises in networks where nodes locally store the data and serves query request on-demand. We present distributed minimal time scheduling algorithms for both the cases. Simulation results have shown significant performance improvements of our new approaches over existing solutions.
Year
DOI
Venue
2007
10.1109/RTSS.2007.19
RTSS
Keywords
Field
DocType
time slot,reliable convergecast,maximum length,sparse data sources,minimal time scheduling algorithm,data frame,sensor node,base station,collision-prone csma mac layer,sensor network,minimal time convergecast scheduling,consequence many-to-one communication pattern,sensor networks,sparse data,scheduling algorithm,data aggregation,scheduling
Piggybacking (Internet access),Base station,Computer science,Scheduling (computing),Network packet,Computer network,Real-time computing,Frame (networking),Wireless sensor network,Data aggregator,Sparse matrix,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-3062-1
18
0.97
References 
Authors
20
3
Name
Order
Citations
PageRank
Ying Zhang11692118.14
Shashidhar Gandham21135.22
Qingfeng Huang374950.42