the data aggregation is the method of combining the data streams coming from multiple nodes. The data aggregation methods reduce the routing decision cost implied by the routers or nodes in the path. The data aggregation can be proven to be efficient in the terms of energy efficiency or transmission efficiency. The proposed model is entirely based upon the data aggregation and data forwarding t...

The ability to discover services in Mobile Ad hoc Network (MANET) is a major prerequisite. Cluster basedcross layer intelligent service discovery for MANET (CBISD) is cluster based architecture, caching ofsemantic details of services and intelligent forwarding using network layer mechanisms. The cluster basedarchitecture using semantic knowledge provides scalability and accuracy. Also, the mini...

In this contribution we define a new class of non-linear integrals based on decomposition integrals. These integrals are motivated by greediness of many real-life situations. Another view on this new class of integrals is that it is a generalization of both the Shilkret and PAN integrals. Moreover, it can be seen as an iterated Shilkret integral. Also, an example in time-series analysis is prov...

With the advent of 5G and evolution Internet protocols, industrial applications are moving from vertical solutions to general purpose IP-based infrastructures that need meet deterministic Quality Service (QoS) requirements. The IETF DetNet working group aims at providing an answer this with support for (i) worst-case latency jitter, (ii) zero packet loss time-sensitive traffic. In paper we focu...

We consider the adaptive influence maximization problem: given a network and budget k, iteratively select k seeds in to maximize expected number of adopters. In full-adoption feedback model, after selecting each seed, seed-picker observes all resulting adoptions. myopic only whether neighbor chosen seed adopts. Motivated by extreme success greedy-based algorithms/heuristics for maximization, we...

In this letter, we discuss a forwarding method for maximizing network lifetime, which combines multi-hop forwarding and direct forwarding with a direct/multi-hop forwarding ratio of each sensor node. The direct forwarding ratio refers to the forwarding amount ratio of sensor nodes’ own data directly towards a sink node in one packet/instance data generation rate. We tackle an optimization probl...

in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...