Taming the underlying challenges of reliable multihop routing in sensor networks
Taming the underlying challenges of reliable multihop routing in sensor networks
复制标题
DOI：
10.1145/958491.958494
复制
发表时间：
2003-11
期刊：
影响因子：
--
通讯作者：
A. Woo;Terence Tong;D. Culler
中科院分区：
文献类型：
--
作者：
A. Woo;Terence Tong;D. Culler
无线通信的动态性和损耗性对可靠的自组织多跳网络提出了重大挑战。这些非理想的特性与传感器网络中发现的原始的、低功率的无线电收发器相比更成问题，并且提出了路由协议必须解决的新问题。链路连通性统计数据应动态捕获，通过一个有效的自适应链路估计器和路由决策应利用这样的连通性统计数据，以实现可靠性。链路状态和路由信息必须保持在一个邻居表与恒定的空间，而不管细胞密度。我们研究和评估链路估计，邻居表管理，可靠的路由协议技术。我们专注于多对一的定期数据收集工作量。我们缩小了设计空间，通过大规模的评估，高层次的模拟50节点，深入的实证实验。最有效的解决方案使用简单的时间平均EWMA估计器，基于频率的表管理和基于成本的路由。
The dynamic and lossy nature of wireless communication poses major challenges to reliable, self-organizing multihop networks. These non-ideal characteristics are more problematic with the primitive, low-power radio transceivers found in sensor networks, and raise new issues that routing protocols must address. Link connectivity statistics should be captured dynamically through an efficient yet adaptive link estimator and routing decisions should exploit such connectivity statistics to achieve reliability. Link status and routing information must be maintained in a neighborhood table with constant space regardless of cell density. We study and evaluate link estimator, neighborhood table management, and reliable routing protocol techniques. We focus on a many-to-one, periodic data collection workload. We narrow the design space through evaluations on large-scale, high-level simulations to 50-node, in-depth empirical experiments. The most effective solution uses a simple time averaged EWMA estimator, frequency based table management, and cost-based routing.