Sciweavers

914 search results - page 113 / 183
» Branch and Bound on the Network Model
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
TIT
2010
146views Education» more  TIT 2010»
14 years 4 months ago
Cooperation with an untrusted relay: a secrecy perspective
We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario...
Xiang He, Aylin Yener
MOBICOM
2005
ACM
15 years 3 months ago
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet. These networks are chara...
Murali S. Kodialam, Thyaga Nandagopal
SIGMETRICS
2008
ACM
111views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Hierarchical routing over dynamic wireless networks
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...
MOBIHOC
2008
ACM
15 years 9 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao