Filters








16,263 Hits in 7.1 sec

HARDNESS AND APPROXIMATION OF GATHERING IN STATIC RADIO NETWORKS

JEAN-CLAUDE BERMOND, JEROME GALTIER, RALF KLASING, NELSON MORALES, STEPHANE PERENNES
2006 Parallel Processing Letters  
In this paper, we address the problem of gathering information in a specific node (or sink ) of a radio network, where interference constraints are present.  ...  We also show that the problem of finding an optimal strategy for gathering is NP-hard, for any values of d I and d T .  ...  Introduction Background and motivation In radio networks a set of radio devices communicate by using radio transmissions which, depending on the technology used, are subject to different interference  ... 
doi:10.1142/s0129626406002551 fatcat:g543xgbyxbhunmpdpmxu65oy3q

Hardness and approximation of Gathering in static radio networks

J.-C. Bermond, N. Morales, S. Perennes, J. Galtier, R. Klasing
Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)  
In this paper, we address the problem of gathering information in a specific node (or sink ) of a radio network, where interference constraints are present.  ...  We also show that the problem of finding an optimal strategy for gathering is NP-hard, for any values of d I and d T .  ...  Introduction Background and motivation In radio networks a set of radio devices communicate by using radio transmissions which, depending on the technology used, are subject to different interference  ... 
doi:10.1109/percomw.2006.62 dblp:conf/percom/BermondMPGK06 fatcat:y73vnglpqbex5bfafjxqfqdgrq

An approximation algorithm for the wireless gathering problem

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie
2008 Operations Research Letters  
The Wireless Gathering Problem is to find a schedule for data gathering in a wireless static network.  ...  We also formulate some challenging open problems concerning complexity and approximability for variations of the problem. ⋆  ...  The Wireless Gathering Problem is the following: given is a static wireless network which consists of several stations (nodes) and one base station (the sink).  ... 
doi:10.1016/j.orl.2008.06.001 fatcat:arta4r3iondtxej3ffmfq2l2fi

An Approximation Algorithm for the Wireless Gathering Problem [chapter]

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie
2006 Lecture Notes in Computer Science  
The Wireless Gathering Problem is to find a schedule for data gathering in a wireless static network.  ...  We also formulate some challenging open problems concerning complexity and approximability for variations of the problem. ⋆  ...  The Wireless Gathering Problem is the following: given is a static wireless network which consists of several stations (nodes) and one base station (the sink).  ... 
doi:10.1007/11785293_31 fatcat:sk2lgf5fi5csfcfy5tahwtrv4a

Cooperative data collection in ad hoc networks

Liron Levin, Michael Segal, Hanan Shpungin
2012 Wireless networks  
We show that the problem is NP-hard for two network types and develop various approximation schemes. Our results are validated through extensive simulations.  ...  This paper studies the problem of data gathering in multi-hop wireless ad hoc networks.  ...  Acknowledgments The authors would like to thank Refael Hassin and the anonymous reviewers for their valuable suggestions and helpful comments.  ... 
doi:10.1007/s11276-012-0456-x fatcat:zr65rbjcp5eophvzkvx3t3zqt4

On the complexity of bandwidth allocation in radio networks

Ralf Klasing, Nelson Morales, Stéphane Pérennes
2008 Theoretical Computer Science  
From this relation, we deduce that in general, round weighting is hard to approximate within n 1−ε (n being the size of the radio network).  ...  We define and study an optimization problem that is motivated by bandwidth allocation in radio networks.  ...  Acknowledgements We would like to thank Jérome Galtier and Alexandre Laugier for introducing us to the Internet in the villages problem.  ... 
doi:10.1016/j.tcs.2008.06.048 fatcat:ey2q5s4xtrcvjmuk6u5l73gzta

Coding, Scheduling, and Cooperation in Wireless Sensor Networks [article]

Samar Agnihotri, Pavan Nuggehalli
2007 arXiv   pre-print
We are interested in maximizing the lifetime of this network. Even though the setting of our problem is very simple, it turns out that the solution is far from easy.  ...  The complexity arises from several competing system-level opportunities available to reduce the energy consumed in radio transmission. First, sensor data is spatially and temporally correlated.  ...  CONCLUSIONS AND FUTURE WORK In this paper, we have considered the problem of maximizing the lifetime of a data gathering wireless network.  ... 
arXiv:cs/0701051v1 fatcat:gwqn75ioefdijj2bopcsz5efsi

Adumbrate: Motion Detection with Unreliable Range Data

Tom Parker, Koen Langendoen
2007 2007 Fourth International Conference on Networked Sensing Systems  
However, many of these applications require some level of motion detection, if only to notice the cases when a network ceases to be statically located and starts to have moving nodes.  ...  Our methods are intended to work in co-operation with existing static network localisation algorithms.  ...  Getting rid of the errors in range measurements is hard to do, but that is the price of gathering data from the real world.  ... 
doi:10.1109/inss.2007.4297423 fatcat:ldd4hrgpgzayxa55dk3vlxysem

