{"title":"Anonymity-Preserving Location Data Publishing","authors":"Girish Lingappa, Ying Cai","doi":"10.1109/ICCCN.2008.ECP.111","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.111","url":null,"abstract":"The advances in wireless communication and positioning technology have made it possible to collect large volumes of personal location data. While such data are useful to many organizations, making them public accessible is generally prohibited, because location data may imply sensitive private information. This paper investigates the challenges of publishing location data while preserving the location privacy of data subjects. Since location data itself may lead to subject reidentification, simply removing user identity of location data is not sufficient for anonymity preservation. To address this problem, this paper presents a novel technique that reduces location resolution to achieve a desired level of anonymity protection. The new scheme ensures K-anonymity protection and allows location data to be published as accurate as possible. More importantly, it is designed to support efficient publishing of large volumes of location data.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114211870","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}
P. Prucnal, M. Fok, K. Kravtsov, Yanhua Deng, Zhenxing Wang, N. Kostinski
{"title":"Using Optical Signal Processing to Provide Information Security in Data Networks","authors":"P. Prucnal, M. Fok, K. Kravtsov, Yanhua Deng, Zhenxing Wang, N. Kostinski","doi":"10.1109/ICCCN.2008.ECP.175","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.175","url":null,"abstract":"We propose and demonstrate the use of real-time optical signal processing, implemented with integrated and packaged off-the-shelf commercial technology, to enhance the security of data networks. Optical steganography, based on spread spectrum, is used to inhibit the observation of data traffic and the analysis of traffic patterns. Using optical CDMA to modulate the data, service interruption is prevented in presence of infrastructure attacks. Unlike conventional wavelength and time multiplexing approaches, the soft blocking capability of optical CDMA provides protection paths without permanently allocating bandwidth. The large size of the optical CDMA code set also reduces the probability that the secure signal can be intercepted by an eavesdropper. Finally, high-speed all-optical data encryption is demonstrated, which prevents side-channel attacks and enables real-time encryption with no delay.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115136053","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":"Revisiting p-Cycles / FIPP p-Cycles vs. Shared Link / Path Protection","authors":"Caroline Rocha, B. Jaumard","doi":"10.1109/ICCCN.2008.ECP.93","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.93","url":null,"abstract":"While the advantages of p-cycles and FIPP p-cycles are well established, there has been no systematic analysis of how much bandwidth they consume in comparison with the shared link or path protection schemes. It was also recently observed that, even enumerating a huge number of cycles is not necessarily a guarantee for obtaining good quality solutions with the classical ILP models if tools for large scale programming such as, e.g., column generation techniques, are not used. For instance, a reduction of up to 37% of the solution cost for FIPP p-cycles can be obtained when using column generation instead of classical ILP modeling. We propose to investigate the bandwidth protection costs of p-cycles and FIPP p-cycles in comparison with those of shared link and path protection, using column generation models for the four protection schemes, and therefore obtaining the optimal values for all of them, out of any doubt. Accurate quantitative comparisons show that the average excess required bandwidth is about 6.6% for p-cycles and about 13.4% for FIPP p-cycles in exchange of a much faster restoration time.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122064161","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":"Fair Randomized Antenna Allocation in Asynchronous MIMO Multi-Hop Networks","authors":"Ahmed K. F. Khattab, A. Sabharwal, E. Knightly","doi":"10.1109/ICCCN.2008.ECP.39","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.39","url":null,"abstract":"Previous work has shown that CSMA-based protocols such as the IEEE 802.11 can yield flow starvation in multi-hop wireless networks. While prior protocol designs alleviated such starvation by utilizing MIMO, they require global synchronization to temporally align transmissions and require per-packet distribution of the complete channel state information. In this paper, we experimentally show that MIMO networks based on pre-802.11 n medium access, the state-of-the-art for asynchronous MIMO CSMA, worsen starvation as compared to SISO networks. Consequently, we design an asynchronous MIMO MAC protocol that counters starvation. We show that randomized and non-greedy antenna allocation coupled with local residual capacity estimation results in previously-starving nodes capturing a fair share of system resources while simultaneously exploiting throughput gains available to multi-antenna systems.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129454432","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 Spanning Tree for Data Aggregation in Wireless Sensor Networks","authors":"Z. Eskandari, M. Moghaddam, A. Mohajerzadeh","doi":"10.1109/ICCCN.2008.ECP.152","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.152","url":null,"abstract":"Wireless sensor networks (WSN) consist of some nodes that have limited processing power, memory and energy source. These constraints cause the algorithms that presented in this field focus on these constraints. Data aggregation is any process in which information is gathered and expressed in a summary form. Data aggregation has been put forward as an essential paradigm for wireless routing in sensor networks. The idea is to combine the data coming from different sources, eliminating redundancy, minimizing the number of transmissions and thus saving energy. For this purpose, sensor nodes must form aggregation tree, then forward sensed data to the root of this tree. Data is aggregated in intermediate nodes and the results are sent toward the root. In this paper we propose an energy aware algorithm for construction the aggregation tree. The proposed algorithm considers both the energy and distance parameters to construct the tree. Simulation results show that the proposed algorithm has better performance in terms of energy efficiency and number of failed nodes which increases the network lifetime.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129928785","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":"Sources and Monitors: A Trust Model for Peer-to-Peer Networks","authors":"Yan Li, M. Gouda","doi":"10.1109/ICCCN.2008.ECP.67","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.67","url":null,"abstract":"In this paper, we introduce an objective model of trust in peer-to-peer networks. Based on this model, we develop protocols that can be used by the peers in a peer-to-peer network to compute the trust values of other peers in these networks. According to our model, the trust value of a peer is the probability that this peer sends correct messages to other peers, provided that this probability is at least 0.6. (A peer whose probability of sending correct messages is less than 0.6 is regarded as a bad peer that cannot be trusted by other peers in the network.) Each peer actively monitors several good peers in the network and accurately estimates the trust values of each of them. The peers then exchange messages about the trust values of the good peers that they have monitored, and each of them ends up accurately computing the trust values of many good peers in the network, even though many of the exchanged messages are arbitrarily wrong. Through analysis and simulation, we show that a peer in a network can compute the trust values of about 100 good peers in the network, while keeping the error in computing these trust values below 10-4.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128731991","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 Message Complexity Oriented Design of Distributed Algorithm for Long-Lived Multicasting in Wireless Sensor Networks","authors":"Song Guo, M. Guo, Victor C. M. Leung","doi":"10.1504/IJSNET.2009.029394","DOIUrl":"https://doi.org/10.1504/IJSNET.2009.029394","url":null,"abstract":"We consider an optimization problem in wireless sensor networks (WSNs) that is to find a multicast tree rooted at the source node and including all the destination nodes such that the lifetime of the tree is maximized. While a recently proposed distributed algorithm for this problem guarantees to obtain optimal solutions, we show that its high message complexity may prevent such contribution from being practically used in resource-constrained WSNs. In this paper, we proposed a new distributed suboptimal algorithm that achieves a good balance on the algorithm-optimality and message complexity. In particular, we prove that it has a linear-message complexity. The tradeoff between algorithm sub-optimality and message complexity is also studied by simulations.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127373216","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":"Top K-Leader Election in Wireless Ad Hoc Networks","authors":"V. Raychoudhury, Jiannong Cao, Weigang Wu","doi":"10.1109/ICCCN.2008.ECP.35","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.35","url":null,"abstract":"In this paper, we propose a distributed algorithm to elect the top K leaders among the nodes in a wireless ad hoc network. Leader election is a fundamental distributed coordination problem arising from many applications, e.g. token regeneration, directory service. However, there is no deterministic algorithm proposed for electing k leaders. In our algorithm, election is based on the weight values of the nodes, which can represent any performance related attribute such as the node's battery power, computational capabilities etc. To achieve message efficiency, coordinator nodes are first selected locally and then the coordinator nodes collect the weight information of other nodes using a diffusing computation approach. The coordinator nodes collaborate with each other to further reduce the message cost. Node failures are also considered in our design. The simulation results show that, compared with a naive solution, our proposed algorithm can elect top K leaders with much less message cost.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130993618","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 Preliminary Look at the Privacy of SSH Tunnels","authors":"M. Dusi, F. Gringoli, L. Salgarelli","doi":"10.1109/ICCCN.2008.ECP.122","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.122","url":null,"abstract":"Secure Shell (SSH) tunnels are commonly used to provide two types of privacy protection to clear-text application protocols. First and foremost, they aim at protecting the privacy of the data being exchanged between two peers, such as passwords, details of monetary transactions and so on. Second, they are supposed to protect the privacy of the behavior of end-users, by preventing an unauthorized observer from detecting which application protocol is being transported by an SSH tunnel. In this paper we introduce a GMM-based (Gaussian Mixture Model) technique that, under a set of reasonable assumptions, can be used to identify which application is being tunneled inside an SSH session by simply observing the stream of encrypted packets. This technique can therefore break the presumption of privacy in its second incarnation as described above. Although still preliminary, experimental results show that the technique can be quite effective, and that the standard bodies might need to take this approach under consideration when designing new obfuscation techniques for SSH.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132347813","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":"Policy Distribution Methods for Function Parallel Firewalls","authors":"Michael R. Horvath, E. Fulp, Patrick S. Wheeler","doi":"10.1109/ICCCN.2008.ECP.121","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.121","url":null,"abstract":"Parallel firewalls offer a scalable low latency design for inspecting packets at high speeds. Typically consisting of an array of m firewalls, these systems filter arriving packets according to a security policy. Given the firewall array, the rules can be distributed in two fashions. Data parallel copies the entire policy to each firewall and distributes packets. In contrast, function parallel distributes the rules and duplicates packets. The function parallel design can provide significantly lower delays than an equivalent data parallel design, however performance is dependent on how the rules are distributed. Therefore, policy management is vital to the performance of the function parallel firewall system. This paper describes the guidelines necessary to maintain policy integrity, which guarantees that a function parallel and a traditional firewall provide the same action for a packet. Based on these requirements, a policy can be divided into autonomous chains (sub-policies) that can be distributed across the firewall array. Although determining the optimal distribution was shown to be NP-hard, an effective algorithm was described. Simulation results indicate the distribution algorithm can provide an 86% reduction in the average processing delay as compared to previous distribution methods.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123859828","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}