期刊文献+

Packet Compression Ratio Dependent Spanning Tree for Convergecast

Packet Compression Ratio Dependent Spanning Tree for Convergecast
下载PDF
导出
摘要 A convergecast is a popular routing in sensor networks. It periodically forwards collected data at every sensor node along a configured routing path to the outside of a sensor network via the base station (BS). To extend the lifetime of energy-limited sensor networks, many previous researches proposed schemes for data compression. However, few researches investigated the relation between packet compression ratio and spanning trees. We propose packet Compression ratio dependent Spanning Tree (CST) which can provide effective routing paths in terms of the tree length for all ranges of compression ratio f. CST is equivalent to the Shortest Path spanning Tree (SPT) which is optimum in the case of no-compression (f = 0) and is equivalent to the Minimum Spanning Tree (MST) in the case of full-compression (f = 1). CST outperforms SPT and MST for any range of f (0 <f <1). Through simulation we show CST provides shorter paths than MST and SPT in terms of the tree length by 34.1% and 7.8% respectively. We confirm CST is very useful in convergecasts. A convergecast is a popular routing in sensor networks. It periodically forwards collected data at every sensor node along a configured routing path to the outside of a sensor network via the base station (BS). To extend the lifetime of energy-limited sensor networks, many previous researches proposed schemes for data compression. However, few researches investigated the relation between packet compression ratio and spanning trees. We propose packet Compression ratio dependent Spanning Tree (CST) which can provide effective routing paths in terms of the tree length for all ranges of compression ratio f. CST is equivalent to the Shortest Path spanning Tree (SPT) which is optimum in the case of no-compression (f = 0) and is equivalent to the Minimum Spanning Tree (MST) in the case of full-compression (f = 1). CST outperforms SPT and MST for any range of f (0 <f <1). Through simulation we show CST provides shorter paths than MST and SPT in terms of the tree length by 34.1% and 7.8% respectively. We confirm CST is very useful in convergecasts.
机构地区 不详
出处 《Wireless Sensor Network》 2010年第7期504-511,共8页 无线传感网络(英文)
关键词 PACKET Compression CONVERGECAST CST SPANNING TREE Sensor Network Packet Compression Convergecast CST Spanning Tree Sensor Network
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部