2006 International Symposium on Computer Networks最新文献

筛选
英文 中文
Parallel performance of DES in ECB mode DES在ECB模式下的并行性能
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662522
E. Cankaya, Jean Davidson, Colin Kern
{"title":"Parallel performance of DES in ECB mode","authors":"E. Cankaya, Jean Davidson, Colin Kern","doi":"10.1109/ISCN.2006.1662522","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662522","url":null,"abstract":"This study presents the design and implementation of DES encryption in ECB (electronic codebook) mode under three different parallelization schemes. The first method we suggest is block based, where 64-bit blocks of text are distributed among the parallel processors. The second approach is pipeline based, where we parallelize each of the 16 internal rounds of DES. The third parallelization scheme is plaintext based which divides the plaintext into equal partitions first and then assigns the 64-bit blocks of each partition to parallel processors. We obtained runtime performances for each parallelization. To observe whether the source language has an effect on the overall performance, we run our algorithm on text from 5 different languages as English, French, German, Spanish and Turkish","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"335 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127574383","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}
引用次数: 6
Reactive vs proactive protocol: a comparative study between two localization approaches of mobile codes in ad hoc mobile networks 被动与主动协议:自组织移动网络中两种移动代码定位方法的比较研究
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662505
Youcef Zafoune, A. Mokhtari
{"title":"Reactive vs proactive protocol: a comparative study between two localization approaches of mobile codes in ad hoc mobile networks","authors":"Youcef Zafoune, A. Mokhtari","doi":"10.1109/ISCN.2006.1662505","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662505","url":null,"abstract":"The mobile agents technology is promising in many fields of application, especially in the field of nomadic computer science. Mobility and the new mode of communication used in ad hoc mobile networks cause problems proper to a mobile environment. In this paper, we study the localization problem of mobile agents in ad hoc mobile networks; an object which has a double mobility is to be located, first, in relation to the mobility of its physical support in a dynamic environment, the station, and that of the code through the network stations. A comparative study, based upon a simulation, between two localization protocols that we have proposed in Y. Zafoune, (2004) show that, contrary to the expectation, the reactive approach outperforms the proactive approach","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126553797","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
Identification of prominent features of sensed processes in wireless sensor networks: a spatial interpolation based approach 无线传感器网络中感知过程的显著特征识别:基于空间插值的方法
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662515
Mohammad Assaf, D. Arifler
{"title":"Identification of prominent features of sensed processes in wireless sensor networks: a spatial interpolation based approach","authors":"Mohammad Assaf, D. Arifler","doi":"10.1109/ISCN.2006.1662515","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662515","url":null,"abstract":"Wireless sensor networks have received much attention due to their wide range of civilian and military application areas and technical challenges raised by their use. In this paper, we focus on environmental parameter monitoring applications of densely and randomly deployed sensors that are constrained in terms of power and communication bandwidth consumption, and storage costs. Our work involves processing sensed values from a subset of sensors at a central station (or \"sink\") to interpolate a sensed process over a field, and to a certain extent, approximately but efficiently locate and identify prominent feature areas such as flooded or polluted sites. For such applications, a sensor management algorithm is considered where sensors with the minimum Voronoi cell area are iteratively turned off to reduce resource consumption. The management algorithm is analyzed in terms of mean-square interpolation error of the sensed process, and compared to one that randomly turns off sensing devices. Extensive simulations demonstrate that the considered sensor management algorithm achieves less interpolation errors compared to the one based on random sensor turn-offs even when up to 90% of the sensing devices per unit area are turned off. A network connectivity metric, average sensor neighbor distance, is also proposed to assess the required radio range when designing sensing devices. Simulation results exhibit that, in the considered sensor management algorithm, the average sensor neighbor distance does not exceed 20% of the width of the sensed field even when up to 60% of the sensors per unit area are turned off. Therefore, significant resource savings can potentially be achieved without compromising too much transmission power for prominent feature identification applications in sensor networks","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121722228","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
A novel clustering algorithm for efficient energy saving in wireless sensor networks 一种新的无线传感器网络高效节能聚类算法
2006 International Symposium on Computer Networks Pub Date : 2006-06-16 DOI: 10.1109/ISCN.2006.1662510
O. Moussaoui, A. Ksentini, M. Naimi, A. Guéroui
{"title":"A novel clustering algorithm for efficient energy saving in wireless sensor networks","authors":"O. Moussaoui, A. Ksentini, M. Naimi, A. Guéroui","doi":"10.1109/ISCN.2006.1662510","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662510","url":null,"abstract":"Energy efficiency operations are essential in extending wireless sensor networks lifetime. Among the energy-saving-based solutions, clustering sensor nodes is an interesting alternative that features a reduction in energy consumption through: (i) aggregating data; (ii) controlling transmission power levels (iii) balancing load; (iv) putting redundant sensor nodes to sleep. This paper introduces a novel clustering algorithm that uses a distributed approach to set up non-overlapping clusters, while performing cluster heads rotation as well as carrying out other energy intensive tasks. Besides the transmission power and the energy level of each node, the proposed clustering algorithm considers nodes number that a cluster head can handle aiming at ideally partitioning the network. In fact, the nodes number constituting the cluster is confined around a pre-defined threshold, facilitating thus the optimal operation of the medium access control (MAC) protocol. Further, intending to reduce the computation and the communications cost as well as the messages exchanged, the proposed algorithm invokes the cluster formation only at the system activation, and delays as long as possible the cluster head turn over","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115042159","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}
引用次数: 21
An intrusion detection based approach for the scalable detection of P2P traffic in the national academic network backbone 一种基于入侵检测的国家学术网络骨干网P2P流量可扩展检测方法
2006 International Symposium on Computer Networks Pub Date : 2006-06-16 DOI: 10.1109/ISCN.2006.1662521
E. G. Schmidt, Murat Soysal
{"title":"An intrusion detection based approach for the scalable detection of P2P traffic in the national academic network backbone","authors":"E. G. Schmidt, Murat Soysal","doi":"10.1109/ISCN.2006.1662521","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662521","url":null,"abstract":"The share of peer-to-peer (P2P) protocol in the total network traffic grows day-by-day in the Turkish academic network (UlakNet) similar to the other networks in the world. This growth is mostly because of the popularity of the shared content and the great enhancement in the P2P protocol since it first came out with Napster. The shared files are generally both large and copyrighted. Motivated by the problems of UlakNet with the P2P traffic, we propose a novel method for P2P traffic-detection in the network backbone in this paper. Observing the similarity between detecting traffic that belongs to a specific protocol and detecting an intrusion in a computer system, we adopt an intrusion detection system (IDS) technique to detect P2P traffic. Our method is a passive detection procedure that uses traffic flows gathered from border routers. Hence, it is scalable and does not have the problems of other approaches that rely on packet pay load data or transport layer ports","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132883186","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}
引用次数: 10
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学术官方微信
小红书