发布求助
文献互助 智能选刊 最新文献

20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)最新文献

筛选
英文 中文
Constrained flooding: a robust and efficient routing framework for wireless sensor networks 约束泛洪:无线传感器网络鲁棒高效路由框架
20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06) Pub Date : 2006-04-18 DOI: 10.1109/AINA.2006.132
Y. Zhang, Markus P. J. Fromherz
{"title":"Constrained flooding: a robust and efficient routing framework for wireless sensor networks","authors":"Y. Zhang, Markus P. J. Fromherz","doi":"10.1109/AINA.2006.132","DOIUrl":"https://doi.org/10.1109/AINA.2006.132","url":null,"abstract":"Flooding protocols for wireless networks in general have been shown to be very inefficient and therefore are mainly used in network initialization or route discovery and maintenance. In this paper, we propose a framework of constrained flooding protocols. The framework incorporates a reinforcement learning kernel, a differential delay mechanism, and a constrained and probabilistic retransmission policy. This type of protocol takes the advantages of robustness from flooding, but maintains energy efficiency by constraining retransmissions. Without the use of any control packets, such a protocol adapts to the specific routing requirements of the task and the dynamic changes of the network. We analyze this framework in simulation using a real-world application in sensor networks.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116263960","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
Sequential Localization Algorithm for Active Sensor Network Deployment 主动传感器网络部署的顺序定位算法
20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06) Pub Date : 2006-04-18 DOI: 10.1109/AINA.2006.304
Y. Zhang, Qingfeng Huang, Juan Liu
{"title":"Sequential Localization Algorithm for Active Sensor Network Deployment","authors":"Y. Zhang, Qingfeng Huang, Juan Liu","doi":"10.1109/AINA.2006.304","DOIUrl":"https://doi.org/10.1109/AINA.2006.304","url":null,"abstract":"There has been a lot of work on localization for sensor networks. Most localization schemes assume an already deployed network. Very little research has been done for active sensor deployment with mobile robots. In this paper, we present a distributed sequential localization process which is tightly integrated with robotic sensor deployment. Being location-aware, sensors can be placed in advantageous locations to avoid big localization errors. In turn, the accurate localization result helps further sensor deployment. We compare our distributed sequential localization scheme with five existing localization algorithms, both through simulations and through repeated runs on a mote testbed. Results show that the distributed sequential localization algorithm produces comparable results to the state-of-the-art centralized localization algorithms. Experiments also show that pre-post processing plays important roles at getting good localization results for all localization algorithms","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"372 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121750758","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
Efficient search mechanisms in a context distribution system 上下文分布系统中的高效搜索机制
20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06) Pub Date : 2006-04-18 DOI: 10.1109/AINA.2006.167
I. Sygkouna, M. Anagnostou, E. Sykas
{"title":"Efficient search mechanisms in a context distribution system","authors":"I. Sygkouna, M. Anagnostou, E. Sykas","doi":"10.1109/AINA.2006.167","DOIUrl":"https://doi.org/10.1109/AINA.2006.167","url":null,"abstract":"In order to improve system's efficiency and scalability for the provision of time-critical context-aware services, we propose a set of decentralised usage-aware search mechanisms. These mechanisms exploit the locality of reference properties exhibited by context usage patterns with efficient means provided by active networks. Simulation results show that the proposed mechanisms reduce the network traffic while they maintain the good search time of flood broadcasting methods.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125201592","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
Experiments with QoS-Aware Gaming-on-Demand Service 基于qos的游戏按需服务实验
20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06) Pub Date : 2006-04-18 DOI: 10.1109/AINA.2006.175
J. Laulajainen, T. Sutinen, Sari Järvinen
{"title":"Experiments with QoS-Aware Gaming-on-Demand Service","authors":"J. Laulajainen, T. Sutinen, Sari Järvinen","doi":"10.1109/AINA.2006.175","DOIUrl":"https://doi.org/10.1109/AINA.2006.175","url":null,"abstract":"This paper presents experiments with an adaptation architecture for a novel client-server based broadband gaming solution, a gaming-on-demand service. The adaptation solution was implemented to an experimental gaming-on-demand setup to evaluate its advantages by measuring adaptation performance under emulated real world network conditions. The obtained results show that the gaming-on-demand service performance is improved significantly when the adaptation solution is used","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122494692","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 framework for measurement of end-to-end QoS requirements in loosely coupled systems 一种在松散耦合系统中测量端到端QoS需求的框架
20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06) Pub Date : 2006-04-18 DOI: 10.1109/AINA.2006.27
K. Kalapriya, S. Nandy, N. Narendra
{"title":"A framework for measurement of end-to-end QoS requirements in loosely coupled systems","authors":"K. Kalapriya, S. Nandy, N. Narendra","doi":"10.1109/AINA.2006.27","DOIUrl":"https://doi.org/10.1109/AINA.2006.27","url":null,"abstract":"Pervasive computing aims at providing computation ubiquitously and a means of realizing anytime, anywhere computing. Pervasive computing is characterized by an infrastructure that enables execution of task (application) that demand automated, continual and multiple unobtrusive services in heterogeneous environments. They use invisible and ubiquitously distributed computational devices. Therefore pervasive computing requires a common single integrated programming solution that would facilitate proactive real-time collaborations among devices, software agents and execution of task. Such systems often termed as loosely coupled systems greatly benefit from service oriented architecture that allows software systems to provide services to end-user applications or other services through published and discoverable interfaces. One of the main issues in loosely coupled systems is the QoS. It is defined as how well a service is satisfied. QoS in such systems is application specific and is multidimensional. We identify two important issues in guaranteeing QoS in such systems: i) The infrastructure should decompose the application specific QoS parameters of multiple tasks (applications) executing in pervasive computing environment into set of QoS parameters and map them to distinct components of task execution, ii) Guaranteeing the QoS parameters with constraints in resource limited pervasive environments. In this paper we propose a framework for guaranteeing QoS by identifying two levels of agreement (service level and resource level) by the middleware entity. This entity identifies the QoS parameters from applications and forms distinct sets applicable to components involved in execution of task. Our aim is develop a generalized architecture that provides a platform for identifying QoS requirements of the applications, mapping these requirements in terms of service level agreements and resource level agreements. Finally , we propose a framework for monitoring and using system level parameters.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122900601","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
Traffic Distribution over Equal-Cost-Multi-Paths using LRU-based Caching with Counting Scheme 基于lru缓存计数的等代价多路径流量分配
20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06) Pub Date : 2006-04-18 DOI: 10.1109/AINA.2006.334
Wei Lin, B. Liu, Yi Tang
{"title":"Traffic Distribution over Equal-Cost-Multi-Paths using LRU-based Caching with Counting Scheme","authors":"Wei Lin, B. Liu, Yi Tang","doi":"10.1109/AINA.2006.334","DOIUrl":"https://doi.org/10.1109/AINA.2006.334","url":null,"abstract":"In order to reduce network congestion and fully use link bandwidth, when there are equal-cost-multi-paths (ECMPs) between a forwarding node and a destination subnet, traffic load should be balanced among ECMPs and packets of the same TCP flow should reach destination host in the same order. An algorithm called LRU-based caching with counting (LCC) is proposed. Packet length differentiation is considered to achieve load balance by adapting a counter for each ECMP, and counter overflow is solved by relative counting and restrictions. UDP packets only need to be concerned to achieve load balance. Furthermore, flow delay differentiation forwarding to different hosts of the same destination subnet is transformed to entries in cache invalided time period difference. Simulation shows that when delay differentiation among ECMPs is not significant, storage requirement is small, only one cycle is needed for each cache lookup, load balance is near optimal, and only 2% of packets are out of order","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123034040","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
SecRout: a secure routing protocol for sensor networks secroute:用于传感器网络的安全路由协议
20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06) Pub Date : 2006-04-18 DOI: 10.1109/AINA.2006.297
Jian Yin, S. Madria
{"title":"SecRout: a secure routing protocol for sensor networks","authors":"Jian Yin, S. Madria","doi":"10.1109/AINA.2006.297","DOIUrl":"https://doi.org/10.1109/AINA.2006.297","url":null,"abstract":"In this paper, we present a secure routing protocol for sensor networks (SecRout) to safeguard sensor networks under different types of attacks. The SecRout protocol uses the symmetric cryptography to secure messages, and uses a small cache in sensor nodes to record the partial routing path (previous and next nodes) to the destination. It guarantees that the destination will be able to identify and discard the tampered messages and ensure that the messages received are not tampered. Comparing the performance with non-secure routing protocol AODV (ad hoc on demand distance vector routing), the SecRout protocol only has a small byte overhead (less than 6%), but packet delivery ratio is almost same as AODV and packet latency is better than AODV after the route discovery.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131884134","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}
引用次数: 52
A Mini-Slot Router Architecture for TDM Optical WDM Networks TDM光WDM网络的小槽路由器架构
20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06) Pub Date : 2006-04-18 DOI: 10.1109/AINA.2006.35
Cheah Huei Yoong, Pung Hung Keng
{"title":"A Mini-Slot Router Architecture for TDM Optical WDM Networks","authors":"Cheah Huei Yoong, Pung Hung Keng","doi":"10.1109/AINA.2006.35","DOIUrl":"https://doi.org/10.1109/AINA.2006.35","url":null,"abstract":"Many routing and wavelength assignment algorithms have been proposed for optical networks, but they lack the refinement of being able to further share the gigabit bandwidth in each wavelength. Obviously, TDM wavelength routing networks can offer better network throughput than traditional wavelength routed networks. However, with the advancement of optical technology, it is possible to divide a wavelength in a fiber into time-slots, and further divide a time-slot into mini-slots so that the fiber bandwidth can be more efficiently utilized. This paper proposes a router architecture with an electronic system controller to support optical data transfer at the mini-slots of a time-slot in a wavelength for each hop of a route. No wavelength converter is employed in the proposed router architecture. The effectiveness of this network in blocking probability and throughput is demonstrated by simulation","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134280473","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
Method of sharing virtual traditional crafting system based on high-speed network 基于高速网络的虚拟传统工艺系统共享方法
20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06) Pub Date : 2006-04-18 DOI: 10.1109/AINA.2006.226
Tomoyuki Ishida, Y. Shibata, A. Miyakawa, Yuji Ohhashi
{"title":"Method of sharing virtual traditional crafting system based on high-speed network","authors":"Tomoyuki Ishida, Y. Shibata, A. Miyakawa, Yuji Ohhashi","doi":"10.1109/AINA.2006.226","DOIUrl":"https://doi.org/10.1109/AINA.2006.226","url":null,"abstract":"In this paper, it proposes the method of sharing space that enables collaborative work in the virtual traditional crafting system based on high-speed network (JGN2). We are building the presentation system which deals with human sensitivity in virtual reality environment. So far we have proposed three different presentation systems of an Internet version and a SGI version. In this research, when the business model is considered, we think that collaboration support in sharing space is required of remote users. Therefore, JGN2 which is a next-generation high speed network was used to interconnect remote CAVE systems, and realize of the system which can perform interactive operations in sharing space is aimed.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134155294","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
Certificateless Designated Verifier Signature Schemes 无证书指定验证者签名方案
20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06) Pub Date : 2006-04-18 DOI: 10.1109/AINA.2006.124
Xinyi Huang, W. Susilo, Y. Mu, Futai Zhang
{"title":"Certificateless Designated Verifier Signature Schemes","authors":"Xinyi Huang, W. Susilo, Y. Mu, Futai Zhang","doi":"10.1109/AINA.2006.124","DOIUrl":"https://doi.org/10.1109/AINA.2006.124","url":null,"abstract":"Designated verifier signature schemes allow a signer to convince a designated verifier, in such a way that only the designated verifier will believe with the authenticity of such a signature. The previous constructions of designated verifier signature rely on the underlying public key Infrastructure, that requires both signer and verifier to verify the authenticity of the public keys, and hence, the certificates are required. In contrast to the previous constructions, in this paper, we propose the first notion and construction of the certificateless designated verifier signature scheme. In our new notion, the necessity of certificates are eliminated. We show that our scheme satisfies all the requirements of the designated verifier signature schemes in the certificateless system. We also provide complete security proofs for our scheme and prove that our scheme is unforgeable under the assumption of the gap bilinear Diffie-Hellman problem in the random oracle model","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134501711","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}
引用次数: 45
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信