Eleni Stai
ABSTRACT
Future communications consist of an increasing number of wireless parts, while simultaneously need to support the widespread multimedia applications imposed by social networks. These human-machine systems, driven by both real time social interactions and the challenges of the wireless networks' design, call for efficient and easy to implement, distributed cross-layer algorithms for their operation. Performance metrics such as throughput, delay, trust, energy consumption, need to be improved and optimized aiming at high quality communications. We investigate the coveted throughput-delay trade-off in static wireless multihop networks based on a "computer-aided" design of the backpressure scheduling/routing algorithm for networks embedded in hyperbolic space. Both routing and scheduling exploit the hyperbolic distances to orient the packets to the destination and prioritize the transmissions correspondingly. The proposed design provides us with the freedom of controlling its theoretical throughput optimality and of counterbalancing its practical performance through simulations, leading to significant improvements of the throughput-delay trade-off.
- J. W. Anderson. Hyperbolic Geometry. Springer 2nd Edition, 2007.Google Scholar
- B. Azimdoost, H. R. Sadjadpour, and J. J. Garcia-Luna-Aceves. Capacity of Composite Networks: Combining Social and Wireless Ad Hoc Networks. In Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), pages 464 -- 468, March 2011.Google ScholarCross Ref
- L. Bui, R. Srikant, and A. L. Stolyar. Novel Architectures and Algorithms for Delay Reduction in Back-pressure Scheduling and Routing. In Proceedings of IEEE INFOCOM, pages 2936 -- 2940, April 2009.Google Scholar
- A. Cvetkovski and M. Crovella. Hyperbolic Embedding and Routing for Dynamic Graphs. In Proceedings of IEEE INFOCOM, pages 1647 -- 1655, April 2009.Google Scholar
- A. Eryilmaz, A. Ozdaglar, D. Shah, and E. Modiano. Distributed Cross-layer Algorithms for the Optimal Control of Multi-hop Wireless Networks. IEEE/ACM Transactions on Networking, 18(2):638--651, April 2010. Google ScholarDigital Library
- L. Georgiadis, M. J. Neely, and L. Tassiulas. Resource Allocation and Cross-Layer Control in Wireless Networks. Now Publications, 2006. Google ScholarDigital Library
- G. R. Gupta and N. B. Shroff. Delay Analysis and Optimality of Scheduling Policies for Multihop Wireless Networks. IEEE/ACM Transactions on Networking, 19(1):129--141, February 2011. Google ScholarDigital Library
- L. Huang and M. J. Neely. Delay Reduction via Lagrange Multipliers in Stochastic Network Optimization. IEEE Transactions on Automatic Control, 56(4):842--857, April 2012.Google ScholarCross Ref
- B. Ji, C. Joo, and N. B. Shroff. Delay-based Back-pressure Scheduling in Multi-hop Wireless Networks. In Proceedings of IEEE INFOCOM, pages 2579 -- 2587, April 2011.Google Scholar
- L. Jiang and J. Walrand. A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks. IEEE/ACM Transactions on Networking, 18(3):960--972, June 2009. Google ScholarDigital Library
- J. Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000. Google ScholarDigital Library
- R. Kleinberg. Geographic Routing Using Hyperbolic Space. In Proceedings. of IEEE INFOCOM, pages 1902 -- 1909, May 2007.Google ScholarDigital Library
- E. Stai, J. S. Baras, and S. Papavassiliou. Throughput-Delay Trade-off in Wireless Multihop Networks via Greedy Hyperbolic Embedding. In Proceedings of the 20th Int'l Symposium on Mathematical Theory of Networks and Systems (MTNS), July 2012.Google Scholar
- L. Tassiulas and A. Ephremides. Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximum Throughput in Multihop Radio Networks. IEEE Transactions on Automatic Control, 37(12):1936--1948, December 1992.Google Scholar
- L. Ying, S. Shakkottai, A. Reddy, and L. Shihuan. On Combining Shortest-path and Back-pressure Routing over Multi-hop Wireless Networks. IEEE/ACM Transactions on Networking, 19(3):841--854, June 2011. Google ScholarDigital Library
Index Terms
- A class of backpressure algorithms for networks embedded in hyperbolic space with controllable delay-throughput trade-off
Recommendations
Throughput and Delay Analysis of IEEE 802.11 DCF in the Presence of Hidden Nodes for Multi-hop Wireless Networks
Hidden node collision in a contention-based medium access control protocol contributes to poor wireless network performance. This paper extended the Bianchi's study and introduces a mathematical model that can be used to calculate throughput and delay ...
Performance of multichannel wireless ad hoc networks
This paper addresses the design of Medium Access Control (MAC) protocols for wireless ad hoc networks that derive benefits from using multiple orthogonal channels for data transmission. Each node is assumed to have a single half-duplex transceiver that ...
Throughput and delay analysis considering packet arrival in IEEE 802.11
ICDCIT'06: Proceedings of the Third international conference on Distributed Computing and Internet TechnologyIn recent years, Wireless Local Area Networks (WLANs) have become extremely popular. IEEE 802.11 protocol is the dominating standards for WLANs employing the Distributed Coordination Function (DCF) as its Medium Access Control (MAC) mechanism. In the ...
Comments