Searching for authors named "Theodoros Salonidis" – sorted by Relevance.
-
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks
- We present a framework for the provision of deterministic end-toend bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility conditions, multi-hop sessions are dynamically offered allocations, further translated to link demands. Using a distributed Time Division Multipl
- Cited by 18 (1 self) – Add To MetaCart
-
Robust Speech Recognition for Multiple Topological Scenarios of the GSM Mobile Phone System
- This paper deals with robust speech recognition in the GSM mobile environment. Our focus is on the voice degradation due to the losses in the GSM coding scheme. Thus, we initially propose an experimental framework of network topologies that consists of various coding-decoding systems placed in tande
- Cited by 6 (0 self) – Add To MetaCart
-
Identifying High Throughput Paths in 802.11 Mesh Networks: a Model-based Approach
- Abstract — We address the problem of identifying high throughput paths in 802.11 wireless mesh networks. We introduce an analytical model that accurately captures the 802.11 MAC protocol operation and predicts both throughput and delay of multi-hop flows under changing traffic load or routing decisi
- Cited by 3 (0 self) – Add To MetaCart
-
ABSTRACT A Cross-Layer Load-Independent Link Cost Metric for Wireless Mesh Networks
- a MAC-aware load-independent link cost metric for 802.11based wireless mesh networks. X-UTT utilizes information acquired from a network-layer unicast probing system and a MAC-layer monitoring system. It is designed to capture the wireless link capacity and be independent of the load induced by self
- Add To MetaCart
-
On Optimal Cooperative Route Caching in Large, Memory-Limited Wireless Ad Hoc Networks
- Caching is a popular mechanism for enhancing performance in various layers and applications of computer networking. We introduce both a model and algorithms for caching routing information in large, memory-limited wireless ad hoc networks. Each host can cache only a small fraction of the network and
- Add To MetaCart
-
Proximity awareness and ad hoc network establishment in bluetooth
- Abstract-- In recent years, wireless ad hoc networks have been a growing area of research. While there has been considerable research on the topic of routing in such networks, the topic of topology creation has not received due attention. This is because almost all ad hoc networks to date have been
- Cited by 8 (0 self) – Add To MetaCart
-
Distributed on-Line Schedule Adaptation for Balanced Slot Allocation in Wireless Ad Hoc Networks
- We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes. The primary objective is to derive a distributed coordination method for schedule construction and modification for any wire
- Cited by 3 (3 self) – Add To MetaCart
-
Asynchronous TDMA ad hoc networks: Scheduling and Performance
- A common assumption of TDMA-based wireless ad hoc networks is the existence of network-wide slot synchronization. Such a mechanism is difficult to support in practice. In asynchronous TDMA systems, each link uses a local time slot reference provided by the hardware clock tick of one of the node endp
- Cited by 2 (1 self) – Add To MetaCart
-
Performance issues of Bluetooth scatternets and other asynchronous TDMA ad hoc networks
- A common assumption of TDMA-based wireless ad hoc networks is the existence of network-wide slot synchronization. In practice such a mechanism is difficult to support. In asynchronous TDMA systems each link uses a local time slot reference provided by the hardware clock tick of one of the node endpo
- Cited by 4 (2 self) – Add To MetaCart
-
A Distributed Scheduling Method for Maxmin Fair Bandwidth Allocation in Wireless Ad Hoc Networks
- We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes. The primary objective is to derive a distributed coordination method for schedule construction and modification for any wire
- Cited by 1 (0 self) – Add To MetaCart

