Given an undirected graph with nonnegative edge-costs, a subset of nodes of size k called the terminals, and an integer q between 1 and k, the minimum q-Steiner forest problem is to find a forest of minimum cost with at most q trees that spans all the terminals. When q = 1, we have the classical minimum-cost Steiner tree problem on networks. We adapt a primal-dual approximation algorithm for th...

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...

Given a set of nodes in the plane and a constant t ≥ 1, a Euclidean t-spanner is a network in which, for any pair of nodes, the ratio of the network distance and the Euclidean distance of the two nodes is at most t. Such networks have applications in transportation or communication network design and have been studied extensively. In this paper we study 1-spanners under the Manhattan (or L1-) m...

A Mobile Ad-hoc network (MANET) is a selforganizing and adaptive in environment. A MANET consists of a set of mobile nodes that have to collaborate, interact and communicate to complete an assigned operation. These applications have need of Quality of Service (QoS) parameters such as: minimum hop path, minimum transmitted energy path, residual energy, bandwidth, throughput and power to be adequ...

The utilization of distributed control and optimization is still a challenge issue to achieve reliable communication for resource-constrained networked systems. In this paper, a distributed cooperative communication nodes control (DCCNC) approach is proposed to achieve higher reliability communication and longer network lifetime for resource-constrained wireless sensor network (WSNs). A DCCNC s...

Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identical transmission radius. In compare, this paper addresses the problem of deploying relay nodes to provide fault tolerance with higher network connectivity in heterogeneous wireless sensor networks, where sensor nodes have d...

OBJECTIVES/HYPOTHESIS Unlike lymphadenectomy at other sites, there is no discrete lymph node count defining an adequate neck dissection. The purpose of this study was to determine the minimum lymph node yield (LNY) of an elective level I-III neck dissection required to reliably capture any positive nodes present in these nodal basins. STUDY DESIGN Retrospective single-institution analysis. ...

We aim to preserve the large amount of data generated inside base station-less sensor networks with minimum energy cost, while considering that sensor nodes are selfish. Previous research assumed that all the sensor nodes are cooperative and designed a centralized minimumcost flow solution. However, in a distributed setting wherein energyand storage-constrained sensor nodes are under different ...

Abstract The mathematical model can be widely applied to the field of deployment and topology control in wireless sensor networks. In wireless sensor networks, sensor nodes are randomly distributed of highdensity. How can we use a minimum number of sensor nodes achieving requirement of coverage and connectivity is a NP-hard problem. This paper formulates a mathematical model in which only if so...

Since sensor nodes have limited battery power, it is desirable to select a minimum set of working sensor nodes which should be involved in sensing and forwarding data to the sink. In this paper, we propose a disjoint scheduling for density control in wireless sensor network to achieve the desired robust coverage as well as satisfactory connectivity to the sink with a small set of working nodes....