752 Hits in 7.1 sec

Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode [chapter]

Pierre Fraigniaud
2001 Lecture Notes in Computer Science  
doi:10.1007/3-540-44676-1_37 fatcat:yyanjbmt6rbjlnpynndjsjrrjm

A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem

Guohui Yao, Daming Zhu, Hengwu Li, Shaohan Ma
2008 Discrete Mathematics  
Two consequences for directed acyclic graphs are: (1) the problem under the vertex-disjoint paths mode can be approximated within a factor of O(log n/ log OPT) of the optimum in O(mn log n)time; (2) the  ...  problem under the edge-disjoint paths mode can be approximated within a factor of O( * / log * ) of the optimum in O(mn log n)-time, where * is the minimum k such that there is a spanning tree of the  ...  There is an O(mn log n)-time, O(log n/ log OPT)-approximation algorithm for the minimum time broadcast problem under vertex-disjoint paths mode in directed acyclic graphs.  ... 
doi:10.1016/j.disc.2007.07.105 fatcat:i4b53y3uofcz5ldgyo55kkdlzy

A note on line broadcast in digraphs under the edge-disjoint paths mode

Pierre Fraigniaud
2004 Discrete Applied Mathematics  
It is known that unless NP ⊂ DTIME(n log log n ), no polynomial-time approximation algorithm for the multicast problem can have approximation ratio less than (log n) in n-node digraphs under the edge-disjoint  ...  paths mode of the line model.  ...  Additional supports from Carleton, Concordia, NATO, and the RNRT project ROM are acknowledged.  ... 
doi:10.1016/j.dam.2003.11.009 fatcat:cs2lilqmzffalflpyeiyrbwjvq

Page 5947 of Mathematical Reviews Vol. , Issue 2000h [page]

2000 Mathematical Reviews  
Specifically, he solves two open problems concerning, re- spectively, gossip complexity and broadcast complexity in particu- lar models with edge-disjoint paths modes.  ...  This is also the case for the quadratic shortest path problem and for the quadratic minimum cut problem considered by J. Y.  ... 

Algorithms for k-fault tolerant power assignments in wireless sensor networks

Li Liu, Lian Li, Bin Hu
2010 Science China Information Sciences  
Segal and Shpungin [13] developed a general approximation framework for various topology control problems under the k-fault resilience criterion in the plane.  ...  We propose three solutions for this problem: two centralized algorithms, a greedy algorithm and an O( n/ )-approximation algorithm, and an h-hop distributed and localized algorithm.  ...  Therefore multi-hop mode [2] is an efficient strategy for data delivery. Multi-hop mode requires the sensor nodes on the data routing path active in order to forward the message.  ... 
doi:10.1007/s11432-010-4101-y fatcat:3vuwyosopzcz3euohloh3t7rv4

Gossiping in chordal rings under the line model

Lali Barrière, Johanne Cohen, Margarida Mitjana
2001 Theoretical Computer Science  
Our gossip algorithms are based on the so-called 3-phase gossip method 15]. For that purpose, the Section 3 gives a decomposition of the chordal ring into disjoint cycles.  ...  mode routing protocols.  ...  The vertex-disjoint paths mode can be de ned analogously to the line model by replacing hypothesis (ii) by the following (iv) any two paths corresponding to simultaneous calls must be vertex-disjoint.  ... 
doi:10.1016/s0304-3975(00)00213-9 fatcat:irddrgcgqzdqrdv24boerlgd2u

Broadcasting in Multi-Radio Multi-Channel Wireless Networks using Simplicial Complexes

W. Ren, Q. Zhao, R. Ramanathan, J. Gao, A. Swami, A. Bar-Noy, M. Johnson, P. Basu
2011 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems  
The second algorithm converts it to a nodeweighted Steiner tree problem under the classic graph model. These two algorithms offer tradeoffs between performance and time-complexity.  ...  The first approximation algorithm converts the minimum spanning problem in simplical complexes to a minimum connected set cover problem.  ...  We thus develop polynomial-time approximation algorithms for the minimum spanning problem in simplicial complexes.  ... 
doi:10.1109/mass.2011.70 dblp:conf/mass/RenZRGSBJB11 fatcat:wkwrq4tn5baifn6zpdqrxoelwu

Deploying Sensor Networks With Guaranteed Fault Tolerance

J.L. Bredin, E.D. Demaine, M.T. Hajiaghayi, D. Rus
2010 IEEE/ACM Transactions on Networking  
We design and analyze the first algorithms that place an almost-minimum number of additional sensors to augment an existing network into a k-connected network, for any desired parameter k.  ...  Specifically, we prove that the number of additional sensors is within a constant factor of the absolute minimum, for any fixed k.  ...  The algorithm is relatively simple, building on approximation algorithms for minimum-weight -vertex-connected subgraph.  ... 
doi:10.1109/tnet.2009.2024941 fatcat:imsothprlbfkrgcnvxwry3emnq

