This paper evaluates the proposed implementation of short length low density parity check (LDPC) codes within the telemetry space protocol. Due to the varying orbital patterns of low earth orbit (LEO) satellites, limited communication time windows need to be optimised to maximise data throughput. Most popular connection oriented protocols focus on correcting congestion related link errors, but ...

We offer a model for a mobile ad-hoc random network, in which nodes that randomly located in a D dimensional space, have a distance-dependent transition probability to all other nodes. The model is examined in a simple mean-field like fashion. By treating the different paths in the network independently, the percolation phase transition is recovered. The critical behavior of the link length in ...

Telomeres are lengths of repetitive DNA that cap the ends of chromosomes. They protect the ends of the chromosome and shorten with each cell division. Short leukocyte telomere length has been related to a number of age-related diseases (1). In addition, shorter telomere length has been associated with environmental factors such as smoking and lack of exercise (2,3). In a recent issue of Biologi...

In learning belief networks, the single link lookahead search is widely adopted to reduce the search space. We show that there exists a class of probabilistic domain models which displays a special pattern of dependency. We analyze the behavior of several learning algorithms using different scoring metrics such as the entropy, conditional independence, minimal description length and Bayesian me...

Two pols nomial time algorithms are given for scheduling conversations in a spread spectrum radio networh. The constraint on converrations is that each station can conver\e with at most one other station at a time. The first algorithm is strongly polynomial and finds a schedule of minimum length which allows each pair of neighboring stations to directly converse for a prescribed length of time....

In this paper, we consider the problem of nonparametric estimation of the original length of traffic flows, based on sampled flow data. The proposed approach is a two-step one. In the first stage, the flow length distribution is estimated by an expectation-maximization (EM) algorithm that in addition provides an estimate for the number of active flows in the link. In the second stage, two estim...

Given a polygon representing a transportation network together with a point p in its interior, we aim to extend the network by inserting a line segment, called a feed-link, which connects p to the boundary of the polygon. Once a feed link is fixed, the geometric dilation of some point q on the boundary is the ratio between the length of the shortest path from p to q through the extended network...

Telecommunication traffic (voice, data etc.) is increasing day by day. So to meet the capacity demand, in this paper we have designed and verified a high capacity optical fiber communication system through simulation. We simulated a 40 Gbps single optical fiber link for telecommunication traffic transmission which could be possible to implement in developing countries with few modifications in ...

Wireless channels have the characteristic that the link quality varies with propagation conditions. For real-time flows with hard time deadlines, link layer retransmissions over the wireless network due to fluctuations in link quality may result in many packets being dropped due to deadline expiry. The expired packets waste network resources and lead to long queuing delay for subsequent packets...

In this paper, we study the effect of bit error rates and handoff disconnections on the performance of different TCP implementations (Tahoe, Reno, NewReno, and SACK). Test scenarios with larger link-up periods, when the mobile is connected, but higher disconnection probability yielded better performance than scenarios with smaller link-up periods and smaller disconnection probability. Our perfo...