A New Scheduling Algorithm for Reducing Data Aggregation Latency in Wireless Sensor Networks*

Document Sample
A New Scheduling Algorithm for Reducing Data Aggregation Latency in Wireless Sensor Networks* Powered By Docstoc
					Int. J. Communications, Network and System Sciences, 2010, 3, 679-688
doi:10.4236/ijcns.2010.38091 Published Online August 2010 (http://www.SciRP.org/journal/ijcns)



           A New Scheduling Algorithm for Reducing Data
          Aggregation Latency in Wireless Sensor Networks*
                                        Meirui Ren1,2, Longjiang Guo1,2#, Jinbao Li1,2
                   1
                   School of Computer Science and Technology, Heilongjiang University, Harbin, China
              2
               Key Laboratory of Database and Parallel
				
DOCUMENT INFO
Description: Existing works on data aggregation in wireless sensor networks (WSNs) usually use a single channel which results in a long latency due to high interference, especially in high-density networks. Therefore, data aggregation is a fundamental yet time-consuming task in WSNs. We present an improved algorithm to reduce data aggregation latency. Our algorithm has a latency bound of 16R + Δ - 11, where Δ is the maximum degree and R is the network radius. We prove that our algorithm has smaller latency than the algorithm in. The simulation results show that our algorithm has much better performance in practice than previous works. [PUBLICATION ABSTRACT]
BUY THIS DOCUMENT NOW PRICE: $6.95 100% MONEY BACK GUARANTEED
PARTNER ProQuest LLC
ProQuest creates specialized information resources and technologies that propel successful research, discovery, and lifelong learning.