3 Vectors Game and Balance Multicast architecture Algorithms for Sensor Grid

We propose a scheme to reach shorter multicast delay, better energy utilizing efficiency and higher efficiency of data transferring for Sensor Grid. Our scheme calculates the space, energy and data weight vectors in one cluster. Then it searches a new vector composed by the linear combination of the three individual ones. We build game balance equation, use the equal correlation coefficient between the new and old vectors to find the point of game balance, seek linear parameters, and generate a least weight path tree. Extended simulation results indicate that our scheme attains less average multicast delay, the number of links used and better system robusticity.

[1]  Richard Duff,et al.  A sensor and computation grid enabled engineering model for drilling vibration research , 2008, Mardi Gras Conference.

[2]  Bobby Bhattacharjee,et al.  Scalable application layer multicast , 2002, SIGCOMM 2002.

[3]  Asuman E. Ozdaglar,et al.  Near-Optimal Power Control in Wireless Networks: A Potential Game Approach , 2010, 2010 Proceedings IEEE INFOCOM.

[4]  Baile Shi,et al.  ACOM: Any-source Capacity-constrained Overlay Multicast in Non-DHT P2P Networks , 2007, IEEE Transactions on Parallel and Distributed Systems.

[5]  Wenqiang Wang,et al.  A Sensor Grid Infrastructure for Large-Scale Ambient Intelligence , 2008, 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies.

[6]  Patrick Valduriez,et al.  Data currency in replicated DHTs , 2007, SIGMOD '07.

[7]  H. Inaltekin,et al.  The Analysis of Nash Equilibria of the One-Shot Random-Access Game for Wireless Networks and the Behavior of Selfish Nodes , 2008, IEEE/ACM Transactions on Networking.

[8]  Weijia Jia,et al.  A scalable and efficient end host multicast for peer-to-peer systems---DSCT , 2004 .