Future Concepts division- publications
-
Multidimensional routing
We present a new perspective on the design and analysis of routing protocols for mobile ad-hoc networks (MANETs).
-
Parallel interaction medium access for wireless ad hoc networks
The Parallel Interaction Medium Access (PIMA) protocol is introduced to orchestrate channel access in a wireless ad hoc network when nodes are endowed with a single half-duplex radio, and can…
-
Proactive or reactive routing: a unified analytical framework in MANETs
We present a mathematical framework for the performance evaluation of proactive and reactive routing protocols operating in mobile ad hoc networks (MANETs).
-
Collaborative routing, scheduling and frequency assignment for wireless ad hoc networks using spectrum-agile radios
We present the CROWN (Collaborative ROuting, scheduling and frequency assignment for Wireless ad hoc Networks) scheme.
-
Channel access using opportunistic reservations and virtual MIMO
We propose ORCHESTRA, a channel access protocol that uses reservations and virtual MIMO to provide high throughput and bounded channel access delays.
-
Best-effort quality-of-service
We present a new, best-effort architecture for providing quality-of-service in the Internet, based on the use of the best set of paths'' to destinations.
-
Aspect shifts in Indo Aryan
We introduce supporting data from the history of Old and Middle Indo-Aryan languages, whose instantiation of this pattern has not been previously noted.
-
Micro-fluidic-based optical detection platform for characterizing fluorescing objects with integrated wavelength detection
We describe a compact, low-cost analyte detection platform that combines a fluidic channel, large area fluorescence excitation and on chip wavelength detection.
-
Uncertain luck and counterfactual stupidity
I argue that predicates of relative stupidity do have at-issue entailments, contra Barker 2002, based on evidence from their interaction with epistemic modals and with counterfactuals.
-
Heuristic search for target-value path problem
In this paper, we introduce a new class of search problems in which the objective is to find a path whose total cost is as close as possible to a…
-
Combining breadth-first and depth-first strategies in searching for optimal treewidth
This paper describes a new way to integrate the two strategies in a single search algorithm that combines the complementary strengths of both strategies to achieve significant speedups over either…
-
Delegating capabilities in predicate encryption systems
We formally define delegation in predicate encryption systems and propose a new security definition for delegation.