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.
Filters
Sharing the cost of multicast transmissions in wireless networks
2006
Theoretical Computer Science
Preserved Fulltext
A crucial issue in non-cooperative wireless networks is that of sharing the cost of multicast transmissions to different users residing at the stations of the network. ...
In this paper, we first investigate cost sharing strategyproof mechanisms for symmetric wireless networks, in which the powers necessary for exchanging messages between stations may be arbitrary and we ...
Cost sharing mechanisms for wired networks The problem of sharing the cost of multicast transmissions in standard networks, where the cost is the total cost of the links of a multicast subtree connecting ...
doi:10.1016/j.tcs.2006.09.004
fatcat:dn3yqiglfrdxphsxennye2npxa
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.
The issue of protecting multicast sessions in wireless mesh networks is a new problem to the best of our knowledge. ...
In this paper, we propose a resilient forwarding mesh approach for protecting a multicast session in wireless mesh networks. ...
In [12] , the authors formulated the minimal cost multicast tree problem in terms of minimizing the number of broadcast transmissions in single rate scenario. ...
doi:10.1109/lcn.2006.322141
dblp:conf/lcn/ZhaoCGJ06
fatcat:6iixenaszfdhtmbndfefca5p5u
Robust provisioning of multicast sessions in cognitive radio networks
2014
2014 International Wireless Communications and Mobile Computing Conference (IWCMC)
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.
the number of sessions that can be accommodated in the network and minimizing the cost of the multicast sessions. ...
Characteristics and Challenges of Cognitive Radio Networks In traditional wireless networks, all nodes share the same set of available channels. ...
doi:10.1109/iwcmc.2014.6906393
dblp:conf/iwcmc/AlmasoudK14
fatcat:al73fo6y7fbzzmhynuegijnrh4
Group Strategyproof Multicast in Wireless Networks
2011
IEEE Transactions on Parallel and Distributed Systems
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 2011; you can also visit the original URL.
The file type is application/pdf.
We study the dissemination of common information from a source to multiple nodes within a multihop wireless network, where nodes are equipped with uniform omni-directional antennas and have a fixed cost ...
In particular, the fraction of optimal routing cost that can be recovered through node charges cannot be significantly higher than 1 2 . ...
COMPUTING CROSS-MONOTONIC COST-
SHARES In this section, we will design an algorithm for computing cost-shares that are cross-monotonic for multicast transmission in wireless ad hoc networks with arbitrary ...
doi:10.1109/tpds.2010.184
fatcat:wycoi3sdendzli52cyoptem4re
On achieving group strategyproof information dissemination in wireless networks
2009
2009 International Conference on Game Theory for 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 2012; you can also visit the original URL.
The file type is application/pdf.
We study the dissemination of common information from a source to multiple peers within a multihop wireless network, where peers are equipped with uniform omni-directional antennas and have a fixed cost ...
In particular, the fraction of optimal routing cost that can be recovered through peer charges cannot be significantly higher than 1 2 . ...
A 1 8 -budget-balanced scheme for uniform cost networks In this section, we will design an algorithm for computing cost-shares that are cross-monotonic for multicast transmission in a wireless ad hoc network ...
doi:10.1109/gamenets.2009.5137406
dblp:conf/gamenets/GopinathanLL09
fatcat:izbgn6p6ireolanhocrd4lff5e
On multicast routing in wireless mesh networks
2008
Computer Communications
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 2014; you can also visit the original URL.
The file type is application/pdf.
In wireless multi-hop networks, the tree cost can be redefined to exploit the wireless broadcast advantage: a minimum cost tree is one which connects sources and receivers by issuing a minimum number of ...
The SPT algorithms minimize the distance (or cost) from the sender to each receiver, while the MCT algorithms such as minimum Steiner trees (MSTs) minimize the overall edge cost of the multicast tree. ...
Acknowledgements This work is supported in part by a Discovery Grant from the Natural Sciences and Engineering Research Council of Canada (NSERC). ...
doi:10.1016/j.comcom.2008.01.022
fatcat:ma656qeikzh47pacxtk3vu7j4y
Minimum Energy Multicast Routing in Mobile Ad-hoc Network
2013
International Journal of Computer Applications
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.
As the nodes are highly dynamic, maintaining routes become a greater challenge. Multicasting is one of the fundamental mechanism, which can be typically implemented by creating a multicast tree. ...
An important issue in such a network is to minimize the total energy consumption for each operation. In MANET each node acts as a store and forward station for routing packets. ...
It can reduce the cost of communication and improve the efficiency of the wireless channel when sending multiple copies of the same data by exploiting the inherent broadcasting properties of wireless transmission ...
doi:10.5120/10781-5762
fatcat:kskmeer24rcotbd4o4dmmf57du
Energy Efficient Multicast in Ad Hoc Networks
[chapter]
2002
Electrical Engineering Handbook
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.
The first group of energy efficient multicast protocols is based on the assumption that the transmission power is controllable. ...
Under this assumption, the problem of finding a tree with the least consumed power becomes a conventional optimization problem on a graph where the weighted link cost corresponds to the transmission power ...
Unlike Prim's algorithm, however, BIP does not necessarily provide minimum-cost trees for wireless networks. ...
doi:10.1201/9781420040401.ch23
fatcat:3xyrxkv6rjcdvgwrgqg3z37qhe
Resource efficient multicast for 3G UMTS wireless networks
2003
2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484)
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 their proposed approach, multicast messages are sent as multiple unicast messages to all active multicast group members in the UMTS network. ...
We also proposed the use common multicast channels in the efficient utilization of radio resources. ...
The analysis of the resource efficient multicast scheme shows that it is efficient in terms of packet delay, throughput, and multicast transmission cost. ...
doi:10.1109/vetecf.2003.1285946
fatcat:3ru7oyioabd7boviwbitvirjuq
Opportunistic Overlay Multicast in Wireless Networks
2010
2010 IEEE Global Telecommunications Conference GLOBECOM 2010
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.
To adopt OR in wireless multicast, the main challenge is to efficiently share opportunistic relay paths between multiple receivers. ...
MSTOR can be easily deployed for multicast in multi-hop wireless networks. ...
The cost of the virtual link between i and j is the OR distance L ij in the underlying wireless network. ...
doi:10.1109/glocom.2010.5683489
dblp:conf/globecom/LeL10
fatcat:sye5ukhudfanfnkk64f5bs43zq
Multicast Routing Algorithm of Network Lifetime
2016
International Journal of Future Generation Communication and Networking
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.
Suppose one wireless Ad Hoc network with N nodes. Each node has unique identifier i, 1 iN and network connectivity depends on the transmission power of each node. ...
The genetic operators of this algorithm reduce the transmission cost and energy consumption of multicast trees, and mutation operator prolongs the network lifetime, thus accelerating the convergence speed ...
multicast tree: in the meantime of multicast tasks being completed, transmission cost reduced and remaining energy of multicast tree' bottleneck nodes growing, hence the network lifetime is prolonged; ...
doi:10.14257/ijfgcn.2016.9.2.03
fatcat:wbmrqhaq5rakzegznrjouwj43e
A Scheme for Probabilistically Reliable Multicast Routing in Wireless Mesh Networks
2007
32nd IEEE Conference on Local Computer Networks (LCN 2007)
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.
[3] study multicast tree in terms of minimizing the number of broadcast transmissions in WMNs utilizing the wireless multicast/broadcast advantage [4] . Chou et al. ...
Adding broadcast transmissions in one multicast session will increase the overhead of the multicast so that it would reduce the throughput of the whole network. ...
doi:10.1109/lcn.2007.92
dblp:conf/lcn/ZhaoCGJ07
fatcat:g5c3vdktangrnlv43od32mqb4i
Efficient Opportunistic Multicast via Tree Backbone for Wireless Mesh Networks
2011
2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems
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 2012; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a new opportunistic multicast protocol to improve multicast throughput in Wireless Mesh Networks (WMN). ...
It builds upon opportunistic routing (OR) strategies that have been designed to improve unicast throughput in wireless networks. The key concept in our multicast protocol is a tree backbone. ...
For example, building a shared tree is a common way in traditional multicast protocols, where transmissions to different destinations may share some hops in the tree to minimize the bandwidth cost. ...
doi:10.1109/mass.2011.63
dblp:conf/mass/ZengHMXT11
fatcat:25jmhz25fnb75hhsnucnfzhj4y
A QoS-oriented distributed routing protocol for hybrid wireless networks
IJARCCE - Computer and Communication Engineering
2015
IJARCCE
IJARCCE - Computer and Communication Engineering
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.
With the increasing level of wireless communication in today's environment, people often required QOS for sharing their data between the nodes. ...
The goal of this paper is to providing efficient dynamic routing management to deal the challenges of data transmission and data streaming in hybrid mobile environments. ...
INTRODUCTION Hybrid Wireless Communication (HWC) is one of the popular among the people for sharing the resources among the networks. ...
doi:10.17148/ijarcce.2015.4112
fatcat:wxbwmjaihbempevza7xon45dyy
Exploring the gain of Opportunistic Routing in wireless Multicast
2014
2014 International Conference on Advanced Technologies for Communications (ATC 2014)
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 explore the gain of adopting OR in wireless multicast. The main challenge is to efficiently share opportunistic relay paths between multiple receivers. ...
Opportunistic Routing (OR) has recently been proposed to improve the efficiency of unicast in multi-hop wireless networks. ...
The cost of the virtual link between i and j is the shortest path OR distance L ij in the underlying wireless network. ...
doi:10.1109/atc.2014.7043441
fatcat:zip2l6azcngf3jfjzk3zmagjku
« Previous
Showing results 1 — 15 out of 10,774 results