2011 IEEE 36th Conference on Local Computer Networks最新文献_第5页

Mercury-like routing for high mobility wireless ad hoc networks 用于高移动性无线自组织网络的水星式路由

2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115505

A. H. Ho, Y. H. Ho, K. Hua

{"title":"Mercury-like routing for high mobility wireless ad hoc networks","authors":"A. H. Ho, Y. H. Ho, K. Hua","doi":"10.1109/LCN.2011.6115505","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115505","url":null,"abstract":"Supporting high mobility is essential to mobile ad hoc networks in a wide range of emerging applications such as vehicular networks. Communication links of an established communication path that extends between source and destination nodes are often broken under a high mobility environment. Although a new communication route can be established when a break in the communication path occurs, repeatedly reestablishing new routes incurs delay and substantial overhead. To address this limitation, we introduce the Communication Path abstraction in this paper. A communication path is a dynamically-created geographical area that connects the source and destination nodes. The routing functionality of a communication path is provided by the physical nodes (i.e., mobile devices) currently within the geographical region served by the path. These physical nodes take turns in forwarding data packets for the path. Since a path can be supported by many alternative nodes, this scheme is much less susceptible to node mobility. Our simulation results show the Communication Path approach can achieve several times better performance than traditional approach based on a fixed sequence of physical links.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"7 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":"129750870","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

Z-Monitor: Monitoring and analyzing IEEE 802.15.4-based Wireless Sensor Networks Z-Monitor:监测和分析基于IEEE 802.15.4的无线传感器网络

2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115575

A. Koubâa, S. A. Chaudhry, Olfa Gaddour, Rihab Chaâri, Nada Al-Elaiwi, Hanan Al-Soli, Hichem Boujelben

引用次数: 14

Network lifetime maximization in sensor networks with multiple mobile sinks 具有多个移动接收器的传感器网络的网络生存期最大化

2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115315

W. Liang, Jun Luo

{"title":"Network lifetime maximization in sensor networks with multiple mobile sinks","authors":"W. Liang, Jun Luo","doi":"10.1109/LCN.2011.6115315","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115315","url":null,"abstract":"In this paper we deal with the network lifetime maximization problem under multiple mobile sink environments, namely, the h-hop-constrained multiple mobile sink problem, which is defined as follows. Given a stationary sensor network with K mobile sinks that traverse and sojourn in a given space of locations in the monitoring area, assume that the total travel distance of each sink is bounded by a given value L and the maximum number of hops from each sensor to a sink is bounded by an integer h ≥ 1, the problem is to find an optimal trajectory for each mobile sink and determine the sojourn time at each sojourn location in the trajectory such that the network lifetime is maximized. We first formulate this problem as a joint optimization problem consisting of finding an optimal trajectory and determining the sojourn time at each chosen location. We then show that the problem is NP-hard. We instead devise a novel three-stage heuristic, which consists of calculating the sojourn time profile at each potential sojourn location, finding a high-quality trajectory for each mobile sink, and determining the actual sojourn time at each sojourn location. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm in terms of network lifetime. We also investigate the impact of constraint parameters on the network lifetime. The experimental results demonstrate that the performance of the proposed heuristic is highly comparable to the optimal one, and the ratios of network lifetime of the proposed algorithm to the optimal network lifetime are ranged from 56% to 93%.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"27 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":"125738690","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}

引用次数: 57

Energy-aware service execution 节能服务执行

2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115164

W. Dargie, Anja Strunk, A. Schill

{"title":"Energy-aware service execution","authors":"W. Dargie, Anja Strunk, A. Schill","doi":"10.1109/LCN.2011.6115164","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115164","url":null,"abstract":"The energy consumption of ICT infrastructures has increased considerably in the recent years. This has resulted in extensive research on dynamic power management strategies as well as data centre design and placement. The main problem with most of the proposed or existing approaches is that they do not fully take the distributed nature of and strong logical dependencies between executed services into account. However, without a comprehensive knowledge of the wider relationships between services, local power management strategies may be ineffectual or can even result in high aggregate energy cost. Understanding this relationship is useful for fine-grained energy-aware computing. For example, services that run on underutilised servers can be stopped or seamlessly migrated to other servers, so that the underutilised servers can be turned off. Alternatively, a re-binding process can be used if the cost of service migration is high. Such advantages can be fully exploited if the dependency between services is properly understood and meaningfully modelled. This paper introduces a conceptual architecture for an energy-aware service execution platform and compares three optimisation mechanisms to support dynamic service migration and rebinding.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"22 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":"126718904","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

Performance evaluation of the inter-domain communication in a switched Ethernet based in-car network 基于交换以太网的车载网络域间通信性能评价

2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115156

Hyung-Taek Lim, Benjamin Krebs, L. Völker, Peter Zahrer

引用次数: 26

Probability of handoff for users moving with the Random Waypoint mobility model 使用随机路径点移动模型移动的用户切换概率

2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115183

E. Zola, F. Barceló

引用次数: 7

Performance comparison of BER-based routing protocols under realistic conditions 基于ber的路由协议在现实条件下的性能比较

2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115203

Tiguiane Yélémou, J. Ledy, B. Hilt, A. Poussard, P. Meseure

引用次数: 5

Enhancing the security of mobile health monitoring systems through trust negotiations 通过信任谈判增强移动健康监测系统的安全性

2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115545

M. Elkhodr, S. Shahrestani, Hon Cheung

引用次数: 13

A conditional retransmission enabled transport protocol for real-time networked control systems 一种用于实时网络控制系统的条件重传传输协议

2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115196

Li Gui, Yu-Chu Tian, C. Fidge

引用次数: 6

Shibboleth based Authentication, Authorization, Accounting and Auditing in Wireless Mesh Networks 无线网状网络中基于Shibboleth的认证、授权、计费和审计

2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115572

Eryk Schiller, A. Monakhov, P. Kropf

引用次数: 3