2012 5th International Conference on New Technologies, Mobility and Security (NTMS)最新文献

{"title":"Towards Strong Security in Embedded and Pervasive Systems: Energy and Area Optimized Serial Polynomial Multipliers in GF(2k)","authors":"Z. Dyka, P. Langendörfer, F. Vater, Steffen Peter","doi":"10.1109/NTMS.2012.6208710","DOIUrl":"https://doi.org/10.1109/NTMS.2012.6208710","url":null,"abstract":"In this paper we discuss a theoretical approach to do early assessment of the area and power consumption of hardware accelerators for elliptic curve cryptography. For evaluation we developed several different one clock multipliers as building block for the final serial multipliers. The former are evaluated concerning their efficiency in comparison to literature and the results of our assessment technique are compared with synthesis results. Since the application areas we are interested in are embedded systems, pervasive computing or wireless sensor networks we investigated serial multipliers in order to achieve reduced area and energy consumption compared to the single clock multipliers. Our evaluation clearly shows that our approach provides good hints to select well suited implementation candidates.","PeriodicalId":401320,"journal":{"name":"2012 5th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130692302","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":"Reliable and Scalable Distributed Hash Tables Harnessing Hyperbolic Coordinates","authors":"Telesphore Tiendrebeogo, Daouda Ahmat, D. Magoni","doi":"10.1109/NTMS.2012.6208677","DOIUrl":"https://doi.org/10.1109/NTMS.2012.6208677","url":null,"abstract":"Distributed hash tables (DHT) need to route requests in a scalable way. Although several solutions do exist, they often require nodes to connect to each others in a given way. Greedy routing schemes based on virtual coordinates taken from the hyperbolic plane have attracted some interest in recent years. Such schemes can be used for building distributed hash tables while letting the nodes connect to the others as they wish. In this paper, we define a new scalable and reliable DHT system based on the use of hyperbolic geometry. We provide a scalability analysis and we assess its efficiency by performing simulations. Results show that our DHT system brings more flexibility to the nodes while still being scalable and reliable in presence of churn.","PeriodicalId":401320,"journal":{"name":"2012 5th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"169 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120891265","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":"Power Consumption Analysis of the Always-Best-Connected User Equipment","authors":"Jari Kellokoski, Joonas Koskinen, T. Hämäläinen","doi":"10.1109/NTMS.2012.6208701","DOIUrl":"https://doi.org/10.1109/NTMS.2012.6208701","url":null,"abstract":"Mobile Internet has rapidly evolved in the past years with an ever increasing number of novel technologies and services with a variety of access technologies. Indeed, today's mobile devices often support multiple communication technologies for accessing Internet services. For users the accessing of these data hungry services means that the mobile device has to be charged more often. Energy efficiency in mobile device communication has been considered to be out of users hands. The concept of Always Best Connected (ABC) allows a person to connect applications using the devices and access technologies that best suit to his or her needs, thereby combining the features of access technologies to provide an enhanced user experience for future Internet. This Always Best Connected scenario can make mobile device more energy efficient by using always the most energy efficient connection. Mobile communication networks and connected devices consume a small fraction of the global energy supply. However, meeting the rapidly increasing demand for more capacity in wireless broadband access will further increase the energy consumption. For example Cisco Visual Networking Index: Global Mobile Data Traffic Forecast 2010-2015 expects compound annual growth rate of 92 percent during 2010 to 2015 Operators are now facing both investing in denser and denser networks as well as increased energy cost. Current cellular systems based on Universal Mobile Telecommunications System (UMTS) and Long Term Evolution (LTE) is characterized by high spectrum efficiency, but low energy efficiency. In urban areas as well as in homes and offices alongside cellular networks IEEE 802.11 (WLAN in this papers context) networks are available. In this heterogeneous network environment the communication energy efficiency can make significant difference when considering how often the user has to recharge the mobile device. In this article we analyze energy efficiency of Always-Best-Connected solution. The application is used in measurements in a various real-life use-cases. The results are showing that algorithm can improve overall energy efficiency without compromising the user experience.","PeriodicalId":401320,"journal":{"name":"2012 5th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131704050","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":"Energy Load Balancing for Fixed Clustering in Wireless Sensor Networks","authors":"Syed Amjad Ali, Cüneyt Sevgi","doi":"10.1109/NTMS.2012.6208703","DOIUrl":"https://doi.org/10.1109/NTMS.2012.6208703","url":null,"abstract":"Clustering can be used as an effective technique to achieve both energy load balancing and an extended lifetime for a wireless sensor network (WSN). This paper presents a novel approach that first creates energy balanced fixed/static clusters, and then, to attain energy load balancing within each fixed cluster, rotates the role of cluster head through uniformly quantized energy levels based approach to prolong the overall network lifetime. The method provided herein, not only provides near-dynamic clustering performance but also reduces the complexity due to the fact that cluster formation phase is implemented once. The presented simulation results clearly show the efficacy of this proposed algorithm and thus, it can be used as a practical approach to obtain maximized network lifetime for energy balanced clusters in fixed clustering environments.","PeriodicalId":401320,"journal":{"name":"2012 5th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132209272","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":"Phase Adjustment in HS-SFN for HSDPA","authors":"A. Puchko, M. Zolotukhin, V. Hytönen, T. Höhne, Thomas Chapman","doi":"10.1109/NTMS.2012.6208682","DOIUrl":"https://doi.org/10.1109/NTMS.2012.6208682","url":null,"abstract":"High Speed Single Frequency Network (HS-SFN) is one of the possible multi-cell transmission schemes for High-Speed Downlink Packet Access (HSDPA). This technique helps user equipments (UEs) in the softer handover area by combining signals from two neighbouring cells and also by reducing intercell interference. However, combining of two signals does not always have positive impact due to uncorrelated fast fading. This problem can be solved if the transmitted signals from the cells are adjusted such that the signals would arrive in phase. In this article the impact on HS-SFN is shown when phase adjustments are applied.","PeriodicalId":401320,"journal":{"name":"2012 5th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132023420","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":"Cluster-Directed Acyclic Graph Formation for IEEE 802.15.4 in Multihop Topologies","authors":"Bogdan Pavković, W. Hwang, Fabrice Théoleyre","doi":"10.1109/NTMS.2012.6208753","DOIUrl":"https://doi.org/10.1109/NTMS.2012.6208753","url":null,"abstract":"IEEE 802.15.4 represents the future standard for multihop Wireless Sensor Networks. However, this protocol is based on a cluster-tree which performs poorly in multihop. In the same way, scheduling the superframes to avoid collisions represents a key challenge. We propose here a simple greedy scheduling algorithm, integrated with the IEEE 802.15.4 MAC mechanisms. This scheduling permits to modify the Cluster-Tree into a Directed Acyclic Graph which reduces the delay while improving robustness, removing the single point of failure problem of the original structure. Simulations proved that these mechanisms permit to obtain an efficient MAC layer for multihop topologies.","PeriodicalId":401320,"journal":{"name":"2012 5th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115475898","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":"GlobeTraff: A Traffic Workload Generator for the Performance Evaluation of Future Internet Architectures","authors":"K. Katsaros, G. Xylomenos, George C. Polyzos","doi":"10.1109/NTMS.2012.6208742","DOIUrl":"https://doi.org/10.1109/NTMS.2012.6208742","url":null,"abstract":"Having identified important limitations of the current Internet architecture, several research initiatives have engaged in the design of new architectures for the Internet of the Future. New features and protocols are designed, and in many cases, a clean slate approach is followed, advocating the replacement of almost the entire current protocol stack. In order to reliably evaluate the performance of such emerging protocols and architectures, we need a realistic evaluation framework reflecting current and forecasted traffic patterns. This is especially important for the emerging information-centric paradigm, where in-network caching plays an important role and network performance is heavily dependent on traffic characteristics. To this end, we have designed and implemented GlobeTraff, a traffic workload generator for the creation of synthetic traffic mixes. GlobeTraff supports several application traffic types, generated via models in the recent research literature, allowing the detailed parameterization of the respective models and the composition of the resulting traffic mix.","PeriodicalId":401320,"journal":{"name":"2012 5th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"265 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124307569","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":"DBAS: A Deployable Bandwidth Aggregation System","authors":"Karim Habak, M. Youssef, Khaled A. Harras","doi":"10.1109/NTMS.2012.6208735","DOIUrl":"https://doi.org/10.1109/NTMS.2012.6208735","url":null,"abstract":"The explosive increase in data demand coupled with the rapid deployment of various wireless access technologies have led to the increase of number of multi-homed or multi-interface enabled devices. Fully exploiting these interfaces has motivated researchers to propose numerous solutions that aggregate their available bandwidths to increase overall throughput and satisfy the end-user's growing data demand. These solutions, however, have faced a steep deployment barrier that we attempt to overcome in this paper. We propose a Deployable Bandwidth Aggregation System (DBAS) for multi-interface enabled devices. Our system does not introduce any intermediate hardware, modify current operating systems, modify socket implementations, nor require changes to current applications or legacy servers. The DBAS architecture is designed to automatically estimate the characteristics of applications and dynamically schedule various connections or packets to different interfaces. Since our main focus is deployability, we fully implement DBAS on the Windows operating system and evaluate various modes of operation. Our implementation and simulation results show that DBAS achieves up to more than double the throughput gains compared to current operating systems, while operating as an out-of-the-box standard Windows executable, highlighting its deployability.","PeriodicalId":401320,"journal":{"name":"2012 5th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128264239","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":"Content-Aware Rate Control for Video Transmission with Buffer Constraints in Multipath Networks","authors":"M. Hajiesmaili, A. Sehati, A. Khonsari","doi":"10.1109/NTMS.2012.6208743","DOIUrl":"https://doi.org/10.1109/NTMS.2012.6208743","url":null,"abstract":"Being an integral part of the network traffic, nowadays it's vital to design robust mechanisms to provide QoS for multimedia applications. The main goal of this paper is to provide an efficient solution to support content-aware video transmission mechanism with buffer underflow avoidance at the receiver in multipath networks. Towards this, we introduce a content-aware time-varying utility function, where the quality impacts of video content is incorporated into its definition. Using the proposed utility function, we formulate a multipath Dynamic Network Utility Maximization (DNUM) problem for the rate allocation of video streams, where it takes into account QoS demand of video streams in terms of buffer underflow avoidance. Finally, using primal-dual method, we propose a distributed solution that optimally allocates the shared bandwidth to video streams. The numerical examples demonstrate the efficacy of the proposed content- aware rate allocation algorithm for video sources in both single and multiple path network models.","PeriodicalId":401320,"journal":{"name":"2012 5th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131514825","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":"Adaptive Probabilistic Flooding for Multipath Routing","authors":"C. Betoule, T. Bonald, R. Clavier, D. Rossi, Giuseppe Rossini, G. Thouénon","doi":"10.1109/NTMS.2012.6208696","DOIUrl":"https://doi.org/10.1109/NTMS.2012.6208696","url":null,"abstract":"In this work, we develop a distributed source routing algorithm for topology discovery, suitable for ISP transport networks, that is however inspired by opportunistic algorithms used in ad hoc wireless networks. We propose a plug-and-play control plane, able to find multiple paths toward the same destination, and introduce a novel algorithm, called adaptive probabilistic flooding, to achieve this goal. By keeping a small amount of state in routers taking part in the discovery process, our technique significantly limits the amount of control messages exchanged with flooding - and, at the same time, it only minimally affects the quality of the discovered multiple path with respect to the optimal solution. Simple analytical bounds, confirmed by results gathered with extensive simulation on several topologies (up to 10,000 nodes), show our approach to be of high practical interest.","PeriodicalId":401320,"journal":{"name":"2012 5th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132495286","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}