2008 33rd IEEE Conference on Local Computer Networks (LCN)最新文献

筛选
英文 中文
On selfish behavior using asymmetric carrier sensing in IEEE 802.11 wireless networks IEEE 802.11无线网络中使用非对称载波感知的自私行为研究
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664222
Eunho Yang, Jaehyuk Choi, Sunglim Lee
{"title":"On selfish behavior using asymmetric carrier sensing in IEEE 802.11 wireless networks","authors":"Eunho Yang, Jaehyuk Choi, Sunglim Lee","doi":"10.1109/LCN.2008.4664222","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664222","url":null,"abstract":"The IEEE 802.11 utilizes carrier sensing mechanism to support multiple users effectively with small number of collisions. However, if there are hidden nodes, IEEE 802.11 nodes suffer from consecutive collisions and experience extremely low throughput. Due to the nature of non-cooperative property, every 802.11 node tries to maximize its own throughput irrespective of total network performance. In this paper, we show that 802.11 node can achieve higher throughput by intentionally reducing its carrier sensing range in some cases. Based on simulations, we also show that adjusting carrier sense threshold may bring about undesirable Nash equilibrium in terms of total network performance in game-theoretical model.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127591447","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
A forwarding protocol with relay acknowledgement for vehicular ad-hoc networks 一种用于车载自组织网络的具有中继确认的转发协议
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664233
Inhyeok Jang, Wooyeol Choi, Hyuk Lim
{"title":"A forwarding protocol with relay acknowledgement for vehicular ad-hoc networks","authors":"Inhyeok Jang, Wooyeol Choi, Hyuk Lim","doi":"10.1109/LCN.2008.4664233","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664233","url":null,"abstract":"In vehicular ad-hoc networks (VANETs), mobility is one of key characteristics that have a significant effect on routing performance because it causes dynamic changes of network topology. In this paper, we propose a contention based forwarding protocol that exploits geographic or virtual location information. A node that is closer to the destination node has a higher priority in competing for the wireless channel, and forwards packets as a relay node earlier than other adjacent nodes. When a packet is forwarded by a relay node, its preceding node informs adjacent nodes that it has been already relayed to prevent duplication of packet delivery. Through ns-2 simulations, we show that the proposed scheme can significantly improve the network performance in terms of the packet delivery ratio and the end-to-end delay in various VANET scenarios.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116772558","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
Neighborhood aware power saving mechanisms for ad hoc networks 基于邻居感知的ad hoc网络节电机制
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664159
A. Belghith, Wafa Akkari
{"title":"Neighborhood aware power saving mechanisms for ad hoc networks","authors":"A. Belghith, Wafa Akkari","doi":"10.1109/LCN.2008.4664159","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664159","url":null,"abstract":"Due to their mobility, stations in ad hoc networks are equipped with autonomous batteries providing limited resources of energy. Thus power conservation proves to be a paramount factor to increase the network lifespan. A closer look at the mechanism of IEEE 802.11 PSM and all its numerous derivative proposals enables us to see some room for further improvements especially for large and dense cluster based networks. This paper presents an optimization of the functional properties of PSM to improve its energy conservation without changing or requiring additional control or management frames, yet it contributes to the betterment of all PSM derivatives especially for those based on a dynamic announcement window such as the Dynamic Carrier Sense DCS-PSM. PSM specifies that a station must announce its traffic before. The announcement traffic puts a heavy constraint on the size of both the ATIM period and the beacon interval and consequently on throughput, end to end delay and power saving. The proposed Neighborhood Aware Power Saving Mechanisms (NA-PSM and NTA-PSM) aim at reducing the number of exchanged announcement frames in order to increase the throughput and decrease both power consumption and delay. Simulation results testified to the superiority of NTA-PSM over PSM and the Dynamic Carrier Sense PSM (DCS-PSM) in ensuring greater power saving, higher throughput and lower delay.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114353803","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
Range queries and load balancing in a hierarchically structured P2P system 层次结构P2P系统中的范围查询和负载平衡
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664148
S. Rieche, Bui The Vinh, Klaus Wehrle
{"title":"Range queries and load balancing in a hierarchically structured P2P system","authors":"S. Rieche, Bui The Vinh, Klaus Wehrle","doi":"10.1109/LCN.2008.4664148","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664148","url":null,"abstract":"Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, are used more and more for file-sharing and content distribution applications. However, a major weakness of traditional DHTs is the search for stored content, as data is assigned to nodes based on hash functions, and the very nature of hash tables allows only exact pattern matches. We present Cerco, a solution for the problem of range queries by using the principles of order-preserving DHTs and a hierarchically structured P2P approach. To guarantee an efficient routing and load balancing, Cerco uses a dynamic hierarchy of DHTs by creating subrings on demand and two explicit load balancing strategies. Our evaluation shows that Cerco is able to achieve the goals of supporting range queries, logarithmic-hop routing, and efficient load balancing.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131129714","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
A performance study of scheduling algorithms in Point-to-Multipoint WiMAX networks 点对多点WiMAX网络调度算法的性能研究
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664291
Pratik Dhrona, N. Abuali, H. Hassanein
{"title":"A performance study of scheduling algorithms in Point-to-Multipoint WiMAX networks","authors":"Pratik Dhrona, N. Abuali, H. Hassanein","doi":"10.1109/LCN.2008.4664291","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664291","url":null,"abstract":"The IEEE 802.16 standard, which includes specification for the medium access control (MAC) and physical (PHY) layers, was designed to handle the requirements of different contemporary applications with diverse QoS requirements. IEEE 802.16 standard is equipped with signaling and bandwidth allocation algorithms that can accommodate many connections with a variety of QoS requirements at one subscriber station (SS). The connections may be varied in their bandwidth and latency requirements, so several researchers proposed an IEEE 802.16 schedulers with different objectives to provide for wireless resource allocations over a different range of traffic models. In this paper, we conduct a comprehensive performance study of scheduling algorithms in Point to multipoint mode of WiMAX. We first make a classification of WiMAX scheduling algorithms, then simulate a representative number of algorithms in each class taking into account the characteristics of the IEEE 802.16 standard. We evaluate the algorithms with respect to their abilities to support multiple classes of service, providing quality of service (QoS) guarantees, fairness amongst service classes and bandwidth utilization. To the best of our knowledge, no such comprehensive performance study has been reported in the literature. Simulation results indicate that none of the current algorithms is capable of effectively supporting all WiMAX classes of service. We demonstrate that an efficient, fair and robust scheduler for WiMAX is still an open research area. We conclude our study by making recommendations that can be used by WiMax protocol designers.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126895347","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}
引用次数: 46
A hybrid MAC with prioritization for wireless sensor networks 无线传感器网络中具有优先级的混合MAC
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664180
I. Slama, Bharat Shrestha, B. Jouaber, D. Zeghlache
{"title":"A hybrid MAC with prioritization for wireless sensor networks","authors":"I. Slama, Bharat Shrestha, B. Jouaber, D. Zeghlache","doi":"10.1109/LCN.2008.4664180","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664180","url":null,"abstract":"This paper introduces I-MAC, a new medium access control protocol for wireless sensor networks. I-MAC targets at improving both channel utilisation and energy efficiency while taking into account traffic load for each sensor node according to its role in the network. I-MAC reaches its objectives through prioritized and adaptive access to the channel. I-MAC performances obtained through simulations for different network topologies, scenarios and traffic loads show significant improvements in energy efficiency, channel utilization, loss ratio and delay compared to existing protocols.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129931165","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
A Tag Prediction Algorithm using Upper Bit in RFID systems RFID系统中基于上位的标签预测算法
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664238
Sung Soo Kim, Yong Hwan Kim, S. Lee, Kyung-Ho Chung, K. Ahn
{"title":"A Tag Prediction Algorithm using Upper Bit in RFID systems","authors":"Sung Soo Kim, Yong Hwan Kim, S. Lee, Kyung-Ho Chung, K. Ahn","doi":"10.1109/LCN.2008.4664238","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664238","url":null,"abstract":"In RFID (Radio Frequency IDentification) system, the reader needs the anti collision algorithm for fast identifying all of the tags in the interrogation zone. This paper proposes the tree based Tag Prediction Algorithm using Upper Bit (TPAUB) to arbitrate the tag collision. A TPAUB can identify tags without identifying all the bits in the tag ID. The reader uses the upper bit which is added to the tag ID and if there are two collided bits or multiple collided bits, it checks the upper bit and grasps the number the number of identified dasia1psilas. A TPAUB can reduce the number of the requests transmitted from the reader, thus it shortens the time of identifying all of the tags in the interrogation zone.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"2007 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114203864","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
Spatially Disjoint Multipath Routing protocol without location information 没有位置信息的空间不相交多路径路由协议
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664241
J. J. Galvez, P. M. Ruiz, A. Gómez-Skarmeta
{"title":"Spatially Disjoint Multipath Routing protocol without location information","authors":"J. J. Galvez, P. M. Ruiz, A. Gómez-Skarmeta","doi":"10.1109/LCN.2008.4664241","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664241","url":null,"abstract":"Multipath routing permits the discovery and use of multiple paths between a source and a destination. We develop a distributed on-demand multipath routing protocol for MANETs capable of finding spatially disjoint paths without location information. The use of spatially disjoint routes in multipath routing is important due to the non-interfering nature of the paths. This enables applications such as load-balancing, bandwidth aggregation, secure communications and multimedia transmission. Most of the proposed multipath protocols for MANETs focus on reliability and are not adequate for these types of applications because of route coupling between alternate paths. We propose Spatially Disjoint Multipath Routing (SDMR) protocol, capable of finding multiple paths in one route discovery, measuring the distance between them and choosing paths with most separation. SDMR is evaluated through simulation.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133347439","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
Priority interrupts of Duty Cycled communications in wireless sensor networks 无线传感器网络占空比通信的优先中断
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664274
Tony O'Donovan, J. Benson, U. Roedig, C. Sreenan
{"title":"Priority interrupts of Duty Cycled communications in wireless sensor networks","authors":"Tony O'Donovan, J. Benson, U. Roedig, C. Sreenan","doi":"10.1109/LCN.2008.4664274","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664274","url":null,"abstract":"FrameComm is a contention based, duty cycled, MAC protocol that ensures a message will be transmitted during the receiverpsilas listen phase by sending a packet, followed by a short gap, repeatedly for a precalculated number of times or until an acknowledgment is received. While introducing duty cycled communications can yield large power savings it does so at the cost of increased delay and decreased throughput. Many WSNs may incorporate several distinct message types of varying priority. A node with a high priority message to send may find the channel to be busy with a lesser priority message from another node and must therefore dasiaback-offpsila leading to further delays. In a multi-hop environment, these delays are compounded and may become unacceptably large. This paper proposes adding a high priority interrupt message to FrameComm that allows a node with important data to send to interrupt another nodepsilas lesser priority transmission giving immediate access to the channel. The priority interrupt mechanism is evaluated using an implementation in TinyOS 2 on a small laboratory testbed.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"138 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132227053","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
A weighted RED for alleviating starvation problem in wireless mesh networks 一种减轻无线网状网络饥饿问题的加权RED
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664290
Chaegwon Lim, Chong-Ho Choi, Hyuk Lim
{"title":"A weighted RED for alleviating starvation problem in wireless mesh networks","authors":"Chaegwon Lim, Chong-Ho Choi, Hyuk Lim","doi":"10.1109/LCN.2008.4664290","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664290","url":null,"abstract":"In wireless mesh networks, the end-to-end throughput of a flow over a multiple-hop wireless link rapidly decreases as the hop-count between the source and destination nodes increases, and the flows that travel over a path of more than 4-5 hops from its source node eventually starve. To alleviate this unfairness, we propose a weighted random early detection (RED) mechanism that has a different dropping preference according to the hop-count information. When the network is congested, it forwards packets that come from a farther source node with a higher priority. Through extensive simulations, we show that the proposed queue management policy can improve the fairness performance effectively and alleviate the starvation problem in multihop wireless networks.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129571109","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学术官方微信