Sciweavers

1204 search results - page 137 / 241
» Optimal Routing in a Small-World Network
Sort
View
AINA
2007
IEEE
16 years 14 days ago
Reference Path Ad Hoc Routing Mechanism
The purpose of this work is to present the Reference Path Ad hoc Routing (REPAR) mechanism, which has been designed to optimize the performance of reactive ad hoc routing protocol...
Fabricio L. Figueiredo, Paulo Cardieri, Marcel C. ...
IJSNET
2006
217views more  IJSNET 2006»
15 years 6 months ago
Optimal sleep scheduling with transmission range assignment in application-specific wireless sensor networks
: To extend the functional lifetime of battery-operated Wireless Sensor Networks (WSNs), stringent sleep scheduling strategies with communication duty cycles running at sub-1% rang...
Rick W. Ha, Pin-Han Ho, Xuemin Shen
150
Voted
ATMOS
2010
163views Optimization» more  ATMOS 2010»
15 years 5 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...
ICALP
2003
Springer
15 years 11 months ago
Anycasting in Adversarial Systems: Routing and Admission Control
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
Baruch Awerbuch, André Brinkmann, Christian...
TCC
2009
Springer
132views Cryptology» more  TCC 2009»
16 years 6 months ago
Authenticated Adversarial Routing
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
Yair Amir, Paul Bunn, Rafail Ostrovsky