2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)最新文献_第4页

Energy efficient learning solution for intrusion detection in Wireless Sensor Networks 无线传感器网络中入侵检测的节能学习解决方案

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431976

S. Misra, P. Venkata Krishna, Kiran Isaac Abraham

引用次数: 35

Using bandwidth-road maps for improving vehicular internet access 利用带宽路线图改善车载互联网接入

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431969

Jun Yao, S. Kanhere, Mahbub Hassan

引用次数: 3

Secure self organization of wireless sensor network: A new approach 无线传感器网络的安全自组织:一种新方法

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431968

H. Kalita, A. Kar

引用次数: 2

Coordinated sampling sans Origin-Destination identifiers: Algorithms and analysis 无始发-目的地标识符的协调抽样:算法和分析

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5432011

V. Sekar, Anupam Gupta, M. Reiter, Hui Zhang

{"title":"Coordinated sampling sans Origin-Destination identifiers: Algorithms and analysis","authors":"V. Sekar, Anupam Gupta, M. Reiter, Hui Zhang","doi":"10.1109/COMSNETS.2010.5432011","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432011","url":null,"abstract":"Flow monitoring is used for a wide range of network management applications. Many such applications require that the monitoring infrastructure provide high flow coverage and support fine-grained network-wide objectives. Coordinated Sampling (cSamp) is a recent proposal that improves the monitoring capabilities of ISPs to address these demands. In this paper, we address a key deployment impediment for cSamp-like solutions-the need for routers to determine the Origin-Destination (OD) pair of each packet. In practice, however, this information is not available without expensive changes. We present a new framework called cSamp-T, in which each router uses only local information, instead of the OD-pair identifiers. Leveraging results from the theory of maximizing sub-modular set functions, cSamp-T provides near-ideal performance in maximizing the total flow coverage in the network. Further, with a small amount of targeted upgrades to a few routers, cSamp-T nearly optimally maximizes the minimum fractional coverage across all OD-pairs. We demonstrate these results on a range of real topologies.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116642303","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

WebProfiler: Cooperative diagnosis of Web failures WebProfiler:网络故障的协同诊断

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431995

S. Agarwal, Nikitas Liogkas, Prashanth Mohan, V. Padmanabhan

引用次数: 17

Zone based ant colony routing in mobile ad-hoc network 移动自组网中基于区域的蚁群路由

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431989

Maumita Bandyopadhyay, Parama Bhaumik

{"title":"Zone based ant colony routing in mobile ad-hoc network","authors":"Maumita Bandyopadhyay, Parama Bhaumik","doi":"10.1109/COMSNETS.2010.5431989","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431989","url":null,"abstract":"Ant colony optimization (ACO) is a stochastic approach for solving combinatorial optimization problems like routing in computer networks. The idea of this optimization is based on the food accumulation methodology of the ant community. Zone based routing algorithms is build on the concept of individual node's position for routing of packets in mobile ad-hoc networks. Here the nodes' position can be further utilized to discover routes by the Ants in optimized way. Position based routing algorithms (POSANT) had some significant loopholes to find route (source to destination) like it never guarantees the route would be the shortest one, in cases while it is able to find it. On the contrary, routing algorithms which are based on ant colony optimization find routing paths that are close in length to the shortest paths. The drawback of these algorithms is the large number of control messages that needs to be sent or the long delay before the routes are established from a source to a destination. Here In this paper we have used Zone based ANT colony using Clustering which assures to find shortest route using the DIR principle (In this principle, the source or intermediate node transmits message to several neighbors and the node whose direction is closest to the direction of destination gets selected as the next hop forwarding node.) together with minimum overhead for route discovery and mobility management. Unlike other Zone based approach, in clustering it is not required to consider zone related information of each node while finding shortest path. Here, it is being proposed a new routing algorithm for mobile ad hoc network by combining the concept of Ant Colony approach and Zone based routing approach using clustering to get shortest path with small number of control messages to minimize the overhead. Simulations show that Zone Based ant colony routing algorithm has relatively short route establishment overhead than other zone based ant colony algorithms in highly mobile scenarios.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126509337","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

RAMP system for proactive pipeline monitoring 用于管道主动监测的RAMP系统

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431967

Jong-Hoon Kim, Gokarna Sharma, N. Boudriga, S. S. Iyengar

引用次数: 8

Bandwidth adaptation in streaming overlays 流覆盖中的带宽适应

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5432020

Simon Schubert, Frank C. Uyeda, N. Vasic, N. Cherukuri, Dejan Kostic

引用次数: 5

Enhanced Genetic algorithm for solving broadcast scheduling problem in TDMA based wireless networks 基于TDMA的无线网络广播调度问题的改进遗传算法

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431986

R. Srivathsan, S. Siddharth, Raghavan Muthuregunathan, R. Gunasekaran, V. R. Uthariaraj

{"title":"Enhanced Genetic algorithm for solving broadcast scheduling problem in TDMA based wireless networks","authors":"R. Srivathsan, S. Siddharth, Raghavan Muthuregunathan, R. Gunasekaran, V. R. Uthariaraj","doi":"10.1109/COMSNETS.2010.5431986","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431986","url":null,"abstract":"Fixed topology packet radio networks can be used where cable connection is not possible. In TDMA based broadcast schedule for these multihop networks, finding a collision free transmission schedule for every node in the network with minimum number of time slots and maximum slot usage is an NP-complete problem. Various heuristic approaches have been proposed to solve this problem. Among these, the Modified GA Approach by Chakraborty has used Genetic Algorithm for solving this problem by defining a new crossover operator that maintains only valid individuals in the population. But the crossover and mutation operators defined in that approach have less chances of maintaining diverse and fitter individuals in the population. In this paper, we enhance this Genetic algorithm by defining additional validity constraints whose application results in clearly observable optimizations in the individuals. Further, we define problem specific crossover and mutation operators that maintain these constraints while preserving diversity and fitness in the population. It is observed that the proposed Enhanced GA outperforms the existing heuristic approaches in almost all the test cases.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130300347","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

Cross-layer techniques for failure restoration of IP multicast with applications to IPTV IP组播故障恢复的跨层技术及其在IPTV中的应用

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5432003

M. Yuksel, Kadangode K. Ramakrishnan, R. Doverspike, R. Sinha, Guangzhi Li, K. Oikonomou, Dongmei Wang

{"title":"Cross-layer techniques for failure restoration of IP multicast with applications to IPTV","authors":"M. Yuksel, Kadangode K. Ramakrishnan, R. Doverspike, R. Sinha, Guangzhi Li, K. Oikonomou, Dongmei Wang","doi":"10.1109/COMSNETS.2010.5432003","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432003","url":null,"abstract":"Broadcast TV distribution over an IP network requires stringent QoS constraints, such as low latency and loss. Streaming content in IPTV is typically delivered to distribution points on an IP backbone using IP multicast protocols such as Protocol Independent Multicast Source Specific Mode (PIM-SSM). Link-restoration using MPLS or layer-2 Fast Reroute (FRR) is a proven failure restoration technique. Link-based FRR creates a pseudo-wire or tunnel in parallel to the IP adjacencies (links); and thus, single link failures are transparent to the Interior Gateway Protocol (IGP) such as OSPF. Although one may choose the back-up path's IGP link weights to avoid traffic overlap during any single physical link failure, multiple failures may still cause traffic overlap with FRR. We present a cross-layer restoration approach that combines both FRR-based restoration for single link failure and “hitless” (i.e., without loss) PIM tree reconfiguration algorithms to prevent traffic overlap when multiple failures occur.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128388345","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