2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)最新文献

筛选
英文 中文
Social similarity as a driver for selfish, cooperative and altruistic behavior 社会相似性是自私、合作和利他行为的驱动因素
E. Jaho, M. Karaliopoulos, I. Stavrakakis
{"title":"Social similarity as a driver for selfish, cooperative and altruistic behavior","authors":"E. Jaho, M. Karaliopoulos, I. Stavrakakis","doi":"10.1109/WOWMOM.2010.5534930","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534930","url":null,"abstract":"This paper explores how the degree of similarity within a social group can be exploited in order to dictate the behavior of the individual nodes, so as to best accommodate the typically non-coinciding individual and social benefit maximization. More specifically, this paper investigates the impact of social similarity on the effectiveness of content dissemination, as implemented through three classes representing well the spectrum of behavior-shaped content storage strategies: the selfish, the self-aware cooperative and the optimally altruistic ones. This study shows that when the social group is tight (high degree of similarity), the optimally altruistic behavior yields the best performance for both the entire group (by definition) and the individual nodes (contrary to typical expectations). When the group is made up of foreigners with almost no similarity, altruism or cooperation cannot bring much benefits to either the group or the individuals and thus, a selfish behavior would make sense due to its simplicity. Finally, the self-aware cooperative behavior could be adopted as an easy to implement distributed scheme — compared to the optimally altruistic one — that has close to the optimal performance for tight social groups, and has the additional advantage of not allowing mistreatment to any node (i.e., the content retrieval cost become larger compared to the cost of the selfish strategy).","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":" 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113950706","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}
引用次数: 19
On access point association in wireless mesh networks 无线网状网络中接入点关联研究
A. Argento, M. Cesana, Ilaria Malanchini
{"title":"On access point association in wireless mesh networks","authors":"A. Argento, M. Cesana, Ilaria Malanchini","doi":"10.1109/WOWMOM.2010.5535000","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5535000","url":null,"abstract":"End users getting connectivity from wireless access networks want to choose the \"best\" access opportunity, that is, the best base station in cellular systems, and the best access point in WLANs. The metrics used to drive the association procedures are usually based on \"local\" parameters like the received signal strength, and the base station/access point's load. In case connectivity is provided through a Wireless Mesh Network the quality perceived by the user upon association depends also on \"global\" network-wide parameters. This paper studies the dynamics of network association in Wireless Mesh Networks by resorting to game theoretic tools. We show how the association problem can be formalized as a non-cooperative game in which end users selfishly play to minimize a perceived association cost which accounts for characteristics of the entire path to reach the WMN gateway. The quality of the Nash Equilibria for the proposed game are then quantitatively analyzed, and preliminary numerical results on the perceived association cost are derived for sample network topologies.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114841020","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}
引用次数: 7
Channel pool management for video streaming in WLAN 无线局域网视频流信道池管理
Xin Liu, G. Calcev
{"title":"Channel pool management for video streaming in WLAN","authors":"Xin Liu, G. Calcev","doi":"10.1109/WOWMOM.2010.5534958","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534958","url":null,"abstract":"In this paper, we present a Wireless Local Area Network (WLAN) channel selection algorithm and testbed implementation for video streaming applications. We call this type of spectrum management functionality Channel Pool Management (CPM). Specifically, we designed a scheme called Shifted Mask Superposition (SMS) that harnesses the transmitter spectral mask to help predict WLAN channel quality dynamically with only passively monitored channel information. We performed extensive experiments to model the spectral mask and verified the effectiveness of our algorithm. Based on our scheme, we built a testbed that implements the main functionality within CPM and performed channel switching without disrupting the video streaming application. Experiments showed that our proposed scheme can predict the best channel for video streaming with 90% accuracy and can improve the video quality significantly compared to systems that do not implement CPM.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133075453","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
A multiaccess network of information 一种多址信息网络
K. Pentikousis, T. Rautio
{"title":"A multiaccess network of information","authors":"K. Pentikousis, T. Rautio","doi":"10.1109/WOWMOM.2010.5534922","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534922","url":null,"abstract":"The Network of Information (Netlnf), an information-centric approach to designing the Internet of the Future, aims at introducing the foundation concepts that allow users to create, distribute, and retrieve information using a common set of network infrastructure primitives without tying data to particular hosts. Netlnf is well suited for mobile communications and wireless content dissemination. One of the key aspects of Netlnf operation is its native capacity to take advantage of overlapping multiaccess environments and distributed in-network storage. This paper introduces Netlnf multiaccess operation taking cues from state-of-the-art peer-to-peer content distribution. In order to evaluate multiaccess operation in practice we consider the requirements and deployment environment for Netlnf, including a migration approach to adopting Netlnf concepts. We conduct measurements, specify the necessary signaling to enhance Bit Torrent operation over multiaccess, multi-domain networks and develop a prototype to explore the design space. The paper also introduces the Netlnf Notification Service. We present empirical results showing how multiaccess Netlnf can outperform current technologies.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123427894","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}
引用次数: 11
General lower and best case upper bounds on energy optimal multicasting in wireless ad hoc and sensor networks 无线自组网和传感器网络中能量最优组播的一般下界和最佳上界
Hannes Frey
{"title":"General lower and best case upper bounds on energy optimal multicasting in wireless ad hoc and sensor networks","authors":"Hannes Frey","doi":"10.1109/WOWMOM.2010.5534900","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534900","url":null,"abstract":"Given a source node and a set of k destination nodes, what is the minimum total energy required for sending a message from source to destinations when multicasting along optimal placed relaying nodes is applied? In this work I will answer this question under the assumption that non-cooperative relaying is applied and that communication over a distance d requires energy proportional to dα + β for some a > 1 and β > 0. I derive lower bound expressions for a MAC layer model which does not exploit the broadcast property of wireless communication and for a MAC layer model which exploits it. I show further, in case of optimal relay positions, how multicasts can be constructed whose energy consumption always stays below the derived lower bound plus an additive constant expression depending on α, β, k. The usefulness of the bound derived in this work is exemplified with three different example applications.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121948660","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}
引用次数: 3
Achieving per-station fairness in IEEE 802.11 wireless LANs 实现IEEE 802.11无线局域网的每站公平性
Wan-Seon Lim, Young-Joo Suh
{"title":"Achieving per-station fairness in IEEE 802.11 wireless LANs","authors":"Wan-Seon Lim, Young-Joo Suh","doi":"10.1109/WOWMOM.2010.5534908","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534908","url":null,"abstract":"In this paper, we address the issue of per-station fairness in IEEE 802.11-based wireless local area networks (WLANs). Although the IEEE 802.11 Distributed Coordination Function (DCF) has been designed to provide a fair channel access for all competing stations, it does not guarantee fairness between uplink and downlink flows in infrastructure mode WLANs. In the literature, several solutions have been proposed, where they give a higher channel access priority to an access point (AP) in order to avoid the starvation of downlink flows. However, we found that existing solutions cannot guarantee per-station fairness when uplink and downlink flows coexist in a station. In this paper, we propose a new MAC protocol for IEEE 802.11 WLANs, which aims at providing a fair medium access for all stations regardless of the direction of flows. In the proposed protocol, stations are classified into four states according to their traffic patterns, and they access the medium in different ways according to their states. The proposed protocol is fully backward compatible with the IEEE 802.11 standard and it does not include any complex scheduling algorithm. We evaluated the performance of the proposed protocol via extensive simulations and experiments in a real test-bed. Compared to existing work, the proposed protocol shows improved fairness performance in resource sharing among WLAN stations.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123934880","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}
引用次数: 4
Load-balanced routing and gateway selection in wireless mesh networks: Design, implementation and experimentation 无线网状网络中的负载均衡路由和网关选择:设计、实现和实验
Emilio Ancillotti, R. Bruno, M. Conti
{"title":"Load-balanced routing and gateway selection in wireless mesh networks: Design, implementation and experimentation","authors":"Emilio Ancillotti, R. Bruno, M. Conti","doi":"10.1109/WOWMOM.2010.5534991","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534991","url":null,"abstract":"Traffic routing and gateway selection for Internet flows play a crucial role in determining the performance of WMNs. Optimal routing strategies have been derived under the assumption that the traffic demands are static and known a priori, or that can be accurately predicted. However, the effectiveness of most of the existing optimization-based routing solutions is still to be demonstrated in real-world deployments. In this paper we present a practical and robust framework for load-balanced routing and gateway selection in WMNs under variable traffic loads, which relies only on real-time measurements of network statistics. Then, we design, implement and evaluate two simple adaptive strategies to automatically select network paths and gateways for flows that dynamically arrive and depart, with the goal of achieving a high network utilization and improved load balancing. We have developed a full-fledged implementation of the proposed mechanisms as an extension of the OLSR protocol, and conducted an experimental study in a trial outdoor mesh network using video streaming traffic. Collected measurements show that our scheme can significantly increase the number of video sessions that can be supported with acceptable quality compared to traditional shortest path routing.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127333709","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}
引用次数: 19
The XO-Mesh path discovery mechanism sanity XO-Mesh路径发现机制健全
R. Carrano, L. Magalhães
{"title":"The XO-Mesh path discovery mechanism sanity","authors":"R. Carrano, L. Magalhães","doi":"10.1109/WOWMOM.2010.5534999","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534999","url":null,"abstract":"The XO-Mesh is a layer two ad hoc multlhop wireless network, developed by OLPC for its hundred-dollar educational laptop. Although based on an early version of the IEEE 802.11s draft, both proposals diverged in many aspects as they evolved in the last three years. This article focuses on the Path Discovery Mechanism introduced by OLPC, which differs from the mechanism described in the IEEE 802.11s — the Hybrid Wireless Mesh Protocol (HWMP) — in many aspects. We are particularly interested in explaining odd behaviors observed in the field (OLPC deployments) and test beds — namely the forming of unexpected multihop paths. We confirm that such oddities do occur and propose methods to reduce its effects.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129880135","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
Optimal joint routing and scheduling in wireless mesh networks with smart antennas 具有智能天线的无线网状网络的最优联合路由与调度
M. Yazdanpanah, C. Assi, Y. Shayan
{"title":"Optimal joint routing and scheduling in wireless mesh networks with smart antennas","authors":"M. Yazdanpanah, C. Assi, Y. Shayan","doi":"10.1109/WOWMOM.2010.5535002","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5535002","url":null,"abstract":"We present a cross-layer optimization framework for wireless mesh networks; we assume nodes are equipped with smart antenna and techniques such as beam-forming, spatial division multiple access and spatial division multiplexing are considered. These techniques provide interference suppression, capability to communicate with several nodes simultaneously and higher transmission data rates, respectively. By integrating different constraints from MAC and network layers, a mathematical formulation of the problem is presented. It is shown that the resulted directive, multiple access and multiplexing gain combined with optimal link scheduling effectively increase both the spectrum spatial reuse and the capacity of the links and thus, enhance the achievable system throughput. Since the optimization problem is a complex combinatorial one, the optimal LP solution is approached by a Column Generation decomposition method. The numerical results for different network topologies with various node densities, transmission ranges, traffics and number of antennas are provided, in which system activation time is reduced up to 86.9% by employing smart antenna techniques.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122602932","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}
引用次数: 11
A vision of cooperation tools for VANETs 对VANETs合作工具的展望
J. Molina-Gil, P. Caballero-Gil, C. Caballero-Gil
{"title":"A vision of cooperation tools for VANETs","authors":"J. Molina-Gil, P. Caballero-Gil, C. Caballero-Gil","doi":"10.1109/WOWMOM.2010.5535001","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5535001","url":null,"abstract":"A Vehicular Ad-hoc NETwork (VANET) is a special type of Movile Ad-hoc Network designed to provide communications among On-Board Units (OBUs) in nearby vehicles, and between OBUs in vehicles and Road-Side Units (RSUs) that are fixed equipment located on the road. Data packets have to be relayed hop by hop from a given OBU to a RSU or another OBU and vice-versa. This means that the mobile stations must accept to forward information for the benefit of other stations. However, these benefits would vanish if the mobile stations did not properly cooperate and forward packets for other stations. In this paper, we address this problem and propose mechanisms that encourage collaboration in packet forwarding.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"320 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122786285","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}
引用次数: 9
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学术文献互助群
群 号:604180095
Book学术官方微信