Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks

Akyol, U.; Andrews, Matthew; Gupta, Piyush; Hobby, John D.; Saniee, Iraj; Stolyar, Alexander L.

doi:10.1109/infocom.2008.111

Cited by 114 publications

(100 citation statements)

References 27 publications

(47 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However it is straightforward to integrate distributed scheduling into our OBSEA for practical CSMA radios by using existing approaches such as [40], which will be studied in our simulation.…”

Section: A Topology and Communication Modelmentioning

confidence: 99%

See 1 more Smart Citation

Selfish Mules: Social Profit Maximization in Sparse Sensornets using Rationally-Selfish Human Relays

Yang

Adeel

McCann

2013

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-Future smart cities will require sensing on a scale hitherto unseen. Fixed infrastructures have limitations regarding sensor maintenance, placement and connectivity. Employing the ubiquity of mobile phones is one approach to overcoming some of these problems. Here, mobility and social patterns of phone owners can be exploited to optimize data forwarding efficiency. The question remains, how can we stimulate phone owners to serve as data relays? In this paper, we combine network science principles and Lyapunov optimization techniques, to maximize global social profit across this hybrid sensor and mobile phone network. Sensor data packets are produced and traded (transmitted) over a virtual economic network using a lightweight socialeconomic-aware backpressure algorithm, combining rate control, routing, and resource pricing. Phone owners can get benefits through relaying sensor data. Our algorithm is fully distributed and makes no probabilistic/stochastic assumptions regarding mobility, topology, and channel conditions, nor does it require prediction. The global social profit achieved by our algorithm can perform close to (or better than) an ideal algorithm with perfect prediction-proven by rigorous theoretical analysis. Simulation results further demonstrate that the proposed algorithm outperforms pure backpressure and social-aware schemes; highlighting the advantage of building systems combining communication with other types of networks.

show abstract

Section: A Topology and Communication Modelmentioning

confidence: 99%

“…Given most current commercial short-range commercial radios (e.g. WiFi Direct and ZigBee) are based on CSMA, we implemented OBSEA on the top of CSMA link layers, by using the distributed scheduling scheme in [47].…”

Section: Simulationmentioning

confidence: 99%

Selfish Mules: Social Profit Maximization in Sparse Sensornets using Rationally-Selfish Human Relays

Yang

Adeel

McCann

2013

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…Similar solutions based on a standard rate-oriented NUM are Horizon [14], wGPD [4] and DiffQ [21]. (DANUMS) is based on NUM model [10] but it differs from its original rate-oriented version since it is aimed at serving heterogeneous traffic with different rate and delay requirements.…”

Section: The Danum Subsystemmentioning

confidence: 99%

SIP-based AAA in delay-aware num-oriented wireless mesh networks

Misiorek

Walkowiak

Karlik

et al. 2013

Image Processing &Amp; Communications

View full text Add to dashboard Cite

“…Umut Akyol et al [10] have studied the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flow rates satisfy an associated network utility maximization problem. They have defined a specific network utility maximization problem which is appropriate for mobile adhoc networks.…”

Section: This Section Presents a Brief Review Of The Work Already Donmentioning

confidence: 99%

Agent based Congestion Control Performance in Mobile ad-hoc Network:A Survey paper

Sharma¹,

Bhadauria²

2011

SpecialIssue

View full text Add to dashboard Cite

Abstract-A Congestion control is a key problem in mobile adhoc networks. The standard TCP congestion control mechanism is not able to handle the special properties of a shared wireless channel. Many approaches have been proposed to overcome these difficulties. ideas and show their interrelations. mobile agent based congestion control Technique routing is proposed to avoid congestion in ad hoc network. Some mobile agents are added in ad hoc network, which carry routing information and nodes congestion status. When mobile agent travels through the network, it can select a less-loaded neighbor node as its next hop and update the routing table according to the node's congestion status. With the aid of mobile agents, the nodes can get the dynamic network topology in time. In this paper, we give an overview over existing proposals, explain their key ideas, TCP Issues, Reduce the Congestion, delay in mobile ad-hoc network and proposed solution

show abstract

Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks

Cited by 114 publications

References 27 publications

Selfish Mules: Social Profit Maximization in Sparse Sensornets using Rationally-Selfish Human Relays

Selfish Mules: Social Profit Maximization in Sparse Sensornets using Rationally-Selfish Human Relays

SIP-based AAA in delay-aware num-oriented wireless mesh networks

Agent based Congestion Control Performance in Mobile ad-hoc Network:A Survey paper

Contact Info

Product

Resources

About