Mobile ad hoc networks communicate in a self-organized way without depending on any fixed infrastructure. The issue of selfish nodes, which may refuse to cooperate, is a great challenge in such networks and may cause network throughput to drastically reduce. Energy-based selfishness is a category of selfishness in which a selfish node shows nondeterministic and probabilistic selfishness behavio...

To establish pairwise keys for each pair of neighboring sensor nodes is a basic service, forming the basis other security services, such as authentication and encrypted in wireless sensor networks (WSNs). However, due to constrained energy, memory, and computational capabilities of sensor nodes to establish the pairwise key is challenging task. Here, a combination of polynomial pool-based and t...

Mobile ad-hoc networks pose real difficulty in finding the multihop shortest paths because of continuous changing positions of the nodes. Traditional ad-hoc routing protocols are proposed to find multi-hop routes based on shortest path routing algorithms, which cannot effectively adapt to time-varying radio links and network topologies of Ad-hoc networks. In this paper we proposed an enhanced r...

Network calculus is an elegant theory which uses envelopes to determine the worst-case performance bounds in a network. Statistical network calculus is the probabilistic version of network calculus, which strives to retain the simplicity of envelope approach from network calculus and use the arguments of statistical multiplexing to determine probabilistic performance bounds in a network. One of...

In this paper we deal with a new probabilistic extension of the Minimum Power Multicast (MPM) problem for wireless networks. The deterministic MPM problem consists in assigning transmission powers to the nodes, so that a multihop connection can be established between a source and a given set of destination nodes and the total power required is minimized. We present a new extension to the basic ...

background & objectives: colon cancer is currently of high incidence and mortality rate. identifying the factors influencing its prognosis can be very beneficial to its clinical treatment. recent studies have shown that lymph nodes ratio can be considered as an important prognostic factor. the aim of the present study is to investigate the effect of this factor on the prognosis of the patie...

We consider the Horton-Strahler number S, for random equiprobable binary trees with n nodes. We give a simple probabilistic proof of the well-known result that ES, = log,n + O(1) and show that for every x > 0, P{ 1 S, log,n ( > x} Q D/4x, for some constant D > 0.

To evolve structured programs we introduce H-PIPE, a hierarchical extension of Probabilistic Incremental Program Evolution (PIPE). Structure is induced by \hierarchi-cal instructions" (HIs) limited to top-level, structuring program parts. \Skip nodes" (SNs) allow for switching program parts on and oo. They facilitate synthesis of certain structured programs. In our experiments H-PIPE outperform...

In this paper the architecture of a distributed and scalable multimedia information retrieval system (Dsmily) is described. The system consists of hierarchically organized networked nodes and is designed to integrate existing dynamic multimedia databases. The document ranking process as well as the preselection of databases to be searched, both tasks are based on a probabilistic model for distr...

Many modern networks grow from blocks. We study the probabilistic behavior of parameters of a blocks tree, which models several kinds of networks. It grows from building blocks that are themselves rooted trees. We investigate the number of leaves, depth of nodes, total path length, and height of such trees. We use methods from the theory of Pólya urns and martingales.