As a routing algorithm defined in IEEE 802.15.5, server routing (SR) can attain the optimal routes between source and destination nodes. However, we found that it has the following two problems: (1) unicasting the Link State Registrations does not utilize the available topology information, and (2) the relay list of Route Formations includes redundant contents. To address these problems, we propose a novel routing algorithm which can obtain more link state information without extra overhead and decrease the redundant information in Route Formations. Theoretical analysis and simulation results show that our proposed algorithm outperforms SR in terms of network overhead and the average end-to-end delay, while keeping the success rate of packets transmission unchanged.
展开▼
