2010 Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing 2010
DOI: 10.1109/iihmsp.2010.67
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of a Smart Traffic Prediction and Flow Control Mechanism for Video Streaming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…If the query window contains the root node region, all sensor nodes are returned (lines 1-2). Otherwise, the region of child nodes is checked such that if a given region belongs to, or has overlap with, the query window, all or partial sensor nodes in this region are to be included into SN set (lines [5][6][7][8][9][10][11][12][13][14][15]. When this region does not corresponds to a leaf node, the sub-regions in this region are processed recursively (line 13).…”
Section: Window Query Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…If the query window contains the root node region, all sensor nodes are returned (lines 1-2). Otherwise, the region of child nodes is checked such that if a given region belongs to, or has overlap with, the query window, all or partial sensor nodes in this region are to be included into SN set (lines [5][6][7][8][9][10][11][12][13][14][15]. When this region does not corresponds to a leaf node, the sub-regions in this region are processed recursively (line 13).…”
Section: Window Query Algorithmmentioning
confidence: 99%
“…Require: nd rt : the root node of SWC-tree sn: sensor node to be queried Ensure: nd sn : the leaf node that contains sn 1: BN pD1 , : : : , BN pDn the set of branch nodes, which are the child nodes of nd rt and have priority p=1, ,n 2: for all j 2 [1 .. n] do 3: for all bn j 2 BN pDj do 4: if sn 2 the set of data objects in bn pDj then 5: if bn pDj has non-leaf nodes then 6: nd sn PriorityQuery(bn pDj , do) 7: else 8: nd sn bn pDj 9: end if 10: break 11: end if 12: end for 13: if nd sn ¤ ; then 14: break 15: end if 16: end for higher priority will be processed first. For all the branch nodes having the same priority, we check whether sensor node sn is included in any branch node or not (lines [3][4][5][6][7][8][9][10][11][12][13][14][15]. When it found that sn is included in a certain leaf node nd sn , nd sn is returned (lines 6, 8, 10, and 14).…”
Section: Algorithm 6 : Priorityquerymentioning
confidence: 99%
See 1 more Smart Citation