A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Filters
Approximately Optimal Wireless Broadcasting
[article]
2010
arXiv
pre-print
Preserved Fulltext
We study a wireless broadcast network, where a single source reliably communicates independent messages to multiple destinations, with the aid of relays and cooperation between destinations. ...
The wireless nature of the medium is captured by the broadcast nature of transmissions as well as the superposition of all transmit signals plus independent Gaussian noise at the received signal at any ...
Therefore, any scheme that is approximately optimal needs to perform coordinated transmission at the relays. ...
arXiv:1011.2835v1
fatcat:6xxtog34ejedte526jauiorjh4
Approximately Optimal Wireless Broadcasting
2012
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Index Terms-Broadcast network, broadcast-relay channels, network information theory, capacity, multi-user channels, wireless networks, Marton code. ...
We study a wireless broadcast network, where a single source reliably communicates independent messages to multiple destinations, with the potential aid of relays and cooperation between destinations. ...
An approximately optimal scheme for the unicast wireless relay network was given recently in [1] . The scheme consists of each relay node doing a quantize-map-forward operation. ...
doi:10.1109/tit.2012.2211566
fatcat:hh65xhplbjbs7kceef4biaj2ta
Multicast tree construction and flooding in wireless ad hoc networks
2000
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems - MSWIM '00
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. ...
This paper studies efficient routing mechanisms for multicast and broadcast in ad hoc wireless networks. ...
Since it is difficult to find an optimal broadcast tree, we should use an approximation algorithm. One of efficient approximation algorithms for the MCDS problem is Berman's algorithm [5] . ...
doi:10.1145/346855.346865
dblp:conf/mswim/LimK00
fatcat:e2nwlbjowvfx7jr67h52fkie2u
Characterizing achievable multicast rates in multi-hop wireless networks
2005
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we consider the multicast throughput optimization problem in multi-hop wireless networks. ...
different transmission power. (2) for the broadcast model, we show that the problem is NP-hard and it is not approximable to a factor better than 2; we then give a simple 2-approximation algorithm to ...
All that changes is the approximation factor.
THE UNSPLITTABLE BROADCAST MODEL In this section we show that the UBMTOP cannot be approximated to a factor better than 2 (50% of the optimal). ...
doi:10.1145/1062689.1062708
dblp:conf/mobihoc/BhatiaL05
fatcat:c4dyf6w475gvjkh2p23h5bvhta
Optimal transport on wireless networks
2007
Europhysics letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The variant we consider specifically accounts for the broadcast restrictions imposed by wireless communication by using a different betweenness measure. ...
We present a study of the application of a variant of a recently introduced heuristic algorithm for the optimization of transport routes on complex networks to the problem of finding the optimal routes ...
The effectiveness of transport optimization on wireless networks was compared to results obtained for ordinary networks with no broadcasting constraints. ...
doi:10.1209/0295-5075/79/48004
fatcat:75xihn3vkrbzfcyxxobqz5z3y4
Constructing minimum-energy broadcast trees in wireless ad hoc networks
2002
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Wireless network, approximate algorithm, power awareness, ad hoc networks, energy consumption optimization, broadcast and multicast algorithm. ...
The technique adopted in this paper is to reduce the minimum-energy broadcast (multicast) tree problem on a wireless ad hoc network to an optimization problem on an auxiliary weighted graph, and solve ...
the optimization problem on the auxiliary graph which in turn gives an approximate solution for the original problem. ...
doi:10.1145/513814.513815
fatcat:iljl2u5tgvfrzcjtsnlnx5o6fi
Constructing minimum-energy broadcast trees in wireless ad hoc networks
2002
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Wireless network, approximate algorithm, power awareness, ad hoc networks, energy consumption optimization, broadcast and multicast algorithm. ...
The technique adopted in this paper is to reduce the minimum-energy broadcast (multicast) tree problem on a wireless ad hoc network to an optimization problem on an auxiliary weighted graph, and solve ...
the optimization problem on the auxiliary graph which in turn gives an approximate solution for the original problem. ...
doi:10.1145/513800.513815
dblp:conf/mobihoc/Liang02
fatcat:4vfsok4wa5hitkebqrwrgnciii
Efficient placement of geographical data over broadcast channel for spatial range query under quadratic cost model
2003
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access - MobiDe '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Algorithm
Optimization Optimization The Approximation Algorithm The Approximation Algorithm The algorithm: • Starts with the root of the BDT and computes the costs of the two possible orientations ...
•The orientation tree determines an ordering sequence of all the nodes in a graph.
22
Optimization Optimization The Approximation Algorithm The Approximation Algorithm ...
access time both to the data channel and the index channel •Explore more ordering heuristics as well as exact and/or approximation optimization methods •Perform more experiments using both synthetic and ...
doi:10.1145/940923.940930
dblp:conf/mobide/ZhangG03
fatcat:i3x5vmaimffsdnlyxhewmigsxa
Energy Efficient Throughput Maximization for Wireless Networks Using Piece Wise Linear Approximation
2015
Indian Journal of Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The amount of power requirement is a main issue in wireless network nodes. We recommend a new piece-wise linear approximation to convert nonlinearities into linear restrictions. ...
In this paper both network throughput and energy requirement were optimized through a multi criteria framework which is optimized, i.e., by optimizing the network output by reducing the maximum power consumption ...
By "optimally", we refer to finding the minimum Kl such that the maximum approximation error of each line segment is no more than. ...
doi:10.17485/ijst/2015/v8i7/62866
fatcat:wugul3rx6ne4pgtyaomqphtcpm
Throughput-Optimal Broadcast in Wireless Networks with Dynamic Topology
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of throughput-optimal broadcast- ing in time-varying wireless networks, whose underlying topology is restricted to Directed Acyclic Graphs (DAG). ...
By stochastically stabilizing these virtual queues, we devise a throughput-optimal broadcast policy. ...
The policy π ′ is a throughput-optimal broadcast algorithm in a time-varying wireless DAG. ...
arXiv:1604.00576v1
fatcat:npisxbenubetvjqejblo23y6yu
Efficient multicast in hybrid wireless networks
2015
MILCOM 2015 - 2015 IEEE Military Communications Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Set problem (for broadcast links). ...
In this paper, the problem of resource-efficient multicast in hybrid wireless networks which include both point-to-point (cellular) and broadcast (MANET) links is considered. ...
To the best of our knowledge, we are the first to study multicast in hybrid networks that combine wireless broadcast capability and point-to-point wireless links.
C. ...
doi:10.1109/milcom.2015.7357460
dblp:conf/milcom/BasuCBGGJ15
fatcat:cjka4wk4evfm3ehc24owj443fi
Throughput-optimal broadcast in wireless networks with dynamic topology
2016
Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing - MobiHoc '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of throughput-optimal broadcasting in time-varying wireless networks, whose underlying topology is restricted to Directed Acyclic Graphs (DAG). ...
By stochastically stabilizing these virtual queues, we devise a throughput-optimal broadcast policy. ...
The policy π ′ is a throughput-optimal broadcast algorithm in a time-varying wireless DAG. ...
doi:10.1145/2942358.2942389
dblp:conf/mobihoc/SinhaTM16
fatcat:x2pxmzzsmrcktk74ba3ibqcho4
Throughput-Optimal Broadcast in Wireless Networks with Dynamic Topology
2018
IEEE Transactions on Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of throughput-optimal broadcasting in time-varying wireless networks, whose underlying topology is restricted to Directed Acyclic Graphs (DAG). ...
By stochastically stabilizing these virtual queues, we devise a throughput-optimal broadcast policy. ...
The policy π ′ is a throughput-optimal broadcast algorithm in a time-varying wireless DAG. ...
doi:10.1109/tmc.2018.2846246
fatcat:z46houiwzzdnnivtlhtny4vvle
A scalable, power-efficient broadcast algorithm for wireless networks
2006
Wireless networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a scalable, power-efficient broadcast algorithm for wireless ad hoc networks. ...
Scalability and power-efficiency are two of the most important design challenges in wireless ad hoc networks. ...
Essentially, the minimum-energy broadcast tree problem is reduced to an optimization problem on an auxiliary weighted graph, and the optimization problem is solved to give an approximate solution for the ...
doi:10.1007/s11276-006-6548-8
fatcat:cspiyjj2dvf2xkvhw3qsxczfvi
Protecting Multicast Sessions in Wireless Mesh Networks
2006
Local Computer Networks (LCN), Proceedings of the IEEE Conference on
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We introduce four heuristic algorithms to obtain approximate solutions that seek to minimize the number of required broadcast transmissions. ...
Utilizing the wireless broadcast advantage, a resilient forwarding mesh effectively establishes two node disjoint paths for each sourcedestination pair. ...
Several heuristics are proposed to obtain the approximate solution of the optimal resilient forwarding mesh in Section 5. ...
doi:10.1109/lcn.2006.322141
dblp:conf/lcn/ZhaoCGJ06
fatcat:6iixenaszfdhtmbndfefca5p5u
« Previous
Showing results 1 — 15 out of 41,549 results