on the connectivity of finite wireless networks with multiple base stations n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
On the Connectivity of Finite Wireless Networks with Multiple Base Stations PowerPoint Presentation
Download Presentation
On the Connectivity of Finite Wireless Networks with Multiple Base Stations

Loading in 2 Seconds...

play fullscreen
1 / 20

On the Connectivity of Finite Wireless Networks with Multiple Base Stations - PowerPoint PPT Presentation


  • 117 Views
  • Uploaded on

On the Connectivity of Finite Wireless Networks with Multiple Base Stations. Sergio Bermudez and Prof. Stephen Wicker School of ECE, Cornell University International Conference on Computer Communications and Networks, August 3-7, 2008. Agenda. Introduction Wireless Networks Connectivity

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'On the Connectivity of Finite Wireless Networks with Multiple Base Stations' - nolan-copeland


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
on the connectivity of finite wireless networks with multiple base stations

On the Connectivity of Finite Wireless Networks with Multiple Base Stations

Sergio Bermudez and Prof. Stephen Wicker

School of ECE, Cornell University

International Conference on Computer Communications and Networks, August 3-7, 2008

agenda
Agenda
  • Introduction
    • Wireless Networks Connectivity
    • Approaches to Analyze Connectivity
  • Model and Results
    • Assumptions
    • Main Result
    • Simulation Results
  • Conclusions

"Connected Sub-networks," Sergio Bermudez

introduction
Introduction

Connectivity is a fundamental quality of a wireless network.

Any two nodes are able to communicate between them, either single- or multi-hop.

"Connected Sub-networks," Sergio Bermudez

previous work on connectivity
Previous Work on Connectivity
  • Focus on the connectivity of wireless networks having a single connected component.
  • Approaches on the number of nodes for random deployments:
    • Asymptotic
    • Finite

"Connected Sub-networks," Sergio Bermudez

asymptotic connectivity analysis
Asymptotic Connectivity Analysis

Gupta and Kumar: n uniformly distributed nodes, letting n → ∞, finite area. Percolation theory.

Bettstetter: Infinite network, constant node density, analyzing finite area. Geometric random graphs theory.

"Connected Sub-networks," Sergio Bermudez

finite connectivity analysis
Finite Connectivity Analysis

Desai and Manjunath: network over a line segment, nodes distributed uniformly, geometrical argument.

Godehardt and Jaworski: random interval graphs in the unit interval, combinatorial theory.

"Connected Sub-networks," Sergio Bermudez

multiple base stations scenario
Multiple Base Stations Scenario
  • Envisioned application of sensor networks is monitoring Physical Infrastructure
    • It is feasible that those networks have base stations.
    • Example in systems like water quality monitoring, electricity generation plants.
  • In general, due to factors like:
    • Increase network capacity
    • Manage large deployment area
    • Enhance network reliability

"Connected Sub-networks," Sergio Bermudez

considering multiple base stations
Considering multiple base stations

It is intuitive that having more than one base station provide less stringent requirements on the numbers of nodes needed to have a connected network.

"Connected Sub-networks," Sergio Bermudez

model for analysis
Model for Analysis
  • We will focus on:
    • analysis of connectivity with sub-networks
    • one-dimensional deployments
  • Connected Sub-network
    • connected components of the network realization that are able to communicate with at least one BS.

"Connected Sub-networks," Sergio Bermudez

general assumptions
General Assumptions

Uniformly random deployment of n nodes over a line segment [0,S]

m base stations at given location yi

Fix communication radius r

Boolean communication link model

"Connected Sub-networks," Sergio Bermudez

problem statement
Problem Statement
  • Given n nodes with communication radius r , and m base stations and their locations, what is the probability that the network realization is connected?
    • We consider a network as connected if its composing sub-networks are connected.

"Connected Sub-networks," Sergio Bermudez

problem decomposition
Problem Decomposition

Conditioning on the number of nodes in a sub-segment, nodes are uniformly distributed.

Independence on the probability of sub-network connectivity.

"Connected Sub-networks," Sergio Bermudez

probability of connectivity
Probability of Connectivity
  • C: all nodes in the network reach at least one base station.
  • Ci : all nodes inside segment wi reach at least one base station.
  • There are two general cases:
    • border and inner connectivity

"Connected Sub-networks," Sergio Bermudez

main formula
Main Formula
  • border and inner connectivity term

By the Law of Total Probability

"Connected Sub-networks," Sergio Bermudez

simulation setup
Simulation Setup

Segment [0,1]

Deployment with n nodes

Use different locations for the base stations

Monte Carlo method with 105 random replications

"Connected Sub-networks," Sergio Bermudez

one base station network
One Base Station Network

"Connected Sub-networks," Sergio Bermudez

two base stations network
Two Base Stations Network

"Connected Sub-networks," Sergio Bermudez

summary
Summary

Used the concept of connected sub-networks.

Presented a formula to calculate the probability of connectivity for wireless networks with infrastructure.

"Connected Sub-networks," Sergio Bermudez

further reading
Further Reading
  • “On the Connectivity of a Random Interval Graph,” E. Godehardt and J. Jaworski, Random Structures and Algorithms, 137–161, 1996.
  • “On the connectivity in finite ad hoc networks,” M. Desai and D. Manjunath, IEEE Commun. Lett., 425–436, 2005.

"Connected Sub-networks," Sergio Bermudez

border and inner connectivity
Border and Inner Connectivity

Border-Connectivity Formula

Inner-Connectivity Formula

"Connected Sub-networks," Sergio Bermudez