一种适用于异步无线传感器网络的机会路由机制

无线传感器网络通常使用低占空比的异步睡眠调度来降低节点能耗。由于发送节点在接收节点醒来后才能向其发送数据，这将引入额外的等待时延。在最近的一些任播路由机制中，发送节点动态地选择最先醒来的候选节点转发数据，以最小化等待时延。但是，由于从最先醒来的候选节点到基站的时延可能并不低，任播路由机制并不一定能最小化端到端总时延。为此，提出了一种适用于异步无线传感器网络的机会路由机制，将路由决策建模为强马尔科夫过程，并根据最优停止理论推导出该过程一种简化的停止规则。仿真结果表明，节点到基站的最大端到端时延仅为基于地理位置的机会路由的68.5%。

An opportunistic routing scheme for asynchronous wireless sensor networks

Wireless sensor networks usually adopt low duty-cycle asynchronous sleep schedule to reduce energy consumption of node. Since a sender can’ t send data packet until the receiver wakes up,additional waiting delay will be introduced. In some recent anycast routing schemes,a sender dynamically selects the first candidate to wake up to forward data packet,in order to minimize the waiting delay. However,the de-lay from the first candidate to the base station may not be low,so anycast routing can not necessarily mini-mize the total end-to-end delay. For this problem,an opportunistic routing scheme is proposed for asyn-chronous wireless sensor networks, where routing decision is modeled as a strong-Markov process and a simplified stopping rule of this process is derived through optimal stopping theory. Simulation results show that the maximal end-to-end delay from the sender to the base station is only 68 . 5% of the opportunistic routing based on geographical location.