Results 1 - 10
of
18
Hierarchical Wireless Multimedia Sensor Networks for Collaborative Hybrid Semi-Supervised Classifier Learning
, 2007
"... Abstract: Wireless multimedia sensor networks (WMSN) have recently emerged as one of the most important technologies, driven by the powerful multimedia signal acquisition and processing abilities. Target classification is an important research issue addressed in WMSN, which has strict requirement in ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
(Show Context)
Abstract: Wireless multimedia sensor networks (WMSN) have recently emerged as one of the most important technologies, driven by the powerful multimedia signal acquisition and processing abilities. Target classification is an important research issue addressed in WMSN, which has strict requirement in robustness, quickness and accuracy. This paper proposes a collaborative semi-supervised classifier learning algorithm to achieve durative online learning for support vector machine (SVM) based robust target classification. The proposed algorithm incrementally carries out the semi-supervised classifier learning process in hierarchical WMSN, with the collaboration of multiple sensor nodes in a hybrid computing paradigm. For decreasing the energy consumption and improving the performance, some metrics are introduced to evaluate the effectiveness of the samples in specific sensor nodes, and a sensor node selection strategy is also proposed to reduce the impact of inevitable missing detection and false detection. With the ant optimization routing, the learning process is implemented with the selected sensor nodes, which can decrease the energy consumption. Experimental results demonstrate that the collaborative hybrid semisupervised classifier learning algorithm can effectively implement target classification in hierarchical WMSN. It has outstanding performance in terms of energy efficiency and time cost, which verifies the effectiveness of the sensor nodes selection and ant optimization routing.
Peer-to-Peer Overlay Networks: A Survey
, 2003
"... P2P network is factually an overlay network for distributed object store, search and sharing. This paper will present a survey about it's recent. First, we will introduce a simple definition of P2P, and define some common operation procedures in P2P. Second, P2P performance metric will be discu ..."
Abstract
-
Cited by 12 (0 self)
- Add to MetaCart
P2P network is factually an overlay network for distributed object store, search and sharing. This paper will present a survey about it's recent. First, we will introduce a simple definition of P2P, and define some common operation procedures in P2P. Second, P2P performance metric will be discussed in order to understand and differentiated the practical P2P architectures and protocols. Third, the current P2P architecture will be classified and compared in detail. Then, object search protocols will be carefully discussed with corresponding P2P architecture. We also review the current P2P modeling outputs and list the general modeling approaches. Finally, several novel applications based on P2P techniques and future research directions of P2P overlay networks are briefly investigated. This paper
Peer-to-peer architecture and protocol for a massively multiplayer online game
- In Proc. of GLOBECOM’04
, 2004
"... becoming a very important part of computer entertainment business. With recent development of broadband technologies, the increase of the number of players is putting a strong pressure on this type of applications. Commonly used clients/server systems do not cope well with scalability, limiting the ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
(Show Context)
becoming a very important part of computer entertainment business. With recent development of broadband technologies, the increase of the number of players is putting a strong pressure on this type of applications. Commonly used clients/server systems do not cope well with scalability, limiting the number of players who interact with each other, are not robust enough and might be subject to bottleneck due to their centralized infrastructure. These systems also force the developers to invest enormous amount of money on hardware and time to design complex software systems. To solve these problems we propose a fully distributed, peer-to-peer architecture for MMOGs. In this paper we discuss the issues surrounding MMOGs, the limitations in term of network infrastructure, and the lack of simulation environment to study and evaluate network architecture and protocol. We use a peer-to-peer (P2P) based architecture and protocol to provide a more scalable, flexible and robust technology solution than currently used infrastructures. We have conducted the design and implementation of a modular MMOG: ‘Time-Prisoners’, using a P2P protocol developed in Java and JXTA. The characteristics of P2P overlays enable to organize dynamically, and in transparent way for the users, the group of players according to their locations in the virtual world, and allow to design scalable mechanism to distribute the game state to the players and to maintain the world consistent in case of node failures.
Modeling and Simulation of Adhoc/P2P Resource Sharing Networks
"... Performance evaluation of adhoc peer-to-peer resource sharing networks is difficult since nearly every aspect of such networks including topology and offered resources can change unpredictably. In this paper we introduce a random-graph based model for studying the evolution of ad hoc peer-to-peer (P ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Performance evaluation of adhoc peer-to-peer resource sharing networks is difficult since nearly every aspect of such networks including topology and offered resources can change unpredictably. In this paper we introduce a random-graph based model for studying the evolution of ad hoc peer-to-peer (P2P) communities (such as Gnutella/Freenet). The proposed random graph model generates a nonuniform graph and provides control over the nodal degree distribution. Based on this random graph model, we present analytic and simulation-based approaches to understand performance characteristics and issues. The analytic approach studies basic properties such as reachability and nodal utilization in the network. To address more detailed performance characteristics, we present our simulation framework called Sim . We discuss the crucial issue of efficiently simulating a random graph model by looking at several potential approaches. Sim incorporates several performance-related aspects of the P2P environment including reachability metrics, queuing behavior, content caching at each node, impact of user timeouts, etc., which are illustrated via an example. While the current study targets a simple static P2P file sharing environment likw Gnutella or Freenet, Sim is intended for opensource release shortly in order to facilitate the evaluation of other more dynamic networks and perhaps intelligent searches. 1
Peer-to-Peer Networks Applied to Power Grid *
"... In order to improve and deploy distributed control systems for the power grid a robust ICT infrastructure is required partially based on dependable middleware that exploits redundancy and diversity in communication networks. The dynamic nature of power grid applications makes necessity of using peer ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
In order to improve and deploy distributed control systems for the power grid a robust ICT infrastructure is required partially based on dependable middleware that exploits redundancy and diversity in communication networks. The dynamic nature of power grid applications makes necessity of using peer-to-peer (P2P) networks in this system. The main requirements of P2P networks for power grid are that they are scalable, self-organizing and distributed. Furthermore they degrade gracefully in the advent of failures, restore automatically after repair and need to cope with dynamic environment. This paper at first classifies P2P networks according their architecture and compares them. Then it analyzes P2P networks based on their architectures for controlling power grid components. It shows hybrid decentralized indexing P2P networks are best choice and most suitable architecture for power grid.
Distributed Peer-to-Peer Target Tracking
- in Wireless Sensor Networks. Sensors 2007
"... Abstract: Target tracking is usually a challenging application for wireless sensor networks (WSNs) because it is always computation-intensive and requires real-time processing. This paper proposes a practical target tracking system based on the auto regressive moving average (ARMA) model in a distri ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Abstract: Target tracking is usually a challenging application for wireless sensor networks (WSNs) because it is always computation-intensive and requires real-time processing. This paper proposes a practical target tracking system based on the auto regressive moving average (ARMA) model in a distributed peer-to-peer (P2P) signal processing framework. In the proposed framework, wireless sensor nodes act as peers that perform target detection, feature extraction, classification and tracking, whereas target localization requires the collaboration between wireless sensor nodes for improving the accuracy and robustness. For carrying out target tracking under the constraints imposed by the limited capabilities of the wireless sensor nodes, some practically feasible algorithms, such as the ARMA model and the 2-D integer lifting wavelet transform, are adopted in single wireless sensor nodes due to their outstanding performance and light computational burden. Furthermore, a progressive multi-view localization algorithm is proposed in distributed P2P signal processing framework considering the tradeoff between the accuracy and energy consumption. Finally, a real world target tracking experiment is illustrated. Results from experimental implementations have demonstrated that the proposed target tracking system based on a distributed P2P signal processing framework can make efficient use of scarce energy and communication resources and achieve target tracking successfully.
Maintaining Comprehensive Resource Availability in P2P Networks
- IN P2P NETWORKS, GCC 2004, LNCS 3251
, 2004
"... In this paper, the resource availability issue has been addressed with respect to the intermittent connectivity and dynamic presence of peers in a P2P system. We aim to maintain more comprehensive resource available. The contribution of this paper is two fold. First, we analyze the probability of a ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
In this paper, the resource availability issue has been addressed with respect to the intermittent connectivity and dynamic presence of peers in a P2P system. We aim to maintain more comprehensive resource available. The contribution of this paper is two fold. First, we analyze the probability of a peer to become a seed consisting of all content. Second, a simple, distributed comprehensive algorithm for resource management is proposed. In order to increase the availability of resources in a P2P network, the peer as well as the fragment of shared content are deliberately allocated during the content sharing process.
Analytical formulations of Peer-to-Peer Connection Efficiency
"... Use of Peer-to-Peer (P2P) service networks introduces a new communication paradigm because peers are both clients and servers and so each peer may provide/request services to/from other peers. Empirical studies of P2P networks have been undertaken and reveal useful characteristics. However there is ..."
Abstract
- Add to MetaCart
(Show Context)
Use of Peer-to-Peer (P2P) service networks introduces a new communication paradigm because peers are both clients and servers and so each peer may provide/request services to/from other peers. Empirical studies of P2P networks have been undertaken and reveal useful characteristics. However there is to date little analytical work to describe P2P networks with respect to their communication paradigm and their interconnections. This paper provides an analytical formulation and optimisation of peer connection efficiency, in terms of minimising the fraction of wasted connection time. Peer connection efficiency is analysed for both a uni- and multiconnected peer. Given this fundamental optimisation, the paper optimises the number of connections that peers should make use of as a function of network load, in terms of minimising the total queue size that requests in the P2P network experience. The results of this paper provide a basis for engineering high performance P2P interconnection networks. The optimisations are useful for reducing bandwidth and power consumption, e.g. in the case of peers being mobile devices with a limited power supply. Also these results could be used to determine when a (virtual) circuit should be switched to support a connection.
Global computing
"... first global computing system for evolutionary biology, and continues to develop it. ..."
Abstract
- Add to MetaCart
first global computing system for evolutionary biology, and continues to develop it.
