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

{"title":"Rate adaptation in MIMO antenna selection system with imperfect CSIT","authors":"T. Ramya, S. Bhashyam","doi":"10.1109/COMSNETS.2010.5431959","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431959","url":null,"abstract":"In this paper, we analyze the performance of an adaptive Multiple Input Multiple Output (MIMO) system employing transmit antenna selection and rate adaptation based on channel state information (CSI). Imperfections in CSI due to estimation error and feedback delay are considered. Since CSI is imperfect, the rate of transmission is chosen in order to meet a target outage probability. The average throughput is evaluated for various cases of imperfect CSI using Monte Carlo simulations. Simulation results show that rate adaptation provides significant gains even with imperfect CSI. Furthermore, prediction can be used to effectively combat the effect of feedback delay.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"35 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":"127467317","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}

{"title":"A framework for security quantification of networked machines","authors":"Hui Wang, Suman Roy, A. Das, S. Paul","doi":"10.1109/COMSNETS.2010.5431978","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431978","url":null,"abstract":"Widespread application of computer network has evoked a lot of interest for cyber attackers to target these systems. In addition to cryptography based protective techniques such as authentication and authorization, several defense measures, like Intrusion Detection and Tolerance, and tools are employed to protect networks thereby, making security a critical issue. Therefore, the need for defining, structuring, and quantifying security arises as a necessary first step towards measuring the effectiveness of security related deployments. This work proposes a structured approach to define and analyze security related metrics for intrusion tolerant systems for each individual host in the network and compose them in a meaningful way to provide an overall security quantification for a network. The dynamics of each machine against a particular vulnerability is modeled as a (hidden) Markov process to capture uncertainties in attacker's action and system response. Based on these stochastic analysis, security metrics of each machine are calculated which are subsequently used in the final computation of the security metrics of the network.1","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"31 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":"133928178","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}

{"title":"Coping with link failures in centralized control plane architectures","authors":"Maulik Desai, T. Nandagopal","doi":"10.1109/COMSNETS.2010.5431977","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431977","url":null,"abstract":"Recently proposed SoftRouter and 4D network architectures recommend having the least amount of intelligence in the switches. They advocate transferring control plane functionalities to general-purpose servers that could govern these switches remotely. A link failure in such architectures could result into switches losing contact with the controller or even generating routing loops. These scenarios could generate a large amount of unnecessary traffic in the network. We study the implications of a failed link in such architectures. We develop an algorithm that would inform only the relevant switches to refrain from sending messages in the direction of the failed link, and yet have the minimum amount of intelligence on the switches. We implement our algorithm on a network formed by OpenFlow switches and evaluate its performance. Our experiments verify that the performance of our algorithm is dependent on the total number of flow-table entries in a switch. We also verify that by implementing our algorithm all the necessary switches are informed of the failed link significantly sooner than the controller identifies the failed link and sends out an update.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"63 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":"134260363","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}

{"title":"Selection of time synchronizing nodes in wireless sensor network","authors":"Tanmay Ratnaparkhe, Sagar Natekar, Shridhar Chandan, V. Sadaphal","doi":"10.1109/COMSNETS.2010.5431974","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431974","url":null,"abstract":"Time synchronization is a critical piece of infrastructure in any wireless sensor network. Time synchronizing nodes are nodes which are responsible for propagating time in the network. Other nodes in the network synchronize themselves with respect to the synchronizing nodes. For various reasons, it is desirable that the number of such nodes is minimized. In this paper, we consider selection of time synchronizing nodes for two protocols viz. a protocol that helps propagate absolute time in the network and another protocol that provides nodes with local relative timescales. We show that the problem of selection of minimum number of time synchronizing nodes for the two protocols is NP-Complete. We then consider selecting time synchronizing nodes for one of the two protocols, Reference Broadcast Synchronization (RBS) protocol, present simulation results. We further present a fault tolerant selection of synchronizing nodes for RBS.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"61 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":"133377026","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}

