The Community for Technology Leaders
RSS Icon
Issue No.08 - August (2008 vol.19)
pp: 1136-1149
Jen-Yeu Chen , Purdue University, West Lafayette
Jianghai Hu , Purdue University, West Lafayette
Dynamical connection graph changes are inherent in networks such as peer-to-peer networks, wireless ad hoc networks, and wireless sensor networks. Considering the influence of the frequent graph changes is thus essential for precisely assessing the performance of applications and algorithms on such networks. In this paper, using Stochastic Hybrid Systems (SHSs), we model the dynamics and analyze the performance of an epidemic-like algorithm, Distributed Random Grouping (DRG), for average aggregate computation on a wireless sensor network with dynamical graph changes. Particularly, we derive the convergence criteria and the upper bounds on the running time of the DRG algorithm for a set of graphs that are individually disconnected but jointly connected in time. An effective technique for the computation of a key parameter in the derived bounds is also developed. Numerical results and an application extended from our analytical results to control the graph sequences are presented to exemplify our analysis.
Sensor networks, Wireless, Distributed networks, Distributed applications, Design studies, Fault tolerance, Modeling techniques, Probabilistic computation, General, Markov processes, Probabilistic algorithms, Stochastic processes
Jen-Yeu Chen, Jianghai Hu, "Analysis of Distributed Random Grouping for Aggregate Computation on Wireless Sensor Networks with Randomly Changing Graphs", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 8, pp. 1136-1149, August 2008, doi:10.1109/TPDS.2008.40
[1] D. Estrin, R. Govindan, J.S. Heidemann, and S. Kumar, “Next Century Challenges: Scalable Coordination in Sensor Networks,” Proc. ACM MobiCom '99, pp. 263-270, 1999.
[2] J.-Y. Chen, G. Pandurangan, and D. Xu, “Robust Aggregate Computation in Wireless Sensor Network: Distributed Randomized Algorithms and Analysis,” IEEE Trans. Parallel and Distributed System, pp. 987-1000, Sept. 2006.
[3] D. Kempe, A. Dobra, and J. Gehrke, “Gossip-Based Computation of Aggregate Information,” Proc. 44th Ann. IEEE Symp. Foundations of Computer Science (FOCS), 2003.
[4] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, “Gossip Algorithms: Design, Analysis and Applications,” Proc. IEEE INFOCOM, 2005.
[5] L. Xiao, S. Boyd, and S. Lall, “A Scheme for Robust Distributed Sensor Fusion Based on Average Consensus,” Proc. Fourth Int'l Symp. Information Processing in Sensor Networks (IPSN), 2005.
[6] N. Lynch, Distributed Algorithms. Morgan KauRman, 1997.
[7] R. Olfati-Saber and R.M. Murray, “Consensus Problem in Networks of Agents with Switching Topology and Time Delays,” IEEE Trans. Automatic Control, vol. 49, no. 9, pp.1520-1533, Sept. 2004.
[8] L. Fang and P. Antsaklis, “Information Consensus of Asynchronous Discrete-Time Multi-Agent Systems,” Proc. 24th Am. Control Conf. (ACC), 2005.
[9] W. Ren and R.W. Beard, “Consensus Seeking in Multi-Agent Systems under Dynamically Changing Interaction Topologies,” IEEE Trans. Automatic Control, vol. 50, no. 5, pp. 655-661, 2005.
[10] L. Moreau, “Stability of Multi-Agent Systems with Time-Dependent Communication Links,” IEEE Trans. Automatic Control, vol. 50, no. 2, pp. 169-182, 2005.
[11] J. Hespanha, “Polynomial Stochastic Hybrid Systems,” Proc. Eighth Int'l Workshop Hybrid Systems: Computation and Control (HSCC '05), pp. 322-338, 2005.
[12] S. Shenker, S. Ratnasamy, B. Karp, R. Govindan, and D. Estrin, “Data-Centric Storage in Sensornets,” SIGCOMM Computer Comm. Rev., vol. 33, no. 1, pp. 137-142, 2003.
[13] J. Zhao, R. Govindan, and D. Estrin, “Computing Aggregates for Monitoring Wireless Sensor Networks,” Proc. First IEEE Int'l Workshop Sensor Network Protocols and Applications (SNPA), 2003.
[14] B. Krishnamachari, D. Estrin, and S. Wicker, “Impact of Data Aggregation in Wireless Sensor Networks,” Proc. First Int'l Workshop Distributed Event-Based Systems (DEBS), 2002.
[15] S. Madden, M. Franklin, J. Hellerstein, and W. Hong, “Tag: A Tiny Aggregation Service for Ad-Hoc Sensor Networks,” Proc. Fifth Symp. Operating Systems Design and Implementation (OSDI), 2002.
[16] M. Enachescu, A. Goel, R. Govindan, and R. Motwani, “Scale-Free Aggregation in Sensor Networks,” Theoretical Computer Science, vol. 344, no. 1, pp. 15-29, 2005.
[17] S. Nath, P.B. Gibbons, S. Seshan, and Z.R. Anderson, “Synopsis Diffusion for Robust Aggregation in Sensor Networks,” Proc. Second Int'l Conf. Embedded Networked Sensor Systems (SenSys), 2004.
[18] P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, W.M. McEneaney, G. Yin, and Q. Zhang, eds., 1998.
[19] M. Fiedler, “Algebraic Connectivity of Graphs,” Czechoslovak Math. J., vol. 23, pp. 298-305, 1973.
[20] M. Bujorianu and J. Lygeros, “General Stochastic Hybrid Systems: Modeling and Optimal Control,” Proc. 43rd IEEE Conf. Decision and Control (CDC '04), pp. 1872-1877, 2004.
[21] G. Pola, M. Bujorianu, J. Lygeros, and M.D. Benedetto, “Stochastic Hybrid Models: An Overview,” IFAC Conf. Analysis and Design of Hybrid Systems (ADHS), 2003.
[22] J. Hu, J. Lygeros, and S. Sastry, “Towards a Theory of Stochastic Hybrid Systems,” Proc. Third Int'l Workshop Hybrid Systems: Computation and Control (HSCC '00), pp. 160-173, 2000.
[23] J.-Y. Chen and J. Hu, “Analysis of a Class of Distributed Randomized Algorithms on Randomly Changing Network Graphs,” Technical Report TR ECE 07-22, Purdue Univ., 2007.
[24] D.J. Hartfiel, Nonhomogeneous Matrix Products. World Scientific, 2002.
[25] L. Elsner, I. Koltracht, and M. Neumann, “On the Convergence of Asynchronous Paracontractions with Applications to Tomographic Reconstruction from Incomplete Data,” Linear Algebra and Applications, vol. 130, pp. 65-82, 1990.
[26] V. Shnayder, M. Hempstead, B. Chen, G. Allen, and M. Welsh, “Simulating the Power Consumption of Large-Scale Sensor Network Applications,” Proc. Second Int'l Conf. Embedded Networked Sensor Systems (SenSys), 2004.
275 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool