Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks

IF 1.3 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS Distributed Computing Pub Date : 2021-04-19 DOI:10.1007/s00446-022-00426-w
Varsha Dani, Aayush Gupta, Thomas P. Hayes, S. Pettie
{"title":"Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks","authors":"Varsha Dani, Aayush Gupta, Thomas P. Hayes, S. Pettie","doi":"10.1007/s00446-022-00426-w","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"36 1","pages":"373 - 384"},"PeriodicalIF":1.3000,"publicationDate":"2021-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Distributed Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00446-022-00426-w","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 9

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
醒醒,加入我!无线网络中最大匹配的节能算法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Distributed Computing
Distributed Computing 工程技术-计算机:理论方法
CiteScore
3.20
自引率
0.00%
发文量
24
审稿时长
>12 weeks
期刊介绍: The international journal Distributed Computing provides a forum for original and significant contributions to the theory, design, specification and implementation of distributed systems. Topics covered by the journal include but are not limited to: design and analysis of distributed algorithms; multiprocessor and multi-core architectures and algorithms; synchronization protocols and concurrent programming; distributed operating systems and middleware; fault-tolerance, reliability and availability; architectures and protocols for communication networks and peer-to-peer systems; security in distributed computing, cryptographic protocols; mobile, sensor, and ad hoc networks; internet applications; concurrency theory; specification, semantics, verification, and testing of distributed systems. In general, only original papers will be considered. By virtue of submitting a manuscript to the journal, the authors attest that it has not been published or submitted simultaneously for publication elsewhere. However, papers previously presented in conference proceedings may be submitted in enhanced form. If a paper has appeared previously, in any form, the authors must clearly indicate this and provide an account of the differences between the previously appeared form and the submission.
期刊最新文献
A wait-free queue with polylogarithmic step complexity Deterministic near-optimal distributed listing of cliques On implementing SWMR registers from SWSR registers in systems with Byzantine failures Developing Irelands first National Student Mental Health and Suicide Prevention Framework for Higher Education. Asymmetric distributed trust
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1