{"title":"Performance of opportunistic scheduling schemes for MIMO-OFDM wireless LANs","authors":"M. Gidlund, P. Åhag","doi":"10.1109/LCN.2008.4664226","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664226","url":null,"abstract":"In this paper, we propose and investigate scheduling algorithms for multiple-input multiple-output (MIMO) wireless local area networks (WLANs) based on <i>orthogonal</i> <i>frequency</i> <i>division</i> <i>multiplexing</i> (OFDM). We propose two new scheduling approaches which combines the channel states with queue states. The obtained results show that the proposed schemes outperform well known schemes such as <i>proportional</i> <i>fair</i> (PF) and <i>shortest</i> <i>remaining</i> <i>processing</i> <i>time</i> (SRPT) in terms of throughput and fairness.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"32 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":"127114023","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}
{"title":"Channel assignment and scheduling in multichannel wireless sensor networks","authors":"Yuanyuan Zeng, N. Xiong, Tai-hoon Kim","doi":"10.1109/LCN.2008.4664215","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664215","url":null,"abstract":"We develop a novel collision-free channel assignment and scheduling mechanism (CFCS) for multichannel wireless sensor networks. Firstly, each node is assigned with a quiescent channel to reduce hidden terminal beforehand and then it makes channel adjustment according to dynamic traffic. Secondly, a scalable multichannel scheduling is designed to make a tradeoff between overhead and fairness. We have implemented simulation to evaluate the performance of CFCS by comparing with other relevant protocols. The results show that our protocol exhibits more prominent ability, which utilizes multichannel to make parallel transmission and reduce hidden terminal problems effectively in resource-constrained wireless sensor networks.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"10 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":"129649500","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}
{"title":"Decision process for automated selection of security protocols","authors":"L. Völker, C. Werle, M. Zitterbart","doi":"10.1109/LCN.2008.4664173","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664173","url":null,"abstract":"Todaypsilas Internet has a growing number of protocols and mechanisms to protect data in transmission. One can choose from IP Security (IPsec), Transport Layer Security (TLS), and many other protocols. However, available security protocols and mechanisms are not widely used due to usability issues [1], [2] and because users often underestimate the risk their data is exposed to. An approach to solve this problem consists of automated selection and configuration of available security protocols in a user-transparent way. In this paper, we present a method for automatically choosing the right security protocol based on Security, Quality of Service, and Energy Consumption aspects. We describe the necessary aspects, value functions, and a hierarchical, flexible, and efficient decision process.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"169 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":"115758372","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}
Dongsheng Peng, Weidong Liu, Chuang Lin, Zhen Chen, Jiaxing Song
{"title":"A loosely synchronized gossip-based algorithm for aggregate information computation","authors":"Dongsheng Peng, Weidong Liu, Chuang Lin, Zhen Chen, Jiaxing Song","doi":"10.1109/LCN.2008.4664203","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664203","url":null,"abstract":"Many P2P applications necessitate statistics aggregate computation of certain information among all individual peers. In contrast to methods of constructing aggregation tree, centralized computing and flooding, gossip-based mechanism has the advantages of good robustness and moderate communication and computing costs. Most algorithms of this type perform aggregate computation recursively on successive time slots called rounds. They require rounds to be globally synchronous on all the nodes, which complicates the algorithm realization. To eliminate the requirement for global round synchronization, we propose a loosely synchronized algorithm to compute global statistic average based on random event triggering mechanism, and prove that the convergence time is O(logN)tau. We then propose a robust method to estimate the number of peers in the network based on this algorithm. Finally, a framework is proposed to generalize the computation of SUM, AVG, MAX, MIN, and CNT(N).","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":"130916788","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}
{"title":"Self-adjusting scheme for high speed routers","authors":"Nizar Ben Neji, A. Bouhoula","doi":"10.1109/LCN.2008.4664229","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664229","url":null,"abstract":"Many schemes of high-performance IP address lookup have been proposed recently. But most of them do not process dynamically the packets and give no specific interest in the skewness of the traffic. Hence, the lack of dynamic packet routing algorithms has been the motivation for this research. In this paper, we have conceived a self-adjusting tree filter, by combining the scheme of binary search on prefix length with the splay tree model. Consequently, we have at most 2 hash accesses for all consecutive values. We give also a special interest in the amount of packets treated then routed through the default route entry. Those packets present an important part of the traffic treated by the routers and they might cause more harm than others as they traverse a long decision path before they are finally sent to the default route.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"39 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":"131276678","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}
B. Al-Manthari, N. Nasser, N. Abuali, H. Hassanein
{"title":"Efficient bandwidth management in Broadband Wireless Access Systems using CAC-based dynamic pricing","authors":"B. Al-Manthari, N. Nasser, N. Abuali, H. Hassanein","doi":"10.1109/LCN.2008.4664208","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664208","url":null,"abstract":"While the demand for mobile broadband wireless services continues to increase, radio resources remain scarce. Even with the substantial increase in the supported bandwidth in next generation Broadband Wireless Access Systems (BWASs), it is expected that these systems will severely suffer from congestion due to the rapid increase in demand of bandwidth intensive applications. Without efficient bandwidth management and congestion control schemes, network operators may not be able to meet the increasing demand of users for multimedia services, and hence they may suffer immense amount of revenue loss. In this paper, we propose an admission-level bandwidth management scheme consisting of Call Admission Control (CAC) and dynamic pricing. The main aim of our proposed scheme is to provide monetary incentives to users to use the wireless resources efficiently and rationally, hence, allowing efficient bandwidth management at the admission level. By dynamically determining the prices of units of bandwidth, the proposed scheme can guarantee that the arrival rates to the system are less than or equal to the optimal ones computed dynamically, hence, guaranteeing a congestion-free system. Simulation results show the effectiveness and strengths of our proposed approach.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"2016 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":"128113316","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}
H. Widiger, S. Kubisch, P. Danielis, J. Schulz, D. Timmermann, T. Bahls, D. Duchow
{"title":"IPclip: An architecture to restore Trust-by-Wire in packet-switched networks","authors":"H. Widiger, S. Kubisch, P. Danielis, J. Schulz, D. Timmermann, T. Bahls, D. Duchow","doi":"10.1109/LCN.2008.4664185","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664185","url":null,"abstract":"During the last decades, the Internet has steadily developed into a mass medium. The target group radically changed compared to, e.g., the 90s. Because virtually everyone has access to the Internet, threats due to insecurity and anonymity reach critical levels and have to be tackled by both carriers and Internet Service Providers. Regaining trust-by-wire, comparable to classic fixed line telephones, could mitigate or even solve problems like Spam, Phishing, and the localization of VoIP emergency calls. This paper presents the hardware implementation of a new and highly flexible solution-Internet protocol-calling line identification presentation-which provides additional support for new services to restore peoplepsilas confidence into the Internet. Supported services are VoIP emergency calls, Spam detection and prevention, and phishing prevention. Already in the access network, the hardware adds unambiguous location information on the packetpsilas origin to IP packets. We document the hardware design of the solution. Furthermore, hardware consumption and performance of a prototype are presented.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"135 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":"124208172","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}
{"title":"A service-differentiated real-time communication scheme for wireless sensor networks","authors":"Yuyan Xue, B. Ramamurthy, M. Vuran","doi":"10.1109/LCN.2008.4664276","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664276","url":null,"abstract":"Supporting end-to-end real-time communication is important for wireless sensor networks (WSNs) to acomplish the collaborative sensing tasks with specific timing constraints. However, without considering the unique constraints for WSNs, many existing real-time communication protocols prove to be infeasible for low-cost WSNs. In this paper, we propose a novel real-time communication scheme (RCS) to provide service-differentiated soft real-time guarantees for end-to-end communication in WSNs. We use hop-based geographic grouping to enable location awareness for sensor nodes with extremely low control overhead.We use dynamic forwarding with load-balanced receiver contention to provide a light-weight, yet efficient, routing technique, which can be easily adapted for duty cycle design. We use polling contention period based real-time MAC support to improve the service-differentiation granularity with better bandwidth utilization. The performance evaluation shows that our scheme can achieve low end-to-end latency, high on-time delivery ratio, fine services-differentiation granularity with load-balance for real-time traffic in unsynchronized low-cost WSNs.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"28 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":"122713195","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}
Eugene Pamba Capo-Chichi, H. Guyennet, J. Friedt, I. Johnson, Craig Duffy
{"title":"Design and implementation of a generic hybrid wireless sensor network platform","authors":"Eugene Pamba Capo-Chichi, H. Guyennet, J. Friedt, I. Johnson, Craig Duffy","doi":"10.1109/LCN.2008.4664289","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664289","url":null,"abstract":"There exist several platforms of wireless sensor networks. Each of them has specific characteristics, such as hardware and software architecture, for example a processing unit, RAM memory, wireless technology. The complexity of novel applications and the number of existing platforms have resulted in the design of hybrid wireless sensor networks. In this paper, we describe the architecture and implementation of a hybrid wireless sensor networks based on the Tmote sky sensor and Fox board platform. They use IEEE 802.15.4/ZigBee and Bluetooth respectively. The paper presents a new model of sensor network which is a mixture of the both previous platforms using only IEEE 802.15.4 wireless technology. We have also compared IEEE 802.15.4 and Bluetooth. In this work, a generic platform of wireless sensor networks with several levels of sensors is presented.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"5 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":"124911542","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}
{"title":"Probabilistic packet dropping for load control in multihop wireless networks","authors":"Daewon Jung, Hyuk Lim","doi":"10.1109/LCN.2008.4664217","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664217","url":null,"abstract":"In multihop wireless networks, packets of a traffic flow originating from a source node are relayed by intermediate nodes (relay nodes) and travel toward their destination node along a multihop wireless path. If a source node transmits excessive packets at a high rate, its relay node may not have enough channel access opportunities to forward them, resulting in a significant throughput decrease on an end-to-end perspective of multihop path. In this paper, we propose a probabilistic packet dropping scheme that regulates the traffic load offered by source nodes and reduces their interference with neighboring relay nodes on the multihop paths. Through ns-2 simulations, we show that the proposed scheme can significantly improve the end-to-end throughput performance without exploiting topological information under chain and cross topologies.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"- - 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":"123624906","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}