Energy Efficient Coded Cooperative Data Exchange for Mobile Users
Download (125.41 kB)
-
Altmetric Citations
Etemadi Tajbakhsh , Shahriar; Sadeghi, Parastoo
Description
In this paper, we generalize the problem of network coded cooperative data exchange from a fixed broadcast topology to dynamic networks with mobile peers. In this problem a group of wireless clients are interested in obtaining a set of packets through cooperation, where each client initially holds a subset of packets. Unlike recent studies where cooperation is enabled through a fixed error free broadcast channel among fixed or stationary peers, we assume that peers move randomly between...[Show more]
dc.contributor.author | Etemadi Tajbakhsh , Shahriar | |
---|---|---|
dc.contributor.author | Sadeghi, Parastoo | |
dc.coverage.spatial | Toronto Canada | |
dc.date.accessioned | 2015-12-10T23:15:28Z | |
dc.date.created | September 11-14 2011 | |
dc.identifier.isbn | 9781457713484 | |
dc.identifier.uri | http://hdl.handle.net/1885/64671 | |
dc.description.abstract | In this paper, we generalize the problem of network coded cooperative data exchange from a fixed broadcast topology to dynamic networks with mobile peers. In this problem a group of wireless clients are interested in obtaining a set of packets through cooperation, where each client initially holds a subset of packets. Unlike recent studies where cooperation is enabled through a fixed error free broadcast channel among fixed or stationary peers, we assume that peers move randomly between transmission rounds, have a limited transmission range and suffer from packet erasures. In this case giving an exact solution to the problem of minimum number of transmissions is difficult, if not impossible. Therefore, we propose two different heuristic transmission strategies to decrease the total number of transmissions compared to uncoded transmissions. We compare the performance of these two strategies in terms of energy consumption (total number of transmissions) by analysis and simulations. In particular, we show that when packet delivery delay is not an issue, the total number of transmissions can be dramatically decreased at the price of a small overhead. | |
dc.publisher | IEEE Communications Society | |
dc.relation.ispartofseries | IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2011) | |
dc.source | Proceedings of IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2011) | |
dc.subject | Keywords: Analysis and simulation; Broadcast channels; Dynamic network; Energy efficient; Exact solution; Mobile users; Packet Delivery; Transmission ranges; Transmission strategies; Uncoded transmission; Wireless client; Electronic data interchange; Energy efficie | |
dc.title | Energy Efficient Coded Cooperative Data Exchange for Mobile Users | |
dc.type | Conference paper | |
local.description.notes | Imported from ARIES | |
local.description.refereed | Yes | |
dc.date.issued | 2011 | |
local.identifier.absfor | 080401 - Coding and Information Theory | |
local.identifier.absfor | 100510 - Wireless Communications | |
local.identifier.ariespublication | u4334215xPUB978 | |
local.type.status | Published Version | |
local.contributor.affiliation | Etemadi Tajbakhsh , Shahriar, College of Engineering and Computer Science, ANU | |
local.contributor.affiliation | Sadeghi, Parastoo, College of Engineering and Computer Science, ANU | |
local.description.embargo | 2037-12-31 | |
local.bibliographicCitation.startpage | 1531 | |
local.bibliographicCitation.lastpage | 1535 | |
local.identifier.doi | 10.1109/PIMRC.2011.6139760 | |
local.identifier.absseo | 890103 - Mobile Data Networks and Services | |
local.identifier.absseo | 970109 - Expanding Knowledge in Engineering | |
dc.date.updated | 2016-02-24T11:04:48Z | |
local.identifier.scopusID | 2-s2.0-84857573846 | |
Collections | ANU Research Publications |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Etemadi Tajbakhsh _Energy_Efficient_Coded_2011.pdf | 125.41 kB | Adobe PDF |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator