关键词：传感器；无线网络；生成树；元组；路由成本
摘 要：Wireless sensor networks (WSNs) differ from traditional networks in several ways: sensor nodes have severe energy constraints, redundant low-rate data, and many-to-many flows. This paper deals with a data-centric merging and by-passing routing schemes based on our own network model. This model permits to gather data at a tuple-centroid node for merging the same type of data. The data-centric merging mechanism is an efficient approach which reduces the number of hops per source and to by-pass the different types of data. It is competent to reduce the unnecessary processing cost of an intermediate node. Our network model shows offers significant performance gains across the high routing cost environment.