37th Annual IEEE Conference on Local Computer Networks最新文献

筛选
英文 中文
A context-aware cross-layer energy-efficient adaptive routing algorithm for WLAN communications 一种基于上下文感知的跨层节能自适应路由算法
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423600
Ruiqi Ding, Gabriel-Miro Muntean
{"title":"A context-aware cross-layer energy-efficient adaptive routing algorithm for WLAN communications","authors":"Ruiqi Ding, Gabriel-Miro Muntean","doi":"10.1109/LCN.2012.6423600","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423600","url":null,"abstract":"Smart phones have gained great popularity all around the world, supporting rich media applications with Internet connectivity. Since increasing number of people own powerful mobile devices, ad-hoc WLANs can be deployed in public areas part of heterogeneous networks environments, as flexible and inexpensive alternatives to infrastructure-based approaches. However, these mobile devices are powered by battery with limited energy budgets, which introduces big energy-related challenges in ad-hoc WLAN routing algorithm design. This paper proposes a context-aware cross-layer energy-efficient adaptive routing algorithm for WLAN communications (AWERA) that performs energy-efficient context differentiated routing in wireless communications. It introduces a cross layer self-learning solution that monitors the context of device usage, and takes routing decisions based on current energy-oriented context. Compared with other state-of-the-art wireless routing protocols, simulation results show both better performance and energy efficiency context-based differentiation.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134082735","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
Optimization trade-offs in the design of wireless sensor and actor networks 无线传感器和行动者网络设计中的优化权衡
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423675
Hyunbum Kim, J. Cobb
{"title":"Optimization trade-offs in the design of wireless sensor and actor networks","authors":"Hyunbum Kim, J. Cobb","doi":"10.1109/LCN.2012.6423675","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423675","url":null,"abstract":"Wireless sensor and actor networks (WSANs) are composed of static sensor nodes and mobile actor nodes. We assume actors have a random initial location in the two-dimensional sensing area. The objective is to move each actor to a location such that every sensor node is within a bounded number of hops from some actor. Because sensor nodes have limited energy, the new actor locations are chosen as to minimize the transmission range required from the sensor nodes. However, actors also have a limited (although larger) power supply, and their movement depletes their resources. It follows that by carefully choosing the new actor locations, the total actor movement can be minimized. In this paper, we study the trade-off between minimizing sensor transmission radius and minimizing actor movement. Due to the complexity of the problem, we introduce an optimal ILP formulation, and compare its results against a proposed heuristic. For the ILP solution to be feasible, we introduce a finite set of potential actor positions such that an optimal solution is guaranteed to be found within this set.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133241692","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
HydroNode: A low cost, energy efficient, multi purpose node for underwater sensor networks HydroNode:一种低成本、高能效、多用途的水下传感器网络节点
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423593
D. Pinto, Sadraque S. Viana, J. Nacif, L. Vieira, M. Vieira, A. Vieira, A. O. Fernandes
{"title":"HydroNode: A low cost, energy efficient, multi purpose node for underwater sensor networks","authors":"D. Pinto, Sadraque S. Viana, J. Nacif, L. Vieira, M. Vieira, A. Vieira, A. O. Fernandes","doi":"10.1109/LCN.2012.6423593","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423593","url":null,"abstract":"The research of underwater sensor networks (UWSNs) is gaining attention due to its possible applications in many scenarios, such as ecosystem preservation, disaster prevention, oil and gas exploration and freshwater reservoirs management. The main elements of a UWSN are underwater sensor nodes (UWNs). In this paper we present HydroNode: a low cost, energy efficient, multipurpose underwater sensor node (UWN). Nowadays, to the best of our knowledge, there is no UWNs that is simultaneously low cost, low power, able to couple diverse types of sensors and educationally available. Thus, the objective of this paper is to fill this gap by describing the design of HydroNode, an underwater sensor node that fulfill all these requirements and can be used in various UWSNs applications. We used only commercial off-the-shelf components to build our underwater sensor node. Due to its multipurpose design, HydroNode can be used in different UWSNs, therefore aiding the research of UWSN system protocols, configurations and applications.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124038800","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
Maximizing network lifetime via 3G gateway assignment in dual-radio sensor networks 在双无线电传感器网络中通过3G网关分配最大化网络寿命
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423664
Xu Xu, W. Liang, T. Wark, Jaein Jeong
{"title":"Maximizing network lifetime via 3G gateway assignment in dual-radio sensor networks","authors":"Xu Xu, W. Liang, T. Wark, Jaein Jeong","doi":"10.1109/LCN.2012.6423664","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423664","url":null,"abstract":"In this paper we consider a sensor network deployed far away from the base station. Each sensor in the network is equipped with two radio interfaces: the low-power IEEE 802.15.4 radio and the high-bandwidth 3G radio. The low-power radios are used on all sensors to transmit data within the network, while the high-bandwidth radios are activated only on a subset of sensors, referred to as gateways, for sending data to the base station. We assume that not all sensors are required to transmit their sensed data to the base station, yet the base station does have a network throughput requirement. A high throughput requirement would cause more energy consumption on sensors and shorten the network lifetime. We investigate the problem of maximizing the network lifetime subject to the network throughput being guaranteed and the data delivery latency from the network to the base station being bounded. We first formulate a novel optimization problem, namely, the throughput guaranteed network lifetime maximization problem. We then devise a heuristic for it, with the key ingredients of gateway assignment technique and energy-efficient routing forest establishment strategy. We finally conduct extensive experiments through simulation to evaluate the performance of the proposed heuristic and show that it outperforms another two algorithms in terms of network lifetime.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115265481","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
Flexible resource allocation for multicast in OFDMA based wireless networks OFDMA无线网络中多播资源的灵活分配
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423659
Xin Zhao, S. Jha
{"title":"Flexible resource allocation for multicast in OFDMA based wireless networks","authors":"Xin Zhao, S. Jha","doi":"10.1109/LCN.2012.6423659","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423659","url":null,"abstract":"This paper studies an efficient resource allocation scheme for multicast in OFDMA based wireless networks. Apart from the conventional resource allocation schemes for multicast which allocate exactly the same subcarriers to the users in a multicast group, this paper proposes a more flexible scheme to divide the multicast group members into different subgroups by utilising the diversity of channel coefficient of different users. We first formulate an optimisation problem to maximise the overall transmission rate. Given the NP-hardness of the problem, we design a low-complexity heuristic, Flexible Resource Allocation with Geometric programming (FRAG). FRAG is a two-step heuristic to subdivide the multicast groups and allocate resource to corresponding subgroups. In the first step, we propose a greedy algorithm to subdivide groups and allocate subcarriers given the assumption of even power distribution. Then we use geometric programming (GP) to solve the optimal power allocation problem. Numerical results show that FRAG is able to allocate subcarriers and power efficiently and effectively, and it achieves up to 33% improvement in aggregated throughput.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115733308","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
A secure monitoring and control system for Wireless Sensor Networks 一种安全的无线传感器网络监控系统
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423597
Michael Riecker, Rainer Thome, Dingwen Yuan, M. Hollick
{"title":"A secure monitoring and control system for Wireless Sensor Networks","authors":"Michael Riecker, Rainer Thome, Dingwen Yuan, M. Hollick","doi":"10.1109/LCN.2012.6423597","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423597","url":null,"abstract":"The maintenance of Wireless Sensor Networks (WSNs) can carry high or prohibitive costs, particularly, if the WSN is deployed in unattended areas. Secure monitoring and control of the WSN is vital, however, practical systems are rare and limited with respect to their capabilities. We present a monitoring and control system for WSNs that is secure and additionally equipped with intrusion detection functionality. It allows to reliably assess the actual status of the network, to configure the sensor nodes, and to further use this data to highlight suspicious events.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128353990","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
Performance evaluation of Sub 1 GHz wireless sensor networks for the smart grid 面向智能电网的Sub - 1ghz无线传感器网络性能评估
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423632
S. Aust, R. V. Prasad, I. Niemegeers
{"title":"Performance evaluation of Sub 1 GHz wireless sensor networks for the smart grid","authors":"S. Aust, R. V. Prasad, I. Niemegeers","doi":"10.1109/LCN.2012.6423632","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423632","url":null,"abstract":"Wireless communication in the sub 1GHz band is going to be one of the key enabler for the wireless smart grid. As part of the smart grid, home area networks (HAN) have to be reliable, robust, and secure. Frequency bands at 2.4 GHz are widely used, e.g., by Wi-Fi and ZigBee systems, but are highly congested. Frequency bands below 1 GHz, such as the ISM (industry, scientific and medical) 920/950MHz bands, offer less interfered wireless channels. There are few wireless transceivers available in the consumer market, which operate in the 950MHz ISM band. However, a thorough performance evaluation of the transmission characteristics is missing. We conducted a performance analysis of 950MHz transceivers which we deployed in a multi-node network setup to emulate a wireless HAN system. We contribute on details regarding the data rate of sub 1 GHz wireless sensors and the related error statistics. We discuss the transmission boundaries and investigate the optimal modulation schemes of sub 1GHz wireless sensors.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121515645","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
Efficient traffic flow measurement for ISP networks 针对ISP网络的高效流量测量
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423646
Qinghua Wu, Zhenyu Li, Jianhua Yang, Gaogang Xie, Kave Salamatian
{"title":"Efficient traffic flow measurement for ISP networks","authors":"Qinghua Wu, Zhenyu Li, Jianhua Yang, Gaogang Xie, Kave Salamatian","doi":"10.1109/LCN.2012.6423646","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423646","url":null,"abstract":"Traffic flow measurement is of great importance to ISPs for various network engineering tasks. An interesting problem is that how to determine the minimum number of links by monitoring which one can obtain the traffic flows of the whole ISP network. Previous works view the problem as Vertex Cover problem. They suffer from high time complexity and redundant monitoring. Different from these works, we study the problem from the perspective of edges and propose two models. The first model, Extended Edge Cover model, can determine the minimum set of monitored links, which are 30% less than that of previous works. The second model, shared-path model, is more suitable when the monitoring resources are limited but one still wants to measure a large part of the networks. Using this method, one can measure 85% of the network by monitoring 5% of links. Finally, we evaluate the performance of the two models through extensive simulations. The experimental results show the effectiveness and robustness of the two models.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121780312","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
LT-OLSR: Attack-tolerant OLSR against link spoofing LT-OLSR:抗链路欺骗的容攻击OLSR
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423612
Yuseok Jeon, Tae-Hyung Kim, Yuna Kim, Jong Kim
{"title":"LT-OLSR: Attack-tolerant OLSR against link spoofing","authors":"Yuseok Jeon, Tae-Hyung Kim, Yuna Kim, Jong Kim","doi":"10.1109/LCN.2012.6423612","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423612","url":null,"abstract":"Optimized Link State Routing is a routing protocol that has been extensively studied for mobile ad-hoc networks. Link spoofing, which disturbs the routing service, is one of the critical security problems related to the OLSR protocol. Existing approaches against link spoofing attack have several drawbacks. In this paper, we propose an LT-OLSR protocol that broadcasts Hello messages to neighbors within two-hops to defend networks against link spoofing attacks. Simulation and analysis results show that the LT-OLSR protocol tolerates link spoofing attacks extensively. The contributions presented in this paper are as follows: (1) We design a mechanism to ensure the integrity of a routing table. (2) In addition, our approach against link spoofing attack is not only extensive but also compact. (3) Finally, it can be practically implemented under various types of MANET environments.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123403396","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
Mobility based dynamic TXOP for vehicular communication 基于移动性的车辆通信动态TXOP
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423651
Hikmat El Ajaltouni, A. Boukerche, R. Pazzi
{"title":"Mobility based dynamic TXOP for vehicular communication","authors":"Hikmat El Ajaltouni, A. Boukerche, R. Pazzi","doi":"10.1109/LCN.2012.6423651","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423651","url":null,"abstract":"Due to the mobile nature of nodes comprising the vehicular networks in addition to interference and congested network traffic, the design of an efficient MAC network becomes challenging. Moreover, the latency constraints underlying safety application add complexity to this design. The TXOP (Transmit Opportunity) mechanism defined in the IEEE 802.11e is optimized to meet the requirements of a Multimedia Network (voice and audio) but not a vehicular network thus making it unsuitable to be used in a VANet environment. On the other hand, existing MAC algorithms for VANets are designed to overcome some challenges overlooking others. Hence, the merit of this paper lies in developing a MAC mechanism that incorporates in an integrated manner various VANet's challenges while modifying the 802.11e TXOP to meet vehicular conditions. In this work, we propose MoByToP (Mobility Based Dynamic TXOP for VANets). MoByToP is an enhancement mechanism added to the MAC layer to extend the operation of the medium reservation phase. The uniqueness of MoByToP lies in designing a dynamic TXOP to incorporate mobility and QoS (Quality of Service) while considering the transmit data rate of the source vehicle. The proposed protocol was implemented in OMNET++4.1 and extensive experiments demonstrated that the proposed MAC with MoByToP mechanism ensures the reception of QoS messages much faster, more efficient and reliable than existing VANet MAC protocols.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129420938","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
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学术官方微信