Cooperative rotational sweep schemes for geographic routing

Jung Tsung Tsai, Yunghsiang S. Han

研究成果: 書貢獻/報告類型會議論文篇章

摘要

Geographic routing operates with minimum local state information but requires a recovery method to bypass network voids. Under unit disk assumption (UDA) for connection between wireless nodes, recovery approaches based on rotational sweep algorithms with sweep curves can be employed to achieve packet delivery guarantee as well as low routing path hop counts. However, they are questionably applicable under more practical non UDA, let alone support the guarantee. For practical use, we propose a cooperative rotational sweep method operated in conjunction with the original one. Under a relaxed UDA by which connection between a pair of nodes within unit distance depends on path loss and Raleigh fading power, simulation results show that proposed schemes are able to achieve an extremely high routing success probability at the cost of the size of packet overhead carrying a recent history of visited nodes, essentially demonstrating a feasible tradeoff of memory length for routing success rates.

原文英語
主出版物標題2016 IEEE International Conference on Communications, ICC 2016
發行者Institute of Electrical and Electronics Engineers Inc.
ISBN(電子)9781479966646
DOIs
出版狀態已發佈 - 2016 七月 12
事件2016 IEEE International Conference on Communications, ICC 2016 - Kuala Lumpur, 马来西亚
持續時間: 2016 五月 222016 五月 27

出版系列

名字2016 IEEE International Conference on Communications, ICC 2016

其他

其他2016 IEEE International Conference on Communications, ICC 2016
國家马来西亚
城市Kuala Lumpur
期間2016/05/222016/05/27

ASJC Scopus subject areas

  • Computer Networks and Communications

指紋 深入研究「Cooperative rotational sweep schemes for geographic routing」主題。共同形成了獨特的指紋。

引用此