Hidden nodes in a wireless network refer to nodes that are out of range of other nodes or a collection of nodes. We will discuss a few problems introduced by the RTS/CTS mechanism of collision avoidance and focus on the virtual jamming problem, which allows a malicious node to effectively jam a large fragment of a wireless network at minimum expense of power. We have also discussed WiCCP (Wirel...

Observing the internal state of whole system using a small number sensor nodes is important in analysis complex networks. Here, we study problem determining minimum to discriminate attractors under assumption that each attractor has at most K noisy nodes. We present exact and approximation algorithms for this minimization problem. The effectiveness also demonstrated by computational experiments...

This paper presents a novel scheme for self configured dynamic sensor networks based on zones, where sensor nodes are location aware. Location about which sensors provide information is always more important than identification of sensors. It is vital to deliver this information to sink involving minimum packet processing at intermediate nodes due to limited battery life and bandwidth. This sch...

We present a detailed simulation based performance study of our recently proposed strong-neighborhood based connected dominating sets (SN-CDS) for mobile ad hoc networks (MANETs). We compare the performance of SN-CDS with that of the well-known minimum connected dominating sets (MCDS) and the ID-based connected dominating sets (ID-CDS) for MANETs. We show that by computing the SN-CDS involving ...

This paper presents a method for extracting lymph node regions from 3-D abdominal CT images using 3-D minimum directional difference filter. In the case of surgery of colonic cancer, resection of metastasis lesions is performed with resection of a primary lesion. Lymph nodes are main route of metastasis and are quite important for deciding resection area. Diagnosis of enlarged lymph nodes is qu...

Maximum-distance-separable (MDS) codes are a class of erasure codes that are widely adopted to enhance the reliability of distributed storage systems (DSS). In (n, k) MDS coded DSS, the original data are stored into n distributed nodes in an efficient manner such that each storage node only contains a small amount (i.e., 1/k) of the data and a data collector connected to any k nodes can retriev...

For given a pair of nodes in a graph, the minimum non-separating path problem looks for a minimum weight path between the two nodes such that the remaining graph after removing the path is still connected. The balanced connected bipartition (BCP2) problem looks for a way to bipartition a graph into two connected subgraphs with their weights as equal as possible. In this paper we present an O(N ...

This paper theoretically and empirically studies the degree and connectivity of the Internet’s scale-free topology at an autonomous system (AS) level. The basic features of scale-free networks influence the normalization constant of degree distribution p(k). It develops a new mathematic model for describing the power-law relationships of Internet topology. From this model we theoretically obtai...

How to design a efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a minimum connected dominating set (MCDS) is a promising approach, where the search space for a route is reduced to nodes in the set (also called gateway nodes). So, to determine this set is a very vital problem. This paper introd...

The prize-collecting generalized minimum spanning tree (PC-GMST) is defined as follows: Given an undirected graph G = (V, E), with node set V, edge set E, cost vector c ∈ R|E| + on the edges E, prize vector p ∈ R|V | + on the nodes V, and a set of K mutually exclusive and exhaustive node sets V1, ..., VK (i.e., V1 ⋂ Vj = ∅, if i 6= j, and Kk=1 Vk = V ), find a minimum cost tree spanning exactly...