Broadcast and gossip in line-communication mode

C. Laforest
1997 Discrete Applied Mathematics  
Farley, that gives the exact broadcast time, [log, nl steps, in any connected network of order n.  ...  In the second part we construct gossip algorithms in any tree network and we prove that they are optimal or asymptotically optimal.  ...  Acknowledgements I want to thank the anonymous referees for their comments and Dominique Sotteau for her help during this work.  ... 
doi:10.1016/s0166-218x(97)00054-1 fatcat:ri6jyao62jfxnk3xmahgenzrze

Energy-aware distributed routing algorithm to tolerate network failure in wireless sensor networks

Prasenjit Chanak, Indrajit Banerjee, R. Simon Sherratt
2017 Ad hoc networks  
We then present a k-Vertex Disjoint Path Routing (kVDPR) algorithm where each cluster head finds k-vertex disjoint paths to the base station and relays their aggregate data to the base station.  ...  During the clustering phase, each sensor node finds k-vertex disjoint paths to cluster heads depending on the energy level of its neighbor sensor nodes.  ...  Hence, k-vertex disjoint paths are preserved for a sufficient amount of time. 2.  ... 
doi:10.1016/j.adhoc.2016.12.006 fatcat:4muj63bqfzc5dfoik4fbyupchy

Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes

Wei Ren, Qing Zhao, Ram Ramanathan, Jianhang Gao, Ananthram Swami, Amotz Bar-Noy, Matthew P. Johnson, Prithwish Basu
2012 Wireless networks  
The second algorithm converts it to a node-weighted Steiner tree problem under the classic graph model. These two algorithms offer tradeoffs between performance and time-complexity.  ...  The first approximation algorithm converts the minimum spanning problem in simplical complexes to a minimum connected set cover (MCSC) problem.  ...  Acknowledgments This work was supported by the Army Research Laboratory NS-CTA under Grant W911NF-09-2-0053.  ... 
doi:10.1007/s11276-012-0522-4 fatcat:cyndqosy2jhehiswps5bpjj3jm

Energy-Efficient Broadcast Scheduling with Minimum Latency for Low-Duty-Cycle Wireless Sensor Networks

Lijie Xu, Jiannong Cao, Shan Lin, Haipeng Dai, Xiaobing Wu, Guihai Chen
2013 2013 IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems  
We show that to find the broadcasting schedule with minimal latency and optimized total energy consumption is NP-hard, and then design an approximation algorithm that can guarantee the optimality of broadcasting  ...  latency and achieve a polylogarithmic approximation ratio for total energy consumption.  ...  ACKNOWLEDGMENT The work is partly supported by China 973 project (2012CB316200) and China NSF grants (61133006, 61021062, 60903179).  ... 
doi:10.1109/mass.2013.47 dblp:conf/mass/XuCLDWC13 fatcat:hdthkhuhwvavva242dji2hlg6m

Algorithms for Wireless Sensor Networks

Sartaj Sahni, Xiaochun Xu
2005 International Journal of Distributed Sensor Networks  
A distributed potential-field-based algorithm to self deploy mobile sensors under the stated assumptions is developed in [24] and a greedy and incremental self-deployment algorithm is developed in [23]  ...  This paper reviews some of the recent advances in the development of algorithms for wireless sensor networks. We focus on sensor deployment and coverage, routing and sensor fusion.  ...  is the time it takes a sensor to deplete its energy when in the awake mode.  ... 
doi:10.1080/15501320490886323 fatcat:7whjawenwnfmtdiqat6efoyzma

Page 554 of Mathematical Reviews Vol. , Issue 2003A [page]

2003 Mathematical Reviews  
, Approximation algorithms for minimum-time broadcast under the vertex-disjoint paths mode (440-451); Andrea E.  ...  , A fast algorithm for approximating the detour of a polygonal chain (321-332); Stephan Eidenbenz and Peter Wid- mayer, An approximation algorithm for minimum convex cover with logarithmic performance  ... 

Optimal Control for Unmanned Systems with One-way Broadcast Communication [article]

Chao Ge, Ge Chen
2022 arXiv   pre-print
We propose an online optimal control algorithm for USs based on a one-way broadcast communication mode under the assumption of a poor communication environment, mobile targets, radars (or sonar), and missiles  ...  Traditional path finding algorithms are hard to adequately obtain optimal paths in real-time under fast time-varying and poor communication environments.  ...  XDA27000000, and by the National Natural Science Foundation of China under grants 12288201, 12071465, and 72192804.  ... 
arXiv:2206.01448v1 fatcat:vkw64xpwczhu7hrpevwj6y3yy4
« Previous Showing results 1 — 15 out of 752 results