Efficient routing among a set of mobile hosts is one the most important functions in ad hoc wireless networks. Routing based on connected dominating promising approach, where search space for route reduced to set. A if all system are either or neighbors The efficiency dominating-set-based mainly depends overhead introduced formation and size In this paper, we first review localized called marking process routing. Then, propose dominant pruning rule reduce This (called Rule k) generalization...

Metal copper mesh with superhydrophobic and superoleophilic surface had been successfully fabricated via a facile solution−immersion process. The hierarchical structure was prepared on the commercial by etching nitric acid. After being modified 1-hexadecanethiol (HDT), as-prepared indicated both property simultaneously. This metal could then be applied for oil water mixture separation. unusual wettability of stable in corrosive conditions, such as acidic, basic, salt solutions. method...

We propose a general framework for broadcasting in ad hoc networks through self-pruning. The approach is based on selecting small subset of hosts (also called nodes) to form forward node set carry out broadcast process. Each node, upon receiving packet, determines whether the packet two neighborhood coverage conditions. These conditions depend neighbor connectivity and history visited nodes, general, resort global network information. Using local information such as k-hop information,...

Due to uncertainty in nodal mobility, DTN routing usually employs multi-copy forwarding schemes. To avoid the cost associated with flooding, much effort has been focused on probabilistic forwarding, which aims reduce of while retaining a high performance rate by messages only nodes that have delivery probabilities. This paper provide an optimal protocol maximizes expected satisfying certain constant number forwardings per message. In our proposed (OPF) protocol, we use metric derived...

We extend dominating-set-based routing to networks with unidirectional links. Specifically, an efficient localized algorithm for determining a dominating and absorbant set of vertices (mobile hosts) is given this can be easily updated when the network topology changes dynamically. A host /spl nu/ called neighbor (absorbant neighbor) another u if there directed edge from (from nu/). subset every vertex not in has one subset. The derived exhibits good locality properties; that is, change node...

Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because short-lived wireless connectivity environment. To deal with this issue, researchers have investigated routing based on prediction future contacts, taking advantage nodes' mobility history. However, previous work focused whether two nodes would a contact, without considering time contact. This paper proposes predict and relay (PER), an efficient algorithm for DTNs, where determine probability...

An important problem in wireless networks, such as ad hoc and sensor is to select a few nodes form virtual backbone that supports routing other tasks area monitoring. Previous work this has focused on selecting small for high efficiency. We propose construct k-connected k-dominating set (k-CDS) balance efficiency fault tolerance. Three localized k-CDS construction protocols are proposed. The first protocol randomly selects with given probability p/sub k/, where k/ depends network condition...

The efficiency of sensor networks depends on the coverage monitoring area. Although in general a sufficient number sensors are used to ensure certain degree redundancy so that can rotate between active and sleep modes, good deployment is still necessary balance workload sensors. In network with locomotion facilities, move around self-deploy. movement-assisted deals moving from an initial unbalanced state balanced state. Therefore, various optimization problems be defined minimize different...

Abstract A taxonomy of broadcast protocols in mobile ad hoc networks (MANETs) is given where are classified into four groups: global, quasi‐global, quasi‐local, and local. The also divides based on the nature algorithms: probabilistic deterministic. locality maintenance plays an important role evaluating protocol. An objective designing a protocol to reduce redundancy save scarce resources such as energy bandwidth avoid storm problem. This should be achieved without introducing excessive...

The efficiency of sensor networks depends on the coverage monitoring area. Although, in general, a sufficient number sensors are used to ensure certain degree redundancy coverage, good deployment is still necessary balance workload sensors. In network with locomotion facilities, can move around self-deploy. movement-assisted deals moving from an initial unbalanced state balanced state. Therefore, various optimization problems be defined minimize different parameters, including total...

Multipoint relays (MPR) provide a localized and optimized way of broadcasting messages in mobile ad hoc network (MANET). Using partial 2-hop information, each node chooses small set forward neighbors to relay this covers the node's neighbor set. These selected nodes form connected dominating (CDS) ensure full coverage. Adjih et al. later proposed novel extension MPR construct CDS it is source-independent. In paper, we several extensions generate smaller using complete information cover We...

Content-based service, which dynamically routes and delivers events from sources to interested users, is extremely important network services. However, existing content-based protocols for static networks will incur unaffordable maintenance costs if they are applied directly the highly mobile environment that featured in disruption-tolerant (DTNs). In this paper, we propose a unique publish/subscribe scheme utilizes long-term social properties, observed many DTNs, facilitate services DTNs....

Semi-supervised clustering employs limited supervision in the form of labeled instances or pairwise instance constraints to aid unsupervised and often significantly improves performance. Despite vast amount expert knowledge spent on this problem, most existing work is not designed for handling high-dimensional sparse data. This paper thus fills crucial void by developing a Clustering method based spheRical K-mEans via fEature projectioN (SCREEN). Specifically, we formulate problem...

A user stores his personal files in a cloud, and retrieves them wherever whenever he wants. For the sake of protecting data privacy queries privacy, should store an encrypted form then sends keywords. However, simple encryption scheme may not work well when wants to retrieve only containing certain keywords using thin client. First, needs encrypt decrypt frequently, which depletes too much CPU capability memory power Second, service provider couldn't determine contain specified by if is...

Vortex-induced vibration (VIV) in oscillatory flow is experimentally investigated the ocean basin. The test flexible cylinder was forced to harmonically oscillate various combinations of amplitude and period with Keulegan-Carpenter (KC) number between 26 178 three different maximum reduced velocities, URmax=4, URmax=6.5, URmax=7.9 separately. VIV responses at cross-flow (CF) direction are using modal decomposition wavelet transformation. results show that quite from steady flow; features,...