Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available The channel for hidden data transmission in WSN
EN
This paper describes an idea and realisation of hidden data transmision using Tiny Aggregation Covert Channel (TAGCC) in Wireless Sensor Networks. Our solution uses data aggregation mechanism called Tiny Aggregation (TAG). The protocol is based on idea of hidden messages sending without generate additional data packets and encryption. The paper describes details of proposed algorithm and simulation results obtained during testing of the sensor networks with hidden channel TAGCC.
EN
This paper presents the Reliable Bidirectional Control Protocol (RBCP) protocol, which is a transport protocol for Wireless Sensor Networks (WSN), focused on managing sensors' behaviour. It aims to be a utility for reliable control data transferring from source to destination unit in the network. Considering the related studies on transport protocols, which are mostly dedicated to a single-direction reliable data transport, RBCP is the answer for the lack of control mechanisms in WSNs based on bidirectional communication. The first part of this paper is focused on general presentation of the proposed solution. In the next part, evaluation of the idea and final functionality are discussed. It will finally show the results of undergone testing stage.
EN
Delay and Disruptive Tolerant Networks (DTN) are relatively a new networking concept that could provide a robust communication in wide range of implementations from the space to battlefield or other military usage. However in such dynamic networks, which could be considered as a set of intermittently connected nodes, message forwarding strategy is a key issue. Existing routing solutions concentrate mainly on two major routing families flooding and knowledge based algorithms. This paper presents SocialRouting - the social-based routing algorithm designed for DTN. The use of the social properties of wireless mobile nodes is the novel way of message routing that is based on message ferrying between separated parts of the network. Proposed idea has been extensively tested using simulation tools. The simulations were made based on especially designed for measurements in DTN scenarios and compared with popular solutions.
EN
At this moment there is a lack of research respecting Mobile Ad-hoc Networks (MANET) address assignment methods used in Delay Tolerant Networks (DTN). The goal of this paper is to review the SDAD, WDAD and Buddy methods of IP address assignment known from MANET in difficult environment of Delay and Disruptive Tolerant Networks. Our research allows us for estimating the effectiveness of the chosen solution and, therefore, to choose the most suitable one for specified conditions. As a part of the work we have created a tool which allows to compare these methods in terms of capability of solving address conflicts and network load. Our simulator was created from scratch in Java programming language in such a manner, that implementation of new features and improvements in the future will be as convenient as possible.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.