250,637 Hits in 7.2 sec

Delay Efficient Data Gathering in Sensor Networks [chapter]

Xianjin Zhu, Bin Tang, Himanshu Gupta
2005 Lecture Notes in Computer Science  
We formally formulate this problem and propose optimal and near-optimal algorithms for different topologies.  ...  Most of current data gathering researches have been emphasized on issues such as energy efficiency and network lifetime maximization; and the technique of data aggregation is usually used to reduce the  ...  Algorithms for Special Topologies In this section, we address the delay efficient data gathering problem in some special topologies.  ... 
doi:10.1007/11599463_38 fatcat:klminhtzv5az5pisgbtpkpazca

Open Constraint Satisfaction [chapter]

Boi Faltings, Santiago Macho-Gonzalez
2002 Lecture Notes in Computer Science  
We examine how such a distributed setting affects changes the assumptions underlying most CSP algorithms, and show how solvers can be augmented with an information gathering component that allows openworld  ...  We report on experiments that show strong performance of such methods over others where gathering information and solving the CSP are separated.  ...  For the problem solver, we consider the two algorithms given earlier, namely Figure 3 plots the efficiency ratio against the average number of values available for each variable for a setting in which  ... 
doi:10.1007/3-540-46135-3_24 fatcat:gt3avtohpzcsjcquvkizqhxvi4

A New Data Gathering Scheme Based on Set Cover Algorithm for Mobile Sinks in WSNs

Yutaro Sasaki, Hidehisa Nakayama, Nirwan Ansari, Yoshiaki Nemoto, Nei Kato
2008 IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference  
In this paper, we focus on the fairness issue of data gathered by the mobile sinks while also considering the efficiency of data gathering.  ...  We propose a new mobility scheme based on a new clustering method and the Set Cover Algorithm to ensure that the mobile sinks can gather data from all of the nodes, and simulation results show that fairness  ...  ACKNOWLEDGEMENTS This work was supported through the Strategic International Cooperative Program, JST and NSF (under grant no. 0726549).  ... 
doi:10.1109/glocom.2008.ecp.145 dblp:conf/globecom/SasakiNANK08 fatcat:tgwbugtmkvgpzdfjm42c7tsrky

Coarse grained gather and scatter operations with applications

Laurence Boxer, Russ Miller
2004 Journal of Parallel and Distributed Computing  
We introduce asymptotically optimal algorithms for gathering and scattering a small-to-moderate sized set of data on a coarse grained parallel computer.  ...  We use these operations to obtain efficient to optimal solutions to several fundamental problems in image processing and string matching (exact or approximate) for coarse grained parallel computers.  ...  Acknowledgments We are grateful to the anonymous referees for helpful suggestions.  ... 
doi:10.1016/j.jpdc.2004.07.002 fatcat:fmlpbtsyljbvdfa2jiyvveanwe

EE-LEACH: development of energy-efficient LEACH Protocol for data gathering in WSN

Gopi Saminathan Arumugam, Thirumurugan Ponnuchamy
2015 EURASIP Journal on Wireless Communications and Networking  
In this paper, an energy-efficient LEACH (EE-LEACH) Protocol for data gathering is introduced.  ...  Hence, the network lifetime becomes the major criteria for effective design of the data gathering schemes in WSN.  ...  Data gathering is an efficient method for conserving energy in sensor networks. The major purpose of data gathering is to remove the redundant data and save transmission energy [1] [2] [3] .  ... 
doi:10.1186/s13638-015-0306-5 fatcat:4pptl25m45bk3hfws3hxbbwz5q

Constrained Flow Optimization with Applications to Data Gathering in Sensor Networks [chapter]

Bo Hong, Viktor K. Prasanna
2004 Lecture Notes in Computer Science  
Our approach provides a unified framework to study a variety of data gathering problems in sensor networks. The efficiency of the proposed method is illustrated through simulations.  ...  We develop a distributed and adaptive algorithm to optimize data gathering. This algorithm leads to a simple protocol that coordinates the sensor nodes in the system.  ...  Acknowledgment We thank the anonymous reviewer for pointing out earlier work on constrained flow problems.  ... 
doi:10.1007/978-3-540-27820-7_17 fatcat:47emy7mn7zfy3asolusuhfq4fq

Efficient energy utilization in wireless sensor networks: an algorithm

2019 3C Tecnología  
However, LEACH and PEGASIS do not provide optimal results for the energy consumption problem and are not feasible to implement.  ...  However, WSNs have limitations in the sense of processing power, life time and data gathering. Among the above said issues, energy efficiency is the main hindrance of WSN deployment.  ...  Sheikh for the follow discussion throughout the research work and thanks to Higher Education Commission Islamabad (HEC), Pakistan for their financial support to present the research work.  ... 
doi:10.17993/3ctecno.2019.specialissue.12 fatcat:a7nkjh6qmfekbjmgo7yhgspvt4

A Novel Scheme for WSAN Sink Mobility Based on Clustering and Set Packing Techniques

