Channel adaptive techniques for wireless resources management in AD Hoc networks

Lin, Xiao-Hui; 林曉輝,

doi:10.5353/th_b3124448

Cited by 1 publication

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, as the system scales up, BGCA can outperform RICA because the latter has a higher routing overhead (which is of a complexity of OðNMÞ, of which N is the number of mobile terminals and M is the number of communication terminal pairs in the network) and the common channel can be highly congested. Scalability results are not shown in this paper but can be found in [17]. On the other hand, there is possible room for further improvement for channel adaptive protocols such as RICA.…”

Section: Discussionmentioning

confidence: 78%

“…The main idea of BGCA is that, when a link is in deep fading, the upstream terminal executes a local search to find a partial route to the destination [17]. It is designed based on AODV, but also incorporates some ingredients of ABR, e.g., the local search for a partial route and selection of the shortest route.…”

Section: Bandwidth-guarded Channel Adaptive (Bgca) Routingmentioning

confidence: 99%

“…Link Quality: The protocol is able to select links that have high bandwidth to form the routes and, more importantly, to rebuild the routes when the channel quality of some links has already deteriorated. Recently, there have been several attempts to design ad hoc routing protocols that meet the above challenge [7], [14], [17], [18], [19]. In our study, we first propose two new channel adaptive routing protocols, called BGCA (Bandwidth Guarded Channel Adaptive) and RICA (Receiver-Initiated Channel Adaptive) protocols, and then perform a quantitative comparison of protocols with and without exploiting channel adaptation.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A quantitative comparison of ad hoc routing protocols with and without channel adaptation

Lin¹,

Kwok²,

Lau³

2005

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

To efficiently support tetherless applications in ad hoc wireless mobile computing networks, a judicious ad hoc routing protocol is needed. Much research has been done on designing ad hoc routing protocols and some well-known protocols are also being implemented in practical situations. However, one major imperfection in existing protocols is that the time-varying nature of the wireless channels among the mobile terminals is ignored, let alone exploited. This could be a severe design drawback because the varying channel quality can lead to very poor overall route quality in turn, resulting in low data throughput. Indeed, better performance could be achieved if a routing protocol dynamically changes the routes according to the channel conditions. In this paper, we first propose two channel adaptive routing protocols which work by using an adaptive channel coding and modulation scheme that allows a mobile terminal to dynamically adjust the data throughput via changing the amount of error protection incorporated. We then present a qualitative and quantitative comparison of the two classes of ad hoc routing protocols. Extensive simulation results indicate that channel adaptive ad hoc routing protocols are more efficient in that shorter delays and higher rates are achieved, at the expense of a higher overhead in route setup and maintenance.

show abstract

Section: Discussionmentioning

confidence: 78%

Section: Bandwidth-guarded Channel Adaptive (Bgca) Routingmentioning

confidence: 99%