UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Wireless Sensor Networks Under the Random Pairwise Key Predistribution Scheme: Can Resiliency Be Achieved With Small Key Rings?

IEEE/ACM transactions on networking, 2016-12, Vol.24 (6), p.3383-3396

2016

Volltextzugriff (PDF)

Zero-One Laws for Connectivity in Random Key Graphs

IEEE transactions on information theory, 2012-05, Vol.58 (5), p.2983-2999

2012

Volltextzugriff (PDF)

On the Connectivity of Sensor Networks Under Random Pairwise Key Predistribution

IEEE transactions on information theory, 2013-09, Vol.59 (9), p.5754-5762

2013

Volltextzugriff (PDF)

Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links

IEEE transactions on information theory, 2013-03, Vol.59 (3), p.1740-1760

2013

Volltextzugriff (PDF)

Asymptotic Degree Distributions in Large (Homogeneous) Random Networks: A Little Theory and a Counterexample

IEEE transactions on network science and engineering, 2020-07, Vol.7 (3), p.1531-1544

2020

Volltextzugriff (PDF)

On the Optimality of Uniform Pulse Amplitude Modulation

IEEE transactions on information theory, 2006-12, Vol.52 (12), p.5546-5549

Makowski, A.M.

2006

Volltextzugriff (PDF)

On the scalability of the random pairwise key predistribution scheme: Gradual deployment and key ring sizes

Performance evaluation, 2013-07, Vol.70 (7-8), p.493-512

2013

Volltextzugriff (PDF)

One-Dimensional Geometric Random Graphs With Nonvanishing Densities-Part I: A Strong Zero-One Law for Connectivity

IEEE transactions on information theory, 2009-12, Vol.55 (12), p.5832-5839

2009

Volltextzugriff (PDF)

Distribution of path durations in mobile ad-hoc networks—Palm’s Theorem to the rescue

Computer networks (Amsterdam, Netherlands : 1999), 2006-08, Vol.50 (12), p.1887-1900

2006

Volltextzugriff (PDF)

One-dimensional geometric random graphs with nonvanishing densities II: a very strong zero-one law for connectivity

Queueing systems, 2012-10, Vol.72 (1-2), p.103-138

2012

Volltextzugriff (PDF)

A very strong zero-one law for connectivity in one-dimensional geometric random graphs

IEEE communications letters, 2007-01, Vol.11 (1), p.55-57

2007

Volltextzugriff (PDF)

Scaling Laws for Connectivity in Random Threshold Graph Models with Non-Negative Fitness Variables

IEEE journal on selected areas in communications, 2013-09, Vol.31 (9), p.573-583

2013

Volltextzugriff (PDF)

On the Absence of Isolated Nodes in Wireless Ad-Hoc Networks with Unreliable Links - a Curious Gap

2010 Proceedings IEEE INFOCOM, 2010, p.1-9

2010

Volltextzugriff (PDF)

Asymptotic optimality of the Round–Robin policy in multipath routing with resequencing

Queueing systems, 2006-03, Vol.52 (3), p.199-214

2006

Volltextzugriff (PDF)

Long-range dependence does not necessarily imply non-exponential tails

IEEE communications letters, 2002-12, Vol.6 (12), p.550-552

Makowski, A.M.

2002

Volltextzugriff (PDF)

On the behavior of ECN/RED gateways under a large number of TCP flows: Limit theorems

Queueing systems, 2006-04, Vol.52 (4), p.287-304

2006

Volltextzugriff (PDF)

Discussion of ''Teletraffic'

Scandinavian journal of statistics, 2005-06, Vol.32 (2), p.217-218

MAKOWSKI, ARMAND M.

2005

Volltextzugriff (PDF)

On the Eschenauer-Gligor key predistribution scheme under on-off communication channels: The absence of isolated nodes

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2015, p.1494-1501

2015

Volltextzugriff (PDF)

On the asymptotics of degree distributions

2015 54th IEEE Conference on Decision and Control (CDC), 2015, p.5506-5511

2015

Volltextzugriff (PDF)

Comparing strength of locality of reference - popularity, majorization, and some folk theorems

IEEE INFOCOM 2004, 2004, Vol.2, p.838-849 vol.2

2004

Volltextzugriff (PDF)

WHEN ARE ON–OFF SOURCES SIS?: CONDITIONS AND APPLICATIONS

Probability in the engineering and informational sciences, 2004-10, Vol.18 (4), p.423-443

2004

Volltextzugriff (PDF)

On a reduced load equivalence for fluid queues under subexponentiality

Queueing systems, 1999, Vol.33 (1-3), p.5-41

1999

Volltextzugriff (PDF)

Sensitivity of critical transmission ranges to node placement distributions

IEEE journal on selected areas in communications, 2009-09, Vol.27 (7), p.1066-1077

2009

Volltextzugriff (PDF)

Steering policies for controlled Markov chains under a recurrence condition

IEEE transactions on automatic control, 1999-08, Vol.44 (8), p.1583-1587

1999

Volltextzugriff (PDF)

Heavy traffic limits associated with M/G/∞ input processes

Queueing systems, 2000, Vol.34 (1-4), p.101-130

2000

Volltextzugriff (PDF)

1 – 25 von 96

Menü

Weitere Dienste

Einstellungen

Wireless Sensor Networks Under the Random Pairwise Key Predistribution Scheme: Can Resiliency Be Achieved With Small Key Rings?

Zero-One Laws for Connectivity in Random Key Graphs

On the Connectivity of Sensor Networks Under Random Pairwise Key Predistribution

Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links

Asymptotic Degree Distributions in Large (Homogeneous) Random Networks: A Little Theory and a Counterexample

On the Optimality of Uniform Pulse Amplitude Modulation

On the scalability of the random pairwise key predistribution scheme: Gradual deployment and key ring sizes

One-Dimensional Geometric Random Graphs With Nonvanishing Densities-Part I: A Strong Zero-One Law for Connectivity

Distribution of path durations in mobile ad-hoc networks—Palm’s Theorem to the rescue

One-dimensional geometric random graphs with nonvanishing densities II: a very strong zero-one law for connectivity

A very strong zero-one law for connectivity in one-dimensional geometric random graphs

Scaling Laws for Connectivity in Random Threshold Graph Models with Non-Negative Fitness Variables

On the Absence of Isolated Nodes in Wireless Ad-Hoc Networks with Unreliable Links - a Curious Gap

Asymptotic optimality of the Round–Robin policy in multipath routing with resequencing

Long-range dependence does not necessarily imply non-exponential tails

On the behavior of ECN/RED gateways under a large number of TCP flows: Limit theorems

Discussion of ''Teletraffic'

On the Eschenauer-Gligor key predistribution scheme under on-off communication channels: The absence of isolated nodes

On the asymptotics of degree distributions

Comparing strength of locality of reference - popularity, majorization, and some folk theorems

WHEN ARE ON–OFF SOURCES SIS?: CONDITIONS AND APPLICATIONS

On a reduced load equivalence for fluid queues under subexponentiality

Sensitivity of critical transmission ranges to node placement distributions

Steering policies for controlled Markov chains under a recurrence condition

Heavy traffic limits associated with M/G/∞ input processes

Suchergebnisse filtern