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

A Cross-Layer Fine-Tuning Scheduling Scheme to Provide Proportional Delay Differentiation in a Wireless LAN 一种在无线局域网中提供比例延迟分化的跨层微调调度方案

22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.102

Y. Lai, A. Chang, Ching-Neng Lai, Chih-Chung Lin

引用次数: 0

A Quorum-Based Route Cache Maintenance Protocol for Mobile 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.151

Gwo-Jong Yu

{"title":"A Quorum-Based Route Cache Maintenance Protocol for Mobile Ad-Hoc Networks","authors":"Gwo-Jong Yu","doi":"10.1109/AINA.2008.151","DOIUrl":"https://doi.org/10.1109/AINA.2008.151","url":null,"abstract":"The objective of this paper is to propose a quorum- based robust and efficient routing protocol (QRERP) for mobile Ad Hoc network. There are four phases in the proposed QRERP. They are initialization phase, route discovery phase, route reply phase and data transmission phases. In initialization phase, the entire network is partitioned into several connected subgraph. Each subgraph is represented by a host adjacency matrix (HAM) and a logical coterie tree. In the route discovery phase, a route can be discovered by local matrix computation, quorum-based routing table query or quorum-based flooding mechanism. When a route is established, a packet can be replied from destination to source node and the route information can be distributed to the set of coteries passed through by this routing path. Finally, after the routing path is confirmed by route reply packet, source node can communication with destination. During the data transmission, when route is broken due to node mobility or power exhausted, a route maintenance mechanism can be triggered to mainline the robustness of the routing path. The performance of the proposed QRERP is demonstrated by experimental results. From the results, we can conclude that the proposed approach has advantages of backup route, less control overhead, mobility maintenance and route maintenance.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"43 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":"126926149","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

Distributed Access Scheduling Algorithms in Wireless Mesh Networks 无线Mesh网络中的分布式访问调度算法

22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.29

Hongju Cheng, N. Xiong, L. Yang

{"title":"Distributed Access Scheduling Algorithms in Wireless Mesh Networks","authors":"Hongju Cheng, N. Xiong, L. Yang","doi":"10.1109/AINA.2008.29","DOIUrl":"https://doi.org/10.1109/AINA.2008.29","url":null,"abstract":"In this paper we have considered the distributed scheduling problem for channel access in wireless mesh networks. The problem is to assign time-slots for each node in the network to access the control channels so that it is guaranteed that each node can broadcast the control packet to any one-hop neighbor in one scheduling cycle. The objective is to minimize the total number of different time-slots in the scheduling cycle. In the single-channel ad hoc networks, the known best result for this problem is proved to be (K2 + 1) in arbitrary graphs and 25K in unit disk graphs with K as the maximum node degree. The original contributions of this paper are that it has taken the large interference range problem into consideration for the first time and proposed two algorithms for the scheduling problem, namely, the one neighbor per cycle (ONPC) algorithm and the all neighbors per cycle (ANPC) algorithm. We prove that the number of time-slots by the second algorithm is upper-bounded by 2K in some special case. The fully distributed versions of these algorithms are given in this paper. Simulation results also show that the performance of ANPC is rather better than ONPC.","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":"128469971","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

An Analytical Model for Priority-Based AQM in the Presence of Heterogeneous Network Traffic 异构网络流量下基于优先级的AQM分析模型

22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.140

Lan Wang, G. Min, I. Awan

引用次数: 7

IDMTM: A Novel Intrusion Detection Mechanism Based on Trust Model for Ad Hoc Networks 基于信任模型的Ad Hoc网络入侵检测机制IDMTM

22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.124

Furong Wang, Chen Huang, Jing Zhao, Chunming Rong

引用次数: 35

A Care Communication System with Space Sharing Function 具有空间共享功能的关怀沟通系统

22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.20

A. Koyama, Yosuke Takenaka, J. Arai, L. Barolli

引用次数: 2

Multi-Character Processor Array for Pattern Matching in Network Intrusion Detection System 面向网络入侵检测系统模式匹配的多字符处理器阵列

22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.119

Yeim-Kuan Chang, Ming-Li Tsai, Yu-Ru Chung

{"title":"Multi-Character Processor Array for Pattern Matching in Network Intrusion Detection System","authors":"Yeim-Kuan Chang, Ming-Li Tsai, Yu-Ru Chung","doi":"10.1109/AINA.2008.119","DOIUrl":"https://doi.org/10.1109/AINA.2008.119","url":null,"abstract":"Network intrusion detection system (NIDS) is a system developed for identifying attacks by using a set of rules. NIDS is an efficient way to provide the security protection for today's Internet. Pattern match algorithm plays an important role in NIDS that performs searches against multiple patterns for a string match. Pattern matching is a computationally expensive task. Traditional software-based NIDS solutions usually can not achieve a high-speed required for ever growing Internet attacks. In order to satisfy high-speed packet content inspection, hardware-implementable pattern match algorithm is required. In this paper, we propose a hardware-based pattern match architecture that employs a multi-character processor array. The proposed multi-character processor array is a parallel and pipelined architecture which can process multiple characters of the input stream per cycle. The proposed architecture can reduce a lot of unnecessary computations and thus it is power efficient. We use snort pattern sets and DEFCON packet traces to perform our simulations. Our experiment results show that, with a 3-character processor array, we can reduce 83% of the computations compared with the brute force approach.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"30 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":"131095441","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

Figurative Privacy Control of SIP-Based Narrowcasting 基于sip窄播的形象隐私控制

22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.128

M. S. Alam, Michael Cohen, Ashir Ahmed, J. Villegas

引用次数: 3

A Ubiquitous Supervisory System Based on Social Context Awareness 基于社会语境感知的泛在监控系统

22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.123

T. Suganuma, K. Yamanaka, Yoshikazu Tokairin, Hideyuki Takahashi, N. Shiratori

引用次数: 13

Performance-Directed iSCSI Security with Parallel Encryption 性能导向的iSCSI安全与并行加密

22nd International Conference on Advanced Information Networking and Applications (aina 2008) Pub Date : 2008-03-25 DOI: 10.1109/AINA.2008.91

Bo Mao, D. Feng, Suzhen Wu, Jianxi Chen, Lingfang Zeng

引用次数: 0