2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)最新文献

筛选
英文 中文
A Novel Multi-Radio Rendezvous Scheme for Cognitive Radio Networks 一种新的认知无线网络多无线电会合方案
2019 12th IFIP Wireless and Mobile Networking Conference (WMNC) Pub Date : 2019-09-01 DOI: 10.23919/WMNC.2019.8881570
Erik Ortiz Guerra, Julio César Pérez Carcía, V. A. Reguera, T. Nguyen, G. Pujolle
{"title":"A Novel Multi-Radio Rendezvous Scheme for Cognitive Radio Networks","authors":"Erik Ortiz Guerra, Julio César Pérez Carcía, V. A. Reguera, T. Nguyen, G. Pujolle","doi":"10.23919/WMNC.2019.8881570","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881570","url":null,"abstract":"Cognitive radio is a promising technology to efficiently use spectrum resources. In this context, blind rendezvous techniques are essential to ensure that cognitive users can establish a communication link. In this paper, a new channel hopping rendezvous algorithm intended for cognitive users equipped with multiple radios is presented. The proposed Fast Rendezvous Multi-Radio (FRMR) scheme includes a Practical Sequence Improvement (PSI) to maximize the visited channels at each time slot. For the proposed FRMR-PSI analytic models are derived to compute the expected and maximum time to rendezvous. Simulations show good match with theoretical results. The proposed rendezvous scheme outperforms a well known counterpart, specifically in scenarios with few common available channels.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123996859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Redesigning Resource Management in Wireless Networks based on Games in Satisfaction Form 基于满足形式游戏的无线网络资源管理再设计
2019 12th IFIP Wireless and Mobile Networking Conference (WMNC) Pub Date : 2019-09-01 DOI: 10.23919/WMNC.2019.8881826
Panagiotis Promponas, P. Apostolopoulos, Eirini-Eleni Tsiropoulou, S. Papavassiliou
{"title":"Redesigning Resource Management in Wireless Networks based on Games in Satisfaction Form","authors":"Panagiotis Promponas, P. Apostolopoulos, Eirini-Eleni Tsiropoulou, S. Papavassiliou","doi":"10.23919/WMNC.2019.8881826","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881826","url":null,"abstract":"The rise in popularity of smartphones, along with the need for personalized services with different Quality of Service (QoS) requirements, has created an increased interest for energy-efficient resource management frameworks in wireless networks, where user actions and decisions are interdependent. Our focus is placed on the transformation and treatment of the uplink power control problem under the perspective of game theory in satisfaction form. The novel concept of Minimum Efficient Satisfaction Equilibrium (MESE) is introduced and its properties are investigated. Considering that each user is associated with a cost function with respect to its actions, the MESE point defines each user’s transmission power that satisfies its QoS prerequisites with the lowest cost. We prove that at the MESE point the system achieves the lowest possible cumulative cost, while each user individually is penalized with the minimum cost compared to the corresponding cost of any Efficient Satisfaction Equilibrium (ESE) point. The existence, uniqueness and benefits of the MESE are studied, and a distributed low complexity algorithm based on the Best Response Dynamics that converges to the MESE point is proposed. Through modeling and simulation, the performance of the proposed novel resource management framework is evaluated, and its benefits are revealed.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125884979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
On the performance evaluation of LoRaWAN under Jamming 干扰下LoRaWAN的性能评价
2019 12th IFIP Wireless and Mobile Networking Conference (WMNC) Pub Date : 2019-09-01 DOI: 10.23919/WMNC.2019.8881830
Ivan Martinez, P. Tanguy, F. Nouvel
{"title":"On the performance evaluation of LoRaWAN under Jamming","authors":"Ivan Martinez, P. Tanguy, F. Nouvel","doi":"10.23919/WMNC.2019.8881830","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881830","url":null,"abstract":"In this paper we evaluate the performance of the LoRaWAN protocol under channel-aware and channel-oblivious jamming. We obtained three key results, namely: (i) LoRaWAN networks are particularly vulnerable to jamming attacks, we have shown that the network throughput of the simulation scenarios chosen can be decreased by ~ 56% when 25 jammers send unauthenticated packets permanently in the network, (ii) the gateway’s performance is dramatically affected as a consequence of jammers. Our results suggest that the resources used to process packets coming from jammers could be 100 times higher than that of regular end-devices, and (iii) the network performance impact of jammers is highly correlated with the jammer class. We have shown that channel-oblivious jammers impacts the network performance widely, while channel-aware jammers impact the network locally. For this, we propose an ns-3 LoRaWAN module extension incorporating jamming attacks.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132895464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Asymptotically Efficient Backlog Estimators for Frame Aloha 框架Aloha的渐近有效积压估计
2019 12th IFIP Wireless and Mobile Networking Conference (WMNC) Pub Date : 2019-09-01 DOI: 10.23919/WMNC.2019.8881810
L. Barletta, F. Borgonovo
{"title":"Asymptotically Efficient Backlog Estimators for Frame Aloha","authors":"L. Barletta, F. Borgonovo","doi":"10.23919/WMNC.2019.8881810","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881810","url":null,"abstract":"The dynamic frame Aloha protocol has been shown to reach efficiency e−1 when the number N of tags to be identified is known and approaches infinity. Results available in literature do not achieve efficiency e−1 for large N when N is unknown. In this paper we analytically show that the best tag estimation procedure let the protocol reach efficiency e−1. However, the convergence to this result shows an oscillatory behavior that on average goes like 1/ ln N. The oscillation can be reduced at will at the expenses of the convergence speed. A practical algorithm is proposed for achieving the claimed efficiency and numerical simulations are shown to validate the results.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133925382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Performance Analysis of Physarum-based Multi-hop Routing with Load Balancing 基于physarum的负载均衡多跳路由性能分析
2019 12th IFIP Wireless and Mobile Networking Conference (WMNC) Pub Date : 2019-09-01 DOI: 10.23919/WMNC.2019.8881801
Hiroshi Katada, Taku Yamazaki, T. Miyoshi
{"title":"Performance Analysis of Physarum-based Multi-hop Routing with Load Balancing","authors":"Hiroshi Katada, Taku Yamazaki, T. Miyoshi","doi":"10.23919/WMNC.2019.8881801","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881801","url":null,"abstract":"For distributed wireless networks, such as ad hoc networks and wireless sensor networks, we have proposed an adaptive multipath ad hoc routing method inspired by the feeding behavior of true slime mold. The proposed method can select transmission paths based on the available bandwidth, volume of scheduled data transmission, and residual battery of nodes. However, previous studies lacked a detailed analysis for using the proposed method as a routing protocol in an actual environment, as they only evaluated the performance in small-scale topologies. In this study, we evaluate the performance of the proposed method in large-scale networks which respect to the ability to load balance, adaptation for node mobility, and fault-tolerance ability. In addition, we evaluate the use of the proposed method as a routing protocol in an actual environment.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121994264","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
SDN Based Handover Management For a Tele-Operated Driving Use Case 基于SDN的远程驾驶用例切换管理
2019 12th IFIP Wireless and Mobile Networking Conference (WMNC) Pub Date : 2019-09-01 DOI: 10.23919/WMNC.2019.8881405
Nadia Mouawad, R. Naja, S. Tohmé
{"title":"SDN Based Handover Management For a Tele-Operated Driving Use Case","authors":"Nadia Mouawad, R. Naja, S. Tohmé","doi":"10.23919/WMNC.2019.8881405","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881405","url":null,"abstract":"Tele-operated driving is a transition phase to the deployment of fully autonomous cars. Vehicles are supposed to communicate with a tele-operation station in order to exchange surrounding videos and traffic information. This communication is achieved through a vehicular network, and it requires low latency and high reliability. To this end, the mobility management should be studied carefully. This paper devises a mobility management scheme for a tele-operated driving use case based on the Software Defined Networking (SDN) paradigm. The proposed scheme provides handover anticipation in order to guarantee a low-latency and a seamless mobility. During the anticipation phase, the target network is selected relying on a specific sigmoid utility function and game theory, aiming at fulfilling user satisfaction and achieving load balancing. Once the selection is finalized, a routing strategy is proposed in order to reduce control signaling overhead and network congestion. Soft handover execution is performed seamlessly using two interfaces of the vehicle simultaneously. Performance analysis shows that our approach provides several improvements in terms of network load alleviation, and it reduces handover delays and losses.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128936975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Game-Theoretic Framework for Resource Sharing in Clouds 云资源共享的博弈论框架
2019 12th IFIP Wireless and Mobile Networking Conference (WMNC) Pub Date : 2019-04-01 DOI: 10.23919/WMNC.2019.8881680
Faheem Zafari, K. Leung, D. Towsley, P. Basu, A. Swami
{"title":"A Game-Theoretic Framework for Resource Sharing in Clouds","authors":"Faheem Zafari, K. Leung, D. Towsley, P. Basu, A. Swami","doi":"10.23919/WMNC.2019.8881680","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881680","url":null,"abstract":"Providing resources to different users or applications is fundamental to cloud computing. This is a challenging problem as a cloud service provider may have insufficient resources to satisfy all user requests. Furthermore, allocating available resources optimally to different applications is also challenging. Resource sharing among different cloud service providers can improve resource availability and resource utilization as certain cloud service providers may have free resources available that can be “rented” by other service providers. However, different cloud service providers can have different objectives or utilities. Therefore, there is a need for a framework that can share and allocate resources in an efficient and effective way, while taking into account the objectives of various service providers that results in a multi-objective optimization problem. In this paper, we present a Cooperative Game Theory (CGT) based framework for resource sharing and allocation among different service providers with varying objectives that form a coalition. We show that the resource sharing problem can be modeled as an N–player canonical cooperative game with non-transferable utility (NTU) and prove that the game is convex for monotonic non-decreasing utilities. We propose an $mathcal{O}left( N right)$ algorithm that provides an allocation from the core, hence guaranteeing Pareto optimality. We evaluate the performance of our proposed resource sharing framework in a number of simulation settings and show that our proposed framework improves user satisfaction and utility of service providers.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128067500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信