On the Convergence and Stability of Data-Driven Link Estimation and Routing in Sensor Networks

被引:2
作者
Zhang, Hongwei [1 ]
Sang, Lifeng [2 ]
Arora, Anish [2 ]
机构
[1] Wayne State Univ, Dept Comp Sci, Detroit, MI 48202 USA
[2] Ohio State Univ, Dept Comp Sci & Engn, Columbus, OH 43210 USA
关键词
Algorithms; Measurement; Performance; Wireless sensor networks; data-driven link estimation and routing; biased link sampling; convergence; stability;
D O I
10.1145/1552297.1552301
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The wireless network community has become increasingly aware of the benefits of data-driven link estimation and routing as compared with beacon-based approaches, but the issue of Biased Link Sampling (BLS) estimation has not been well studied even though it affects routing convergence in the presence of network and environment dynamics. Focusing on traffic-induced dynamics, we examine the open, unexplored question of how serious the BLS issue is and how to effectively address it when the routing metric ETX is used. For a wide range of traffic patterns and network topologies and using both node-oriented and network-wide analysis and experimentation, we discover that the optimal routing structure remains quite stable even though the properties of individual links and routes vary significantly as traffic pattern changes. In cases where the optimal routing structure does change, data-driven link estimation and routing is either guaranteed to converge to the optimal structure or empirically shown to converge to a close-to-optimal structure. These findings provide the foundation for addressing the BLS issue in the presence of traffic-induced dynamics and suggest approaches other than existing ones. These findings also demonstrate that it is possible to maintain an optimal, stable routing structure despite the fact that the properties of individual links and paths vary in response to network dynamics.
引用
收藏
页数:29
相关论文
共 35 条
  • [1] AGUAYO D, 2004, P ACM SIGCOMM DAT CO
  • [2] [Anonymous], TR2003467 DEP COMP S
  • [3] CHAKERES I, 2002, P INT S WIR PERS MUL
  • [4] COUTO DD, 2003, P ACM ANN INT C MOB
  • [5] *CROSSBOW TECHN IN, 2009, CROSSB MICA2 MOT
  • [6] DAS SM, 2007, P ACM INT MEAS C IMC
  • [7] DRAVES R, 2004, P ACM ANN INT C MOB
  • [8] DRAVES R, 2004, P ACM SIGCOMM DAT CO
  • [9] DUTTA P, 2005, P IEEE ACM INT C INF
  • [10] ERTIN E, 2006, P IEEE ACM INT C INF