A new hierarchical routing protocol for dynamic multihop wireless networks

Akyildiz, Ian F.; Yen, Wei; Yener, Bülent

doi:10.1109/infcom.1997.631183

Cited by 23 publications

(14 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [12], the channel pool is divided into a set of fixed channels and a set of forwarding channels so that data packets can hop from "hot" cells to "cold" cells using the forwarding channels in order to reduce delay and increase capacity. In [13], the authors consider a generic multihop wireless network where the mobile clients communicate with a mobile base station for Internet access, but the clients use only one interface. The authors in [14] also investigate a hybrid IEEE 802.11 network architecture with both DCF and PCF modes, again using one wireless interface.…”

Section: B Related Workmentioning

confidence: 99%

See 1 more Smart Citation

The Design and Evaluation of Unified Cellular and Ad-Hoc Networks

Luo

Meng²,

Ramjee³

et al. 2007

IEEE Trans. on Mobile Comput.

111

View full text Add to dashboard Cite

Abstract-In third-generation (3G) wireless data networks, providing service to low data-rate users is required for maintaining fairness, but at the cost of reducing the cell's aggregate throughput. In this paper, we propose the Unified Cellular and Ad-Hoc Network (UCAN) architecture for enhancing cell throughput, while maintaining fairness. In UCAN, a mobile client has both 3G interface and IEEE 802.11-based peer-to-peer links. The 3G base station forwards packets for destination clients with poor channel quality to proxy clients with better channel quality. The proxy clients then use an ad-hoc network composed of other mobile clients and IEEE 802.11 wireless links to forward the packets to the appropriate destinations, thereby improving cell throughput. We refine the 3G base station scheduling algorithm so that the throughput gains are distributed proportional to users' average channel rates, thereby maintaining fairness. With the UCAN architecture in place, we propose novel greedy and on-demand protocols for proxy discovery and ad-hoc routing that explicitly leverage the existence of the 3G infrastructure to reduce complexity and improve reliability. We further propose secure crediting mechanisms to motivate users that are not actively receiving to participate in relaying packets for others. Through both analysis and extensive simulations with HDR and IEEE 802.11b, we show that the UCAN architecture can increase individual user's throughput by more than 100% and the aggregate throughput of the HDR downlink by up to 50%.Index Terms-Wireless, Algorithm/protocol design and analysis, Mobile communication systems

show abstract

Section: B Related Workmentioning

confidence: 99%

“…We turn off data and header compression on the CDMA2000-1X link. We conduct multiple runs (13) of each download during the day (1-4pm) and compute the average and maximum throughput for the transfer of the one megabyte file.…”

Section: Motivationmentioning

confidence: 99%

The Design and Evaluation of Unified Cellular and Ad-Hoc Networks

Luo

Meng²,

Ramjee³

et al. 2007

IEEE Trans. on Mobile Comput.

111

View full text Add to dashboard Cite

show abstract

“…The implemented prototype, where mobile stations run a bridging protocol, shows that MCN is a feasible architecture for wireless LANs [8]. In MCN, the ability of relaying packets of mobile stations is not allowed in other variant systems of SCN, such as Ricochet network [9] and mobile base network [10]. There is a similar architecture in ODMA (Opportunity Driven Multiple Access) [11], which sits upon a radio sub-system that supports relaying.…”

Section: Introductionmentioning

confidence: 99%

Multihop cellular: A novel architecture for wireless data communications

Hsu

Lin

2002

J. Commun. Netw.

View full text Add to dashboard Cite

“…Recently, some new works were conducted for multihop wireless networks [5], [6], and [7]. The routing algorithm in [5] is proposed to avoid the 'false reply' problem in [8].…”

Section: Introductionmentioning

confidence: 99%

“…The routing algorithm in [5] is proposed to avoid the 'false reply' problem in [8]. The hierarchical routing protocol in [6] needs each entity in the architecture to maintain a small fraction of the topology information to help routing in the hierarchical network. However, these two algorithms do not consider bandwidth reservation for the real-time traffic.…”

Section: Introductionmentioning

confidence: 99%