The following pages link to The capacity of wireless networks (Q4503540):
Displaying 50 items.
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks (Q1652223) (← links)
- Robust gateway placement in wireless mesh networks (Q1652709) (← links)
- The topology of wireless communication on a line (Q1698733) (← links)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
- Metastability of queuing networks with mobile servers (Q1756563) (← links)
- Distributed time synchronization for networks with random delays and measurement noise (Q1796992) (← links)
- Weighted improper colouring (Q1932354) (← links)
- Performance analysis for \((X,S)\)-bottleneck cell in large-scale wireless networks (Q1944088) (← links)
- Mobile geometric graphs: detection, coverage and percolation (Q1955843) (← links)
- Limitations of current wireless link scheduling algorithms (Q2202005) (← links)
- Deterministic protocols in the SINR model without knowledge of coordinates (Q2208251) (← links)
- Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss (Q2241637) (← links)
- The cost of global broadcast in dynamic radio networks (Q2285142) (← links)
- Flocking with general local interaction and large population (Q2287365) (← links)
- On the economic sustainability of supplying bandwidth policies in multi-layer wireless cognitive networks (Q2290794) (← links)
- Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae (Q2348034) (← links)
- Topological properties of random wireless networks (Q2371220) (← links)
- Efficient broadcasting in radio networks with long-range interference (Q2375820) (← links)
- Constant-approximation for optimal data aggregation with physical interference (Q2393081) (← links)
- Continuous data aggregation and capacity in probabilistic wireless sensor networks (Q2443003) (← links)
- Maximum flow problem in wireless ad hoc networks with directional antennas (Q2458905) (← links)
- Cross-layer optimization in ultra wideband networks (Q2463846) (← links)
- Stochastic networks with multiple stable points (Q2468427) (← links)
- On the fundamental limits of topology control in ad hoc networks (Q2471707) (← links)
- Designing a contact process: the piecewise-homogeneous process on a finite set with applications (Q2485821) (← links)
- Monotone properties of random geometric graphs have sharp thresholds (Q2496499) (← links)
- Message and time efficient multi-broadcast schemes (Q2513670) (← links)
- Towards a dynamical model for wireless sensor networks (Q2575093) (← links)
- Delay and capacity trade-offs in mobile wireless networks with infrastructure support (Q2637275) (← links)
- Optimal congestion control algorithm for ad hoc networks: penalty function-based approach (Q2644518) (← links)
- Network design under general wireless interference (Q2665910) (← links)
- A maximum clique based approximation algorithm for wireless link scheduling under SINR model (Q2672948) (← links)
- Cloud Computing in Space (Q2802249) (← links)
- Exact formulations for the minimum interference problem in<i>k</i>-connected<i>ad hoc</i>wireless networks (Q2829159) (← links)
- Combining Spot and Futures Markets: A Hybrid Market Approach to Dynamic Spectrum Access (Q2830759) (← links)
- Self-organization and emergent behaviour: distributed decision making in sensor networks (Q2845280) (← links)
- Large deviations of the interference in the Ginibre network model (Q2921187) (← links)
- Average consensus on networks with quantized communication (Q2928300) (← links)
- BROADCAST SCHEDULING PROBLEM IN SINR MODEL (Q2929620) (← links)
- Analytical Framework for Contact Time Evaluation in Delay-Tolerant Networks (Q3006021) (← links)
- Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation (Q3057149) (← links)
- Performance Characteristics of Multicast Flows on Random Trees (Q3157869) (← links)
- STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE (Q3166749) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- Distributed filtering of networked dynamic systems with non-Gaussian noises over sensor networks: A survey (Q3297094) (← links)
- EPIDEMICS OF SIRS MODEL WITH NONUNIFORM TRANSMISSION ON SCALE-FREE NETWORKS (Q3398041) (← links)
- On Efficient Gossiping in Radio Networks (Q3408156) (← links)
- Batched Point Location in SINR Diagrams via Algebraic Tools (Q3448774) (← links)
- Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points (Q3448848) (← links)
