Critical Density Thresholds in Distributed Wireless Networks

Krishnamachari, Bhaskar; Wicker, S.B.; Béjar, Ramón; Pearlman, Marc R.

doi:10.1007/978-1-4757-3789-9_14

Cited by 44 publications

(31 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This typical modeling assumption is commonly used by many researchers [8], [12], [13], [22], [24], [25], [34], [49], [54], [55]. In particular, the initial placement of the nodes is assumed to be random when the sensors are distributed over a region from a moving vehicle such as an airplane.…”

mentioning

confidence: 99%

Extremal properties of three-dimensional sensor networks with applications

Ravelomanana

2004

IEEE Trans. on Mobile Comput.

149

View full text Add to dashboard Cite

In this paper, we analyze various critical transmitting/sensing ranges for connectivity and coverage in three-dimensional sensor networks. As in other large-scale complex systems, many global parameters of sensor networks undergo phase transitions: For a given property of the network, there is a critical threshold, corresponding to the minimum amount of the communication effort or power expenditure by individual nodes, above (resp. below) which the property exists with high (resp. a low) probability.For sensor networks, properties of interest include simple and multiple degrees of connectivity/coverage. First, we investigate the network topology according to the region of deployment, the number of deployed sensors and their transmitting/sensing ranges. More specifically, we consider the following problems:Assume that n nodes, each capable of sensing events within a radius of r, are randomly and uniformly distributed in a 3-dimensional region R of volume V , how large must the sensing range r Sense be to ensure a given degree of coverage of the region to monitor? For a given transmission range r Trans , what is the minimum (resp. maximum) degree of the network? What is then the typical hop-diameter of the underlying network? Next, we show how these results affect algorithmic aspects of the network by designing specific distributed protocols for sensor networks.

show abstract

mentioning

confidence: 99%

Extremal properties of three-dimensional sensor networks with applications

Ravelomanana

2004

IEEE Trans. on Mobile Comput.

149

View full text Add to dashboard Cite

show abstract

“…As for random graphs, aiming at applications to wireless networks, one of the main research topics in recent years has been the analysis of their connectivity (Santi, Blough, and Vainstein, 2001; Krishnamachari et al, 2002). In this paper, for the fixed radius model and the Bernoulli model, we demonstrated that the peak locations of H, E, and C almost coincide with each other at the phase transition area where the probability of existence of solutions (a sort of connectivity) rapidly decreases.…”

Section: Related Workmentioning

confidence: 72%

Hardness measures for gridworld benchmarks and performance analysis of real-time heuristic search algorithms

Mizusawa

Kurihara

2008

J Heuristics

View full text Add to dashboard Cite

Gridworlds are one of the most popular settings used in benchmark problems for real-time heuristic search algorithms. However, no comprehensive studies have existed so far on how the difference in the density of randomly positioned obstacles affects the hardness of the problems. This paper presents two measures for characterizing the hardness of gridworld problems parameterized by obstacle ratio, and relates them to the performance of the algorithms. We empirically show that the peak locations of those measures and actual performance degradation of the basic algorithms (RTA* and LRTA*) almost coincide with each other for a wide variety of problem settings. Thus the measures uncover some interesting aspects of the gridworlds.

show abstract

“…Reasonably, in the case R = 22m, a higher node density is required to reach this reachability. Detailed studies of critical density for wireless network connectivity can be found in [20], [21]. Here, we will focus on the comparison among different k-hop searching results.…”

Section: A Study Of Simple Geographic Greedy Routingmentioning

confidence: 99%

An exploration of geographic routing with k-hop based searching in wireless sensor networks

Chen

Song

2008

2008 Third International Conference on Communications and Networking in China

View full text Add to dashboard Cite

Abstract-We explore the asymptotic performance of existing geographic routing with a utilization of k-hop neighborhood information. The reachability from source to sink improves as we use more information for routing decision and the average number of hops required decreases significantly from 1-hop to 2-hop searching, which indicates a potential tradeoff between performance enhancement and system complexity. As simple greedy geographic routing is insufficient in lossy wireless environment, we propose a new metric incorporating both advance in distance and link quality. Through simulations, we show its effectiveness over the conventional simple greedy method. The generalization to k-hop based routing and resulting performance are also presented. Simulation results show that with the multi-hop based searching, there is a good improvement in the number of transmissions required from source to sink, which also indicates potential improvement in routing delay and energy consumption in transmissions.

show abstract

Critical Density Thresholds in Distributed Wireless Networks

Cited by 44 publications

References 16 publications

Extremal properties of three-dimensional sensor networks with applications

Extremal properties of three-dimensional sensor networks with applications

Hardness measures for gridworld benchmarks and performance analysis of real-time heuristic search algorithms

An exploration of geographic routing with k-hop based searching in wireless sensor networks

Contact Info

Product

Resources

About