Hidehisa Nakayama, Zubair Md. Fadlullah, Nirwan Ansari, Nei Kato
2011 IEEE Transactions on Automatic Control  
In this paper, we propose a novel method, based on the set packing algorithm and traveling salesman problem, to accomplish this goal.  ...  As a consequence, more research effort is needed to improve the efficiency as well as fairness of data gathering.  ...  Similar to the set packing problem, it is also difficult to find the optimal solution for the traveling salesman problem.  ... 
doi:10.1109/tac.2011.2163872 fatcat:2ldssqi6xvhu3adhgsl7ajfgdu

Flow Based Efficient Data Gathering in Wireless Sensor Network Using Path-Constrained Mobile Sink [article]

Naween Kumar, Dinesh Dash
2018 arXiv   pre-print
We refer the problem as a Maximizing data gathering with minimum energy consumption (MDGMEC) problem. So far, existing works have heuristic algorithms for MDGMEC problem.  ...  Therefore, based on network flow optimization approach, we propose a deterministic algorithm called data gathering using mobile sink for path constraint environment (DGAMSPCE) to handle the MDGMEC problem  ...  Network Flow-Based Algorithm In this section, we describe two different data gathering algorithms for solving MDGMEC problem in two different data receiving models.  ... 
arXiv:1811.10032v1 fatcat:hkp63iqxj5a4dnk7m6xf6e7xgu

An Optimization Based Distributed Algorithm for Mobile Data Gathering in Wireless Sensor Networks

Miao Zhao, Yuanyuan Yang
2010 2010 Proceedings IEEE INFOCOM  
We provide an optimization based distributed algorithm for such data gathering in this paper.  ...  To efficiently solve the problem, we decompose it into two sets of subproblems and solve them in a distributed manner, which facilitates the scalable implementations.  ...  Finally, we provided numerical results to validate the efficiency of the proposed algorithm. (b) Five cases for z.  ... 
doi:10.1109/infcom.2010.5462184 dblp:conf/infocom/ZhaoY10 fatcat:76z6v742i5esvo6nl7xygbmmpq

Online Green Data Gathering from Geo-Distributed IoT Networks via LEO Satellites

Huawei Huang, Song Guo, Weifa Liang, Kun Wang
2018 2018 IEEE International Conference on Communications (ICC)  
To address this problem, we first formulate a novel optimization problem, and then propose an online algorithm for green datauploading in geo-distributed IoT networks.  ...  In this paper, we focus on data gathering for geodistributed Internet-of-Things (IoT) networks via LEO satellites.  ...  However, the problem is how to timely and efficiently gather the data cached in the distributed IoT gateways, and then forward the data to data centers for further analytics to enable quick decision making  ... 
doi:10.1109/icc.2018.8422522 dblp:conf/icc/HuangGL018 fatcat:5twkqgcssvhpjnt57wo6ydqube

An Efficient Data Gathering Protocol for Mobile Wireless Sensor Networks

2017 DEStech Transactions on Computer Science and Engineering  
Through the study found that the problem is NP-hard. We then propose a mobile wireless sensor network data gathering strategy based on ant colony algorithm.  ...  Simulation results show that compared with other data gathering methods, the proposed algorithm can produce balanced network energy, reduce the total energy consumption, improve network efficiency and  ...  ACO ALGORITHM FOR DATA GATHERING Ant colony algorithm is a heuristic algorithm, it is inspired by the foraging behavior of ant colony.  ... 
doi:10.12783/dtcse/cib2015/16154 fatcat:o2ahwr4u6vhxbipozemn34h5ri

Maximum Data Gathering in Networked Sensor Systems

Bo Hong, Viktor K. Prasanna
2005 International Journal of Distributed Sensor Networks  
We develop a distributed and adaptive algorithm to optimize data gathering. This algorithm leads to a simple protocol that coordinates the sensor nodes in the system.  ...  We study storeand-gather problems where data are locally stored at the sensors before the data gathering starts, and continuous sensing and gathering problems that model time critical applications.  ...  Many efficient algorithms have been developed ( [3] ) for the standard network flow problem.  ... 
doi:10.1080/15501320590901847 fatcat:gqz7mojltrcdbh773vdhee3oq4

Fast algorithm for multicast and data gathering in wireless networks

Michael Segal
2008 Information Processing Letters  
Yassour, Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas, in: Proc. ACM MOBIHOC, 2005] and a data gathering problem [K. Kalpakis, K. Dasgupta, P.  ...  We present an optimal generalized solution algorithm running in improved optimal O(|V | + |E|) time, where V stands for a set of nodes and E stands for a set of links in the network.  ...  In order to solve the data gathering problem, we define the weights of edges exactly in the same fashion as for the previously described multicast problem.  ... 
doi:10.1016/j.ipl.2007.12.007 fatcat:4gftxdul5favfa5nnndmu6lr4m

Power efficient gathering of correlated data: optimization, NP-completeness and heuristics

Răzvan Cristescu, Martin Vetterli
2003 ACM SIGMOBILE Mobile Computing and Communications Review  
We formulate an optimization problem for power efficient data gathering and show that the problem is NP-complete.  ...  We propose scalable, distributed and efficient heuristics for solving this problem and show by numerical simulations that the power consumption can be significantly improved over direct transmission or  ...  There is no polynomial time algorithm that solves the MINIMUM POWER GATHERING TREE problem, unless P=NP.  ... 
doi:10.1145/961268.961278 fatcat:bzzmsjn3mrbl3hb5kpbzjbtxta
« Previous Showing results 1 — 15 out of 250,637 results