Sciweavers

514 search results - page 75 / 103
» Robust Routing and Scheduling in Wireless Mesh Networks
Sort
View
GLOBECOM
2007
IEEE
14 years 19 days ago
Resource Efficient Survivable Clustering for Wireless Sensor Networks
Abstract-- In this paper, we address both lifetime and survivability issues in wireless sensor networks (WSNs). We present an easy-to-implement clustering method called DED (distri...
Mohammad Masud Hasan, Jason P. Jue
ICDE
2006
IEEE
190views Database» more  ICDE 2006»
14 years 2 months ago
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
Elke Michlmayr
CISS
2008
IEEE
14 years 3 months ago
On the delay and throughput of digital and analog network coding for wireless broadcast
— We address the problem of exchanging broadcast packets among multiple wireless terminals through a single relay node. The objective is to evaluate the delay and throughput gain...
Yalin Evren Sagduyu, Dongning Guo, Randall Berry
IWQOS
2004
Springer
14 years 2 months ago
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...
Theodoros Salonidis, Leandros Tassiulas
ICC
2008
IEEE
110views Communications» more  ICC 2008»
14 years 3 months ago
PAQ: A Starvation-Resistant Alternative to Proportional Fair
Abstract—Proportional Fair (PF) is a frequently used channelaware scheduling algorithm in 3G wireless networks. However, recent work by us and others has shown that, in practice,...
Soshant Bali, Sridhar Machiraju, Hui Zang