{"title":"Robustness of DTN against routing attacks","authors":"F. C. Choo, M. Chan, E. Chang","doi":"10.1109/COMSNETS.2010.5432014","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432014","url":null,"abstract":"In this work, we study robustness of DTN routing in the absence of authentication. We identify conditions for an attack to be effective and present an attack based on a combination of targeted flooding and acknowledgement counterfeiting that is highly effective even with only a small number of attackers. Simulation results show that delivery ratio decrease by 30% to 50% using only 2 attackers for the two mobility patterns studied (Haggle and DieselNet). We observe that minimum hop count for packet delivery has a strong influence on the robustness of the DTN routing protocols. Generally, attacks become increasingly effective when the minimum hop count required increases. Further, use of global routing metadata in the routing protocol also increases attack effectiveness. Our study provides insights to the robustness of routing attacks in different DTNs settings and can be useful to DTN designers who want to choose the appropriate level of security that is needed for their respective scenarios.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"76 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":"123065521","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}

{"title":"Scalable rekeying for dynamic groups using key path compression","authors":"D. Raju, Valli Kumari Vatsavayi, K. V. S. V. N. Raju","doi":"10.1109/COMSNETS.2010.5431963","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431963","url":null,"abstract":"This paper proposes a technique for dynamic group key rekeying which is based on path compression of the key path of the new member or evicted member.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"21 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":"127221394","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}

