Quasi-greedy geographic routing in wireless networks

Jung Tsung Tsai, Yen Cheng Li

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

1 引文 斯高帕斯(Scopus)


Greedy forwarding combined with planar graph routing exploits minimal local position information to achieve reliable packet delivery in wireless networks. However, it is at the expense of path hop counts and traffic loads converging on links dictated by a chosen planar graph traversal scheme to bypass network holes. To mitigate these negative factors for delay-sensitive traffic service, our forwarding scheme further utilizes a simple hypothesis test based on local information to partition the set of candidate neighborhood nodes for packet relay into two subsets. One is a preferable subset containing nodes more likely located in a dense area of nodes and less likely to be a local minimum for greedy forwarding while the other contains the rest. The preferable subset has priority over the other one in the process of greedy forwarding. Consequently, our geographic routing scheme even embodies the feature of quasi greedy for forwarding packets but does achieve the goal of reducing routing hop counts. It only requires an extra complexity at each node to compute a representative angle that characterizes the node and to interchange with neighborhood nodes the angle information in addition to the location information needed normally.

主出版物標題2012 IEEE Global Communications Conference, GLOBECOM 2012
出版狀態已發佈 - 2012
事件2012 IEEE Global Communications Conference, GLOBECOM 2012 - Anaheim, CA, 美国
持續時間: 2012 12月 32012 12月 7


名字Proceedings - IEEE Global Communications Conference, GLOBECOM


其他2012 IEEE Global Communications Conference, GLOBECOM 2012
城市Anaheim, CA

ASJC Scopus subject areas

  • 電氣與電子工程


深入研究「Quasi-greedy geographic routing in wireless networks」主題。共同形成了獨特的指紋。