2011 IEEE 36th Conference on Local Computer Networks最新文献

筛选
英文 中文
Extending node protection concept of p-cycles for an efficient resource utilization in multicast traffic 扩展p-环的节点保护概念,以提高组播流量的资源利用率
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115180
A. Frikha, Bernard A. Cousin, S. Lahoud
{"title":"Extending node protection concept of p-cycles for an efficient resource utilization in multicast traffic","authors":"A. Frikha, Bernard A. Cousin, S. Lahoud","doi":"10.1109/LCN.2011.6115180","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115180","url":null,"abstract":"In this paper, we consider link-and-node failure recovery in dynamic multicast traffic in WDM networks. We extend the node protection concept of the p-cycle approach to achieve more efficient resource utilization. Then, we propose a novel algorithm that integrates our concept for the node protection, named node-and-link protecting p-cycle based algorithm (NPC). We also propose a second algorithm, named node-and-link protecting candidate p-cycle based algorithm (NPCC). This algorithm deploys our concept for node protection and relies on a candidate p-cycle set to speed up the computational time. We compare our proposed algorithms to the ESHN algorithm, which is reported to be the most efficient algorithm for protecting dynamic multicast sessions. Extensive simulations show that the NPC algorithm achieves the lowest blocking probability, but has the highest computational time among the NPCC and ESHN algorithms. The NPCC algorithm outperforms the ESHN algorithm in terms of resource utilization efficiency and computational time.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124710345","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
Improving the link lifetime in VANETs 提高VANETs的链路寿命
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115570
Marwane Ayaida, L. Afilal, H. Fouchal, Haytem El Mehraz
{"title":"Improving the link lifetime in VANETs","authors":"Marwane Ayaida, L. Afilal, H. Fouchal, Haytem El Mehraz","doi":"10.1109/LCN.2011.6115570","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115570","url":null,"abstract":"Nodes in VANETs move at high speed. This high mobility makes most conventional routing protocols incompatible with this type of network. A new class of geographic routings has emerged. Most of these routing protocols suppose that the nodes position is known in advance and that the nodes do not have time to move significantly between sending packets and receiving their acknowledgments. This assumption is not always realistic because of the high nodes movement and the low wireless transmissions range. Consequently, packets routing may fail if this assumption is not guaranteed. In this paper, we propose a prediction mechanism, which will estimate the expected new vehicle position to reduce the packet loss.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121910573","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
G-local resource management: Achieving global optimization via local inference without message passing 本地资源管理:通过不传递消息的本地推理实现全局优化
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115511
Chen Liu, J. Harms, M. MacGregor
{"title":"G-local resource management: Achieving global optimization via local inference without message passing","authors":"Chen Liu, J. Harms, M. MacGregor","doi":"10.1109/LCN.2011.6115511","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115511","url":null,"abstract":"Resource competition is inevitable in shared-resource systems, as the number of users increases or their resource demands change. In wireless networks, this problem is aggravated due to the existence of co-channel interference. Without appropriate control, harmful competition causes unbalanced user consumption of resources (e.g. starvation), and resource waste due to conflicts and idleness. In this paper we propose a novel framework to effectively manage resources (e.g. shared wireless channels). Compared with the state-of-art global optimization algorithm, our method is superior in terms of eliminating control overhead caused by message passing, achieving competitive performance, and reducing computational complexity. This framework combines the advantages of global and local optimization methods and drives the system toward a global optimum by intelligently exploiting local information.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115829021","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
Interframe spacing adaptation method for IEEE 802.11 WLANs coexisting with IEEE 802.16 networks IEEE 802.11无线局域网与IEEE 802.16网络共存的帧间间距自适应方法
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115308
Boram Choi, Daewon Jung, Hyuk Lim
{"title":"Interframe spacing adaptation method for IEEE 802.11 WLANs coexisting with IEEE 802.16 networks","authors":"Boram Choi, Daewon Jung, Hyuk Lim","doi":"10.1109/LCN.2011.6115308","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115308","url":null,"abstract":"In cognitive networks, secondary users (SUs) are regulated to prevent them from accessing a channel if primary users (PUs) are currently occupying the channel. However, there is no strict regulation about how to coordinate the channel access among multiple SUs belonging to heterogeneous networks with different channel access policies. In this paper, we consider the coexistence problem for two specific SUs of carrier sense multiple access (CSMA)-based IEEE 802.11 network and centralized scheduling-based IEEE 802.16 network. We propose an inter-frame spacing (IFS) adaptation method that allows IEEE 802.11 SUs to fully utilize idle intervals between successive IEEE 802.16 frames while not interfering with the following IEEE 802.16 frame. Through various simulations, we show that our proposed method significantly improves the throughput of IEEE 802.11 networks without harmful interference to IEEE 802.16 systems.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132491739","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
dMME: Virtualizing LTE mobility management dMME:虚拟化LTE移动性管理
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115386
Xueli An, Fabio Pianese, I. Widjaja, Utku Günay Acer
{"title":"dMME: Virtualizing LTE mobility management","authors":"Xueli An, Fabio Pianese, I. Widjaja, Utku Günay Acer","doi":"10.1109/LCN.2011.6115386","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115386","url":null,"abstract":"With the convergence between phone and data networks in LTE and 4G, cellular signaling traffic is increasingly carried over IP. Control plane functions, once performed by dedicated machinery, are evolving into large-scale network applications with strict requirements on delay, availability, and processing throughput as mandated by 3GPP standards. In this paper we present dMME, a distributed architecture that implements mobility management for next-generation cellular systems. dMME is a scalable and cost-effective drop-in replacement for the LTE mobility management entity (MME). We evaluate the dMME scheme via analysis and simulation under several deployment scenarios, using mobility patterns drawn from synthetic models and from traces collected in a production network. We also report preliminary performance figures by our dMME prototype implementation. Our results confirm that distributed architectures are a viable choice to reliably support high-throughput, latency-sensitive control plane functions.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"226 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133338250","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}
引用次数: 18
Design and deployment tool for in-building wireless sensor networks: A performance discussion 建筑内无线传感器网络的设计和部署工具:性能讨论
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115530
Antony Guinard, M. Aslam, D. Pusceddu, S. Rea, A. Mcgibney, D. Pesch
{"title":"Design and deployment tool for in-building wireless sensor networks: A performance discussion","authors":"Antony Guinard, M. Aslam, D. Pusceddu, S. Rea, A. Mcgibney, D. Pesch","doi":"10.1109/LCN.2011.6115530","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115530","url":null,"abstract":"The design and deployment of a wireless sensor network (WSN) for building automation applications is a complex operation that requires expert knowledge and experience. This paper presents an evaluation of a WSN deployment support framework for in-building wireless infrastructures. A case study consisting of a sample network deployment for environmental monitoring is used to investigate the need for such support tools. The network infrastructure design suggested by the deployment support tool is compared against designs done using basic planning guidelines and a design based on an extensive site survey and experience. It will be shown how the deployment support tools provide a WSN with a reduced infrastructure cost and improved sensing packet delivery ratio when compared to the designs using traditional approaches.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132333405","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}
引用次数: 14
Learning mechanisms for achieving context awareness and intelligence in Cognitive Radio networks 认知无线电网络中实现上下文感知和智能的学习机制
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115543
K. Yau, P. Komisarczuk, Paul D. Teal
{"title":"Learning mechanisms for achieving context awareness and intelligence in Cognitive Radio networks","authors":"K. Yau, P. Komisarczuk, Paul D. Teal","doi":"10.1109/LCN.2011.6115543","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115543","url":null,"abstract":"Providing that licensed or Primary Users (PUs) are oblivious to the presence of unlicensed or Secondary Users (SUs), Cognitive Radio (CR) enables the SUs to use underutilized licensed spectrum (or white spaces) opportunistically and temporarily conditional on the interference to the PUs being below an acceptable level. Context awareness and intelligence enable the SU to sense for and use the underutilized licensed spectrum in an efficient manner. This paper investigates various learning mechanisms for achieving context awareness and intelligence with respect to Dynamic Channel Selection (DCS) in CR networks. The learning mechanisms are Adaptation (Adapt), Window (Win), Adaptation-Window (AdaptWin), and Reinforcement Learning (RL). The DCS scheme helps SU base station to select channel adaptively for data transmission to its SU host in static and mobile centralized CR networks. The purpose is to enhance quality of service, particularly throughput and delay (in terms of number of channel switches), in the presence of channel heterogeneity. Our contribution is to investigate simple and yet pragmatic learning mechanisms for CR networks. Simulation results reveal that RL, AdaptWin and Win achieve approximately similar and the best possible network performance, followed by Adapt, and finally Random, which does not apply learning and serves as baseline.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115902825","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
SmartMeter.KOM: A low-cost wireless sensor for distributed power metering SmartMeter。KOM:用于分布式电力计量的低成本无线传感器
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115159
A. Reinhardt, Dominic Burkhardt, P. Mogre, M. Zaheer, R. Steinmetz
{"title":"SmartMeter.KOM: A low-cost wireless sensor for distributed power metering","authors":"A. Reinhardt, Dominic Burkhardt, P. Mogre, M. Zaheer, R. Steinmetz","doi":"10.1109/LCN.2011.6115159","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115159","url":null,"abstract":"Most current smart metering solutions aim at increasing user awareness for their household's electrical energy consumption. Although some smart meters make use of wireless data transfers between their sensor and display units, their integration into existing wireless sensor networks is hampered by proprietary communication interfaces and their lack of re-programmability. Furthermore, the sole availability of aggregate consumption values renders current meters insufficient for novel application scenarios like smart home automation, for which information at device-level granularity and high resolution is vital. We address these shortcomings of existing solutions by presenting SmartMeter.KOM, our wireless sensor node capable of determining the current consumption of individual electrical appliances at high resolution. The platform is based on low-power hardware and incorporates a reprogrammable microcontroller which allows developers to easily deploy new algorithms. Its IEEE 802.15.4-compliant radio transceiver makes its integration with existing sensor networks possible, and thus enables their integration in smart buildings. We demonstrate the versatility of SmartMeter.KOM by presenting prototypical implementations of smart applications and identifying further research directions.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124198349","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}
引用次数: 32
Energy-efficient retransmission strategies under variable TDMA scheduling in body area networks 体域网络中可变TDMA调度下的节能重传策略
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115319
Yuriy Tselishchev, Lavy Libman, A. Boulis
{"title":"Energy-efficient retransmission strategies under variable TDMA scheduling in body area networks","authors":"Yuriy Tselishchev, Lavy Libman, A. Boulis","doi":"10.1109/LCN.2011.6115319","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115319","url":null,"abstract":"We consider a body area network (BAN) setting in which sensor nodes send data to a common hub regularly on a TDMA basis, as defined by the emerging IEEE 802.15.6 BAN standard. Our previous work has established the benefits of variable TDMA scheduling in this setting, where the order of communication with nodes in each TDMA round is determined on the fly by the hub, based on the actual outcomes (success or failure) of their recent transmissions. This technique takes into account the very slow fading nature of wireless channels in BANs, and can minimize the expected rate of transmission losses merely by ordering nodes according to their most recent channel state information, without any additional energy overhead. In this paper, we focus on an extended TDMA setting where the length of each TDMA round is greater than the number of nodes, i.e. a number of ‘spare’ slots are reserved for retransmissions of lost packets. We consider delay-constrained data transmissions based on a Markov model of the wireless channels. We evaluate several variable scheduling strategies in terms of the trade-off between the energy consumption due to the additional retransmissions and the reduction of the loss rate. We show how the best strategy depends on the energy budget of the sensor nodes, and demonstrate the considerable reduction in the loss rate (up to 18%) that can be achieved over a naïve approach where static TDMA scheduling is combined with retransmission slots at the end of the round.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114947889","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}
引用次数: 20
Raptor-based reliable unicast content delivery in wireless network environments 无线网络环境中基于猛禽的可靠单播内容传送
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115560
M. Baguena, C. Calafate, Juan-Carlos Cano, P. Manzoni
{"title":"Raptor-based reliable unicast content delivery in wireless network environments","authors":"M. Baguena, C. Calafate, Juan-Carlos Cano, P. Manzoni","doi":"10.1109/LCN.2011.6115560","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115560","url":null,"abstract":"Delivering contents over wireless networks can be a challenging task due to the intrinsic limitations of these environments. In this paper we propose RCDP, a solution which adopts an application layer FEC scheme based on Raptor codes to avoid retransmissions, optimizing content delivery for the unicast case. The proposed solution relies on end-to-end bandwidth estimations to perform rate control, achieving high throughput levels in lossy wireless environments. We have designed and implemented RCDP for the GNU/Linux platform to validate our approach under different channel conditions, varying packet loss ratio, end-to-end delay, and channel capacity. Experimental results show that the proposed solution is very efficient when facing high loss ratios and end-to-end delays, allowing for an efficient usage of channel resources in wireless scenarios.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117286956","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
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学术官方微信