{"title":"d-ACTM: Distributed Anomaly Connection Tree Method to detect Silent Worms","authors":"N. Kawaguchi, H. Shigeno, Ken-ichi Okada","doi":"10.1109/PCCC.2007.358934","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358934","url":null,"abstract":"This paper proposes a distributed network based worm detection method, d-ACTM, to detect a kind of hit-list worm named Silent worm. The worm propagation behavior in the network is expressed as a tree-like structure composed of the infected hosts and the infection connections. d-ACTM detects the existence of worms by detecting the tree structures composed of anomaly connections in a distributed manner. The simulation result shows that d-ACTM can detect Silent worms before 7% of all vulnerable hosts are infected under the condition where the infection interval is equals to the normal connection interval.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126178854","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":"The Interworking between EDCA 802.11e and DiffServ","authors":"A. Elmangosh, M. Ashibani, Fathi B. Shatwan","doi":"10.1109/PCCC.2007.358938","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358938","url":null,"abstract":"The provisioning of quality-of-service (QoS) with interworking between heterogeneous mobile environments will be of vital importance for the future success of mobile telecommunications. As each network technology has its own distinct QoS mechanism, it becomes essential to support interworking methods between different QoS technologies, in order to guarantee end-to-end QoS in heterogeneous networks. This paper investigates the interworking between differentiated service (DiffServ) core networks and the IEEE 802.11e QoS-enabled wireless LAN (WLAN). An interworking framework is proposed, in addition to a mapping scheme from the DiffServ per-hob behaviors (PHBs) to the 802.11e enhanced distributed coordinated access (EDCA) access categories (AC). The interworking framework is evaluated by means of simulation demonstrating the conformance of 802.11e EDCA to DiffServ PHBs in an end-to-end architecture.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124239898","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":"GKM: A Group Dynamics Aware Key Management Scheme for Multicast Communications in Ad-hoc Sensor Networks","authors":"Hui Ling, T. Znati","doi":"10.1109/PCCC.2007.358927","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358927","url":null,"abstract":"Multicast communications are crucial to support collaborative information processing and dissemination in ad hoc sensor networks (ASNs). The unique characteristics, including the severe resource constraints of sensor nodes and the lack of infrastructure, make it highly challenging to secure the multicast communications in these networks. To this end, we propose a novel key pre-distribution based scheme, referred to as GKM, for secure multicasting in ASNs. Prior to network deployment, each node is assigned with a set of keys. After nodes are deployed and a multicast group is formed, a group tree is distributively constructed among the group members, by utilizing group dynamics such as hop distance between group members. The group keys are then established and updated through the group tree. Unlike existing key predistribution schemes, GKM does not rely on non-group intermediate nodes to manage group keys dynamically. As a result, GKM achieves higher levels of security than existing key pre-distribution schemes.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123442168","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":"Towards Survivable and Secure Wireless Sensor Networks","authors":"Y. Qian, K. Lu, D. Tipper","doi":"10.1109/PCCC.2007.358925","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358925","url":null,"abstract":"In this paper, we present a comprehensive study on the design of secure and survivable wireless sensor networks (WSNs). Our goal is to develop a framework that provides both security and survivability features that are crucial to applications in WSNs, which are vulnerable to physical and network based security attacks, accidents, and failures. To achieve such a goal, we first examine the security requirements and survivability requirements. We then propose an architecture for security and survivability in WSNs with heterogeneous sensor nodes. To understand the interactions between survivability and security, we also design and analyze a key management scheme. The experiment results show that 1) a good design can improve both security and survivability of WSNs; and 2) in some situation, there is a trade-off between security and survivability.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131436439","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 Power Management Proxy with a New Best-of-N Bloom Filter Design to Reduce False Positives","authors":"M. Jimeno, Kenneth J. Christensen, A. Roginsky","doi":"10.1109/PCCC.2007.358887","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358887","url":null,"abstract":"Bloom filters are a probabilistic data structure used to evaluate set membership. A group of hash functions are used to map elements into a bloom filter and to test elements for membership. In this paper, we propose using multiple groups of hash functions and selecting the group that generates the bloom filter instance with the smallest number of bits set to I. We evaluate the performance of this new Best-of-N method using order statistics and an actual implementation. Our analysis shows that significant reduction in the probability of a false positive can be achieved. We also propose and evaluate a new method that uses a random number generator (RNG) to generate multiple hashes from one initial \"seed\" hash. This RNG method (motivated by a method from Kirsch and Mitzenmacher) makes the computational expense of the Best-of-N method very modest. The target application is a power management proxy for P2P applications executing in a resource-constrained \"SmartNIC\".","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125546925","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 Application Layer Extension for Multipoint Communication for the Session Initiation Protocol","authors":"Brian J. Thorp, S. Midkiff","doi":"10.1109/PCCC.2007.358895","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358895","url":null,"abstract":"The session initiation protocol (SIP) enables multipoint communications through the use of conferencing and IP multicast, but the usefulness of SIP's multiparty communications is limited. This paper introduces an extension to SIP that provides membership awareness, fault tolerance, and partition recovery for conferencing. The extension also supports application layer multicast for session negotiation and transfer of necessary session information for protocol initialization. We report performance results that characterize message size, message processing time, and partition reformation delays. Using a ring protocol implementation, we demonstrate the ability of the extension to operate with an application layer multipoint protocol and evaluate performance with respect to message size and reformation delay.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"2010 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125634590","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":"Rover: An Integration and Fusion Platform to Enhance Situational Awareness","authors":"Christian B. Almazan, M. Youssef, A. Agrawala","doi":"10.1109/PCCC.2007.358945","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358945","url":null,"abstract":"First responders need to be able to have the most amount of situational awareness of the operations they perform while not being overwhelmed by all of the information that may be made available to them. This paper presents the Rover integration and fusion platform to alleviate the fusing of multiple information sources, which may not be known prior to the beginning of an operation. Rover can aid fusing sources by providing as much contextual information which often will be forgotten when designing programs, mapping contextual information into a view in which programs and users can use, and automate well-known and designed tasks. All of this occurs while deploying Rover to first responder incident scenes without the need for an existing network infrastructure prior to an incident.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125642489","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":"Classification Model for Access Control Constraints","authors":"Mathias Kohler, C. Liesegang, A. Schaad","doi":"10.1109/PCCC.2007.358921","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358921","url":null,"abstract":"Whether access is given to a protected entity is decided upon evaluation of access control constraints. Though some initial approaches to classify access control constraints can be identified in the current literature, they must be considered as too broad with respect to today's multi-layered system landscapes. In this paper we present a classification model for authorization constraint types extracted from recent publications. We identify common restriction characteristics and classify the constraint types depending on their information sources necessary for constraint evaluation. We identified the following authorization classes: authentication, ontology, environment, and activity. We further propose a system architecture supporting these classes. We map our model architecture onto the Windows 2003 Authorization Manager, identify the components equal to our proposed architecture and emphasize which authorization classes are supported. We therefore show the applicability of our model to analyze existing authorization systems and determine the supported constraints.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121056314","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":"Streaming in MANET: Proactive Link Protection and Receiver-Oriented Adaptation","authors":"Toby Xu, Ymg Cai","doi":"10.1109/PCCC.2007.358893","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358893","url":null,"abstract":"Multimedia streaming applications can significantly boost the value of mobile ad hoc networks (MANET). Live streaming, however, means continuous data delivery, which is a major challenge in MANET. Because of host mobility, a streaming path may be broken easily, causing streaming interruption. In this paper, we address this problem with a light-weighted yet robust streaming protocol. Our technique distinguishes itself from existing ones with two innovative features: proactive link protection (PLP) and receiver-oriented adaptation (ROA). PLP allows a mobile host in a streaming path to find an alternative link before its current one becomes broken. This feature minimizes the chance of having to discover a new path in urgent to replace a broken link. While PLP protects the streaming continuity, ROA ensures the streaming efficiency by minimizing the hop number of a streaming path. Specifically, ROA dynamically adjusts the path of a live stream to make it as straight as possible along the direction from the source to the receiver. We evaluate the proposed technique through simulation, and our extensive study indicates that the new technique can support robust streaming applications with a minimal control overhead.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"1985 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131067053","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}
Yanzhong Bi, J. Niu, Limin Sun, Huan-Yuan Wei, Yi Sun
{"title":"Moving Schemes for Mobile Sinks in Wireless Sensor Networks","authors":"Yanzhong Bi, J. Niu, Limin Sun, Huan-Yuan Wei, Yi Sun","doi":"10.1109/PCCC.2007.358884","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358884","url":null,"abstract":"In a wireless sensor network for data-gathering applications, if all network data congregate to a stationary sink node hop by hop, the sensor nodes near the sink have to consume more energy on forwarding data for other nodes, which probably causes the early function loss of the sensor network. Employing a mobile sink can alleviate the hotspot problem and balance the energy consumption among the sensor nodes. In this paper, we propose two autonomous moving schemes for the mobile sink. In our schemes, the sink makes moving decisions without complete knowledge of network topology and the energy distribution of all sensor nodes. We evaluated the performance of our moving schemes by simulation and the results show that both the two schemes can extend the network lifetime prominently.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"39 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130968579","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}