点击次数：

论文类型：会议论文

发表时间：2011-11-15

收录刊物：EI、CPCI-S、Scopus

卷号：145

期号：VOL. 2

页面范围：483-488

摘要：In this paper, we pay attention to the problem of node search in Wireless Sensor Networks (WSNs). The main problem of basic flooding is that the cost is too high. In order to solve above problem, we propose a variant of Flooding called Level Based Flooding (LBF). In LBF, the whole network is divided into several layers according to the distance (hops) between the nodes and the sink node. The sink node knows the level information of each node. The search packet is broadcast in the network according to levels of nodes and its TTL is set to the level of the target node. When the target node receives the packet, it sends its data back to the sink node in random walk within level hops. We show by extensive simulations that the energy consumption of LBF is much better than that of basic flooding.