2010 European Wireless Conference (EW)最新文献_第6页

An efficient Recursive Inverse adaptive filtering algorithm for channel equalization 一种有效的信道均衡递归逆自适应滤波算法

2010 European Wireless Conference (EW) Pub Date : 2010-04-12 DOI: 10.1109/EW.2010.5483397

Mohammad Shukri Ahmad, O. Kukrer, A. Hocanin

引用次数: 19

Protection and fairness oriented cognitive radio MAC protocol for ad hoc networks (PROFCR) 面向保护和公平的ad hoc网络认知无线电MAC协议

2010 European Wireless Conference (EW) Pub Date : 2010-04-12 DOI: 10.1109/EW.2010.5483429

B. Kahraman, F. Buzluca

{"title":"Protection and fairness oriented cognitive radio MAC protocol for ad hoc networks (PROFCR)","authors":"B. Kahraman, F. Buzluca","doi":"10.1109/EW.2010.5483429","DOIUrl":"https://doi.org/10.1109/EW.2010.5483429","url":null,"abstract":"Spectrum scarcity and underutilized frequency bands are the most challenging wireless networking problems in the last decade. Cognitive radio (CR) is the promising solution for these two problems. We propose a protection and fairness oriented cognitive radio MAC protocol (PROFCR) for ad hoc networks. PROFCR allows secondary users (SU) to utilize the unused and underutilized frequency bands while bounding the harm against the QoS of primary users (PU). An important advantage of PROFCR is that it completely eliminates the spectrum sensing process. Each SU decides next operating channel by calculating state variables of channels using only local information. Instead of choosing another data channel after each collision, PROFCR tries to utilize the same data channel until a state variable reaches the limit. This process reduces the number of handovers and decreases the delays that arise from changing channels frequently. The proposed protocol includes three protection schemes, which limit the harm caused by SUs against the QoS of PUs. These protection schemes are: limiting the packet size of SUs, assigning larger congestion window size to SUs that compete for channel resources with PUs, and requiring SUs to wait before attempting to access the channel. We have created a discrete time simulator to analyze the efficiency of the proposed protocol. The simulation results indicate that PROFCR utilizes the spectrum holes efficiently while protecting primary transmission.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127945356","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 case for mobility- and traffic-driven routing algorithms for wireless access mesh networks 无线接入网状网络的移动性和流量驱动路由算法的案例

2010 European Wireless Conference (EW) Pub Date : 2010-04-12 DOI: 10.1109/EW.2010.5483501

B. Nazari, S. Wen

引用次数: 2

Scheduling and resource allocation in OFDM and FBMC systems: An interactive approach and performance comparison OFDM和FBMC系统的调度和资源分配:一种交互方法和性能比较

2010 European Wireless Conference (EW) Pub Date : 2010-04-12 DOI: 10.1109/EW.2010.5483515

Qing Bai, N. Passas, J. Nossek

引用次数: 7

An improvement of collision probability in biased birthday attack against A5/1 stream cipher 针对A5/1流密码的偏差生日攻击中碰撞概率的改进

2010 European Wireless Conference (EW) Pub Date : 2010-04-12 DOI: 10.1109/EW.2010.5483496

H. Kourkchi, Hamidreza Tavakoli, M. Naderi

{"title":"An improvement of collision probability in biased birthday attack against A5/1 stream cipher","authors":"H. Kourkchi, Hamidreza Tavakoli, M. Naderi","doi":"10.1109/EW.2010.5483496","DOIUrl":"https://doi.org/10.1109/EW.2010.5483496","url":null,"abstract":"A5/1 is the strong version of the encryption algorithm on GSM (Global System for Mobile communications) used in many countries. It is constructed of a combination of three LFSRs (Linear Feedback Shift Registers) with irregular clocking manner. One of the most practical attacks against this algorithm is time-memory trade-off attack, which is based on birthday paradox. The goal of this attack is to find any intersection between precomputed LFSRs states set and set of states generating the output bits in the actual execution of the algorithm. In order to increase feasibility of this attack, the biased birthday attack was introduced. In this attack special states producing a specific pattern in output bits are sampled and only a fraction of the special states with higher probability of occurrence are stored. By using a 16-bit pattern of data there are 248 parallelizable preparation stages. This attack requires about 150 GB of memory and two minutes of conversation. Under these conditions, the probability of collision is about 0.61. In this paper an improvement in the collision probability is introduced without changing the available memory capacity and duration of conversation. Our approach is based on using multiple data patterns instead of using a single one. This approach leads to increment of the preprocessing and the collision probability. It is shown that there is a trade-off between the collision probability and the preprocessing complexity.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114735229","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

Joint discovery in wireless networks 无线网络的联合发现

2010 European Wireless Conference (EW) Pub Date : 2010-04-12 DOI: 10.1109/EW.2010.5483508

Alberto Vigato, L. Vangelista, C. Méasson, Xinzhou Wu

{"title":"Joint discovery in wireless networks","authors":"Alberto Vigato, L. Vangelista, C. Méasson, Xinzhou Wu","doi":"10.1109/EW.2010.5483508","DOIUrl":"https://doi.org/10.1109/EW.2010.5483508","url":null,"abstract":"Given a wireless network with N nodes located uniformly at random on a finite plane, we consider the problem of distributed peer discovery: all nodes want to discover as many other nodes as possible. We assume that there are a total of K physical resources dedicated for the discovery purpose. Each node can pick one resource to transmit its node identifier on, and can receive on the remaining K -1 resources. We assume that node identifiers are broadcast via coded transmission on one single physical resource using a single hop. This paper addresses link level strategies to maximize the average number of discovered devices when K <;<; N. A classical strategy of decoding one node per resource would lead to a maximum of K -1 nodes being discovered. We observe that typically this number is much lower (~K/2). We focus on n-user joint coding schemes to improve this performance and, more particularly, on joint iterative decoding (JID). It is shown through system simulations that JID may gain by significantly more than 100% over the classical single-user decoding, and by 20-25% over interference cancellation, provided that the number n of jointly decoded identifiers matches the actual interference density.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127315691","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

Secret key agreement on wiretap channel with transmitter side information 基于发送方信息的窃听信道密钥协议

2010 European Wireless Conference (EW) Pub Date : 2010-04-12 DOI: 10.1109/EW.2010.5483458

A. Khisti

引用次数: 14

Utility-based power control via convex pricing for the uplink in CDMA wireless networks 基于效用的CDMA无线网络上行链路凸定价功率控制

2010 European Wireless Conference (EW) Pub Date : 2010-04-12 DOI: 10.1109/EW.2010.5483417

Eirini-Eleni Tsiropoulou, Georgios K. Katsinis, S. Papavassiliou

引用次数: 23

Spiderweb: A social mobile network Spiderweb:社交移动网络

2010 European Wireless Conference (EW) Pub Date : 2010-04-12 DOI: 10.1109/EW.2010.5483495

Antonio Sapuppo

{"title":"Spiderweb: A social mobile network","authors":"Antonio Sapuppo","doi":"10.1109/EW.2010.5483495","DOIUrl":"https://doi.org/10.1109/EW.2010.5483495","url":null,"abstract":"Social networking sites obtained a great success in the last years. Their popularity is related to changing lifestyles, where people increasingly look for new acquaintances or cultivate old friendships by means of the Internet, typically using a PC. Yet along with the rapidly increasing amount of mobile phone users, as well as the development of so-called smart phones, the possibility for creating similar services for mobiles arises. Importantly, the mobile phones are not just entry points to existing social networks with their centralized architectures; being mobile offers one more degree of freedom. However, mobile social network services are unquestionably limited by mobile phones weaknesses (e.g. small screen, keyboards), so several challenges are necessary to be addressed. Consequently, in this paper we analyze usability and user satisfaction of mobile social networks. Thus, a mobile social network application called Spiderweb is implemented and used as a test case. Spiderweb provides to the users an opportunity to make acquaintances, search for people on the basis of certain criteria, chat, view profiles of other users, and with numerous other possibilities. Yet the application not only offers the mobile phone users services similar to social networks available on the web. Spiderweb moves beyond this concept, also giving an opportunity to interact with other users through Bluetooth connectivity. Thus, the application enables establishment of spontaneous collaborative networks which are further explored and evaluated in this paper.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126374253","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}

引用次数: 34

Analysis on channel bonding/aggregation for multi-channel cognitive radio networks 多信道认知无线网络的信道键合/聚合分析

2010 European Wireless Conference (EW) Pub Date : 2010-04-12 DOI: 10.1109/EW.2010.5483492

Lei Jiao, V. Pla, F. Li

引用次数: 71