{"title":"An integrated soft handoff approach to IP fast reroute in wireless mobile networks","authors":"S. Cevher, Ta Chen, Ibrahim Hökelek, Jaewon Kang, V. Kaul, Yow-Jian Lin, Marcus Pang, M. Rodoper, S. Samtani, C. Shah, J. Bowcock, G. B. Rucker, J. Simbol, A. Staikos","doi":"10.1109/COMSNETS.2010.5432006","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432006","url":null,"abstract":"This paper presents an integrated approach to IP fast reroute (IPFRR) of both unicast and multicast paths in wireless mobile networks. A distinct feature of the proposed approach is that, instead of modifying existing routing protocols, it employs a soft handoff technique, i.e., temporarily installs pre-computed Loop Free Alternative Paths (LFAPs) until the co-existing routing protocol converges to new routes. The proposed approach builds on our previously proposed IPFRR technology and uses the concept of pre-computed LFAPs not only for local but also for remote link failures within a certain neighborhood to achieve full alternative path coverage for a single link failure. This paper's contributions include: i) bandwidth efficient fast failure detection by integrating two novel mechanisms, namely probing and link quality prediction, ii) a novel method for calculating LFAPs, iii) a framework for switching seamlessly between LFAPs and OSPF paths, iv) a multicast fast reroute mechanism, and v) implementation in eXtensible Open Router Platform (XORP). We also present a generic framework for handling multiple simultaneous failures in the integrated IPFRR. The performance evaluation has been performed in both indoor and outdoor environments with real 802.11 radio links. The results confirm that our IPFRR technology consistently provides significant convergence time improvement during a single link failure event.","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":"130992965","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}

{"title":"Energy-efficient mobile data collection in Wireless Sensor Networks with delay reduction using wireless communication","authors":"Arun K. Kumar, K. Sivalingam","doi":"10.1109/COMSNETS.2010.5431982","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431982","url":null,"abstract":"In a Wireless Sensor Network (WSN), battery power is a limited resource on the sensor nodes. Hence, the amount of power consumption by the nodes determines the node and network lifetime. This in turn has an impact on the connectivity and coverage of the network. One way to reduce power consumed is to use a special Mobile Data Collector (MDC) for data gathering, instead of multi-hop data transmission to the sink. The MDC collects the data from the nodes and transfers it to the sink. Various kinds of MDC approaches have been explored for different assumptions and constraints. But in all the models proposed, the data latency is usually high, due to the slow speed of the mobile nodes. In this paper, we propose a new model of mobile data collection that reduces the data latency significantly. Using a combination of a new touring strategy based on clustering and a data collection mechanism based on wireless communication, we show that the delay can be reduced significantly without compromising on the advantages of MDC based approach. Using extensive simulation studies, we analyze the performance of the proposed approach and show that the packet delay reduces by more than half when compared to other existing approaches.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"31 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":"122852534","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}

{"title":"Primal meets dual: A generalized theory of logical topology survivability in IP-over-WDM optical networks","authors":"K. Thulasiraman, Muhammad S. Javed, G. Xue","doi":"10.1109/COMSNETS.2010.5432016","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432016","url":null,"abstract":"The survivable logical topology mapping (SLTM) problem in an IP-over-WDM optical network is to map each link (u, v) in the logical topology (at the IP layer) into a lightpath between the nodes u and v in the physical topology (at the optical layer) such that failure of a physical link does not cause the logical topology to become disconnected. It is assumed that both the physical and logical topologies are 2-edge connected. For this problem Kurant and Thiran presented an algorithmic framework called SMART that involves successively contracting circuits in the logical topology and mapping the logical links in the circuits into edge disjoint lightpaths in the physical topology. In a recent work we presented a dual framework involving cutsets and showed that both these frameworks possess the same algorithmic structure. Algorithms CIRCUIT-SMART, CUTSET-SMART, CUTSET-SMART-SIMPLIFIED and INCIDENCE-SMART were also presented in. Effectiveness of both these frameworks as well as their robustness in providing survivability against multiple failures depends on the lengths of the cutset cover and circuit cover sequences on which they are based. To improve their effectiveness and robustness, in this paper we first introduce the concept of generalized cutset cover and generalized circuit cover sequences. We present an algorithm to get a generalized cutset (circuit) cover sequence from any given cutset (circuit) cover sequence. We then present GENCUTSET-SMART and GEN-CUTSET-SMART-SIMPLIFIED algorithms that remove some of the shortcomings of the dual framework of. We prove that there is a one-to-one correspondence between the set of generalized circuit cover sequences and the set of generalized cutset cover sequences. We then show that for each execution of GEN-CIRCUIT-SMART there exists an execution of GEN-CUTSET-SMART-SIMPLIFIED such that the groups of edges that they map into edge disjoint lightpaths are exactly the same. In other words, the distinction between the primal and dual methods disappears when they use generalized sequences. Preliminary simulation results confirm our expectation that GEN-CUTSET-SMART-SIMPLIFIED will perform better than CIRCUIT-SMART and CUTSET-SMART-SIMPLIFIED (when started with a circuit or a cutset sequence) in terms of number of additional protection edges to be added.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"15 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":"116179311","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}

{"title":"SPAMMS: A sensor-based pipeline autonomous monitoring and maintenance system","authors":"Jong-Hoon Kim, Gokarna Sharma, N. Boudriga, S. Iyengar","doi":"10.1109/COMSNETS.2010.5432015","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432015","url":null,"abstract":"Pipeline-based applications have become the indispensable part of life. Active monitoring and frequent inspections are critical to maintaining pipeline health. However, these tasks are highly expensive using the traditional maintenance systems, knowing that the pipeline systems can be largely deployed in an inaccessible and hazardous environment. In this paper, we propose a novel cost effective, scalable, customizable, and autonomous sensor-based system, called SPAMMS. It combines robot agent based technologies with sensing technologies for efficiently locating health related events and allows active and corrective monitoring and maintenance of the pipelines. SPAMMS integrates RFID systems with mobile sensors and autonomous robots. While the mobile sensor motion is based on the fluid transported by the pipeline, the fixed sensors provide event and mobile sensor location information and contribute efficiently to the study of health history of the pipeline. In addition, it permits a good tracking of the mobile sensors. Using the output of event analysis, a robot agent gets command from the controlling system, travels inside the pipelines for detailed inspection and repairing of the reported incidents (e.g., damage, leakage, or corrosion). The key innovations of SPAMMS are 3-fold: (a) the system can apply to a large variety of pipeline systems; (b) the solution provided is cost effective since it uses low cost powerless fixed sensors that can be setup while the pipeline system is operating; (c) the robot is autonomous and the localization technique allows controllable errors. The simulation experiments described in this paper along with prototyping activities demonstrate the feasibility of SPAMMS.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"14 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":"123474444","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}