Sciweavers

DATE
2006
IEEE
82views Hardware» more  DATE 2006»
14 years 6 months ago
Performance analysis of greedy shapers in real-time systems
— Traffic shaping is a well-known technique in the area of networking and is proven to reduce global buffer requirements and end-to-end delays in networked systems. Due to these...
Ernesto Wandeler, Alexander Maxiaguine, Lothar Thi...
MSN
2007
Springer
124views Sensor Networks» more  MSN 2007»
14 years 6 months ago
Reducing End-to-End Delay in Multi-path Routing Algorithms for Mobile Ad Hoc Networks
Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find nodedisjoint paths to achieve higher fault toleranc...
Nastooh Taheri Javan, Mehdi Dehghan
INFOCOM
2007
IEEE
14 years 6 months ago
An Optimal Algorithm for Minimizing Energy Consumption while Limiting Maximum Delay in a Mesh Sensor Network
— This paper presents an algorithm for maximizing the lifetime of a sensor network while guaranteeing an upper bound on the end-to-end delay. We prove that the proposed algorithm...
Reuven Cohen, Boris Kapchits
ICC
2007
IEEE
146views Communications» more  ICC 2007»
14 years 6 months ago
A Delay-Constrained Shared Mesh Restoration Scheme
—We present a multi-constrained routing algorithm, called Delay-constrained Pool Sharing (DPS), in a survivable mesh network. The goal of this algorithm is to find a pair of link...
Hassan Naser, Ming Gong
WCNC
2008
IEEE
14 years 6 months ago
On Energy-Efficient and Low-Latency Medium Access Control in Wireless Sensor Networks
Abstract— In wireless sensor networks, one of the big challenges is to achieve a satisfactory network lifetime while meeting quality of service (QoS) requirements. In this paper,...
Zhiwen Wan, Jinsong Zhang, Hao Zhu, Kia Makki, Nik...
ICC
2008
IEEE
118views Communications» more  ICC 2008»
14 years 6 months ago
Bounded-Variance Network Calculus: Computation of Tight Approximations of End-to-End Delay
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
Paolo Giacomazzi, Gabriella Saddemi
GLOBECOM
2008
IEEE
14 years 7 months ago
Distributed and Dynamic Resource Allocation for Delay Sensitive Network Services
—In this paper, we present a distributed algorithm to dynamically allocate the available resources of a service-oriented network to delay sensitive network services. We use a uti...
Michael G. Kallitsis, Robert D. Callaway, Michael ...
GLOBECOM
2008
IEEE
14 years 7 months ago
A Dynamic Programming Approach for Routing in Wireless Mesh Networks
—The routing problem in Wireless Mesh Networks is concerned with finding “good” source-destination paths. It generally faces multiple objectives to be optimized, such as i) ...
Jorge Crichigno, Joud Khoury, Min-You Wu, Wei Shu
FGCN
2008
IEEE
116views Communications» more  FGCN 2008»
14 years 7 months ago
Routing in Degree-Constrained FSO Mesh Networks
This paper addresses the routing problem in packet switching free-space optical (FSO) mesh networks. FSO mesh networks are emerging as broadband communication networks because of ...
Ziping Hu, Pramode K. Verma, James J. Sluss Jr.
INFOCOM
2009
IEEE
14 years 7 months ago
Minimizing End-to-End Delay: A Novel Routing Metric for Multi-Radio Wireless Mesh Networks
—This paper studies how to select a path with the minimum cost in terms of expected end-to-end delay (EED) in a multi-radio wireless mesh network. Different from the previous eff...
Hongkun Li, Yu Cheng, Chi Zhou, Weihua Zhuang