Share: Scalable Hybrid Adaptive Routing For Dynamic Multi-Hop Environments

2017 IEEE SMARTWORLD, UBIQUITOUS INTELLIGENCE & COMPUTING, ADVANCED & TRUSTED COMPUTED, SCALABLE COMPUTING & COMMUNICATIONS, CLOUD & BIG DATA COMPUTING, INTERNET OF PEOPLE AND SMART CITY INNOVATION (SMARTWORLD/SCALCOM/UIC/ATC/CBDCOM/IOP/SCI)(2017)

引用 24|浏览52
暂无评分
摘要
No longer are wireless networks isolated islands: now devices in one network may communicate with devices in other networks. But as the density of devices increases and the range of wireless transmissions decreases, there is a critical need for scalable multi-hop wireless networking. In this paper, we propose SHARE, a novel approach to scalable multi-hop routing for wireless networks. SHARE is a hybrid of gradient routing, locally scoped link-state routing, multiple-path braid forwarding, and flooding. SHARE adapts the amount of control traffic and the amount of data traffic according to data traffic patterns and network dynamics to maximize network scalability and robustness while minimizing control overhead. We evaluate a real-world implementation of SHARE in ns-3 using Direct Code Execution (DCE), and compare SHARE against a DCE version of the optimized link state routing protocol (OLSR) for a static grid and for the Gauss-Markov mobility model. We show that SHARE is able to deliver up to 31% more data packets than OLSR across a range of network sizes and speeds, while reducing overhead by a factor of 7x.
更多
查看译文
关键词
wireless networks,wireless transmissions,scalable multihop wireless networking,gradient routing,locally scoped link-state routing,flooding,control traffic,data traffic patterns,network dynamics,network scalability,optimized link state routing protocol,scalable hybrid adaptive routing,dynamic multihop environments,scalable multihop routing,multiple-path braid forwarding,SHARE,Gauss-Markov mobility model,Direct Code Execution
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要