Cross layer cooperative protocol which exploits the benefits of physical layer cooperative communication, is one of the widely recognized MAC layer protocol design strategies for future wireless networks. This paper presents performance analysis of a cooperative mac and these performance parameters are compared those of the legacy IEEE 802.11 DCF MAC. Appropriate relay station selection is the main hurdle in designing efficient cooperative MAC protocol for wireless networks. This cooperative mac demonstrated that intermediate relay nodes themselves can initiate cooperation for relaying data frame to the receiver on behalf of the sender. This procedure makes the selection process of a “helper node” more distributed in nature as well as it contributes to increase throughput of a wireless network by reducing the overheads that are usually incurred in the helper selection process. It has been shown by thorough analytical analysis that the proposed cooperative MAC protocol offers higher throughput and lower frame transmission delay in both ideal and error prone wireless environment. These performance metrics are also evaluated while the wireless nodes are mobile as well.
The article refers to the idea of using the software defined network (SDN) as an effective hardware and software platform enabling the creation and dynamic management of distributed ICT infrastructure supporting the rapid prototyping process. The authors proposed a new layered reference model remote distributed rapid prototyping that allows the development of heterogeneous, open systems of rapid prototyping in a distributed environment. Next, the implementation of this model was presented in which the functioning of the bottom layers of the model is based on the SDN architecture. Laboratory tests were carried out for this implementation which allowed to verify the proposed model in the real environment, as well as determine its potential and possibilities for further development. Thus, the approach described in the paper may contribute to the development and improvement of the efficiency of rapid prototyping processes which individual components are located in remote industrial, research and development units. Thanks to this, it will be possible to better integrate production processes as well as optimize the costs associated with prototyping. The proposed solution is also a response in this regard to the needs of industry 4.0 in the area of creating scalable, controllable and reliable platforms.
The paper presents the concept of vital cities in the context of mechanisms of sustainable development, networking and creativity. The vital city was presented as:
- a city belonging to the inhabitants – a city managed and developed with advanced processes of participation,
- a city of reasonable management – a city that uses and at the same time protects its key potentials,
- a city of creation – a city of creating and implementing new ideas,
- a city of opportunities – a city that creates the conditions for the use of energy and creativity residents,
- a city in the surround – a city with a strong position in the environment.
A spectrum defragmentation problem in elastic optical networks was considered under the assumption that all connections can be realized in switching nodes. But this assumption is true only when the switching fabric has appropriate combinatorial properties. In this paper, we consider a defragmentation problem in one architecture of wavelength-spacewavelength switching fabrics. First, we discuss the requirements for this switching fabric, below which defragmentation does not always end with success. Then, we propose defragmentation algorithms and evaluate them by simulation. The results show that proposed algorithms can increase the number of connections realized in the switching fabric and reduce the loss probability.
Extensive use of computer networks is associated with the development of various effective methods that are suitable for hiding information in the contents transferred over the network. These methods are described as network steganography. Since web applications use HTTP protocol to transmit the requests to the server and send the answers to the final recipient, specifically HTTP protocol is ideal for hiding information. For example, there are several methods that can be used to transmit the additional content in the HTTP header. In this paper, we present authors’ evaluation method for network steganography using HTTP specific properties and evaluate the effectiveness of some techniques, providing experimental results.
Single Frequency Networks (SFN) of transmitters are currently used in television and digital broadcasting to effectively cover large areas using minimal spectral resources and using transmitters with much lower power than if the same area were covered using one transmitter. It is therefore a very ecological solution. In this way, much better reception conditions are obtained in large city areas, as the signal reaches the receiving antenna from different directions, reducing the risk of shading. However, in this type of network one should take into account the loss of signal caused by signal interference. Using the appropriate propagation model, it is possible, with appropriate assumptions, to check how the operation of the third transmitter affects the distribution and size of the deepest fades in relation to the network in which there are two transmitters.
A novel algorithm is presented to deduce individual nodal forwarding behavior from standard end-to-end acknowledgments. The algorithm is based on a well-established mathematical method and is robust to network related errors and nodal behavior changes. The proposed solution was verified in a network simulation, during which it achieved sound results in a challenging multihop ad-hoc network environment.
This paper details a hardware implementation of a distributed Θ(1) time algorithm allows to select dynamically the master device in ad-hoc or cluster-based networks in a constant time regardless the number of devices in the same cluster. The algorithm allows each device to automatically detect its own status; master or slave; based on identifier without adding extra overheads or exchanging packets that slow down the network. We propose a baseband design that implements algorithm functions and we detail the hardware implementation using Matlab/Simulink and Ettus B210 USRP. Tests held in laboratory prove that algorithm works as expected.
Human brain is “the perfect guessing machine” (James V. Stone (2012) Vision and Brain, Cambridge, Mass: The MIT Press, p. 155), trying to interpret sensory data in the light of previous biases or beliefs. Bayesian inference is carried out by three complex networks of the human brain: salience network, central executive network, and default mode network. Their function is analysed both in neurotypical person and Attention Deficit Disorder. Modern human being having predictive brain and overloaded mind must develop social identity, whose evolution went probably through three stages: social selection based on punishment, sexual selection based on reputation, and group selection based on identity.
The aim of the presented paper was to verify the impact of Dynamic PUCCH Resource Allocation Algorithm of the LTE cellular system on the maximum uplink cell throughput and call setup success rate-CSSR. Paper includes the laboratorytestbeddescription and presents the results of an experiment confirming the improvement of both key performance indicatorsKPIs.Apart from the presentation of the Dynamic PUCCH Resource allocation algorithm, the paper also includes a description of legacy LTE uplink (PUCCH and PUSCH) channels dimensioning process thus filling the gap of such a tutorial in the available literature.