• Corpus ID: 14273252

Critical Power for AsymptoticConnectivity in Wireless NetworksPiyush

  title={Critical Power for AsymptoticConnectivity in Wireless NetworksPiyush},
  author={GuptaP and Ridhima . and KumarKEYWORDS},
In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each oth-ers' packets, as is the case in ad hoc wireless networks, each node should transmit with just enough power to guarantee connectivity in the network. Towards this end, we derive the critical power a node in the network… 
9 Citations
Information theoretic bounds on the throughput scaling of wireless relay networks
This work considers a two-dimensional network of extending area with only one active source-destination pair at any given time, and all remaining nodes acting only as possible relays and shows that the per-node throughput remains constant as the network size increases.
Capacity Scaling of Ad Hoc Networks with Spatial Diversity
It is concluded that in ad hoc networks, beamforming performs best, selection combining performs well for smaller numbers of antennas, and that space-time block coding offers only marginal gains.
Low Latency Wireless Ad-Hoc Networking: Power and Bandwidth Challenges and a Hierarchical Solution
Multi-resolution randomized hierarchy (MRRH), a novel power and bandwidth efficient WANET protocol with scalable network latency, is introduced, a provably efficient candidate for truly large scale wireless ad-hoc networking.
Reliable Broadcast in Wireless Networks with Probabilistic Failures
  • V. Bhandari, N. Vaidya
  • Computer Science
    IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
  • 2007
The primary focus is on Byzantine failures, but the also handle crash-stop failures, and it is proved that, for failure probability less than frac12, the critical average degree for reliable broadcast is O(lnn/frac12-p+frac12ln(1/2(1-p))).
Data dissemination in low duty-cycle multi-channel multi-hop wireless sensor networks
This paper presents a distributed channel selection scheme for efficient data dissemination in low duty-cycle multi-channel multi-hop wireless sensor network and name it as a Smart Channel Selection Scheme and analyzes the performance of the proposed approach and compared it with three relevant approaches.
Stochastic geometry and random graphs for the analysis and design of wireless networks
This tutorial article surveys some of these techniques based on stochastic geometry and the theory of random geometric graphs, discusses their application to model wireless networks, and presents some of the main results that have appeared in the literature.
Scheduling Wireless Links with Successive Interference Cancellation
A polynomial-time scheduling algorithm that uses successive interference cancellation to compute short schedules for network topologies formed by nodes arbitrarily distributed in the Euclidean plane is proposed and proves that the proposed algorithm is correct in the physical interference model.
Problem of localisation in networks of randomly deployed nodes: asymptotic and finite analysis, and thresholds
Finite (when the number of nodes in the bounded domain is finite and does not grow) and asymptotic thresholds for the localisation probability are derived and the authors show the presence of asymPTotic thresholds on the network localised probability in two different scenarios.


A System and Traac Dependent Adaptive Routing Algorithm for Ad Hoc Networks 1
A new routing algorithm for ad hoc networks using a novel technique for estimating the path delays without requiring the links to be bidirectional or the clocks at the nodes in the network to be synchronized.
Dynamic Source Routing in Ad Hoc Wireless Networks
This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Radio link admission algorithms for wireless networks with power control and active link quality protection
A distributed power control scheme, which maintains the signal/interference ratios (SIRs) of operational (active) links above their required thresholds at all times while new users are being admitted and when new users cannot be successfully admitted, existing ones do not suffer fluctuations of their SIRs below their required threshold values.
Stochastic power control for cellular radio systems
This work develops distributed iterative power control algorithms that use readily available measurements and proves that the mean-squared error (MSE) of the power vector from the optimal power vector that is the solution of a feasible deterministic power control problem goes to zero.
Introduction to the theory of coverage processes
Examples, concepts and tools random line segments, queues and counters vacancy counting and clumping elements of inference. Appendices: direct Radon-Nikodym theorem central limit theorem, Poisson
Dynamic source routing in ad hoc wireless networks
4(1 + 00 )e c : Since 00 can be made arbitrarily small, the result follows. 2 Authors' AAliations
  • 4(1 + 00 )e c : Since 00 can be made arbitrarily small, the result follows. 2 Authors' AAliations
Percolation Theory for Mathematicians, Birkhh auser
  • Percolation Theory for Mathematicians, Birkhh auser
  • 1982
Percolation Theory for Mathematicians, Birkhauser
  • 1982
Percolation Theory for Mathematicians, Birkh
  • 1982