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

22nd International Conference on Advanced Information Networking and Applications (aina 2008)最新文献

筛选
英文 中文
Analysis of Packet Relaying Models and Incentive Strategies in Wireless Ad Hoc Networks with Game Theory 基于博弈论的无线Ad Hoc网络分组中继模型及激励策略分析
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.28
Lu Yan, S. Hailes, L. Capra
{"title":"Analysis of Packet Relaying Models and Incentive Strategies in Wireless Ad Hoc Networks with Game Theory","authors":"Lu Yan, S. Hailes, L. Capra","doi":"10.1109/AINA.2008.28","DOIUrl":"https://doi.org/10.1109/AINA.2008.28","url":null,"abstract":"In wireless ad hoc networks, nodes are both routers and terminals, and they have to cooperate to communicate. Cooperation at the network layer means routing (finding a path for a packet), and forwarding (relaying packets for others). However, because wireless nodes are usually constrained by limited power and computational resources, a selfish node may be unwilling to spend its resources in forwarding packets that are not of its direct interest, even though it expects other nodes to forward its packets to the destination. In this paper, we propose a game-theoretic model to facilitate the study of the non-cooperative behaviors in wireless ad hoc networks and analyze incentive schemes to motivate cooperation among wireless ad hoc network nodes to achieve a mutually beneficial networking result.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"33 23","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114109882","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}
引用次数: 16
A New Low Complexity Iterative Detection for Space-Time Bit-Interleaved Coded Modulation Schemes 一种新的空时位交织编码调制方案的低复杂度迭代检测方法
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.64
Ying Li, Hongmei Xie, Xudong Guo, Xinmei Wang
{"title":"A New Low Complexity Iterative Detection for Space-Time Bit-Interleaved Coded Modulation Schemes","authors":"Ying Li, Hongmei Xie, Xudong Guo, Xinmei Wang","doi":"10.1109/AINA.2008.64","DOIUrl":"https://doi.org/10.1109/AINA.2008.64","url":null,"abstract":"To reduce the detection complexity of the space-time bit-interleaved coded modulation(ST-BICM) scheme, a turbo type iterative receiver structure consisting of a new group Gaussian approximation(GGA) algorithm and an a posteriori probability(APP) decoder is presented. When calculating the log-likelihood ratio(LLR) of the i-th transmitted symbol, the GGA algorithm first divide the N transmitted signals into two groups, a detecting group consisting of G signals with the i-th transmitted signal included, and an interfering group consisting of the other N-G signals. Taking the superposition of the N-G signals as a Gaussian random variable, the GGA algorithm implements the maximum a posteriori(MAP) detection to obtain the LLR of the signal transmitted from antenna i. At high SNR values or if the receiver has more than two replicas of each transmitted signal, the GGA detection exhibits a good performance as well as low decoding complexity.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116682915","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
SRPTES: A Secure Routing Protocol Based on Token Escrow Set for Ad Hoc Networks 基于令牌托管集的Ad Hoc网络安全路由协议
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.125
Chen Huang, Benxiong Huang, Yijun Mo, Jianhua Ma
{"title":"SRPTES: A Secure Routing Protocol Based on Token Escrow Set for Ad Hoc Networks","authors":"Chen Huang, Benxiong Huang, Yijun Mo, Jianhua Ma","doi":"10.1109/AINA.2008.125","DOIUrl":"https://doi.org/10.1109/AINA.2008.125","url":null,"abstract":"Ad hoc networks, which do not rely on fixed infrastructure such as base stations, can be deployed rapidly and inexpensively in situations with geographical or time constraints. However, the nature of ad hoc networks makes them vulnerable to attacks, especially in routing protocols. In order to establish a secure route composed only by trusted nodes and prevent routes from being tampered by internal malicious nodes, we present a novel secure routing protocol based on token escrow set (SRPTES). SRPTES employs token with limited lifetime to control the trust relationships between neighboring nodes, and provides secure routing and packet forwarding services through valid token. As the core of SRPTES, it creates completely distributed and localized token escrow set (TES) which can maintain robust trust relationships among nodes and greatly reduce the overhead of key management. The simulation results show that SRPTES provides an effective security enhancement and improves the efficiency of routing establishment in insecure environment.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130590157","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
Keep Passwords Away from Memory: Password Caching and Verification Using TPM 密码远离内存:使用TPM进行密码缓存和验证
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.109
Hua Wang, Yao Guo, Xia Zhao, Xiangqun Chen
{"title":"Keep Passwords Away from Memory: Password Caching and Verification Using TPM","authors":"Hua Wang, Yao Guo, Xia Zhao, Xiangqun Chen","doi":"10.1109/AINA.2008.109","DOIUrl":"https://doi.org/10.1109/AINA.2008.109","url":null,"abstract":"TPM is able to provide strong secure storage for sensitive data such as passwords. Although several commercial password managers have used TPM to cache passwords, they are not capable of protecting passwords during verification. This paper proposes a new TPM-based password caching and verification method called PwdCaVe. In addition to using TPM in password caching, PwdCaVe also uses TPM during password verification. In PwdCaVe, all password-related computations are performed in the TPM. PwdCaVe guarantees that once a password is cached in the TPM, it will be protected by the TPM through the rest of its lifetime, thus eliminating the possibility that passwords might be attacked in memory. A prototype of PwdCaVe is implemented on Linux to demonstrate its feasibility.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125192696","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
Non-Uniform Node Deployment for Lifetime Extension in Large-Scale Randomly Distributed Wireless Sensor Networks 大规模随机分布无线传感器网络寿命扩展的非均匀节点部署
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.55
Yuh-Ren Tsai, Kai-Jie Yang, Sz-Yi Yeh
{"title":"Non-Uniform Node Deployment for Lifetime Extension in Large-Scale Randomly Distributed Wireless Sensor Networks","authors":"Yuh-Ren Tsai, Kai-Jie Yang, Sz-Yi Yeh","doi":"10.1109/AINA.2008.55","DOIUrl":"https://doi.org/10.1109/AINA.2008.55","url":null,"abstract":"Network sensing coverage and network lifetime are the two major performance metrics for WSNs. Different data forwarding/routing mechanisms lead to different amounts and different distributions of energy consumption in a network. Moreover, nodes at different locations will suffer from different message forwarding burdens, either due to the amounts of forwarding messages or due to the required transmission power. In this work, we focus on the node deployment problem for large-scale randomly distributed WSNs, and proposed a non-uniform node deployment strategy, the IFA-based deployment strategy, for the multi-hop routing scenario. The sensing coverage, message forwarding and energy consumption issues are well examined and taken into consideration in our proposed deployment strategy. The iterative algorithm that figures out the optimal node density distribution fitting to the energy consumption distribution has been devised. Simulation results show that the proposed IFA-based deployment strategy can significantly improve the sensing coverage performance of a WSN.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130218065","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}
引用次数: 14
An Architecture for Mobility Support in a Next-Generation Internet 下一代互联网中移动支持的体系结构
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.39
Walter Wong, R. Villaça, L. B. D. Paula, R. Pasquini, F. Verdi, M. Magalhães
{"title":"An Architecture for Mobility Support in a Next-Generation Internet","authors":"Walter Wong, R. Villaça, L. B. D. Paula, R. Pasquini, F. Verdi, M. Magalhães","doi":"10.1109/AINA.2008.39","DOIUrl":"https://doi.org/10.1109/AINA.2008.39","url":null,"abstract":"The current internetworking architecture presents some limitations to naturally support mobility, security and multi- homing. Among the limitations, the IP semantic overload seems to be a primary issue to be considered. In this paper we present a next generation internetworking architecture to overcome the IP semantic overload by introducing an identity layer located between the network and transport layers. This new layer provides a stable cryptographic identifier for end-hosts and seamlessly allows the deployment of new services, such as mobility, multi-homing and security. A prototype was implemented and evaluated considering some mobility scenarios, including intra-domain, inter-domain and simultaneous node mobility.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120943725","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}
引用次数: 15
A New Remote Camera Work System for Teleconference Using a Combination of Omni-Directional and Network Controlled Cameras 全向摄像机与网络摄像机相结合的新型远程会议摄像机工作系统
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.153
Yosuke Sato, K. Hashimoto, Y. Shibata
{"title":"A New Remote Camera Work System for Teleconference Using a Combination of Omni-Directional and Network Controlled Cameras","authors":"Yosuke Sato, K. Hashimoto, Y. Shibata","doi":"10.1109/AINA.2008.153","DOIUrl":"https://doi.org/10.1109/AINA.2008.153","url":null,"abstract":"As advent of communication network and multimedia processing technologies, various video conference systems to smoothly communicate each other between remote sites using with high quality audio and video have been developed. However, since those video conference systems usually use conventional cameras which only capture the objective images in one direction with narrow area, wide area such as 360 degree of surround direction cannot be captured. In this paper, we introduce a new teleconference system so called Telegnosis in which omni-directional camera and PTZ (Pan/Tilt/Zoom) are combined. While the omni-directional camera capture 360 degree of surrounding images, the PTZ camera captures more detail images specified by the users in omni-directional panorama images by pan, tilt and zoom operations. Using multiple Telegnosis systems, more flexible and dynamic video conference system can be realized for new application fields.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121641547","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
A Concept of an Anonymous Direct P2P Distribution Overlay System 一个匿名直接P2P分布覆盖系统的概念
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.117
I. Margasinski, M. Pióro
{"title":"A Concept of an Anonymous Direct P2P Distribution Overlay System","authors":"I. Margasinski, M. Pióro","doi":"10.1109/AINA.2008.117","DOIUrl":"https://doi.org/10.1109/AINA.2008.117","url":null,"abstract":"The paper introduces a peer-to-peer system called P2PRIV (peer-to-peer direct and anonymous distribution overlay). Basic novel features of P2PRIV are: (i) a peer-to-peer parallel content exchange architecture, and (ii) separation of the anonymization process from the transport function. These features allow a considerable saving of service time while preserving high degree of anonymity. In the paper we evaluate anonymity measures of P2PRIV (using a normalized entropy measurement model) as well as its traffic measures (including service time and network dynamics), and compare anonymity and traffic performance of P2PRIV with a well known system called CROWDS.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122561498","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}
引用次数: 5
Formalization of Link Farm Structure Using Graph Grammar 用图语法形式化链接场结构
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.96
Kiattikun Chobtham, A. Surarerks, A. Rungsawang
{"title":"Formalization of Link Farm Structure Using Graph Grammar","authors":"Kiattikun Chobtham, A. Surarerks, A. Rungsawang","doi":"10.1109/AINA.2008.96","DOIUrl":"https://doi.org/10.1109/AINA.2008.96","url":null,"abstract":"A link farm is a set of web pages constructed to mislead the importance of target pages in search engine results by boosting their link-based ranking scores. In this paper, we introduce a new graph grammar model for expressing the structure of a link farm. Supervised graph grammar induction created by an expert is modified to fit the training data to explain the behavior and the properties of link farms. In the experiments, graph grammar can effectively recognize link farms from Yahoo's web spam dataset. The comparison among the number of applying production rules of spam and normal hosts indicates that graph grammar seem to be a good mechanism for detecting link spam.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115831709","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
Extending Always Best Connected Paradigm for Voice Communications in Next Generation Wireless Network 在下一代无线网络中扩展始终最佳连接模式的语音通信
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.22
T. Chung, Fong-Ching Yuan, Yung-Mu Chen, Baw-Jhiune Liu, Ching-Chi Hsu
{"title":"Extending Always Best Connected Paradigm for Voice Communications in Next Generation Wireless Network","authors":"T. Chung, Fong-Ching Yuan, Yung-Mu Chen, Baw-Jhiune Liu, Ching-Chi Hsu","doi":"10.1109/AINA.2008.22","DOIUrl":"https://doi.org/10.1109/AINA.2008.22","url":null,"abstract":"Selecting transparently a proper network connection for voice communication will be a fundamental requirement in future multi-mode heterogeneous wireless network. This paper extends always best connected (ABC) to a fine-grain paradigm called always best network connection (ABNC) to address this issue. Instead of selecting a best access network as in conventional ABC, ABNC enable users to select a best network connection, which consists of source and destination access network pair, to satisfy quality constraint and users' preference. To support ABNC, we develop a user profile to specify network connection priority. Meanwhile we extend SIP and propose a network selection information service (NSIS) based on MIH (media independent handover) to collect information of both source and destination access networks for decision making. Finally, analytic hierarchy process (AHP) is used to recommend a network connection with assistance of user profile and NSIS. An example is illustrated to show that AHP can successfully select a good network connection that fulfill the requirement of users.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114160384","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
首页 上一页 下一页 尾页
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学术官方微信