Developed Algorithm for Increasing the Efficiency of Data Exchange in a Computer Network

This paper presents specialized means to analyze, model and research of data exchange in large-scale corporate computer network. Due to extreme complexity of corporate intranet networks and the internet has resulted in the apparent difficulties in the development of an analytical model. Thus, under these circumstances, simulation models became viable alternative to comprehend the behavior of these complex networks during data exchange. This research work examined the mode of data exchange since its perfection allows in many cases to obtain a considerable improvement of the network and also the network application performance without substantial additional expenditure. Hence, the need for this developed algorithm for increasing the efficiency of data exchange in a computer network and the appropriate topology that suite this case. Test results from the algorithm showed an average of 10 to 15% increase and occasionally 60% and above increase in data exchange efficiency without additional expenses

An Authentication Protocol for Future Sensor Networks

Authentication is one of the essential security services in Wireless Sensor Networks (WSNs) for ensuring secure data sessions. Sensor node authentication ensures the confidentiality and validity of data collected by the sensor node, whereas user authentication guarantees that only legitimate users can access the sensor data. In a mobile WSN, sensor and user nodes move across the network and exchange data with multiple nodes, thus experiencing the authentication process multiple times. The integration of WSNs with Internet of Things (IoT) brings forth a new kind of WSN architecture along with stricter security requirements; for instance, a sensor node or a user node may need to establish multiple concurrent secure data sessions. With concurrent data sessions, the frequency of the re-authentication process increases in proportion to the number of concurrent connections, which makes the security issue even more challenging. The currently available authentication protocols were designed for the autonomous WSN and do not account for the above requirements. In this paper, we present a novel, lightweight and efficient key exchange and authentication protocol suite called the Secure Mobile Sensor Network (SMSN) Authentication Protocol. In the SMSN a mobile node goes through an initial authentication procedure and receives a re-authentication ticket from the base station. Later a mobile node can use this re-authentication ticket when establishing multiple data exchange sessions and/or when moving across the network. This scheme reduces the communication and computational complexity of the authentication process. We proved the strength of our protocol with rigorous security analysis and simulated the SMSN and previously proposed schemes in an automated protocol verifier tool. Finally, we compared the computational complexity and communication cost against well-known authentication protocols.Comment: This article is accepted for the publication in "Sensors" journal. 29 pages, 15 figure

Mapping-equivalence and oid-equivalence of single-function object-creating conjunctive queries

Conjunctive database queries have been extended with a mechanism for object creation to capture important applications such as data exchange, data integration, and ontology-based data access. Object creation generates new object identifiers in the result, that do not belong to the set of constants in the source database. The new object identifiers can be also seen as Skolem terms. Hence, object-creating conjunctive queries can also be regarded as restricted second-order tuple-generating dependencies (SO tgds), considered in the data exchange literature. In this paper, we focus on the class of single-function object-creating conjunctive queries, or sifo CQs for short. We give a new characterization for oid-equivalence of sifo CQs that is simpler than the one given by Hull and Yoshikawa and places the problem in the complexity class NP. Our characterization is based on Cohen's equivalence notions for conjunctive queries with multiplicities. We also solve the logical entailment problem for sifo CQs, showing that also this problem belongs to NP. Results by Pichler et al. have shown that logical equivalence for more general classes of SO tgds is either undecidable or decidable with as yet unknown complexity upper bounds.Comment: This revised version has been accepted on 11 January 2016 for publication in The VLDB Journa

Secure exchange of information by synchronization of neural networks

A connection between the theory of neural networks and cryptography is presented. A new phenomenon, namely synchronization of neural networks is leading to a new method of exchange of secret messages. Numerical simulations show that two artificial networks being trained by Hebbian learning rule on their mutual outputs develop an antiparallel state of their synaptic weights. The synchronized weights are used to construct an ephemeral key exchange protocol for a secure transmission of secret data. It is shown that an opponent who knows the protocol and all details of any transmission of the data has no chance to decrypt the secret message, since tracking the weights is a hard problem compared to synchronization. The complexity of the generation of the secure channel is linear with the size of the network.Comment: 11 pages, 5 figure

Cooperative Downlink Multicell Preprocessing Relying on Reduced-Rate Back-Haul Data Exchange

Different-complexity multicell preprocessing (MCP) schemes employing distributed signal-to-interference leakageplus-noise ratio (SILNR) precoding techniques are proposed, which require reduced back-haul data exchange in comparison with the conventional MCP structure. Our results demonstrate that the proposed structures are capable of increasing the throughput achievable in the cell-edge area while offering different geographic rate profile distributions, as well as meeting different delay requirements

Distributed downlink multi-cell processing requiring reduced-rate back-haul data exchange

Different-complexity Multi-Cell Processing (MCP) schemes employing Distributed Signal-to-Interference-Leakage-plus-Noise-Ratio (SILNR) precoding techniques are proposed, which require reduced back-haul data exchange in comparison to the conventional MCP structure. Our results demonstrate that the proposed structures are capable of increasing the achievable cell-edge throughput and offering different geographic rate profile distributions as well as meeting different delay requirements

A Predator-Prey Model with an Application to Lake Victoria Fisheries

Greater complexity in renewable resource models is achieved by acknowledging that species interact through a predator-prey relationship in which both species are harvested. The price of greater complexity is that traditional concepts, such as maximum sustained yield (MSY), have to be revised dramatically. Moreover, having chosen greater complexity, fishery biologists and other researchers must choose an explicit value for each fish, a rate of exchange of one species for every other species. Policy makers and social scientists in Tanzania, Kenya, and Uganda with a keen interest in Lake Victoria fisheries regard the resource as a tool for furthering socioeconomic goals, such as foreign exchange earnings, employment for women, and nutrition. Comparative analysis allows policy makers to understand the consequences of choosing these goals in addition to economically efficient resource use. Foreign exchange earnings, employment for women, and healthy people are other goals promulgated by Tanzania, Kenya, and Uganda in the management of Lake Victoria Fisheries. The conflicts among social goals are evident in the bioeconomic predator-prey model: a goal favoring a particular species reduces the sustainable harvest of another species. Data from Kenya are used to estimate the population dynamics equations.predator-prey, bioeconomic model, Lake Victoria, Resource /Energy Economics and Policy, Q22, Q28,