2006 International Conference on Systems and Networks Communications (ICSNC'06)最新文献

筛选
英文 中文
End-to-End Differentiation of Congestion and Wireless Losses using a Fuzzy Arithmetic based on Relative Entropy 基于相对熵的模糊算法的端到端拥塞和无线损耗的区分
Yong Li, Fang Su, Yinglei Fan, Huimin Xu
{"title":"End-to-End Differentiation of Congestion and Wireless Losses using a Fuzzy Arithmetic based on Relative Entropy","authors":"Yong Li, Fang Su, Yinglei Fan, Huimin Xu","doi":"10.1109/ICSNC.2006.35","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.35","url":null,"abstract":"This paper, according to the traditional transfer control protocol(TCP)exposures the performance decline in the wireless environment.. presents a formulation for aggregating opinions about the alternatives into a single consensus or compromise one. The approach which is used to derive the aggregation formula is minimum relative entropy inference. Based on the relative entropy, we introduce an end-to-end arithmetic. The main idea of our arithmetic is to regard the average packet loss ratio and RFD as two decision makers. Those two decision makers give opinions to the network status separately; utilize the principle of relative entropy to infer the best choice of the network status. Therefore, we can differentiate the character of losses using decision-making. Our simulation measurements suggest that this arithmetic can work well in differentiating losses and throughputs.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121414580","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}
引用次数: 2
Usage Control Requirements in Mobile and Ubiquitous Computing Applications 移动和普适计算应用中的使用控制需求
M. Hilty, A. Pretschner, C. Schaefer, T. Walter
{"title":"Usage Control Requirements in Mobile and Ubiquitous Computing Applications","authors":"M. Hilty, A. Pretschner, C. Schaefer, T. Walter","doi":"10.1109/ICSNC.2006.75","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.75","url":null,"abstract":"Usage control is concerned with control over data after its release to third parties, and includes requirements such as \"this data must be deleted after 30 days\" and \"this data may be used for statistical purposes only\". With the ultimate goal of respective policy languages that go beyond current technology for DRM of intellectual property, we provide (1) a catalog of requirements that are specific to the domains of mobile and ubiquitous computing applications, and (2) a classification of mobile and ubiquitous computing application scenarios that involve usage control, including a description of different kinds of involved data.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127498264","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}
引用次数: 20
Application Development in Vision-Enabled Wireless Sensor Networks 视觉无线传感器网络的应用开发
S. Hengstler, H. Aghajan
{"title":"Application Development in Vision-Enabled Wireless Sensor Networks","authors":"S. Hengstler, H. Aghajan","doi":"10.1109/ICSNC.2006.21","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.21","url":null,"abstract":"Wireless networks in combination with image sensors open up a multitude of previously unthinkable sensing applications. Capable tools and testbeds for these wireless image sensor networks can greatly accelerate development of complex, yet efficient algorithms that meet application requirements. In this paper, we introduce WiSNAP (Wireless Image Sensor Network Application Platform), a Matlab-based application development platform intended for wireless image sensor networks. It allows researchers and developers of such networks to investigate, design, and evaluate algorithms and applications using real target hardware. WiSNAP offers standardized and easy-to-use Application Program Interfaces (APIs) to control image sensors and wireless motes, which do not require detailed knowledge of the target hardware. Nonetheless, its open system architecture enables support of virtually any kind of sensor or wireless mote. Several application examples illustrate the usage of WiSNAP as a powerful development tool.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129999680","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}
引用次数: 26
Energy Aware Topology Management in Ad Hoc Wireless Networks Ad Hoc无线网络中的能量感知拓扑管理
T. Shivaprakash, G. Badrinath, K. Venugopal, L. Patnaik
{"title":"Energy Aware Topology Management in Ad Hoc Wireless Networks","authors":"T. Shivaprakash, G. Badrinath, K. Venugopal, L. Patnaik","doi":"10.1007/11947950_23","DOIUrl":"https://doi.org/10.1007/11947950_23","url":null,"abstract":"","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124374475","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}
引用次数: 12
A Real-time Secure Voice Communication System Based on Speech Recognition 基于语音识别的实时安全语音通信系统
Zongyuan Deng, Zhen Yang, Lixin Deng
{"title":"A Real-time Secure Voice Communication System Based on Speech Recognition","authors":"Zongyuan Deng, Zhen Yang, Lixin Deng","doi":"10.1109/ICSNC.2006.13","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.13","url":null,"abstract":"This paper proposes a scheme of real-time secure communication system based on information hiding and speech recognition. The algorithm uses speech recognition to reduce the bit-rate of secret speech greatly. Then we design an information hiding algorithm by adaptively choosing embedding locations and adopting the multi-nary modulation technique. Experimental results show that this algorithm has good imperceptibility and robustness against various interference (A-law/U-law compression, low-pass filtering, white noise, etc) when the speech is transmitted over the public switching telephone network (PSTN). This algorithm can be widely used in secure voice communication and fax systems.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124564179","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
Maintaining Coverage by Progressive Crystal-Lattice Permutation in Mobile Wireless Sensor Networks 移动无线传感器网络中渐进式晶体-晶格排列维持覆盖
Pang-Chieh Wang, Ting-Wei Hou, Ruei-Hong Yan
{"title":"Maintaining Coverage by Progressive Crystal-Lattice Permutation in Mobile Wireless Sensor Networks","authors":"Pang-Chieh Wang, Ting-Wei Hou, Ruei-Hong Yan","doi":"10.1109/ICSNC.2006.53","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.53","url":null,"abstract":"A new distributed algorithm, called Crystal-Lattice Permutation (CLP) algorithm, is devised to approach the coverage problem in wireless sensor networks. All nodes are assumed as mobile and run the same CLP algorithm in . An initial seed triggers six neighboring nodes to move to hexagon permutation positions, which is like the Crystal-Lattice formation process in nature. These chosen nodes then become new seeds to trigger other neighboring nodes. By such a progressive process, with initial and boundary conditions, the coverage is achieved. Comparing to the Virtual Force algorithm (VFA), the CLP algorithm needs fewer nodes and takes shorter average moving distance to achieve 100% coverage in random deployment. In simulation, the CLP algorithm deployed at least 60 nodes to achieve the 100% coverage, while the VFA algorithm required more than 100 nodes, under the same assumptions. The average moving distance for each CLP node was less than a half of the VFA node. In addition, as there are n mobile nodes, the number of CLP messages is proportional to n, while VFA is proportional to n2. The CLP algorithm is robust in fault tolerance when some nodes are error in distribution.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132387559","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}
引用次数: 22
A Multi-Layer Ubiquitous Middleware for Bijective Adaptation between Context and Activity in a Mobile and Collaborative learning 移动协同学习中上下文与活动双向适应的多层泛在中间件
J. Malek, M. Laroussi, A. Derycke
{"title":"A Multi-Layer Ubiquitous Middleware for Bijective Adaptation between Context and Activity in a Mobile and Collaborative learning","authors":"J. Malek, M. Laroussi, A. Derycke","doi":"10.1109/ICSNC.2006.4","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.4","url":null,"abstract":"In all learning scenarios and especially mobile and collaborative ones, the learner¿s context is an essential asset in designing the learning process. Researches in context aware mobile learning have concentrated on how to adapt applications to context. In this paper, we present an innovative approach for modeling a bijective adaptation between context and learning activities because they influence each others in learning processes. Furthermore, it proposes an ubiquitous middleware, a new multi-layer conceptual framework for building contextaware mobile learning systems. This framework supports tasks including: acquiring, interpreting, modeling, storing, reasoning, updating and adapting context. The originality of this framework comes especially from its top-most layer which is an adaptor that defines two classes of functionalities: the adaptation of learning activity to context and the adaptation of context to learning activity.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"431 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132027701","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}
引用次数: 25
Accelerating VOD Streaming with Adaptive Proxy- Assisted Scheduling, Caching and Patching 加速VOD流与自适应代理辅助调度,缓存和补丁
Li Zimu, Wu Jianping, Qin Shaohua
{"title":"Accelerating VOD Streaming with Adaptive Proxy- Assisted Scheduling, Caching and Patching","authors":"Li Zimu, Wu Jianping, Qin Shaohua","doi":"10.1109/ICSNC.2006.17","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.17","url":null,"abstract":"Delivering real-time VOD streaming media to a large number of users consumes significant amount of network bandwidth and server resources without scalability. Under a wireless content delivery network architecture, we study the bandwidth consumption of streaming multiple media objects from a VOD server through proxies to multiple clients based on which we propose an adaptive segment-based and proxy-assisted scheduling, caching and patching scheme called MBP (Multicast Batched Patching) with application-layer multicast strategy to accelerate VOD streaming effectively and efficiently in a wireless network environment. By introducing a simple transmission cost model, we investigate the overall cost of network consumption of our proposal. Simulations show that our scheme has a better scalability and can reduce the overall transmission cost significantly whereas small amount of cache space is needed at proxies.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121707653","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
Building High-Performance and Reconfigurable Bandwidth Controllers with Adaptive Clustering 构建高性能和可重构的带宽控制器与自适应集群
Chien-Hua Chiu, Chin-Yen Lee, Pan-Lung Tsai, Chun-Ying Huang, C. Lei
{"title":"Building High-Performance and Reconfigurable Bandwidth Controllers with Adaptive Clustering","authors":"Chien-Hua Chiu, Chin-Yen Lee, Pan-Lung Tsai, Chun-Ying Huang, C. Lei","doi":"10.1109/ICSNC.2006.26","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.26","url":null,"abstract":"As quality of service gains more and more attention, bandwidth controllers gradually become one of the most important network systems used in modern Internet environment. The demand for high-performance in-line bandwidth controllers is driven by the growing bandwidth available in the last mile WAN links as well as the sophisticated packet processing functions that become essential in current computer networks. In this paper, we propose an adaptive clustering scheme to scale the throughput of in-line devices and implement the bandwidth control functions over a cluster of in-line devices. The proposed scheme aggregates the processing power of multiple in-line devices in the cluster by making incoming traffic self-dispatched in a transparent fashion, and incorporates a flow migration mechanism that keeps the load of each device balanced. The resulted cluster is also able to tolerate device failures and hence is run-time reconfigurable. Based on the proposed scheme, we successfully design a distributed policy adjustment algorithm, the proportional bandwidth allocation algorithm, and implement a clustered bandwidth controller over embedded Linux. The results of performance evaluation suggest that the proposed traffic redistribution mechanism and distributed policy adjustment algorithm can be used together to realize high-performance and reconfigurable bandwidth controllers.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125296317","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
Performance Evaluation of Dual Authentication Scheme in Mobile IPv6 Networks 移动IPv6网络中双重认证方案的性能评估
Jong‐Hyouk Lee, Tai-Myung Chung
{"title":"Performance Evaluation of Dual Authentication Scheme in Mobile IPv6 Networks","authors":"Jong‐Hyouk Lee, Tai-Myung Chung","doi":"10.1109/ICSNC.2006.60","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.60","url":null,"abstract":"Open medium transmission makes wireless networks convenient to use, easy to deploy, and probably more economic, while at the same time it brings up many security problems. Thus, security mechanisms are proposed to protect communications. As one of most widely used security mechanisms, authentication is used to identify mobile nodes, prevent unauthorized usage, and negotiate credentials. Unfortunately, authentication mechanisms have been proposed up to now are impertinent in case of a mobile node has a high velocity or is in the ping-pong effect. In this paper, we propose a dual authentication scheme using Identity-Based Encryption. Using this scheme, a mobile node employs a dual authentication policy so that it reduces the fault rate of authentication up to about 57.1% based on the same network parameters and solves the ping-pong effect. Numerical results presented in this paper shows that our scheme has superior performance comparing to the standard AAA architecture.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122756601","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
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学术官方微信