Sciweavers

117 search results - page 15 / 24
» Anti-Sniffing in Unbounded Networks
Sort
View
RTAS
2002
IEEE
15 years 2 months ago
Achieving End-to-end Predictability in the TAO Real-time CORBA ORB
End-to-end predictability of operations is essential for many fixed-priority distributed real-time and embedded (DRE) applications, such as command and control systems, manufactu...
Irfan Pyarali, Douglas C. Schmidt, Ron Cytron
COMPSAC
2009
IEEE
15 years 1 months ago
Leveraging Social Contacts for Message Confidentiality in Delay Tolerant Networks
Delay and disruption tolerant networks (DTNs) can bring much-needed networking capabilities to developing countries and rural areas. DTN features such as high node mobility and in...
Karim M. El Defrawy, John Solis, Gene Tsudik
ANOR
2006
64views more  ANOR 2006»
14 years 9 months ago
A note on asymptotic formulae for one-dimensional network flow problems
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
Carlos F. Daganzo, Karen R. Smilowitz
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
15 years 3 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
89
Voted
LCN
2006
IEEE
15 years 3 months ago
Performance Limits and Analysis of Contention-based IEEE 802.11 MAC
— Recent advance in IEEE 802.11 based standard has pushed the wireless bandwidth up to 600Mbps while keeping the same wireless medium access control (MAC) schemes for full backwa...
Shao-Cheng Wang, Ahmed Helmy