Dominating tree construction in wireless networks using all-pair shortest paths in graph

2011 ◽  
Vol 47 (18) ◽  
pp. 1048
Author(s):  
L.-Y. Shi ◽  
J. Peng ◽  
Y. Wang
Keyword(s):  
Wireless Networks ◽  
Shortest Paths ◽  
Tree Construction ◽  
Dominating Tree

Line-of-Sight Networks

2009 ◽  
Vol 18 (1-2) ◽  
pp. 145-163 ◽  
Author(s):  
ALAN FRIEZE ◽  
JON KLEINBERG ◽  
R. RAVI ◽  
WARREN DEBANY
Keyword(s):  
Wireless Networks ◽  
Shortest Paths ◽  
Graph Model ◽  
Constant Factor ◽  
Line Of Sight ◽  
Geometric Graphs ◽  
Indoor Environments ◽  
Random Graph Model ◽  
Random Geometric Graphs ◽  
Fixed Distance

Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square or circle), and then connects pairs of points by an edge if they are within a fixed distance of one another. In addition to giving rise to a range of basic theoretical questions, this class of random graphs has been a central analytical tool in the wireless networking community.For many of the primary applications of wireless networks, however, the underlying environment has a large number of obstacles, and communication can only take place among nodes when they are close in space and when they have line-of-sight access to one another – consider, for example, urban settings or large indoor environments. In such domains, the standard model of random geometric graphs is not a good approximation of the true constraints, since it is not designed to capture the line-of-sight restrictions.Here we propose a random-graph model incorporating both range limitations and line-of-sight constraints, and we prove asymptotically tight results for k-connectivity. Specifically, we consider points placed randomly on a grid (or torus), such that each node can see up to a fixed distance along the row and column it belongs to. (We think of the rows and columns as ‘streets’ and ‘avenues’ among a regularly spaced array of obstructions.) Further, we show that when the probability of node placement is a constant factor larger than the threshold for connectivity, near-shortest paths between pairs of nodes can be found, with high probability, by an algorithm using only local information. In addition to analysing connectivity and k-connectivity, we also study the emergence of a giant component, as well an approximation question, in which we seek to connect a set of given nodes in such an environment by adding a small set of additional ‘relay’ nodes.

ACR: an adaptive communication-aware routing through maximally zone-disjoint shortest paths inad hoc wireless networks with directional antenna

2006 ◽  
Vol 6 (2) ◽  
pp. 191-199 ◽  
Author(s):  
Tetsuro Ueda ◽  
Shinsuke Tanaka ◽  
Bokuji Komiyama ◽  
Siuli Roy ◽  
Dola Saha ◽  
...  
Keyword(s):  
Wireless Networks ◽  
Shortest Paths ◽  
Directional Antenna ◽  
Adaptive Communication

scholarly journals Mobility-Robust Tree Construction in ZigBee Wireless Networks

2011 ◽  
Author(s):  
Wei-Ho Chung ◽  
Pi-Cheng Hsiu ◽  
Yuan-Yao Shih ◽  
Ai-Chun Pang ◽  
Yu-Kai Huang ◽  
...  
Keyword(s):  
Wireless Networks ◽  
Tree Construction

A Mobility-Aware Node Deployment and Tree Construction Framework for ZigBee Wireless Networks

2013 ◽  
Vol 62 (6) ◽  
pp. 2763-2779 ◽  
Author(s):  
Yuan-Yao Shih ◽  
Wei-Ho Chung ◽  
Pi-Cheng Hsiu ◽  
Ai-Chun Pang
Keyword(s):  
Wireless Networks ◽  
Node Deployment ◽  
Tree Construction
Sign in / Sign up

Export Citation Format

Share Document