The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we consider the joint problem of congestion control and scheduling with multi-class Quality of Service (QoS) requirements. Generally, the joint problem is formulated as a Network Utility Maximization (NUM) problem and can be decomposed into a congestion control problem and a scheduling problem. Usually, the congestion control problem can be solved in a distributed manner by tracking...
Wireless Mesh Networks (WMNs) with chain topologies are very useful in road and railroad transportation or in tunnel and mine applications. The proposed protocols for WMNs usually support best-effort traffic or some kind of Quality of Service (QoS). However, some applications such as remote-controlled machines in industrial control networks have Hard Real-Time (HRT) requirements, i.e., strict deadlines...
IEEE 802.11e (EDCA) standard is concerned to support QoS in wireless ad-hoc networks. However, EDCA cannot control traffic when there is a congestion to guarantee QoS required by real-time and multimedia applications. Therefore, the ill-behaved sources consume the most of bandwidth allowed. That leads to some of source nodes (i.e. out-ranged nodes) suffer from the lack of bandwidth and unfairness...
In this paper we investigate whether scheduling packets based on path information can improve the fairness in an ad hoc network. The users may have a need for a predictable service over time and common to the whole ad hoc network. However, the performance depends on the path between sender and receiver, and it will therefore vary over time. Two schemes are analyzed; the first scheme differentiates...
Topology control and energy saving is one of the most important challenges in wireless ad hoc sensor networks. There are two approaches for conserve energy in topology control algorithms. First by adjusting a node??s transmission power and second manipulating a node??s state. In this paper, multi-state k-fault tolerant topology control algorithm is presented using clustering technique to manage k...
As wireless local area networks (WLAN) become ubiquitous and an integral part of data networks, they will also be increasingly used for applications ranging from standard Internet services like ftp to time bound multimedia applications, such as Voice (or Video) over IP (VoIP/VIP), HDTV etc. with strict latency, throughput or jitter restrictions. These applications on WLAN will also be more bandwidth...
It is well-known that TCP has difficulty in achieving desirable levels of performance in multi-hop ad hoc networks. TCP implements a loss-based congestion control mechanism for adjusting traffic in the networks. However, when TCP reacts to a loss event in a multi-hop ad hoc network, contentions raised in the IEEE 802.11 MAC layer among nodes usually becomes excessive. This problem eventually induces...
In this paper we introduce two novel control slot scheduling approaches for creating dynamic contention free time division multiple access (TDMA) schedules. Our approaches are ideal for exchanging control information in mobile ad hoc networks (MANET) and wireless mesh networks so that dynamic resource needs of participating nodes can be rapidly accommodated for quality of service (QoS) guarantees...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.