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

筛选
英文 中文
Adaptive congestion control of DSRC vehicle networks for collaborative road safety applications 面向协同道路安全应用的DSRC车辆网络自适应拥塞控制
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115571
Wenyang Guan, Jianhua He, Lin Bai, Zuoyin Tang
{"title":"Adaptive congestion control of DSRC vehicle networks for collaborative road safety applications","authors":"Wenyang Guan, Jianhua He, Lin Bai, Zuoyin Tang","doi":"10.1109/LCN.2011.6115571","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115571","url":null,"abstract":"Congestion control is critical for the provisioning of quality of services (QoS) over dedicated short range communications (DSRC) vehicle networks for road safety applications. In this paper we propose a congestion control method for DSRC vehicle networks at road intersection, with the aims of providing high availability and low latency channels for high priority emergency safety applications while maximizing channel utilization for low priority routine safety applications. In this method a offline simulation based approach is used to find out the best possible configurations of message rate and MAC layer backoff exponent (BE) for a given number of vehicles equipped with DSRC radios. The identified best configurations are then used online by an roadside access point (AP) for system operation. Simulation results demonstrated that this adaptive method significantly outperforms the fixed control method under varying number of vehicles. The impact of estimation error on the number of vehicles in the network on system level performance is also investigated.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"73 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":"134049361","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}
引用次数: 25
Hiding on the road — Anonymous usage of Location Based Services 隐藏在路上-匿名使用基于位置的服务
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115534
Alan Walsh, T. Pfeifer
{"title":"Hiding on the road — Anonymous usage of Location Based Services","authors":"Alan Walsh, T. Pfeifer","doi":"10.1109/LCN.2011.6115534","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115534","url":null,"abstract":"The rapid increase in the usage of Location Based Services (LBS) due to the rise of the smartphone is focusing attention on how applications are accessing users' context location. Smartphone operating systems such as iOS and Android currently promote a \"one size fits all\" approach and do not discriminate between services on the accuracy and extent of location disclosure. A general lack of awareness pervades amongst users of these devices as to the consequences of indiscriminate location disclosure although the various issues have been discussed and published for many years. This paper outlines a new approach to obfuscate a user's location using relevant road categories and their vector data and explores how the current deficiencies in current smartphone operating systems could be improved to allow such obfuscation of user location and provide improved user control over all classes of LBS applications.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"69 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":"115143025","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
Improving the stability of eXplicit Control Protocol under heterogeneous delays 提高显式控制协议在异构时延下的稳定性
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115170
Hairui Zhou, Chengchen Hu, Jian Li, Lina He, F. Hu
{"title":"Improving the stability of eXplicit Control Protocol under heterogeneous delays","authors":"Hairui Zhou, Chengchen Hu, Jian Li, Lina He, F. Hu","doi":"10.1109/LCN.2011.6115170","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115170","url":null,"abstract":"The eXplicit Control Protocol (XCP) is a promising congestion control protocol that outperforms TCP in terms of efficiency, fairness, persistent queue length, and packet loss rate. However, XCP will behave in a noticeably unstable manner if the maximum round trip time of a flow is much larger than average round trip time of all flows, which is a typical nonlinear instability. In this paper, eXCP is proposed to stabilize the system and enable XCP to deal with heterogeneous feedback delays. With the aid of the exponentially weighted moving average filter, eXCP directly reduces the volatility of the control interval and effectively improves the stability of the aggregate input traffic at a bottleneck link. Simulations also have shown that the variance of per-flow throughput and round trip time decrease dramatically.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"54 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":"116354374","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
Evaluation of protocol treatment in 3G networks 3G网络中协议处理的评估
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115536
P. Arlos, Ravichandra Kommalapati, M. Fiedler
{"title":"Evaluation of protocol treatment in 3G networks","authors":"P. Arlos, Ravichandra Kommalapati, M. Fiedler","doi":"10.1109/LCN.2011.6115536","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115536","url":null,"abstract":"In this work, we present a systematic study of how the traffic of different transport protocols (UDP, TCP and ICMP) is treated, in three operational Swedish 3G networks. This is done by studying the impact that protocol and packet size have on the one-way-delay (OWD) across the networks. We do this using a special method that allows us to calculate the exact OWD, without having to face the usual clock synchronization problems that are normally associated with OWD calculations. From our results we see that all three protocols are treated similarly by all three operators, when we consider packet sizes that are smaller than 250 bytes and larger than 1100 bytes. We also show that larger packet sizes are given preferential treatment, with both smaller median OWD as well as a smaller standard deviation. It is also clear that, ICMP is given a better performance compared to TCP and UDP.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"69 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":"133762164","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
Position verification for vehicular networks via analyzing two-hop neighbors information 基于两跳邻居信息分析的车辆网络位置验证
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115555
Mervat Abu-Elkheir, Sherin Abdel Hamid, H. Hassanein, I. El-Henawy, S. Elmougy
{"title":"Position verification for vehicular networks via analyzing two-hop neighbors information","authors":"Mervat Abu-Elkheir, Sherin Abdel Hamid, H. Hassanein, I. El-Henawy, S. Elmougy","doi":"10.1109/LCN.2011.6115555","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115555","url":null,"abstract":"Vehicular networks will enable vehicles on the road to utilize wireless communication to exchange safety information; enhancing traffic flow and minimizing accidents. With vehicle positions being the most frequently exchanged information in vehicular networks; it becomes imperative to establish a strong level of trust in the announced positions before a vehicle may take action in response. This paper proposes a position verification scheme that involves the collaborative exchange of one-hop neighbor information in order to help a vehicle make better judgments of position announcements. Vehicles can assess neighborhood connectivity and use the logical traffic flow to form a verdict on trusting a position announcement, thus enabling the detection of possible position falsifications. The scheme analyzes accumulated 2-hop neighbors' information in order to define a plausibility area within which a vehicle should exist in order for its position to be considered “correct”. In very sparse traffic scenarios, a vehicle will depend on measuring the consistency of a vehicle's Received Signal Strength (RSS) with its announced position. Performance evaluation was carried out via simulation, and results show that defining this plausibility area yields accurate detection of position falsifications with low false positives.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"17 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":"132733558","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}
引用次数: 16
Coverage extension based on incentive scheduler for mobile relaying nodes in wireless networks 基于激励调度的无线网络移动中继节点覆盖扩展
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115309
C. Gueguen, A. Rachedi
{"title":"Coverage extension based on incentive scheduler for mobile relaying nodes in wireless networks","authors":"C. Gueguen, A. Rachedi","doi":"10.1109/LCN.2011.6115309","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115309","url":null,"abstract":"In this paper, we propose a new scheduler able to extend the wireless coverage by using an incentive approach for potential mobile relaying nodes. Indeed, the cost of cooperation can be expensive in terms of QoS and energy consumption which do not motivate the nodes to cooperate. Our incentive approach rewards the cooperative nodes. The percentage of cooperation is considered in the QoS management in order to incite the border nodes to cooperate and then to extend the wireless area. Moreover, the monitoring mechanism is proposed to correctly evaluate the cooperation rate of each node. The results show that not only the proposed solution allows the border nodes to cooperate without the negative impact but also enhance the QoS parameters.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"73 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":"124766596","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}
引用次数: 2
A Nash Stackelberg approach for network pricing, revenue maximization and vertical handover decision making 网络定价、收益最大化和垂直移交决策的纳什斯塔克尔伯格方法
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115526
Mariem Zekri, Makhlouf Hadji, B. Jouaber, D. Zeghlache
{"title":"A Nash Stackelberg approach for network pricing, revenue maximization and vertical handover decision making","authors":"Mariem Zekri, Makhlouf Hadji, B. Jouaber, D. Zeghlache","doi":"10.1109/LCN.2011.6115526","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115526","url":null,"abstract":"Radio resource and mobility managements are becoming more and more complex within nowadays rich and heterogeneous wireless access networking systems. Multiple requirements, challenges and constraints, at both technical and economical perspectives have to be considered. While the main objective remains guaranteeing the best Quality of Service and optimal radio resource utilization, economical aspects have also to be considered including cost minimization for users and revenue maximization for network providers. In this paper, we propose a game theoretic scheme where each available network plays a Stackelberg game with a finite set of users, while users are playing a Nash game among themselves to share the limited radio resources. A Nash equilibrium point is found and used for vertical handover decision making and admission control. We also introduce in the proposed model the user's requirements in terms of quality of service according to its running application and the network reputation that is conducted from the users' quality of experience and we study the effect of these parameters on the network pricing and revenue maximization problems.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"63 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":"125505728","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
Studying the feasibility of IEEE 802.15.4-Based WSNs for gas and fire tracking applications through simulation 通过仿真研究了基于IEEE 802.15.4的无线传感器网络在燃气和火灾跟踪应用中的可行性
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115566
Carlos Lino, C. Calafate, A. Díaz-Ramírez, P. Manzoni, Juan-Carlos Cano
{"title":"Studying the feasibility of IEEE 802.15.4-Based WSNs for gas and fire tracking applications through simulation","authors":"Carlos Lino, C. Calafate, A. Díaz-Ramírez, P. Manzoni, Juan-Carlos Cano","doi":"10.1109/LCN.2011.6115566","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115566","url":null,"abstract":"Wireless Sensor Networks (WSNs) have proliferated significantly in recent years. Nowadays they are used in many fields, such as military, environmental and industrial. Reliability and low latency are desirable characteristics of many WSN applications. In particular, time-critical WSN applications must be able to act according to the observed changes in the environment as quickly as possible, assuring that the information collected by the sensor nodes is correct. In these applications the response time is a critical factor. In this paper, we focus on WSN monitoring applications for both indoor and outdoor environments. We propose a near real-time monitoring system based on binary detection sensor that offers delay bounded tracking of events, such as gas and fire. The performance of gas and fire tracking applications is evaluated using the IEEE 802.15.4 technology and a routing scheme for WSNs that relies on sink announcements for route discovery. The proposed routing protocol is tuned to introduce the lowest possible end-to-end delay to data packet delivery, by reducing control traffic to a minimum. To evaluate the performance, we develop both gas and fire propagation models for a framework that allows simulating emergency events, thus allowing us to determine the degree of accuracy achieved in the monitoring process.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"92 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":"130099694","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
Hybrid web server: Traffic analysis and prototype 混合web服务器:流量分析和原型
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115169
M. Olson, Ken Christensen, Sanghak Lee, Jungmee Yun
{"title":"Hybrid web server: Traffic analysis and prototype","authors":"M. Olson, Ken Christensen, Sanghak Lee, Jungmee Yun","doi":"10.1109/LCN.2011.6115169","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115169","url":null,"abstract":"Web servers in small and medium enterprises (SME) consume a significant amount of energy. We consider how a hybrid SME web server based on two co-located platforms (one high performance and high power and the second low performance and low power) can be architected to appear as a single system image to clients. A prototype based on a Dell AMD Athlon x64-based PC and a Sheeva ARM-based plug computer is described and evaluated using the Apache ab benchmark. Using traffic traces from the KETI corporate web server, we show that for the majority of the time a low-performance platform can very likely meet the performance demands (during which time the high-power platform can sleep). We explore prediction of server load using network traffic analysis as a means to achieve a selection (or switching) policy between the two platforms. Using simple prediction methods, we show that we can achieve between 41% to 67% energy savings with minimal performance impact.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"96 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":"128884468","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}
引用次数: 8
User- and application-centric multihomed flow management 以用户和应用程序为中心的多宿主流管理
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115206
O. Mehani, R. Boreli, Michael J. Maher, T. Ernst
{"title":"User- and application-centric multihomed flow management","authors":"O. Mehani, R. Boreli, Michael J. Maher, T. Ernst","doi":"10.1109/LCN.2011.6115206","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115206","url":null,"abstract":"We consider the problem of network selection and flow distribution for a multihomed mobile device. We argue the benefits of a holistic approach which considers user- and application-centric metrics such as quality, energy consumption and monetary cost, rather than the commonly used network-centric metrics. We thus introduce the multihomed flow management problem which combines network selection, flow distribution and application flow awareness. We formulate it as a constrained optimisation problem and compare it to commonly used techniques: single network selection and load balancing. For selected interactive applications, we use empirical network measurements to evaluate the optimal solutions obtained by the three approaches. We show that, by exploiting the flexibility of application parameters, it is possible to achieve the potentially conflicting goals of maintaining high application quality while reducing both the power consumption and cost of network use.","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":"128946835","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
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学术官方微信
小红书