Vision graph construction in wireless multimedia sensor networks

Xin Dong; Mehmet C. Vuran

doi:10.1109/GLOCOM.2010.5683899

Vision graph construction in wireless multimedia sensor networks

Xin Dong, Mehmet C. Vuran

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Scopus citations

Abstract

In Wireless multimedia sensor networks (WMSNs), the camera nodes connected in the vision graph share overlapped field of views (FOVs) and they depend on the densely deployed relay nodes in the communication network graph to communicate with each other. Given a uniformly deployed camera sensor network with relay nodes, the problem is to find the number of hops for the vision-graph-neighbor-searching messages to construct the vision graph in an energy efficient way. In this paper, mathematical models are developed to analyze the FOV overlap of the camera nodes and the multi-hop communications in two dimensional topologies, which are utilized to analyze the relation between vision graph construction and maximum hop count. In addition, simulations are conducted to verify the models.

Original language	English (US)
Title of host publication	2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
DOIs	https://doi.org/10.1109/GLOCOM.2010.5683899
State	Published - 2010
Externally published	Yes
Event	53rd IEEE Global Communications Conference, GLOBECOM 2010 - Miami, FL, United States Duration: Dec 6 2010 → Dec 10 2010

Publication series

Name	GLOBECOM - IEEE Global Telecommunications Conference

Other

Other	53rd IEEE Global Communications Conference, GLOBECOM 2010
Country/Territory	United States
City	Miami, FL
Period	12/6/10 → 12/10/10

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/GLOCOM.2010.5683899

Cite this

@inproceedings{337354f7186f4685bada2bf8376e1263,

title = "Vision graph construction in wireless multimedia sensor networks",

abstract = "In Wireless multimedia sensor networks (WMSNs), the camera nodes connected in the vision graph share overlapped field of views (FOVs) and they depend on the densely deployed relay nodes in the communication network graph to communicate with each other. Given a uniformly deployed camera sensor network with relay nodes, the problem is to find the number of hops for the vision-graph-neighbor-searching messages to construct the vision graph in an energy efficient way. In this paper, mathematical models are developed to analyze the FOV overlap of the camera nodes and the multi-hop communications in two dimensional topologies, which are utilized to analyze the relation between vision graph construction and maximum hop count. In addition, simulations are conducted to verify the models.",

author = "Xin Dong and Vuran, {Mehmet C.}",

year = "2010",

doi = "10.1109/GLOCOM.2010.5683899",

language = "English (US)",

isbn = "9781424456383",

series = "GLOBECOM - IEEE Global Telecommunications Conference",

booktitle = "2010 IEEE Global Telecommunications Conference, GLOBECOM 2010",

note = "53rd IEEE Global Communications Conference, GLOBECOM 2010 ; Conference date: 06-12-2010 Through 10-12-2010",

}

TY - GEN

T1 - Vision graph construction in wireless multimedia sensor networks

AU - Dong, Xin

AU - Vuran, Mehmet C.

PY - 2010

Y1 - 2010

N2 - In Wireless multimedia sensor networks (WMSNs), the camera nodes connected in the vision graph share overlapped field of views (FOVs) and they depend on the densely deployed relay nodes in the communication network graph to communicate with each other. Given a uniformly deployed camera sensor network with relay nodes, the problem is to find the number of hops for the vision-graph-neighbor-searching messages to construct the vision graph in an energy efficient way. In this paper, mathematical models are developed to analyze the FOV overlap of the camera nodes and the multi-hop communications in two dimensional topologies, which are utilized to analyze the relation between vision graph construction and maximum hop count. In addition, simulations are conducted to verify the models.

AB - In Wireless multimedia sensor networks (WMSNs), the camera nodes connected in the vision graph share overlapped field of views (FOVs) and they depend on the densely deployed relay nodes in the communication network graph to communicate with each other. Given a uniformly deployed camera sensor network with relay nodes, the problem is to find the number of hops for the vision-graph-neighbor-searching messages to construct the vision graph in an energy efficient way. In this paper, mathematical models are developed to analyze the FOV overlap of the camera nodes and the multi-hop communications in two dimensional topologies, which are utilized to analyze the relation between vision graph construction and maximum hop count. In addition, simulations are conducted to verify the models.

UR - http://www.scopus.com/inward/record.url?scp=79551643969&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79551643969&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2010.5683899

DO - 10.1109/GLOCOM.2010.5683899

M3 - Conference contribution

AN - SCOPUS:79551643969

SN - 9781424456383

T3 - GLOBECOM - IEEE Global Telecommunications Conference

BT - 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010

T2 - 53rd IEEE Global Communications Conference, GLOBECOM 2010

Y2 - 6 December 2010 through 10 December 2010

ER -

Vision graph construction in wireless multimedia sensor networks

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this