Sciweavers

1256 search results - page 18 / 252
» A Simple E-Voting Protocol
Sort
View
MSWIM
2005
ACM
14 years 28 days ago
Getting urban pedestrian flow from simple observation: realistic mobility generation in wireless network simulation
In order for precise evaluation of MANET applications, more realistic mobility models are needed in wireless network simulations. In this paper, we focus on the behavior of pedest...
Kumiko Maeda, Kazuki Sato, Kazuki Konishi, Akiko Y...
INFOCOM
2003
IEEE
14 years 20 days ago
MEDF - A Simple Scheduling Algorithm for Two Real-Time Transport Service Classes with Application in the UTRAN
— In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-time packetswitched data (PSD) in the UMTS Terrestrial Radio Access Net...
Michael Menth, Matthias Schmid, Herbert Heiss, Tho...
SIGCOMM
1999
ACM
13 years 11 months ago
A Simple Approximation to Minimum-Delay Routing
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
Srinivas Vutukury, J. J. Garcia-Luna-Aceves
TCOM
2010
107views more  TCOM 2010»
13 years 5 months ago
A Simple Recruitment Scheme of Multiple Nodes for Cooperative MAC
—Physical (PHY) layer cooperation in a wireless network allows neighboring nodes to share their communication resources in order to create a virtual antenna array by means of dis...
Francesco Verde, Thanasis Korakis, Elza Erkip, Ann...
INFOCOM
2006
IEEE
14 years 1 months ago
A Brownian Motion Model for Last Encounter Routing
— We use a mathematical model based on Brownian motion to analyze the performance of Last Encounter Routing (LER), a routing protocol for ad hoc networks. Our results show that, ...
Stratis Ioannidis, Peter Marbach