An Analysis of Some Graph Theoretical Cluster Techniques
Journal of the ACM (JACM)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
A new model for packet scheduling in multihop wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Achieving MAC layer fairness in wireless packet networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Utility-based rate control in the Internet for elastic traffic
IEEE/ACM Transactions on Networking (TON)
Incentive Engineering in Wireless LAN Based Access Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Price-Based Channel Time Allocation in Wireless LANs
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
An energy-aware data-centric generic utility based approach in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Dynamic bandwidth management in single-hop ad hoc wireless networks
Mobile Networks and Applications
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Cooperation in wireless ad hoc networks: a market-based approach
IEEE/ACM Transactions on Networking (TON)
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Dynamic resource allocation for joint grid user and provider optimisation in computational grid
International Journal of Computer Applications in Technology
ATBAS: an efficient fair bandwidth allocation approach for multihop wireless ad hoc network
International Journal of Sensor Networks
Distributed optimal contention window control for elastic traffic in single-cell wireless LANs
IEEE/ACM Transactions on Networking (TON)
Rate Control, Routing Algorithm and Scheduling for Multicast with Network Coding in Ad Hoc Networks
AICI '09 Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence
Comparative study of price-based resource allocation algorithms for ad hoc networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Cross-layer design in multihop wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Sampling frequency optimization in wireless sensor network-based control system
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Hi-index | 0.00 |
The shared-medium multi-hop nature of wireless ad hoc networks poses fundamental challenges to the design of an effective resource allocation algorithm to maximize the aggregated utility of flows, while maintaining basic fairness among multiple flows. When previously proposed scheduling algorithms have been shown to perform well in providing fair shares of bandwidth among single-hop wireless flows, they did not consider multi-hop flows with an end-to-end perspective. Moreover, the resource allocation strategies employed in the wireline network can not be applied directly in the context of ad hoc networks due to the unique characteristic of location dependent contention and spatial reuse of the shared wireless channel. In this paper, we propose a price-based resource allocation model to achieve maximized aggregated utility (i.e., social welfare) of flows. Our original contributions are: First, we propose to use maximal clique-associated shadow prices for wireless channel access coordination, rather than link-associated price for wireline link access arbitration. Second, we present a new pricing policy for end-to-end multi-hop flow. Using this model, different fairness goals can be realized in ad hoc networks for end-to-end flows. With a two-tier distributed and iterative algorithm, scarce channel capacity is allocated fairly among multi-hop flows from an end-to-end perspective, using shadow prices as the mechanism to arbitrate channel access. Through extensive analysis and simulation results, we show that our proposed algorithm is able to fairly distribute resources among multi-hop flows, while simultaneously maximizing the aggregated utility of flows globally.