0000000000627587
AUTHOR
L. Gatani
showing 25 related works from this author
Knowledge Extraction from Environmental Data Through a Cognitive Architecture
2008
Wireless Sensor Networks represent a novel technology which is expected to experience a dramatic diffusion thanks to the promise to be a pervasive sensory means; however, one of the issues limiting their potential growth relies in the difficulty of managing and interpreting huge amounts of collected data. This paper proposes a cognitive architecture for the extraction of high-level knowledge from raw data through the representation of processed data in opportune conceptual spaces. The presented framework interposes a conceptual layer between the subsymbolic one, devoted to sensory data processing, and the symbolic one, aimed at describing the environment by means of a high level language. T…
A Logical Framework for Augmented Simulations of Wireless Sensor Networks
2006
This paper describes a framework for practical and efficient monitoring of a wireless sensor network. The architecture proposed exploits the dynamic reasoning capabilities of the situation calculus in order to assess the sensor network behavior before actually deploying all the nodes. Designing a wireless sensor network for a specific application typically involves a preliminary phase of simulations that rely on specialized software, whose behavior does not necessarily reproduce what will be experienced by an actual network. On the other hand, delaying the test phase until deployment may not be advisable due to unreasonable costs. This paper suggests the adoption of a hybrid approach that i…
An Adaptive Routing Mechanism for Efficient Resource Discovery in Unstructured P2P Networks
2005
The widespread adoption of large-scale decentralized peer-to-peer (P2P) systems imposes huge challenges on distributed search and routing. Decentralized and unstructured P2P networks are very attractive because they require neither centralized directories, nor precise control over network topology or data placement. However their search mechanisms are extremely unscalable, generating large loads on the network participants. In this paper, to address this major limitation, we propose and evaluate the adoption of an innovative algorithm for routing user queries. The proposed approach aims at dynamically adapting the network topology to peer interests, on the basis of query interactions among …
Notice of Violation of IEEE Publication Principles<BR>An adaptive routing mechanism for P2P resource discovery
2005
The key to the usability of large-scale decentralize peer-to-peer (P2P) systems, and one of the most challenge design aspects, is efficient mechanism for distributed resource discovery. Unstructured P2P networks are very attractive because they do not suffer the limitations of centralized systems an the drawbacks of highly structured approaches. However the search algorithms are usually based on simple flooding scheme generating large loads on the network participants. In this paper to address this major limitation, we present the design an evaluation of an innovative searching protocol in unstructured P2P networks. The approach aims at dynamically adapting the network topology to peers' in…
A Logical Architecture for Active Network Management
2006
This paper focuses on improving network management by exploiting the potential of “doing” of the Active Networks technology, together with the potential of “planning,” which is typical of the artificial intelligent systems. We propose a distributed multiagent architecture for Active Network management, which exploits the dynamic reasoning capabilities of the Situation Calculus in order to emulate the reactive behavior of a human expert to fault situations. The information related to network events is generated by programmable sensors deployed across the network. A logical entity collects this information, in order to merge it with general domain knowledge, with a view to identifying the roo…
Notice of Violation of IEEE Publication Principles: Reinforcement learning for P2P searching
2005
For a peer-to-peer (P2P) system holding a massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured P2P networks avoid the limitations of centralized systems and the drawbacks of a highly structured approach, because they impose few constraints on topology and data placement, and they support highly versatile search mechanisms. However their search algorithms are usually based on simple flooding schemes, showing severe inefficiencies. In this paper, to address this major limitation, we propose and evaluate the adoption of a local adaptive routing protocol. The routing algorithm adopts a simple reinforcement learni…
Monitoring wireless sensor networks through logical deductive processes
2006
This paper proposes a distributed multi-agent architecture for wireless sensor networks management, which exploits the dynamic reasoning capabilities of the Situation Calculus in order to emulate the reactive behavior of a human expert to fault situations. The information related to network events is generated by tunable agents installed on the network nodes and is collected by a logical entity for network managing where it is merged with general domain knowledge, with the aim of identifying the root causes of faults, and deciding on reparative actions. The logical inference system has being devised to carry out automated isolation, diagnosis, and, whenever possible, repair of network anoma…
Exploiting Deductive Processes for Automated Network Management
2005
This paper focuses on improving network management by the adoption of artificial intelligence techniques. We propose a distributed multiagent architecture for network management, which exploits the dynamic reasoning capabilities of the situation calculus in order to emulate the reactive behavior of a human expert to fault situations. The information related to network events is generated by programmable sensors deployed on the network devices and is collected by a logical entity for network managing where it is merged with general domain knowledge, with a view to identifying the root causes of faults and to decide on reparative actions. The logical inference system has been devised to carry…
An efficient distributed algorithm for generating and updating multicast trees
2006
As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…
A Dynamic Reasoning Architecture for Computer Network Management
2005
This paper focuses on improving network management and monitoring by the adoption of Artificial Intelli- gence techniques. In order to allow automated reasoning on networking concepts, we defined an accurate ontologi- cal model capable of describing as better as possible the networking domain. The thorough representation of the do- main knowledge is used by a Logical Reasoner, which is an expert system capable of performing high-level manage- ment tasks.
An efficient distributed approach for dynamic multicast trees
2005
In this paper we present a distributed algorithm for constructing efficient multicast trees in large networks. The algorithm allows the set up of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been implemented and extensively tested both in simulation, and on experimental networks. Performance evaluation indicates that our approach outperforms the state-of-the-art distributed algorithms for multicast tree setup, providing good levels of convergence time and communication complexity. Furthermore, we introduce a distributed technique for dynamically updating the multicast tree. The approach monitors the accumulated damage as nodes join or…
Robust Data Gathering for Wireless Sensor Networks
2006
2005 13th IEEE International Conference on Networks jointly held with the 2005 7th IEEE Malaysia International Conference on Communications, Proceedings Volume 1, 2005, Article number 1635527, Pages 469-474 2005 13th IEEE International Conference on Networks jointly held with the 2005 7th IEEE Malaysia International Conference on Communications; Kuala Lumpur; Malaysia; 16 November 2005 through 18 November 2005; Category number05EX1235; Code 69262 Robust data gathering for wireless sensor networks (Conference Paper) Ortolani, M. , Gatani, L. , Lo Re, G. Dipartimento di Ingegneria Informatica, Università degli Studi di Palermo, Viale delle Scienze Parco d'Orleans, 90128 Palermo, Italy View re…
An Efficient Retransmission Strategy for Data Gathering in Wireless Sensor Networks
2006
This paper introduces a new strategy for data gathering in wireless sensor networks that takes into account the need for both energy saving and for a reasonable tradeoff between robustness and efficiency. The proposed algorithm implements an efficient strategy for retransmission of lost packets by discovering alternative routes and making clever use of multiple paths when necessary; in order to do that we use duplicate and order insensitive aggregation functions, and by taking advantage of some intrinsic characteristics of the wireless sensor networks, we exploit implicit acknowledgment of reception and smart caching of the data.
Rule based reasoning for network management
2006
This paper focuses on improving network management by the adoption of artificial intelligence techniques. We propose a distributed multi-agent architecture for network management, where a logical reasoner acts as a managing entity capable of directing, coordinating, and triggering monitoring and management actions in the proposed architecture. The logical inference system has been devised to enable automated isolation, diagnosis, and to repair network anomalies, thus enhancing the reliability, performance, and security of the network. The measurements of network events are captured by programmable sensors deployed on the network devices and are collected by the network management entity whe…
A P2P Architecture for Multimedia Content Retrieval
2006
The retrieval facilities of most Peer-to-Peer (P2P) systems are limited to queries based on unique identifiers or small sets of keywords. This approach can be highly labor-intensive and inconsistent. In this paper we investigate a scenario where a huge amount of multimedia resources are shared in a P2P network, by means of efficient content-based image and video retrieval functionalities. The challenge in such systems is to limit the number of sent messages, maximizing the usefulness of each peer contacted in the query process. We achieve this goal by the adoption of a novel algorithm for routing user queries. The proposed approach exploits compact representations of multimedia resources sh…
A Monitoring Framework Exploiting the Synergy between Actual and Virtual Wireless Sensors
2006
This paper describes a framework that allows realistic monitoring of a wireless sensor network in order to assess its behavior before actually deploying all the nodes. Designing a wireless sensor network for a specific application typically involves a preliminary phase of simulations that rely on specialized software, whose behavior does not necessarily reproduce what will be experienced by an actual network. On the other hand, delaying the test phase until deployment may not be advisable due to unreasonable costs. This paper suggests the adoption of a hybrid approach that involves coupling an actual wireless sensor network composed of a minimal set of actual nodes with a simulated one; we …
Understanding the Environment through Wireless Sensor Networks
2007
This paper presents a new cognitive architecture for extracting meaningful, high-level information from the environment, starting from the raw data collected by a Wireless Sensor Network. The proposed framework is capable of building rich internal representation of the sensed environment by means of intelligent data processing and correlation. Furthermore, our approach aims at integrating the connectionist, data-driven model with the symbolic one, that uses a high-level knowledge about the domain to drive the environment interpretation. To this aim, the framework exploits the notion of conceptual spaces, adopting a conceptual layer between the subsymbolic one, that processes sensory data, a…
Notice of Violation of IEEE Publication Principles: Enhanced P2P Services Providing Multimedia Content
2006
[This paper has been withdrawn by the publisher]Traditional peer-to-peer (P2P) services provide only basic searching facilities, based on unique identifiers or small sets of keywords. Unfortunately, this approach is very inadequate and inefficient when a huge amount of multimedia resources is shared. In this paper, we present an original image and video sharing system, in which a user is able to interactively search interesting resources by means of content-based image and video retrieval techniques. In order to limit the network traffic cost, maximizing the usefulness of each peer contacted in the query process, we also propose the adoption of an adaptive overlay routing algorithm, exploit…
Robust and Efficient Data Gathering for Wireless Sensor Networks
2006
This paper describes a new strategy for data gathering in wireless sensor networks that takes into account the need for both energy saving, typical of such networks, and for a reasonable tradeoff between robustness and efficiency. The proposed algorithm implements an efficient strategy for retransmission of lost packets by discovering alternative routes and making clever use of multiple paths when necessary; in order to do that we build upon the general framework presented in recent works, that provided a formulation of duplicate and order insensitive aggregation functions, and by taking advantage of some intrinsic characteristics of the wireless sensor networks, we exploit implicit acknowl…
A Dynamic Distributed Algorithm for Multicast Path Setup
2005
In the past few years, there has been a considerable work on multicast route selection techniques, with the aim to design scalable protocols which can guarantee an efficient use of network resources. Steiner tree-based multicast algorithms produce optimal trees, but they are prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require a complete knowledge of the network topology. In this paper, we propose a new distributed approach that is efficient and suitable for real network adoption. Performance evaluation indicates that it outp…
An Efficient Distributed Algorithm for Generating Multicast Distribution Trees
2005
Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in Networks) is prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require complete knowledge of the network topology. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem. The algorithm allows the construction of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been i…
An efficient adaptive strategy for searching in peer-to-peer networks
2005
One of the main technical challenges in Peer-to-Peer (P2P) networks is how to efficiently locate desired resources. Although structured systems, based on distributed hash tables, can achieve fair effectiveness, they are not suitable for widely deployed Internet applications. In fact, this kind of systems shows many severe limitations, such as ignoring the autonomous nature of peers, and supporting only weakly semantic functions. Unstructured P2P networks are more attractive for real applications, since they can avoid both the limitations of centralized systems, and the drawbacks of structured approaches. However, their search algorithms are usually based on inefficient flooding schemes, tha…
Notice of Violation of IEEE Publication Principles: Distributed Multimedia Digital Libraries on Peer-to-Peer Networks
2007
This paper presents an original approach to image sharing in large, distributed digital libraries, in which a user is able to interactively search interesting resources by means of content-based image retrieval techniques. The approach described here addresses the issues arising when the content is managed through a peer-to-peer architecture. In this case, the retrieval facilities are likely to be limited to queries based on unique identifiers or small sets of keywords, which may be quite inadequate, so we propose a novel algorithm for routing user queries that exploits compact representations of multimedia resources shared by each peer in order to dynamically adapt the network topology to …
Introducing automated reasoning in network management
2004
This paper proposes the adoption of Artificial Intelligence techniques in the field of network management and moni toring. In order to allow automated reasoning on network ing topics, we constructed an accurate ontological model capable of fitting as more as possible networking concepts. The thoroughly representation of the domain knowledge is used by a Logical Reasoner, which is an expert system ca pable of performing management tasks typically executed by human experts. The Logical Reasoner is integrated in a distributed multi-agent architecture for network manage ment, which exploits the dynamic reasoning capabilities of the Situation Calculus formalism to provide a powerful sys tem capa…
Reinforcement Learning for P2P Searching
2005
For a peer-to-peer (P2P) system holding massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured P2P networks avoid the limitations of centralized systems and the drawbacks of a highly structured approach, because they impose few constraints on topology and data placement, and they support highly versatile search mechanisms. However their search algorithms are usually based on simple flooding schemes, showing severe inefficiencies. In this paper, to address this major limitation, we propose and evaluate the adoption of a local adaptive routing protocol. The routing algorithm adopts a simple Reinforcement Learning…