Quality of service provisioning in ad hoc wireless networks: a survey of issues and solutions

Reddy, T. Bheemarjuna; Karthigeyan, I.; Manoj, B. S.; Murthy, C. Siva Ram

doi:10.1016/j.adhoc.2004.04.008

Cited by 179 publications

(92 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…One way is to attempt global clock synchronizationand use a TDMA-based system where each node may transmit at a predefined time. This is difficult toachieve due to the lack of a central controller, node mobility and the complexity and overhead involved [9].Other ways are to use a different frequency band or spreading code (as in CDMA) for each transmitter.This requires a distributed channel selection mechanism as well as the dissemination of channel information.However data communications take place, without a central controller, some set-up, new neighbor discoveryand control operations must take place on a common contended channel. Indeed, avoiding the aforementioned complications, much MANET research, as well as the currently most popular wireless ad hoc networking technology (802.11x) is based on fully-contended access to a common channel i.e.…”

Section: Issues and Challenges Providing Qos In Ad-hoc Networkmentioning

confidence: 99%

“…Finally, the well-understood hidden node [10] andexposed node [11] problems are a further consequence of channel contention. These problems are even more pronounced when we consider that nodes may interfere with transmissions outside of their transmission range [12], [9], [13], since receivers are able to detect a signal at a much greater distance than that at which they can decode its information. Limited device resources: to some extent this is an historical limitation, since mobile devices are becomingincreasingly powerful and capable.…”

Section: Issues and Challenges Providing Qos In Ad-hoc Networkmentioning

confidence: 99%

See 1 more Smart Citation

Quality- Of- Survey Routing Solutions forMobile Ad HocNetworks: A Review

Dash¹

2014

IOSRJECE

View full text Add to dashboard Cite

show abstract

Section: Issues and Challenges Providing Qos In Ad-hoc Networkmentioning

confidence: 99%

Section: Issues and Challenges Providing Qos In Ad-hoc Networkmentioning

confidence: 99%

Quality- Of- Survey Routing Solutions forMobile Ad HocNetworks: A Review

Dash¹

2014

IOSRJECE

View full text Add to dashboard Cite

show abstract

“…Reddy et al (2006). However, one could think of other allocation policies, for instance, by increasing the transmission share of the relay node (see also Mandjes and Roijers 2007, Sect.…”

Section: Introductionmentioning

confidence: 99%

“…When information needs to be transmitted across the network, it is sent from the sender to the receiver by relaying the packets along intermediate nodes. An excellent survey on ad hoc networks, with special emphasis on Quality-of-Service aspects, is Reddy et al (2006).…”

Section: Introductionmentioning

confidence: 99%

A fluid model for a relay node in an ad hoc network: the case of heavy-tailed input

Bekker

Mandjes

2008

Math Meth Oper Res

View full text Add to dashboard Cite

Relay nodes in an ad hoc network can be modelled as fluid queues, in which the available service capacity is shared by the input and output. In this paper such a relay node is considered; jobs arrive according to a Poisson process and bring along a random amount of work. The total transmission capacity is fairly shared, meaning that, when n jobs are present, each job transmits traffic into the queue at rate 1/(n + 1) while the queue is drained at the same rate of 1/(n + 1). Where previous studies mainly concentrated on the case of exponentially distributed job sizes, the present paper addresses regularly varying jobs. The focus lies on the tail asymptotics of the sojourn time S. Using sample-path arguments, it is proven that P {S > x} behaves roughly as the residual job size, i.e., if the job sizes are regularly varying of index −ν, the tail of S is regularly varying of index 1 − ν. In addition, we address the tail Part of the research was conducted while R. Bekker was affiliated to CWI. Hans van den Berg (Telecom ICT) is acknowledged for bringing this model under our attention.

show abstract

“…the survey paper [3] and [11,13]. These studies usually capture many details of the ad-hoc network protocols, but, unfortunately, are mostly limited with respect to the considered traffic scenarios and often do not provide much insight into the essentials of the behavior of the system.…”

Section: Introductionmentioning

confidence: 99%

Performance Modeling of a Bottleneck Node in an IEEE 802.11 Ad-Hoc Network

Berg

Mandjes

Roijers

2006

Ad-Hoc, Mobile, and Wireless Networks

View full text Add to dashboard Cite

C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c a PNA Probability, Networks and Algorithms Probability, Networks and AlgorithmsPerformance modeling of a bottleneck node in an IEEE 802.11 ad-hoc network J.L. van Performance modeling of a bottleneck node in an IEEE 802.11 ad-hoc network ABSTRACT This paper presents a performance analysis of wireless ad-hoc networks, with IEEE 802.11 as the underlying Wireless LAN technology. WLAN has, due to the fair radio resource sharing at the MAC-layer, the tendency to share the capacity equally amongst the active nodes, irrespective of their loads. An inherent drawback of this sharing policy is that a node that serves as a relay-node for multiple flows is likely to become a bottleneck. This paper proposes to model such a bottleneck by a fluid-flow model. Importantly, this is a model at the flow-level: flows arrive at the bottleneck node, and are served according to the sharing policy mentioned above. Assuming Poisson initiations of new flow transfers, we obtain insightful, robust, and explicit expressions for characteristics related to the overall flow transfer time, the buffer occupancy, and the packet delay at the bottleneck node. The analysis is enabled by a translation of the buffer dynamics at the bottleneck node in terms of an M/G/1 queueing model. We conclude the paper by an assessment of the impact of alternative sharing policies (which can be obtained by the IEEE 802.11E version), in order to improve the performance of the bottleneck. Abstract This paper presents a performance analysis of wireless ad-hoc networks, with ieee 802.11 as the underlying wireless lan technology. wlan has, due to the fair radio resource sharing at the mac-layer, the tendency to share the capacity equally amongst the active nodes, irrespective of their loads. An inherent drawback of this sharing policy is that a node that serves as a relay-node for multiple flows is likely to become a bottleneck. This paper proposes to model such a bottleneck by a fluid-flow model. Importantly, this is a model at the flow-level: flows arrive at the bottleneck node, and are served according to the sharing policy mentioned above. Assuming Poisson initiations of new flow transfers, we obtain insightful, robust, and explicit expressions for characteristics related to the overall flow transfer time, the buffer occupancy, and the packet delay at the bottleneck node. The analysis is enabled by a translation of the buffer dynamics at the bottleneck node in terms of an m/g/1 queueing model. We conclude the paper by an assessment of the impact of alternative sharing policies (which can be obtained by the ieee 802.11e version), in order to improve the performance of the bottleneck.

show abstract

Quality of service provisioning in ad hoc wireless networks: a survey of issues and solutions

Cited by 179 publications

References 28 publications

Quality- Of- Survey Routing Solutions forMobile Ad HocNetworks: A Review

Quality- Of- Survey Routing Solutions forMobile Ad HocNetworks: A Review

A fluid model for a relay node in an ad hoc network: the case of heavy-tailed input

Performance Modeling of a Bottleneck Node in an IEEE 802.11 Ad-Hoc Network

Contact Info

Product

Resources

About