Experimental Study on Wireless Mobile Sensor Configurations for Output-Only Modal Identification of a Beam Testbed

2017 ◽  
pp. 71-77 ◽  
Author(s):  
Bhavana Valeti ◽  
Thomas J. Matarazzo ◽  
Shamim N. Pakzad
Keyword(s):  
Experimental Study ◽  
Modal Identification ◽  
Mobile Sensor ◽  
Output Only ◽  
Wireless Mobile

scholarly journals Compact Conformal Map for Greedy Routing in Wireless Mobile Sensor Networks

2016 ◽  
Vol 15 (7) ◽  
pp. 1632-1646 ◽  
Author(s):  
Siming Li ◽  
Wei Zeng ◽  
Dengpan Zhou ◽  
Xianfeng Gu ◽  
Jie Gao
Keyword(s):  
Sensor Networks ◽  
Mobile Sensor Networks ◽  
Conformal Map ◽  
Greedy Routing ◽  
Mobile Sensor ◽  
Wireless Mobile

Graph Intersection-Based Benchmarking Algorithm for Maximum Stability Data Gathering Trees in Wireless Mobile Sensor Networks

2014 ◽  
pp. 433-458
Author(s):  
Natarajan Meghanathan ◽  
Philip Mumford
Keyword(s):  
Sensor Networks ◽  
Spanning Trees ◽  
Data Gathering ◽  
Mobile Sensor Networks ◽  
Sensor Nodes ◽  
Mobile Sensor ◽  
Topology Changes ◽  
Maximum Stability ◽  
Wireless Mobile ◽  
Data Gathering Tree

The authors propose a graph intersection-based benchmarking algorithm to determine the sequence of longest-living stable data gathering trees for wireless mobile sensor networks whose topology changes dynamically with time due to the random movement of the sensor nodes. Referred to as the Maximum Stability-based Data Gathering (Max.Stable-DG) algorithm, the algorithm assumes the availability of complete knowledge of future topology changes and is based on the following greedy principle coupled with the idea of graph intersections: Whenever a new data gathering tree is required at time instant t corresponding to a round of data aggregation, choose the longest-living data gathering tree from time t. The above strategy is repeated for subsequent rounds over the lifetime of the sensor network to obtain the sequence of longest-living stable data gathering trees spanning all the live sensor nodes in the network such that the number of tree discoveries is the global minimum. In addition to theoretically proving the correctness of the Max.Stable-DG algorithm (that it yields the lower bound for the number of discoveries for any network-wide communication topology like spanning trees), the authors also conduct exhaustive simulations to evaluate the performance of the Max.Stable-DG trees and compare to that of the minimum-distance spanning tree-based data gathering trees with respect to metrics such as tree lifetime, delay per round, node lifetime and network lifetime, under both sufficient-energy and energy-constrained scenarios.

RAGOBOT: A New Platform for Wireless Mobile Sensor Networks

2005 ◽  
pp. 412-412 ◽  
Author(s):  
Jonathan Friedman ◽  
David Lee ◽  
Ilias Tsigkogiannis ◽  
Sophia Wong ◽  
Dennis Chao ◽  
...  
Keyword(s):  
Sensor Networks ◽  
Mobile Sensor Networks ◽  
Mobile Sensor ◽  
Wireless Mobile
Sign in / Sign up

Export Citation Format

Share Document