Search
Filters
total: 197
filtered: 173
Search results for: AD-HOC NODES NETWORK
-
Collision-free network exploration
PublicationMobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...
-
Transmission Protocol Simulation Framework For The Resource-Constrained Wireless Sensor Network
PublicationIn this paper a prototype framework for simulation of wireless sensor network and its protocols are presented. The framework simulates operation of a sensor network with data transmission, which enables simultaneous development of the sensor network software, its hardware and the protocols for wireless data transmission. An advantage of using the framework is converging simulation with the real software. Instead of creating...
-
Distributed protection against non-cooperative node behavior in multi-hop wireless networks
PublicationAn important security problem in today's distributed data networks is the prevention of non-cooperative behavior i.e., attacks consisting in the modification of standard node operation to gain unfair advantage over other system nodes. Such a behavior is currently feasible in many types of computer networks whose communication protocols are designed to maximize the network performance assuming full node cooperation. Moreover, it...
-
Architektura bezpieczeństwa systemu netBaltic
PublicationW artykule zaprezentowano założenia dotyczące zabezpieczania węzłów sieci realizowanej w ramach systemu netBaltic. Ze względu na dużą różnorodność rozważanych mechanizmów komunikacyjnych architektura bezpieczeństwa została podzielona na kilka elementów – infrastrukturę klucza publicznego (PKI), bezpieczeństwo systemowe węzłów, zabezpieczanie komunikacji w modelu samoorganizującej wieloskokowej sieci kratowej, a także sieci niewrażliwej...
-
Bilateral multi-issue negotiation of execution contexts by proactive document agents
PublicationA proactive document can react to its actual environment by autonomously selecting and performing actions integrated into its body and interact with its user. When migrating over a network of execution devices it may encounter diverse execution contexts, each one set up according to temporal characteristics of a receiving device and preferences of its owner. A concept to augment proactive documents with negotiation capability is...
-
Mitigating Traffic Remapping Attacks in Autonomous Multi-hop Wireless Networks
PublicationMultihop wireless networks with autonomous nodes are susceptible to selfish traffic remapping attacks (TRAs). Nodes launching TRAs leverage the underlying channel access function to receive an unduly high Quality of Service (QoS) for packet flows traversing source-to-destination routes. TRAs are easy to execute, impossible to prevent, difficult to detect, and harmful to the QoS of honest nodes. Recognizing the need for providing...
-
Toward Fast Calculation of Communication Paths for Resilient Routing
PublicationUtilization of alternate communication paths is a common technique to provide protection of transmission against failures of network nodes/links. However, a noticeable delay is encountered when calculating the relevant sets of disjoint paths using the available algorithms (e.g., using Bhandari’s approach). This, in turn, may have a serious impact on the ability of a network to serve dynamic demands...
-
Collision-Free Network Exploration
PublicationA set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...
-
The reliability of tree and star networks
PublicationThis paper investigated the reliability of tree and star networks. Following measures of network reliability are assumed: the expected number of nodes, that can communicate with the central node; the expected number of node pairs, that are connected by a path through the central node; the expected number of node pairs communicating.
-
Wireless systems of threats monitoring
PublicationThe concept of wireless system of threats monitoring with self-organizing network of multipurpose data transfer nodes are presented. Two practical applications of this system are also presented. The first of these is the Global Wireless Monitoring System for Containers, and the second is the Mobile Monitoring System for Gas Air Pollution Measurements.
-
Wireless systems of threats monitoring
PublicationThe concept of wireless system of threats monitoring with self-organizing network of multipurpose data transfer nodes are presented. Two practical applications of this system are also presented. The first of these is the Global Wireless Monitoring System for Containers, and the second is the Mobile Monitoring System for Gas Air Pollution Measurements.
-
Wireless Systems of Threats Monitoring
PublicationConcept of wireless system of threats monitoring with self-organizing network of multipurpose data transfer nodes are presented. Two practical applications of this system are also presented. The first of these is the Global Wireless Monitoring System for Containers and the second is the Mobile Monitoring System for Gas Air Pollution Measurements.
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
Multi-agent systems registration and maintenance of address mapping without agent self-registation
PublicationMonitoring of dynamic multi-agent systems, here agents are allowed to appear and disappear, and can migrate between network nodes is a complex tasks. Applying the traditional monitoring methods is not effective, as little can be assumed in advance about such environments. It is necessary to track changes in addressing and availability of agents to create and maintain mapping between agents and their network addresses. The...
-
Guaranteeing Threshold Attendance of W/WSAN nodes in a reverted security paradigm
PublicationWe consider a Wireline/Wireless Sensor and Actor Network composed of sensor/actor nodes and a data sink/command center (DSCC). Each node controls a generic device that can be in- or out-of-service, corresponding to the ENABLED or DISABLED node state. The node senses the device's intention to change state, and notifies and/or requests the DSCC for authorization to act upon the device. Motivated by requirements for critical infrastructures...
-
On-line Search in Two-Dimensional Environment
PublicationWe consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. As a way of modeling two-dimensional shapes, we restrict our attention to networks that are embedded into partial grids:...
-
Assessing the time effectiveness of trust management in fully synchronised wireless sensor networks
PublicationThe paper presents the results of the time effectiveness assessment of the distributed WSN Cooperative Trust Management Method - WCT2M in a fully synchronized Wireless Sensor Network (WSN). First we introduce some basic types of synchronization patterns in WSN based on the idea of sleep scheduling. Then we explain how WCT2M works in the network applying the fully synchronized sleep scheduling pattern. Such networks were subjected...
-
On Symmetry of Uniform and Preferential Attachment Graphs
PublicationMotivated by the problem of graph structure compression under realistic source models, we study the symmetry behavior of preferential and uniform attachment graphs. These are two dynamic models of network growth in which new nodes attach to a constant number m of existing ones according to some attachment scheme. We prove symmetry results for m=1 and 2 , and we conjecture that for m≥3 , both models yield asymmetry with high...
-
RSS-based DoA Estimation Using ESPAR Antennas and Interpolated Radiation Patterns
PublicationIn this letter, it is shown how an algorithm, which employs received signal strength (RSS) values in order to estimate direction-of-arrival (DoA) of impinging signals in wireless sensor network (WSN) nodes equipped with electronically steerable parasitic array radiator (ESPAR) antennas, can easily be improved by applying an interpolation algorithm to radiation patterns recorded in the calibration phase of the DoA estimation process....
-
Investigation of continuous wave jamming in an IEEE 802.15.4 network
PublicationThis paper presents how continuous wave jamming affects IEEE 802.15.4 network. To this end, an office-based measurement setup has been proposed. Within the measurement area, 25 nodes have been set up in order to create a IEEE 802.15.4 tree-based test network structure. A dedicated jamming device that generates and transmits a continuous wave signal has been developed. Several tests have been conducted and presented to demonstrate...
-
The reliability of any-hop star networks with respect to failures of communication nodes.
PublicationThis paper investigated the reliability of any-hop star networks. The any-hop star topology is used in centralized computer networks. We will assume that the all nodes fail independently, links are failure-free. Following measures of network reliability are assumed: the expected number of nodes, which can communicate with the central node; the expected number of node pairs, which are connected by a path through the central node;...
-
The Methodology of identifying the place to install shunt compensators in the transmission network
PublicationThis methodology of selection and localization of static com- paper presents pensators in wide network. Proposed method is based on analysis of voltage area power profiles in the nodes of the power grid, and designating locations, In Which Voltages ex- cessively tend to change in time. Practical way of modeling the SVC device in PLANS program you Presented, as well as some example results of research.
-
A concept of measurement system based on the Z-Wave standard
PublicationIn the paper a new concept of measurement system based on the Z-Wave standard is presented. This standard is dedicated to use mainly in home automation systems, but its properties enable to use it in dispersed measurement systems and support wireless communication between measurement nodes in a mesh-type network. In the paper basic metrological aspects of the Z-Wave standard and an example of impedance measurement system are discussed.
-
Gossiping by energy-constrained mobile agents in tree networks
PublicationEvery node of an edge-weighted tree network contains a data packet. At some nodes are placed mobile agents, each one possessing an amount of energy (not necessarily the same for all agents). While walking along the network, the agents spend the energy proportionally to the distance traveled and collect copies of the data packets present at the visited network nodes. An agent visiting a node deposits there copies of all currently...
-
Mechanizmy bezpieczeństwa transmisji w systemie netBaltic
Publicationartykule zaprezentowano założenia dotyczące zabezpieczania węzłów sieci realizowanej w ramach systemu netBaltic. Ze względu na dużą różnorodność rozważanych mechanizmów komunikacyjnych architektura bezpieczeństwa została podzielona na kilka elementów – infrastrukturę klucza publicznego (PKI), bezpieczeństwo systemowe węzłów, zabezpieczanie komunikacji w modelu samoorganizującej wieloskokowej sieci kratowej, a także sieci niewrażliwej...
-
Disciplines and measures of information resilience
PublicationCommunication networks have become a fundamental part of many critical infrastructures, playing an important role in information delivery in various failure scenarios triggered e.g., by forces of nature (including earthquakes, tornados, fires, etc.), technology-related disasters (for instance due to power blackout), or malicious human activities. A number of recovery schemes have been defined in the context of network resilience...
-
The realization of ASON/GMPLS control plane
PublicationASON (Automatic Switched Optical Network) is a concept of optical network recommended in G.8080/Y.1304 by ITU-T. Control Plane of this network could be based on GMPLS (Generalized Multi-Protocol Label Switching) protocols like RSVP-TE, OSPF-TE, LMP. This solution is named ASON/GMPLS. In this chapter we present the control plane problems and proposes ASON/GMPLS network realization that are tested on testbed consists of three and...
-
Assessment of Connectivity-based Resilience to Attacks Against Multiple Nodes in SDNs
PublicationIn Software Defined Networks (SDNs), the control plane of a network is decoupled from its data plane. For scalability and robustness, the logically centralized control plane is implemented by physically placing different controllers throughout the network. The determination of the number and placement of controllers is known as the Controller Placement Problem (CPP). In the regular (i.e., failure-free) state, the control plane...
-
Wireless Systems of Threats Monitoring
PublicationThe concept of wireless system of threats monitoring with self-organizing network of multipurpose data transfer nodes are presented. Two practical applications of this system are also presented. The first of these is the Global Wireless Monitoring System for Containers, and the second is the Mobile Monitoring System for Gas Air Pollution Measurements. Presented practical applications of the wireless threats monitoring system is...
-
Improving the Survivability of Carrier Networks to Large-Scale Disasters
PublicationThis chapter is dedicated to the description of methods aiming to improve the survivability of carrier networks to large-scale disasters. First, a disaster classification and associated risk analysis is described, and the disaster-aware submarine fibre-optic cable deployment is addressed aiming to minimize the expected costs in case of natural disasters. Then, the chapter addresses the improvement of the network connectivity resilience...
-
Selection of optimal location and rated power of capacitor banks in distribution network using genetic algorithm
PublicationIn this paper, the problem of placement and rated power of capacitor banks in the Distribution Network (DN) is considered. We try to suggest the best places for installing capacitor banks and define their reactive power. The considered formulation requires the optimization of the cost of two different objectives. Therefore the use of properly multiobjective heuristic optimization methods is desirable. To solve this problem we use...
-
Topology Discovery of Hierarchical Ethernet LANs without SNMP support
PublicationThis paper presents an algorithm that allows for discovery of layer-2 hierarchical Ethernet network topology using agents running on selected end nodes. No SNMP, MIB, hardware, firmware, or operating system-level software modification is required. The method is based on transmission of customized Ethernet frames among installed software agents. It can be used to discover the topology of LAN or one VLAN segment as long as no MAC...
-
Computer-aided analysis of resonance risk in power system with Static Var Compensators
PublicationStatic Var Compensators operation in a power system may significantly improve voltage profiles in nodes and the reactive power balance, as well as ensure greater system stability in emergency conditions. However these devices may be a cause of a resonance in the system. The aim of this paper is to call attention to the need to include resonance phenomena in a compensator’s location evaluation process. The analysis performed in...
-
Tryton Supercomputer Capabilities for Analysis of Massive Data Streams
PublicationThe recently deployed supercomputer Tryton, located in the Academic Computer Center of Gdansk University of Technology, provides great means for massive parallel processing. Moreover, the status of the Center as one of the main network nodes in the PIONIER network enables the fast and reliable transfer of data produced by miscellaneous devices scattered in the area of the whole country. The typical examples of such data are streams...
-
BADANIE MOŻLIWOŚCI SYMULACYJNYCH ŚRODOWISKA ‘MININET’ POD KĄTEM WSPARCIA PROTOKOŁU NETCONF
PublicationNiniejszy artykuł został poświęcony zagadnieniu wykorzystania środowiska emulacyjnego Mininet do testowania mechanizmów działania protokołu NETCONF. Omówiono w nim projekt inżynierski, którego wynikiem było zaimplementowanie wirtualnego środowiska, umożliwiającego prowadzenie takich badań. Opisano także wyniki testów emulacji dwóch pierścieniowych domen sieciowych, składających się z 30 węzłów.
-
Relay-aided Wireless Sensor Network Discovery Algorithm for Dense Industrial IoT utilizing ESPAR Antennas
PublicationIndustrial Internet of Things (IIoT) applicationsrequire reliable and efficient wireless communication. Assumingdense Wireless Sensor Networks (WSNs) operating in a harshenvironment, a concept of a Time Division Multiple Access(TDMA) based WSN enriched with Electronically SteerableParasitic Array Radiator (ESPAR) antennas is proposed andexamined in this work. The utilized...
-
Reinforced Secure Gossiping Against DoS Attacks in Post-Disaster Scenarios
PublicationDuring and after a disaster, the perceived quality of communication networks often becomes remarkably degraded with an increased ratio of packet losses due to physical damages of the networking equipment, disturbance to the radio frequency signals, continuous reconfiguration of the routing tables, or sudden spikes of the network traffic, e.g., caused by the increased user activity in a post-disaster period. Several techniques have...
-
On-line Search in Two-Dimensional Environment
PublicationWe consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. We require that the strategy is connected and monotone, that is, at each point of the execution the part of the graph...
-
A survey of strategies for communication networks to protect against large-scale natural disasters
PublicationRecent natural disasters have revealed that emergency networks presently cannot disseminate the necessary disaster information, making it difficult to deploy and coordinate relief operations. These disasters have reinforced the knowledge that telecommunication networks constitute a critical infrastructure of our society, and the urgency in establishing protection mechanisms against disaster-based disruptions. Hence, it is important...
-
Leader election for anonymous asynchronous agents in arbitrary networks
PublicationWe consider the problem of leader election among mobile agents operating in an arbitrary network modeled as an undirected graph. Nodes of the network are unlabeled and all agents are identical. Hence the only way to elect a leader among agents is by exploiting asymmetries in their initial positions in the graph. Agents do not know the graph or their positions in it, hence they must gain this knowledge by navigating in the graph...
-
Network Graph Transformation Providing Fast Calculation of Paths for Resilient Routing
PublicationProtection of transmission against failures can be appropriately dealt with by alternative paths. However, common schemes (e.g., Bhandaris scheme) are characterized by a remarkable delay while determining the transmission paths. This in turn may have a serious impact on serving dynamic demands (characterized by relatively short duration time). As a remedy to this problem, we introduce an approach to pre-compute the sets of disjoint...
-
Deep Learning-Based LOS and NLOS Identification in Wireless Body Area Networks
PublicationIn this article, the usage of deep learning (DL) in ultra-wideband (UWB) Wireless Body Area Networks (WBANs) is presented. The developed approach, using channel impulse response, allows higher efficiency in identifying the direct visibility conditions between nodes in off-body communication with comparison to the methods described in the literature. The effectiveness of the proposed deep feedforward neural network was checked on...
-
Long-distance quantum communication over noisy networks without long-time quantum memory
PublicationThe problem of sharing entanglement over large distances is crucial for implementations of quantum cryptography. A possible scheme for long-distance entanglement sharing and quantum communication exploits networks whose nodes share Einstein-Podolsky-Rosen (EPR) pairs. In Perseguers et al. [Phys. Rev. A 78, 062324 (2008)] the authors put forward an important isomorphism between storing quantum information in a dimension D and transmission...
-
Maximizing SDN resilience to node‐targeted attacks through joint optimization of the primary and backup controllers placements
PublicationIn Software Defined Networks (SDN) packet data switches are configured by a limited number of SDN controllers, which respond to queries for packet forwarding decisions from the switches. To enable optimal control of switches in real time the placement of controllers at network nodes must guarantee that the controller-to-controller and switch-to-controller communications delays are bounded. Apart from the primary controllers that...
-
Collision‐Aware Routing Using Multi‐Objective Seagull Optimization Algorithm for WSN‐Based IoT
PublicationIn recent trends, wireless sensor networks (WSNs) have become popular because of their cost, simple structure, reliability, and developments in the communication field. The Internet of Things (IoT) refers to the interconnection of everyday objects and sharing of information through the Internet. Congestion in networks leads to transmission delays and packet loss and causes wastage of time and energy on recovery. The routing protocols...
-
Open extensive IoT research and measurement infrastructure for remote collection and automatic analysis of environmental data.
PublicationInternet of Things devices that send small amounts of data do not need high bit rates as it is the range that is more crucial for them. The use of popular, unlicensed 2.4 GHz and 5 GHz bands is fairly legally enforced (transmission power above power limits cannot be increased). In addition, waves of this length are very diffiult to propagate under field conditions (e.g. in urban areas). The market response to these needs are the...
-
RSS-Based DoA Estimation for ESPAR Antennas Using Support Vector Machine
PublicationIn this letter, it is shown how direction-of-arrival (DoA) estimation for electronically steerable parasitic array radiator (ESPAR) antennas, which are designed to be integrated within wireless sensor network nodes, can be improved by applying support vector classification approach to received signal strength (RSS) values recorded at an antenna's output port. The proposed method relies on ESPAR antenna's radiation patterns measured...
-
Evaluation of time-efficiency of disjoint paths calculation schemes
PublicationThe concept of alternate paths has been shown in the literature to provide fast response of a network to failures of its elements (nodes/links) affecting flows along the primary communication paths. Various approaches have been proposed to reduce the time necessary to redirect the respective flows onto the alternate paths. In this paper, we focus on another important objective, that so far has not received much attention, i.e.,...
-
Remote Stateful Autoconfiguration for Mobile IPv6 Nodes with Server Side Duplicate Address Detection
PublicationDuring interdomain handover, IPv6 node requires new address at its new location. Once the L2 handover procedure is completed, mobile node (MN) starts its IPv6 configuration, using stateless (router advertisements) or stateful (DHCPv6 communication) mode. Once the address is obtained, its uniqueness has to be verified, using Duplicate Address Detection (DAD) procedure. Depending on the interface type, this procedure may easily take...
-
Long Distance Geographically Distributed InfiniBand Based Computing
PublicationCollaboration between multiple computing centres, referred as federated computing is becom- ing important pillar of High Performance Computing (HPC) and will be one of its key components in the future. To test technical possibilities of future collaboration using 100 Gb optic fiber link (Connection was 900 km in length with 9 ms RTT time) we prepared two scenarios of operation. In the first one, Interdisciplinary Centre for Mathematical...