[Firebug-cvs] firebug/web spie_2004.tex,1.9,1.10 spie_reviews.tex,1.4,1.5

[<do...@us...>]

Update of /cvsroot/firebug/firebug/web
In directory sc8-pr-cvs1:/tmp/cvs-serv13817

Modified Files:
	spie_2004.tex spie_reviews.tex 
Log Message:
Added mehta and zarki review.

Index: spie_2004.tex
===================================================================
RCS file: /cvsroot/firebug/firebug/web/spie_2004.tex,v
retrieving revision 1.9
retrieving revision 1.10
diff -C2 -d -r1.9 -r1.10
*** spie_2004.tex	26 Jul 2003 20:48:09 -0000	1.9
--- spie_2004.tex	27 Jul 2003 00:46:59 -0000	1.10
***************
*** 288,292 ****
  
  
! \paragraph{Mehta and El Zarki}~\cite{mehta:v2002} ????
  
  
--- 288,324 ----
  
  
! 
! \paragraph{Mehta and El Zarki}~\cite{mehta:v2002} propose
! a scatternet tree structured network for fixed wireless
! sensor area networks for structural health monitoring 
! of bridges, highways and other infrastructure.  The algortihm
! allows arbitrary placement of nodes, and does not require
! nodes to be in radio proximity of every other node.
! 
! The ``scatternet'' tree is rooted at a network hub, which 
! executes most of the scatternet algorithm to build routes for
! each sensor.  The algorithm has two phases: discovery and 
! connection.  During discovery, each node reports all other
! nodes in radio proximity to the hub, which creates a 
! neighborhood matrix.  The nodes are ``backtracked'' recursively
! using a depth-first search, starting at the hub and passing 
! to each node in turn.
! The connection phase is performed by the hub.  The tree is 
! built using a breadth-first search with statistics such 
! as link strength, load factor, and degree, collected during 
! discovery phase.  
! 
! 
! The complexity of building the tree increases 
! exponentially with the number of nodes, which the authors
! tackle using a simulated annealing (SA) approach.  
! The objective function is chosen to minimize the 
! load variation across nodes in the subtrees, and 
! an energy formulation for this is presented.  The 
! authors provide a detailed discussion of the SA.
! Results from a simulation implementing the proposed 
! method indicate that adaptive methods work better 
! for minimizing interference in the resulting 
! network.
  
  

Index: spie_reviews.tex
===================================================================
RCS file: /cvsroot/firebug/firebug/web/spie_reviews.tex,v
retrieving revision 1.4
retrieving revision 1.5
diff -C2 -d -r1.4 -r1.5
*** spie_reviews.tex	22 Jul 2003 21:02:38 -0000	1.4
--- spie_reviews.tex	27 Jul 2003 00:46:59 -0000	1.5
***************
*** 192,194 ****
  
  
! \paragraph{Mehta and El Zarki}~\cite{mehta:v2002} ????
--- 192,225 ----
  
  
! \paragraph{Mehta and El Zarki}~\cite{mehta:v2002} propose
! a scatternet tree structured network for fixed wireless
! sensor area networks for structural health monitoring 
! of bridges, highways and other infrastructure.  The algortihm
! allows arbitrary placement of nodes, and does not require
! nodes to be in radio proximity of every other node.
! 
! The ``scatternet'' tree is rooted at a network hub, which 
! executes most of the scatternet algorithm to build routes for
! each sensor.  The algorithm has two phases: discovery and 
! connection.  During discovery, each node reports all other
! nodes in radio proximity to the hub, which creates a 
! neighborhood matrix.  The nodes are ``backtracked'' recursively
! using a depth-first search, starting at the hub and passing 
! to each node in turn.
! The connection phase is performed by the hub.  The tree is 
! built using a breadth-first search with statistics such 
! as link strength, load factor, and degree, collected during 
! discovery phase.  
! 
! 
! The complexity of building the tree increases 
! exponentially with the number of nodes, which the authors
! tackle using a simulated annealing (SA) approach.  
! The objective function is chosen to minimize the 
! load variation across nodes in the subtrees, and 
! an energy formulation for this is presented.  The 
! authors provide a detailed discussion of the SA.
! Results from a simulation implementing the proposed 
! method indicate that adaptive methods work better 
! for minimizing interference in the resulting 
! network.