Related papers: The Carrier Pigeon Internet Protocol: An Algorithm…
As the use of wireless sensor networks increases, the need for (energy-)efficient and reliable broadcasting algorithms grows. Ideally, a broadcasting algorithm should have the ability to quickly disseminate data, while keeping the number of…
Data communication in sensor networks can have timing constraints like end to end deadlines. If the deadlines are not met either a catastrophe can happen in hard real time systems or performance deterioration can occur in soft real time…
The predator/prey (capture) problem is a prototype of many network-related applications. We study the capture process on complex networks by considering multiple predators from multiple sources. In our model, some lions start from multiple…
We consider ad-hoc networks consisting of $n$ wireless nodes that are located on the plane. Any two given nodes are called neighbors if they are located within a certain distance (communication range) from one another. A given node can be…
We propose the construction of an unobservable communications network using social networks. The communication endpoints are vertices on a social network. Probabilistically unobservable communication channels are built by leveraging image…
The problem of adaptively setting the timeout interval for retransmitting a packet has been discussed. A layered view of the algorithms has been presented. It is shown that a timeout algorithm consists of essentially five layers or…
Flying ad hoc network (FANET) provides portable and flexible communication for many applications and possesses several unique design challenges; a key one is the successful delivery of messages to the destination, reliably. For reliable…
In this paper it is introduced a biobjective ant algorithm for constructing low cost routing networks. The new algorithm is called the Distributed Pharaoh System (DPS). DPS is based on AntNet algorithm. The algorithm is using Pharaoh Ant…
This paper develops a framework to study multi-hop relaying in a vehicular network consisting of vehicles and Road Side Units (RSUs), and the effect of this relaying on the network coverage and the communication delay. We use a stochastic…
In this paper, we consider the problem of modelling the average delay in an IEEE 802.11 DCF wireless mesh network with a single root node under light traffic. We derive expression for mean delay for a co-located wireless mesh network, when…
We present a theoretical formalism to study steady state information transmission in type 1 coherent feed-forward loop motif with an additive signal integration mechanism. Our construct allows a two-step cascade to be slowly transformed…
The network layer is central to the networking scientific area. It is around the network layer that all the data communications develop, and one of its main tasks is to allow the identification of each single interface/machine between the…
This paper seeks to address the question of designing distributed algorithms for the setting of compact memory i.e. sublinear bits working memory for arbitrary connected networks. The nodes in our networks may have much lower internal…
This paper studies the problem of transmitting multiple independent layered video streams over single-hop wireless networks using network coding (NC). We combine feedback-free random linear NC (RLNC) with unequal error protection (UEP) and…
In this paper, we consider a two-hop molecular communication network consisting of one nanotransmitter, one nanoreceiver, and one nanotransceiver acting as a relay. We consider two different schemes for relaying to improve the range of…
In this paper, we propose a new relaying protocol for large multihop networks combining the concepts of cooperative diversity and opportunistic relaying. The cooperative relaying protocol is based on two diversity mechanisms, incremental…
Classical communication paradigms focus on accurately transmitting bits over a noisy channel, and Shannon theory provides a fundamental theoretical limit on the rate of reliable communications. In this approach, bits are treated equally,…
Classical communication paradigms focus on accurately transmitting bits over a noisy channel, and Shannon theory provides a fundamental theoretical limit on the rate of reliable communications. In this approach, bits are treated equally,…
Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This…
This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node…