Minimizing flow time in the wireless gathering problem

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie
2011 ACM Transactions on Algorithms  
We address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet.  ...  We prove that no polynomial time algorithm for this problem can have approximation ratio less than Ω(m 1/3 ) when m packets have to be transmitted, unless P = NP.  ...  Acknowledgments Research supported by EU FET Integrated Project AEOLUS IST-15964, by FET EC 6th FP Research Project ARRIVAL FP6-021235-2, by the Dutch BSIK-BRICKS project, and by MIUR-FIRB Italy-Israel  ... 
doi:10.1145/1978782.1978788 fatcat:nu63ew3q5nfo5hrpuh7o2dwfca

Minimizing Flow Time in the Wireless Gathering Problem [article]

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie
2008 arXiv   pre-print
We address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet.  ...  We prove that no polynomial time algorithm for this problem can have approximation ratio less than Ω(m^1/3) when m packets have to be transmitted, unless P = NP.  ...  Acknowledgments Research supported by EU FET Integrated Project AEOLUS IST-15964, by FET EC 6th FP Research Project ARRIVAL FP6-021235-2, by the Dutch BSIK-BRICKS project, and by MIUR-FIRB Italy-Israel  ... 
arXiv:0802.2836v1 fatcat:qycn4mfeerg4dc2zboikjfr424

A Study on Underwater based Wireless Sensor Networks

Aiman J.Albarakati
2015 International Journal of Computer Applications  
Furthermore we also discussed the vital defies, facets of Underwater sensors comprising their protocols and architectures and future research prospects.  ...  A lot of researchers lately have attained the attention of Wireless Sensor Networks.  ...  INTRODUCTION Approximately 70% of our earth/world is covered by water.  ... 
doi:10.5120/21118-3971 fatcat:3k2x7kipaneehowbejghvxlnni

Intelligent fluid infrastructure for embedded networks

Aman Kansal, Arun A. Somasundara, David D. Jea, Mani B. Srivastava, Deborah Estrin
2004 Proceedings of the 2nd international conference on Mobile systems, applications, and services - MobiSYS '04  
We first show why our approach is advantageous in terms of network lifetime and data fidelity. Second, we present adaptive algorithms that are used to control mobility.  ...  Our approach yields significant advantages for energy constrained systems, sparsely deployed networks, delay tolerant networks, and in security sensitive situations.  ...  ACKNOWLEDGEMENTS This paper is based on research supported in part by the Intel Corporation, by the NSF Center on Embedded Networked Sensing and by the Office of Naval Research.  ... 
doi:10.1145/990064.990080 dblp:conf/mobisys/KansalSJSE04 fatcat:qy7dm4ef35ejxpkrpyk76vjtaa

Data gathering tours in sensor networks

Alexandra Meliou, David Chu, Joseph Hellerstein, Carlos Guestrin, Wei Hong
2006 Proceedings of the fifth international conference on Information processing in sensor networks - IPSN '06  
A basic task in sensor networks is to interactively gather data from a subset of the sensor nodes.  ...  When data needs to be gathered from a selected set of nodes in the network, existing communication schemes often behave poorly.  ...  Acknowledgments: We would like to thank Andreas Krause for the data used in Figure 1 . This work was supported by NSF Grants 0326472 and 0205647, and a gift from Microsoft Corporation.  ... 
doi:10.1145/1127777.1127788 dblp:conf/ipsn/MeliouCHGH06 fatcat:d7lmr6az5zfpjba4nr4nsacynq

Data gathering tours in sensor networks

A. Meliou, D. Chu, C. Guestrin, J. Hellerstein, W. Hong
2006 2006 5th International Conference on Information Processing in Sensor Networks  
A basic task in sensor networks is to interactively gather data from a subset of the sensor nodes.  ...  When data needs to be gathered from a selected set of nodes in the network, existing communication schemes often behave poorly.  ...  Acknowledgments: We would like to thank Andreas Krause for the data used in Figure 1 . This work was supported by NSF Grants 0326472 and 0205647, and a gift from Microsoft Corporation.  ... 
doi:10.1109/ipsn.2006.244055 fatcat:gnqbvkhlrrcarfxgayxmj6oo2y

Network interrupts

James Brown, Joe Finney, Christos Efstratiou, Ben Green, Nigel Davies, Mark Lowton, Gerd Kortuem
2007 Proceedings of the second workshop on Challenged networks CHANTS - CHANTS '07  
However, in recent years, a growing number of delay sensitive and interactive applications have been discovered for such networks, that are no longer purely limited to the data gathering model of sensor  ...  The importance in maintaining energy efficient communications in low power networks such as sensor and actuator networks is well understood.  ...  In order to monitor the workers' exposure to HAV and avoid violation of related H&S regulations, we designed, implemented and field Permission to make digital or hard copies of all or part of this work  ... 
doi:10.1145/1287791.1287802 dblp:conf/mobicom/BrownFEGDLK07 fatcat:uga3kub52bcfvmokzxa45bsrii
« Previous Showing results 1 — 15 out of 16,263 results