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

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

筛选
英文 中文
Towards Bio-Inspired Self-Organization in Sensor Networks: Applying the Ant Colony Algorithm 传感器网络中仿生自组织:应用蚁群算法
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.79
Jue Hong, Sanglu Lu, Daoxu Chen, Jiannong Cao
{"title":"Towards Bio-Inspired Self-Organization in Sensor Networks: Applying the Ant Colony Algorithm","authors":"Jue Hong, Sanglu Lu, Daoxu Chen, Jiannong Cao","doi":"10.1109/AINA.2008.79","DOIUrl":"https://doi.org/10.1109/AINA.2008.79","url":null,"abstract":"Self-organization is the key to implement self-calibration, autonomously coordination and P2P communication in sensor networks. Current researches mainly solve this problem in an inappropriate pre-planned manner. The swarm intelligence of the ant colony algorithm (ACA) provides a novel and efficient method for self-organization. For the similarity of sensor network and ant colony, we argue that the sensor networks will benefit from the bio-inspired self-organization by applying the ACA in optimization, structure formation and task/resource allocation. In this paper we outline the current researches on the ACA in sensor network first, then propose the potential applications and research issues. General design of the ACA in sensor network and some challenges are presented as well.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"18 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":"123922726","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}
引用次数: 18
Synchronization of Transactions to Prevent Illegal Information Flow in a Role-Based Access Control Model 基于角色的访问控制模型中防止非法信息流的事务同步
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.145
T. Enokido, M. Takizawa
{"title":"Synchronization of Transactions to Prevent Illegal Information Flow in a Role-Based Access Control Model","authors":"T. Enokido, M. Takizawa","doi":"10.1109/AINA.2008.145","DOIUrl":"https://doi.org/10.1109/AINA.2008.145","url":null,"abstract":"The role-based access control (RBAC) model is widely used to make information systems secure. Even if every access request is authorized in the roles, illegal information flow might occur as the well known confinement problem. In this paper, we discuss how to prevent illegal information flow to occur by synchronizing conflicting transactions in the RBAC model. We first define types of information flow relations, legal (LIF), illegal (IIF), and possibly illegal (PIF) ones R<sub>1</sub> = R<sub>2</sub>, R<sub>1</sub> rarr R<sub>2</sub>, and R1 rarr R<sub>2</sub> among a pair of role families R and Ri, respectively. Here, let T<sub>1</sub> and T<sub>2</sub> be a pair of transactions with role families R<sub>1</sub> and R<sub>2</sub> respectively. Suppose T<sub>1</sub> precedes T<sub>2</sub> in a schedule, i.e. for every pair of conflicting methods op and opi from T andT% respectively, op is performed prior to op<sub>2</sub>- Here, if the LIF relation R<sub>1</sub> = R<sub>2</sub> holds, no illegal information flow occur. If R<sub>1</sub> rarr R<sub>2</sub>, illegal information flow necessarily occur. R<sub>1</sub> rarr R<sub>2</sub> implies that illegal information flow might occur depending on in which order the transactions perform what methods.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"78 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":"124065519","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}
引用次数: 7
A New Dynamic Wavelength Assignment Scheme in Wavelength-Convertible WBS Networks 波长可转换WBS网络中一种新的动态波长分配方案
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.33
Chingfang Hsu, Fang-Sheng Lin, Ke-Kuan Hsu
{"title":"A New Dynamic Wavelength Assignment Scheme in Wavelength-Convertible WBS Networks","authors":"Chingfang Hsu, Fang-Sheng Lin, Ke-Kuan Hsu","doi":"10.1109/AINA.2008.33","DOIUrl":"https://doi.org/10.1109/AINA.2008.33","url":null,"abstract":"In the paper, we study the wavelength assignment problem in waveband switching (WBS) networks, which is composed of multi-granular optical cross-connect (MG-OXCs) interconnected by fiber links. WBS networks with MG-OXCs can route traffic at multiple granularities at the same time; therefore, the complexity of switching fabrics can be efficiently reduced. Moreover, in order to relax the wavelength continuity constraint on lightpath establishments, each MG-OXC node is equipped with certain number of wavelength converters. Focusing on minimizing the extra port consumption and utilizing wavelength converters in an efficient manner, we propose a heuristic algorithm, named Least-Configuration with Bounded Conversion (LCBC), under the dynamic traffic environment. Simulation results show that our algorithm can achieve a considerable port saving and significant performance gain by a well-design cost function.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"10 2 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":"124278194","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 Channel Quality and QoS Aware Bandwidth Allocation Algorithm for IEEE 802.16 Base Stations 基于信道质量和QoS的IEEE 802.16基站带宽分配算法
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.104
Y. Lai, Yen-Hung Chen
{"title":"A Channel Quality and QoS Aware Bandwidth Allocation Algorithm for IEEE 802.16 Base Stations","authors":"Y. Lai, Yen-Hung Chen","doi":"10.1109/AINA.2008.104","DOIUrl":"https://doi.org/10.1109/AINA.2008.104","url":null,"abstract":"In an IEEE 802.16 network, mobile stations locating different places will encounter various interferences during transmission, leading that their communication channels experience different packet loss conditions and adopt suitable modulations. Thus, an excellent bandwidth allocation algorithm should not only satisfy various quality of services (QoS) required by heterogeneous traffic, but also consider the channel quality to maximize bandwidth utilization. In this paper, a bandwidth allocation algorithm with channel quality awareness and QoS guarantee, called CQQ, is proposed. Besides satisfying each connection's QoS requirement, CQQ raises the throughput by dynamically adjusting the downlink/uplink (DL/UL) bandwidth to match current DL/UL traffic and allocating more bandwidth to the connections having better channel quality. Simulation results demonstrate that CQQ provides lower delay violation ratio and higher goodput, comparing with the previous algorithms.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"303 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":"123200740","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}
引用次数: 24
A Protocol for Content-Based Communication in Disconnected Mobile Ad Hoc Networks 非连接移动自组网中基于内容的通信协议
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.3233/MIS-2010-0096
J. Haillot, F. Guidec
{"title":"A Protocol for Content-Based Communication in Disconnected Mobile Ad Hoc Networks","authors":"J. Haillot, F. Guidec","doi":"10.3233/MIS-2010-0096","DOIUrl":"https://doi.org/10.3233/MIS-2010-0096","url":null,"abstract":"In content-based communication, information flows towards interested hosts rather than towards specifically set destinations. This new style of communication perfectly fits the needs of applications dedicated to information sharing, news distribution, service advertisement and discovery, etc. In this paper we address the problem of supporting content-based communication in partially or intermittently connected mobile ad hoc networks (MANETs). The protocol we designed leverages on the concepts of opportunistic networking and delay-tolerant networking in order to account for the absence of end-to-end connectivity in disconnected MANETs. The paper provides an overview of the protocol, as well as simulation results that show how this protocol can perform in realistic conditions.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"2 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":"115346695","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}
引用次数: 57
Improving the Scalability of P2P Streaming Based on Fine-Grained Balancing Scheme 基于细粒度均衡方案提高P2P流的可扩展性
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.105
Chow-Sing Lin, Wei-Ting Syu, I-Ting Lee
{"title":"Improving the Scalability of P2P Streaming Based on Fine-Grained Balancing Scheme","authors":"Chow-Sing Lin, Wei-Ting Syu, I-Ting Lee","doi":"10.1109/AINA.2008.105","DOIUrl":"https://doi.org/10.1109/AINA.2008.105","url":null,"abstract":"In this paper, we relax the restriction of only one designated description forwarded by a peer described in our previously proposed balancing scheme and propose the fine-grained balancing scheme to further improve the scalability of P2P live streaming network based on multiple description coding (MDC) techniques. Like the balancing scheme, the fine-grained balancing scheme is capable of balancing the distribution of descriptions and peer loading by a centralized description allocation scheme. In addition, according to our analysis, its flexibility of selecting desired descriptions and source peers favors the utilization of the aggregate bandwidth of P2P network. The performance study shows that our fine-grained balancing scheme can successfully reduce the consumption of server bandwidth and the rejection rate so that more clients can be served.","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":"129819330","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
Long-Term CPU Load Prediction System for Scheduling of Distributed Processes and its Implementation 分布式进程调度的长期CPU负荷预测系统及其实现
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.135
Yoshihiro Sugaya, H. Tatsumi, M. Kobayashi, H. Aso
{"title":"Long-Term CPU Load Prediction System for Scheduling of Distributed Processes and its Implementation","authors":"Yoshihiro Sugaya, H. Tatsumi, M. Kobayashi, H. Aso","doi":"10.1109/AINA.2008.135","DOIUrl":"https://doi.org/10.1109/AINA.2008.135","url":null,"abstract":"There exist distributed processing environments composed of many heterogeneous computers. It is required to schedule distributed parallel processes in an appropriate manner. For the scheduling, prediction of execution load of a process is effective to exploit resources of environments. We propose long-term load prediction methods with references of properties of processes and of runtime predictions. Since an appropriate prediction method is different according to the situation, we propose a prediction module selection to select an appropriate prediction method according to a state of changing CPU load using a neural network. We also discuss about the implementation of a long-term CPU load prediction system, which provides information including prediction of load for schedulers, system administrators and users.","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":"125406645","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
Senceive: A Middleware for a Wireless Sensor Network sentive:无线传感器网络的中间件
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.34
Christian Hermann, W. Dargie
{"title":"Senceive: A Middleware for a Wireless Sensor Network","authors":"Christian Hermann, W. Dargie","doi":"10.1109/AINA.2008.34","DOIUrl":"https://doi.org/10.1109/AINA.2008.34","url":null,"abstract":"A significant amount of research effort is being carried out by the research community to increase the scope and usefulness of wireless sensor networks; to optimise life time by developing energy efficient power management, self-organising, medium access and routing protocols; and to reduce the cost of sensing nodes so that dense and robust deployment is possible. Though much has already been achieved, currently the cost of commercially available wireless sensor nodes is considerable and the wide applicability of proposed or existing protocols is still under investigation. One essential problem associated with cost or wide applicability of protocols is that sensor networks are application-specific. Protocols and in-network algorithms are optimised for particular sensing tasks. On the other hand, in research environments researchers would like to experiment not with a single application but with many applications. Considering the not-so-cheap sensing nodes available on the market and the management overhead of deploying wireless sensor networks, it is not economical or efficient to dedicate wireless sensor networks just to a single application, not at present at any rate. We therefore propose a middleware that enables researchers to experiment with multiple applications while providing them with essential in-network functionalities to satisfy individual application's requirements. The middleware cleanly separates sensing from network management so that application developers can obtain data from the wireless sensor networks without having to deal with management concerns.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"60 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":"116688935","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}
引用次数: 28
Dynamic MAP Selection Mechanism for HMIPv6 HMIPv6的动态MAP选择机制
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.17
Ying-Hong Wang, Kuo-Feng Huang, Chien-Shan Kuo, Weiyuan Huang
{"title":"Dynamic MAP Selection Mechanism for HMIPv6","authors":"Ying-Hong Wang, Kuo-Feng Huang, Chien-Shan Kuo, Weiyuan Huang","doi":"10.1109/AINA.2008.17","DOIUrl":"https://doi.org/10.1109/AINA.2008.17","url":null,"abstract":"Hierarchical Mobile IPv6 management(HMIPv6) which is drawn up by the IETF (Internet Engineering Task Force) utilizes the Mobile Anchor Point (MAP) to reduce the considerable number of binding update messages among the mobile node, correspondent node, and the mobile node's home agent. According to the HMIPv6 mechanism, the MAP of higher layer can efficiently reduce the frequency of binding update messages; it will have higher loading of service and become the bottleneck of the whole network. Because the MAP's bandwidth of services is finite and if MAP serves as the gateway at the same time, the whole network will be crashed due to overloading. This research proposes a MAP selection mechanism that takes the mobile node's particular characteristics which include the mobility velocity and quantity of communication services into consideration, the research can manage MAPs efficiently. Besides, the research also designs the MAP Load Balance mechanism to avoid the network crash due to the overloaded MAP.","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":"122450770","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}
引用次数: 11
SARBAU Towards Highly Self-Configuring IP-Fieldbus Based Building Automation Networks 面向高度自配置的基于ip现场总线的楼宇自动化网络
22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.53
S. Knauth, R. Kistler, Daniel Käslin, A. Klapproth
{"title":"SARBAU Towards Highly Self-Configuring IP-Fieldbus Based Building Automation Networks","authors":"S. Knauth, R. Kistler, Daniel Käslin, A. Klapproth","doi":"10.1109/AINA.2008.53","DOIUrl":"https://doi.org/10.1109/AINA.2008.53","url":null,"abstract":"The SARBAU project is a study on a highly self configuring building automation and control network using IP as field level protocol. UPnP will be used for device operation and control. The paper gives an overview on the SARBAU approach. Current work-in-progress including wired and wireless experimental device hardware is presented. A focus of this paper is \"nearly automatic configuration\". Using intelligent commissioning software and optional device localisation, we propose highly automated device commissioning and binding schemes.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"22 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":"116147140","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
首页 上一页 下一页 尾页
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学术官方微信