Article thumbnail

Game and Balance Multicast Architecture Algorithms for Sensor Grid

By Qingfeng Fan, Qiongli Wu, Frèdèric Magoulés, Naixue Xiong, Athanasios V. Vasilakos and Yanxiang He

Abstract

We propose a scheme to attain shorter multicast delay and higher efficiency in the data transfer of sensor grid. Our scheme, in one cluster, seeks the central node, calculates the space and the data weight vectors. Then we try to find a new vector composed by linear combination of the two old ones. We use the equal correlation coefficient between the new and old vectors to find the point of game and balance of the space and data factorsbuild a binary simple equation, seek linear parameters, and generate a least weight path tree. We handled the issue from a quantitative way instead of a qualitative way. Based on this idea, we considered the scheme from both the space and data factor, then we built the mathematic model, set up game and balance relationship and finally resolved the linear indexes, according to which we improved the transmission efficiency of sensor grid. Extended simulation results indicate that our scheme attains less average multicast delay and number of links used compared with other well-known existing schemes

Topics: Article
Publisher: Molecular Diversity Preservation International (MDPI)
OAI identifier: oai:pubmedcentral.nih.gov:3290501
Provided by: PubMed Central

Suggested articles

Citations

  1. a DiffServ-integrated multicast algorithm for Internet resource optimization in source specific multicast applications.
  2. (2006). A multicast based anonymous information sharing protocol for peer-to-peer systems.
  3. (2003). A routing underlay for overlay networks.
  4. A scalable and efficient end host multicast for Peer-to-Peer Systems.
  5. (2005). A Scalable P2P Platform for the Knowledge Grid.
  6. (2008). A sensor and computation grid enabled engineering model for drilling vibration research.
  7. A sensor grid infrastructure for large-scale ambient intelligence.
  8. (2007). ACOM: Any-source Capacity-constrained Overlay Multicast in Non-DHT P2P Networks.
  9. (2007). Best position algorithms for top-k queries.
  10. (2004). Big-bang simulation for embedding network distances in Euclidean space.
  11. (2006). Can an overlay compensate for a careless underlay?
  12. (2001). Chord: A scalable peer-to-peer lookup service for internet applications.
  13. (2006). Continuous monitoring of top-k queries over sliding windows.
  14. (2007). Data currency in replicated DHTs.
  15. (2000). Distributed clustering and local regression for knowledge discovery in multiple spatial databases.
  16. (2001). Enabling conferencing applications on the Internet using an overlay multicast architecture.
  17. (2003). Fast accurate computation of large-scale IP traffic matrices from link loads.
  18. (2007). GridTorrent: Optimizing data transfers in the Grid with collaborative sharing.
  19. (2006). Hierarchical Multicast Tree Algorithms for Application Layer Mesh Networks.
  20. (1997). Implementation of a Reliable Multicast Protocol.
  21. (2004). Optimising multicast structures for grid computing.
  22. (2006). Petascale computational systems.
  23. Rate-distortion optimized video peer-to-peer multicast streaming.
  24. (2006). Relaxed-currency serializability for middle-tier caching and replication.
  25. (2002). Scalable application layer multicast.
  26. (2006). Scalable trust: engineering challenge or complexity barrier?
  27. (2005). Scheduling Independent Tasks Sharing Large Data Distributed with BitTorrent.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.