9,624 research outputs found

    Cross-layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks

    Get PDF
    This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constraint and scheduling constraint using multicommodity flow variables, and formulate resource allocation in networks with fixed wireless channels (or single-rate wireless devices that can mask channel variations) as a utility maximization problem with these constraints. By dual decomposition, the resource allocation problem naturally decomposes into three subproblems: congestion control, routing and scheduling that interact through congestion price. The global convergence property of this algorithm is proved. We next extend the dual algorithm to handle networks with timevarying channels and adaptive multi-rate devices. The stability of the resulting system is established, and its performance is characterized with respect to an ideal reference system which has the best feasible rate region at link layer. We then generalize the aforementioned results to a general model of queueing network served by a set of interdependent parallel servers with time-varying service capabilities, which models many design problems in communication networks. We show that for a general convex optimization problem where a subset of variables lie in a polytope and the rest in a convex set, the dual-based algorithm remains stable and optimal when the constraint set is modulated by an irreducible finite-state Markov chain. This paper thus presents a step toward a systematic way to carry out cross-layer design in the framework of “layering as optimization decomposition” for time-varying channel models

    An altruistic cross-layer recovering mechanism for ad hoc wireless networks

    Full text link
    Video streaming services have restrictive delay and bandwidth constraints. Ad hoc networks represent a hostile environment for this kind of real-time data transmission. Emerging mesh networks, where a backbone provides more topological stability, do not even assure a high quality of experience. In such scenario, mobility of terminal nodes causes link breakages until a new route is calculated. In the meanwhile, lost packets cause annoying video interruptions to the receiver. This paper proposes a new mechanism of recovering lost packets by means of caching overheard packets in neighbor nodes and retransmit them to destination. Moreover, an optimization is shown, which involves a video-aware cache in order to recover full frames and prioritize more significant frames. Results show the improvement in reception, increasing the throughput as well as video quality, whereas larger video interruptions are considerably reduced. Copyright © 2014 John Wiley & Sons, Ltd.Arce Vila, P.; Guerri Cebollada, JC. (2015). An altruistic cross-layer recovering mechanism for ad hoc wireless networks. Wireless Communications and Mobile Computing. 15(13):1744-1758. doi:10.1002/wcm.2459S174417581513Li J Blake C De Couto DSJ Lee HI Morris R Capacity of ad hoc wireless networks Proceedings of the 7th Annual International Conference on Mobile Computing and Networks (MobiCom) 2001 61 69Akyildiz, I. F., & Xudong Wang. (2005). A survey on wireless mesh networks. IEEE Communications Magazine, 43(9), S23-S30. doi:10.1109/mcom.2005.1509968Hsu, C.-J., Liu, H.-I., & Seah, W. K. G. (2011). Opportunistic routing – A review and the challenges ahead. Computer Networks, 55(15), 3592-3603. doi:10.1016/j.comnet.2011.06.021Huang, X., Zhai, H., & Fang, Y. (2008). Robust cooperative routing protocol in mobile wireless sensor networks. IEEE Transactions on Wireless Communications, 7(12), 5278-5285. doi:10.1109/t-wc.2008.060680Wieselthier, J. E., Nguyen, G. D., & Ephremides, A. (2001). Mobile Networks and Applications, 6(3), 251-263. doi:10.1023/a:1011478717164Clausen T Jacquet P Optimized Link State Routing Protocol (OLSR), IETF RFC 3626 2003 http://www.rfc-editor.org/rfc/rfc3626.txtMarina, M. K., & Das, S. R. (2006). Ad hoc on-demand multipath distance vector routing. Wireless Communications and Mobile Computing, 6(7), 969-988. doi:10.1002/wcm.432Zhou X Lu Y Ma HG Routing improvement using multiple disjoint paths for ad hoc networks International Conference on Wireless and Optical Communications Networks (IFIP) 2006 1 5Fujisawa H Minami H Yamamoto M Izumi Y Fujita Y Route selection using retransmission packets for video streaming on ad hoc networks IEEE Conference on Radio and Wireless Symposium (RWS) 2006 607 610Badis H Agha KA QOLSR multi-path routing for mobile ad hoc networks based on multiple metrics: bandwidth and delay IEEE 59th Vehicular Technology Conference (VTC) 2004 2181 2184Wu Z Wu J Cross-layer routing optimization for video transmission over wireless ad hoc networks 6th International Conference on Wireless Communications Networks and Mobile Computing (WiCOM) 2010 1 6Schier, M., & Welzl, M. (2012). Optimizing Selective ARQ for H.264 Live Streaming: A Novel Method for Predicting Loss-Impact in Real Time. IEEE Transactions on Multimedia, 14(2), 415-430. doi:10.1109/tmm.2011.2178235Nikoupour M Nikoupour A Dehghan M A cross-layer framework for video streaming over wireless ad-hoc networks 3rd International Conference on Digital Information Management (ICDIM) 2008 340 345Yamamoto R Miyoshi T Distributed retransmission method using neighbor terminals for ad hoc networks Proceedings of the 14th Asia-Pacific Conference on Communications (APCC) 2008 1 5Gravalos I Kokkinos P Varvarigos EA Multi-criteria cooperative energy-aware routing in wireless ad-hoc networks Proceedings of the 9th International Wireless Communications and Mobile Computing Conference (IWCMC) 2013 387 393Abid, R. M., Benbrahim, T., & Biaz, S. (2010). IEEE 802.11s Wireless Mesh Networks for Last-Mile Internet Access: An Open-Source Real-World Indoor Testbed Implementation. Wireless Sensor Network, 02(10), 725-738. doi:10.4236/wsn.2010.210088Yen, Y.-S., Chang, R.-S., & Wu, C.-Y. (2011). A seamless handoff scheme for IEEE 802.11 wireless networks. Wireless Communications and Mobile Computing, 13(2), 157-169. doi:10.1002/wcm.1102Liangzhong Yin, & Guohong Cao. (2006). Supporting cooperative caching in ad hoc networks. IEEE Transactions on Mobile Computing, 5(1), 77-89. doi:10.1109/tmc.2006.15Biswas S Morris R ExOR: opportunistic multi-hop routing for wireless networks Proceedings of ACM SIGCOMM 2005 133 144Chachulski S Jennings M Katti S Katabi D Trading structure for randomness in wireless opportunistic routing Proceedings of ACM SIGCOMM 2007 169 180Kohler E Handley M Floyd S Datagram Congestion Control Protocol (DCCP), IETF RFC 4340 2006 http://www.rfc-editor.org/rfc/rfc4340.txtSchierl, T., Ganger, K., Hellge, C., Wiegand, T., & Stockhammer, T. (2006). SVC-based multisource streaming for robust video transmission in mobile ad hoc networks. IEEE Wireless Communications, 13(5), 96-103. doi:10.1109/wc-m.2006.250365Iera, A., Molinaro, A., Paratore, S. Y., Ruggeri, G., & Zurzolo, A. (2011). Making a mesh router/gateway from a smartphone: Is that a practical solution? Ad Hoc Networks, 9(8), 1414-1429. doi:10.1016/j.adhoc.2011.03.00

    Node Cooperation to Avoid Early Congestion Detection Based on Cross-Layer for Wireless Ad Hoc Networks

    Get PDF
    The resent application of wireless ad hoc networks (WANET) demands a high and reliable data load. The simultaneous transfer of large amounts of data different nearby sources to nearby destinations in a massive network under these circumstances results in the possibility of network congestion. Congestion is an extremely unwanted condition because it creates extra overhead to the already deeply loaded environment, which ultimately leads to resource exhaustion, and can lead to packet drops and retransmission at either the MAC or upper layers. We present a lightweight congestion control and early avoidance congestion control scheme, which can effective control congestion while keeping overhead to a minimum. This scheme is based on the Cross-layer between the MAC and network layers lead to early detection of congestion. With the help of node cooperation the sender node is triggered to find an alternative route based on TMT. This mechanism controls the network resources rather than the data traffic. Detailed performance results show enhancement in the throughput and packet delivery ratio, as well as a reduction in packet drop. Generally, network performance increases

    A survey of performance enhancement of transmission control protocol (TCP) in wireless ad hoc networks

    Get PDF
    This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2011 Springer OpenTransmission control protocol (TCP), which provides reliable end-to-end data delivery, performs well in traditional wired network environments, while in wireless ad hoc networks, it does not perform well. Compared to wired networks, wireless ad hoc networks have some specific characteristics such as node mobility and a shared medium. Owing to these specific characteristics of wireless ad hoc networks, TCP faces particular problems with, for example, route failure, channel contention and high bit error rates. These factors are responsible for the performance degradation of TCP in wireless ad hoc networks. The research community has produced a wide range of proposals to improve the performance of TCP in wireless ad hoc networks. This article presents a survey of these proposals (approaches). A classification of TCP improvement proposals for wireless ad hoc networks is presented, which makes it easy to compare the proposals falling under the same category. Tables which summarize the approaches for quick overview are provided. Possible directions for further improvements in this area are suggested in the conclusions. The aim of the article is to enable the reader to quickly acquire an overview of the state of TCP in wireless ad hoc networks.This study is partly funded by Kohat University of Science & Technology (KUST), Pakistan, and the Higher Education Commission, Pakistan

    A Survey on Multimedia-Based Cross-Layer Optimization in Visual Sensor Networks

    Get PDF
    Visual sensor networks (VSNs) comprised of battery-operated electronic devices endowed with low-resolution cameras have expanded the applicability of a series of monitoring applications. Those types of sensors are interconnected by ad hoc error-prone wireless links, imposing stringent restrictions on available bandwidth, end-to-end delay and packet error rates. In such context, multimedia coding is required for data compression and error-resilience, also ensuring energy preservation over the path(s) toward the sink and improving the end-to-end perceptual quality of the received media. Cross-layer optimization may enhance the expected efficiency of VSNs applications, disrupting the conventional information flow of the protocol layers. When the inner characteristics of the multimedia coding techniques are exploited by cross-layer protocols and architectures, higher efficiency may be obtained in visual sensor networks. This paper surveys recent research on multimedia-based cross-layer optimization, presenting the proposed strategies and mechanisms for transmission rate adjustment, congestion control, multipath selection, energy preservation and error recovery. We note that many multimedia-based cross-layer optimization solutions have been proposed in recent years, each one bringing a wealth of contributions to visual sensor networks

    Progetto e realizzazione di un protocollo di trasporto per reti Ad Hoc Multi-Hop

    Get PDF
    A Mobile Ad hoc Network (MANET) is a collection of mobile nodes connected together over a wireless medium, which self-organize into an autonomous multi-hop wireless network. This kind of networks allows devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. This thesis examines the problems encountered by TCP over multi-hop ad hoc networks. TCP is not able to efficiently deal with the unstable and very dynamic environment provided by multi-hop ad hoc networks. This is because TCP implicitly assumes that packet loss is almost always due to congestion phenomena causing buffer overflows at intermediate routers. Furthermore, it also assumes that nodes are static (i.e., they do not change their position over time). Unfortunately, these assumptions do not hold in MANETs, since in this kind of networks packet losses due to interference and link-layer contentions are largely predominant, and nodes may be mobile. This thesis presents a new lightweight transport protocol (TPA) designed from scratch, that provides a connection-oriented, reliable type of service. TPA differs from TCP in a number of ways. Specifically, the data transfer and the congestion control algorithms have been re-designed. Furthermore, TPA explicitly detects and deals with both route failures and route changes and it can also leverage cross-layer interactions with the routing protocol, when available. This thesis also includes a preliminary simulative evaluation of TPA
    corecore