2007 15th IEEE International Conference on Networks最新文献_第7页

Trusted Greedy Perimeter Stateless Routing 可信贪婪外围无状态路由

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444087

A. Pirzada, C. McDonald

{"title":"Trusted Greedy Perimeter Stateless Routing","authors":"A. Pirzada, C. McDonald","doi":"10.1109/ICON.2007.4444087","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444087","url":null,"abstract":"Ad-hoc networks generally comprise of mobile wireless nodes having limited communication and computation resources. These nodes execute special routing protocols, which help to establish multi-hop communication despite a dynamic topology. The greedy perimeter stateless routing (GPSR) protocol is one such routing protocol that is frequently used to establish routes in an ad-hoc or sensor network. However, for its precise execution, it is imperative that all nodes depict sustained benevolent behaviour. However, such an altruistic setting would never work in a wireless environment, which is intrinsically physically insecure. Consequently, participating malicious nodes may launch an array of attacks against the routing protocol leading to route severing, elongation or loop creation. In this paper, we present an improved variant of the GPSR protocol that uses the inherent characteristics of the routing process to assess the trust in the network nodes. These trust levels are then used to influence the routing decisions so as to circumvent malevolent nodes in the network. Extensive simulations indicate that the packet delivery ratio of the trusted GPSR protocol surpasses that of the standard GPSR by as much as 30% when as many as 50% of the nodes are acting maliciously in the network.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126023601","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}

引用次数: 66

Flexible Throughput Management in IEEE 802.11e Wireless LANs IEEE 802.11e无线局域网的灵活吞吐量管理

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444102

S. Karim, David Philip Green, M. Rumsewicz, N. Bean

引用次数: 0

TEAM: Trust Enhanced Security Architecture for Mobile Ad-hoc Networks 团队:移动Ad-hoc网络的信任增强安全架构

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444083

V. Balakrishnan, V. Varadharajan, U. Tupakula, Phillip Lucs

{"title":"TEAM: Trust Enhanced Security Architecture for Mobile Ad-hoc Networks","authors":"V. Balakrishnan, V. Varadharajan, U. Tupakula, Phillip Lucs","doi":"10.1109/ICON.2007.4444083","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444083","url":null,"abstract":"Security is paramount in mobile ad-hoc networks (MANET) as they are not conducive to centralized trusted authorities. Several solutions have been proposed for MANET in the areas of key management, secure routing, nodal cooperation, and trust management. Nevertheless, MANET lacks a unified architecture to take advantage of the deployed security models. In this paper, we propose trust enhanced security architecture for MANET (TEAM), in which a trust model is overlaid on the following security models - key management mechanism, secure routing protocol, and cooperation model. We briefly present the operation of our architecture and then we detail the system operation of our novel trust and cooperation model, which we call as secure MANET routing with trust intrigue (SMRTI) and fellowship respectively. SMRTI captures the evidence of trustworthiness for other nodes from the security models, and in return assists them to make better security decisions. Unlike related trust models, SMRTI captures recommendations in such a way that it eliminates both free-riding and honest-elicitation problems. In comparison with related cooperation models, fellowship model defends against both flooding and packet drop attacks. It can efficiently identify and isolate both malicious and selfish nodes that fail to share the communication channel or forward packets for other nodes. Furthermore, our models do not rely on any centralized authority or tamper-proof hardware. Simulation results confirm that our models enhance the performance of TEAM.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129987541","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}

引用次数: 29

Generalization of the RIN Result to Heterogeneous Networks of Aggregate Schedulers and Leaky Bucket Constrained Flows 将RIN结果推广到聚合调度和泄漏桶约束流异构网络

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444118

G. Rizzo, J. Boudec

{"title":"Generalization of the RIN Result to Heterogeneous Networks of Aggregate Schedulers and Leaky Bucket Constrained Flows","authors":"G. Rizzo, J. Boudec","doi":"10.1109/ICON.2007.4444118","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444118","url":null,"abstract":"We consider networks of FIFO aggregate schedulers. Quite surprisingly, the natural condition (node utilization inferior to one) in general is not sufficient in these networks to ensure stability (boundedness of delay and backlog at each node). Deriving good sufficient conditions for stability and delay bounds for these networks is of fundamental importance if we want to offer quality of service guarantees in such networks as DiffServ networks, high speed switches and network-on-chips. The main existing sufficient conditions for stability in these networks are the \"DiffServ bound\" and the route interference number (RIN) result. We use an algebraic approach. First, we develop a model of the network as a dynamical system, and we show how the problem can be reduced to properties of the state transition function. Second, we obtain new sufficient conditions for stability valid without any of the restrictions of the \"RIN result\". We show that in practical cases, when flows are leaky bucket constrained, the new sufficient conditions perform better than existing results. We also prove that the \"RIN result\" can be derived as a special case from our approach. We finally derive an expression for a bound to delay at all nodes.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132939284","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

Time-series Modelling of Server to Client IP Packet Length in First Person Shooter Games 第一人称射击游戏中服务器到客户端IP数据包长度的时间序列建模

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444138

A. Cricenti, P. Branch, G. Armitage

{"title":"Time-series Modelling of Server to Client IP Packet Length in First Person Shooter Games","authors":"A. Cricenti, P. Branch, G. Armitage","doi":"10.1109/ICON.2007.4444138","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444138","url":null,"abstract":"Modelling traffic generated by Internet based multiplayer computer games has attracted a great deal of attention in the past few years. In part this has been driven by a need to simulate correctly the network impact of highly interactive online game genres such as the first person shooter (FPS). Time-series models are important elements in the creation of realistic traffic generators for network simulators such as ns-2 and OMNeT++ as they account for the correlation between packets. In this paper we show that the time-series behaviour of FPS server-to-client packet lengths is well modelled by ARMA(1,1) processes. We report on data from six popular FPS games of the past 10 years including Half-Life, Half-Life Counter-Strike, Half-Life 2, Half-Life 2 Counter-Strike, Quake III Arena and Wolfenstein Enemy Territory. For each of these games we analyse sessions each comprising 2 to 9 players. In all cases ARMA(1,1) is an effective model. We also show that AR models of order 1 and higher fail to capture the packet size variance as effectively as ARMA(1,1). Finally we show that higher order ARMA models are no more effective in describing the time-series behaviour than the simpler ARMA(1,1) models.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132955635","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}

引用次数: 13

Aggregation of Wi-Fi Links: When Does it Work? Wi-Fi链路聚合:何时起作用?

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444106

A. Jayasuriya, S. Aust, P. Davis, Akira Yamaguchi, S. Obana

引用次数: 7

Myth: An Accurate and Scalable Network Coordinate System under High Node Churn Rate 谬论:高节点流失率下的精确可扩展网络坐标系统

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444076

Yang Chen, Genyi Zhao, Ang Li, Beixing Deng, Xing Li

引用次数: 8

Uplink Intercell Interference and Capacity in 3G LTE systems 3G LTE系统中的上行小区间干扰和容量

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444143

S. Elayoubi, O. B. Haddada

引用次数: 31

A Synthetic Streaming Quality Measurement System on IP Networks 一种基于IP网络的流媒体质量综合测量系统

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444061

Linghong Ji, Xia Yin, Xingang Shi, Zhiliang Wang

引用次数: 1

Using a Cache Scheme to Detect Misbehaving Nodes in Mobile Ad-Hoc Networks 使用缓存方案检测移动Ad-Hoc网络中的异常节点

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444053

Hongxun Liu, J. Delgado-Frías, S. Medidi

引用次数: 8