2010 International Conference on Broadband, Wireless Computing, Communication and Applications最新文献

{"title":"A Biologically Modeled Intrusion Detection System for Mobile Networks","authors":"Brian C. Williams, E. Fulp","doi":"10.1109/BWCCA.2010.113","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.113","url":null,"abstract":"A computer security system is typically tasked with identifying an intrusion, which is defined as a set of actions that attempt to compromise, “the integrity, confidentiality, or availability of any resources provided by a computing system” [1] An attack on a computer system plays out in a series of sequential events, the granularity of which can vary drastically depending on the type of exploit. An intrusion detection system is tasked with monitoring a system or systems in order to look for these events as indicators of potential malicious behavior. Computer intrusion detection can be provided via signatures which describe the actions associated with an attack. In a world with constantly evolving threats combined with unique new attack vectors, maintaining signatures for every individual piece of malware becomes unwieldy. This is especially true in the mobile realm, where the additional processing power and battery capacity needed to handle high numbers of signatures adversely impacts the user experience and overall platform speed. As mobile devices become increasingly computer-like, complete with similar vulnerabilities and ever-increasing connectivity, their attractiveness to attackers has increased. Efficiently detecting threats across devices on a mobile network This paper introduces the Mobile Network Defense (MND), a lightweight intrusion detection system. MND is biologically-modeled on the behavior of a population of ants, giving it many advantages over traditional security measures. Each ant in the virtual colony has the ability to detect one specic metric of the current state of a computer. In combination, the results of these simple tests can point to specic attacks, while the dynamic nature of the MND offers performance benets over the traditional static setup. This paper will demonstrate how the biologically-modeled MND offers a 34% improvement in detection time over other agent-based systems, and provides more efficient intrusion detection platform than a static model with respect to CPU utilization, making the system attractive for use across many types of mobile devices.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133128075","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 Scalable Hybrid Time Protocol for a Heterogeneous Group","authors":"I. Tsuneizumi, A. Aikebaier, Makoto Ikeda, T. Enokido, M. Takizawa","doi":"10.1109/BWCCA.2010.73","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.73","url":null,"abstract":"In peer-to-peer (P2P) applications, a scalable group of multiple peer processes (peers) are required to cooperate with each other. In this paper, we discuss a two-layered heterogeneous hybrid time (THHT) protocol which takes advantage of the linear time (LT) and physical time (PT) to causally order messages in a scalable heterogeneous group. In a heterogeneous type of group, the clock accuracy of each peer and the minimum delay time between every pair of peers are not the same. It depends on accuracy of each physical clock and minimum delay time between a pair of peers how messages can be ordered. Each peer has to hold group information on the clock accuracy of every peer and the minimum delay time of every pair of peers. In a scalable group of n peers, it is not easy, maybe impossible for each peer to hold the group information due to storage and computation overhead O(n2 ). In this paper, we newly consider a multi-layered model of a scalable heterogeneous group to reduce the information which each peer has to hold.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114535229","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 a Common Notion of Privacy Leakage on Public Database","authors":"S. Kiyomoto, K. Martin","doi":"10.1109/BWCCA.2010.69","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.69","url":null,"abstract":"Two different approaches to defining a notion of database privacy, the generalization method and the perturbation method, have been independently studied. These two approaches are significantly different, making it hard to compare related research. In this paper, we propose a unified model that is based on the perturbation method, but which is applicable to generalized data sets. In particular, this model applies the notion of differential privacy to data sets that satisfy $k$-anonymity. We demonstrate this approach through a simple case study. This is a first step towards a common notion for protecting database privacy.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133354664","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":"State of the Art: Carbon Emission Accountability Modeling","authors":"Valencia Lo, V. Potdar","doi":"10.1109/BWCCA.2010.180","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.180","url":null,"abstract":"Global warming is becoming a big problem and carbon emissions from a variety of sources are the cause of it. To control emission, a number of carbon emission reduction policies and schemes such as the Kyoto Protocol & COP15 treaty have been reached and put in place. However, not all countries participate in these global carbon mitigation treaties. One of the many reasons for the absence of participation in developing countries is due to their incapable financial status. As in the case of developed countries such as the USA, it is usually due to monetary profiting before and after the participation and the ambiguous carbon emission responsibility that each country has to bear. Many accounting models have already been proposed in the current literature to solve the problem of responsibility ambiguity. However, the current accountability models are proposed for the general industries and not for the ICT industry. We feel that these models cannot be applied directly to the ICT industry since factors of influence are significantly different. In ICT industry, it involves a mix of international and national factors such as accountability issues (eg. the party responsible for the carbon emission) and the implications of participants and non-participants of those climate change mitigation treaties in different countries. Hence, taking into account all the determinant factors and different stakeholders involved in the process of the carbon accounting, we are proposing an efficacious and fair accountability model for the ICT industry in our research. This accountability model can be used to assist Government worldwide in coming up with a fair tax ‘relief/subsidy’ scheme for ICT companies for more sustainable business models. This research will take a science and engineering approach and the outcome of this research would be significant to the global combat against climate change.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128877366","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":"Impact of Source and Destination Movement on MANET Performance Considering BATMAN and AODV Protocols","authors":"Elis Kulla, Makoto Ikeda, L. Barolli, Rozeta Miho","doi":"10.1109/BWCCA.2010.54","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.54","url":null,"abstract":"In recent years, MANETs are continuing to attract the attention for their potential use in several fields such as military activities, rescue operations and time-critical applications. In this paper, we present the implementation and analysis of our implemented MANET testbed considering AODV and BATMAN protocols for wireless multi-hop networking. We investigate the effect of mobility and topology changing in MANET. We evaluate the performance of the routing protocols through experiments in real environment. In this work, we consider four scenarios: Static, Source Moving, Destination Moving and Source-Destination Moving. We assess the performance of our testbed in terms of throughput, number of dropped packets and delay. We found that, when routes are changing often, the BATMAN has better performance than AODV because it put the packets in a buffer. While, because AODV is a reactive protocol, it introduces some delay in the network.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129968491","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":"Field Estimation for Terrestrial Digital Broadcasting in Western Part of Fukuoka","authors":"J. Honda, K. Uchida, M. Takematsu","doi":"10.1504/IJSSC.2011.040345","DOIUrl":"https://doi.org/10.1504/IJSSC.2011.040345","url":null,"abstract":"Fukuoka tower plays an important role as master stations for several terrestrial digital broadcasting systems in Fukuoka area, which are going to completely replace the conventional analog broadcasting systems in 2011. The input power of the digital broadcasting system is reduced about one tenth of the old analog system, but the new system needs many relay stations to maintain high quality of services. In this paper, focusing on the relay station at Mt. Kaya in the western part of Fukuoka, we estimate the field distributions with respect to both the master and a relay station by using the discrete ray tracing method. We also discuss the necessity of a relay station in conjunction with the blind zones of the master station due to shadowing in a mountainous area.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128929021","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 Communication Protocol to Improve Fairness and Data Amount on Sensor Data Collection with a Mobile Sink","authors":"Wataru Seino, T. Yoshihisa, T. Hara, S. Nishio","doi":"10.1109/BWCCA.2010.45","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.45","url":null,"abstract":"Recently, many studies exploit mobile sinks to construct large-scale databases for environmental observations or weather forecasting. Mobile sinks travel in the sensing area that sensors are deployed, collect data from each sensor, and uploads them to sensor databases. By using mobile sinks, we can reduce communication traffic and maintenance cost compared with those for wireless sensor networks (WSNs). Some methods to give fairness to data collection for sensors have been proposed. However these methods give hard restrictions for sensor data collection. Therefore, the mobile sink does not always collect data from sensors even when it can collect. This causes a fewer amount of data collection. In this paper, we propose a communication protocol to increase the data amount that the mobile sink collects considering fairness of communication time. Our proposed protocol ensures fairness by giving an upper limit to the first communication time for a sensor. After that, the mobile sink collects data from the sensor again if the mobile sink cannot find any other sensors. Our simulation results demonstrated that our proposed protocol can ensure fairness of the communication time and can increase the amount of collected data.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131529487","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 Novel Adaptable Routing Protocol for Wireless Sensor Networks","authors":"K. Aravind, M. Pai","doi":"10.1109/BWCCA.2010.99","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.99","url":null,"abstract":"Routing is an important issue in WSNs with the sensor nodes having limited processing power, memory etc. In this paper we present a query-based routing protocol for a WSN that provides different classes of Quality of Service (QoS) in terms of energy-efficiency, reliability, low latency and fault tolerance for different application requirements. The algorithm has low computational overhead while guaranteeing different QoS support based on the application demand. The novelty of the proposed algorithm is the ability to provide multiple QoS support without having to reconfigure or redeploy sensor nodes. The performance of the algorithm has been evaluated by implementing it on network simulator NS-2 with 802.15.4 libraries. The results show that the algorithm gives good performance statistics for the designed QoS terms thereby satisfying the goal of the design.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131097459","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":"Inter-ONU Scheduling Scheme for QoS Guarantee in 10G EPON","authors":"Jae-Hyun Jun, Zhibin Yu, Min-Suk Jung, Sung-Ho Kim","doi":"10.1109/BWCCA.2010.61","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.61","url":null,"abstract":"Recently, more and more services need high quality bandwidth. In order to satisfy those services, high-speed networks are needed. The Task Force team of IEEE 802.3ah set a standard as Ethernet Passive Optical Network (EPON) that is a next generation subscriber access network. IEEE 802.3av developed 10G EPON which has 10 times more capacity than EPON to solve the high quality problem. Research on 10G EPON has been conducted by Kramer, but still there were limitations in providing Quality of Service (QoS). Therefore, this paper suggests a Time synchronization method, resource reservation method, and bandwidth allocation method in 10G EPON. The OPNET simulation results show that our proposed ideas can provide enough services in 10G EPON.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130906001","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":"Examination of Selection for Relay Nodes Adapted to Priority of Transportation in Triage Network","authors":"Hiroki Tamura, Hikaru Kobayashi, H. Shigeno, Ken-ichi Okada","doi":"10.1109/BWCCA.2010.62","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.62","url":null,"abstract":"Applying sensor network to emergency lifesaving systems called Triage to decide priority of transportation in disasters is an active area of research. It is necessary to keep collecting data by sensors fixed in injured people. Sensors selected as relay nodes consume battery in large quantity and are easy to be out of battery in collecting the data. In addition, sensors secede from the network because injured people are transported sequentially. But sensors transported later are easy to be out of battery because of remaining in the network for a long time. So in this paper, we propose selection of relay nodes adapted to priority of transportation. Our proposal keeps the packet arrival rate and suppresses the battery consumption totally by generating multiple routes by broadcast from the sink. In addition, it suppresses battery consumption of sensors transported later by using priority of transportation. We evaluate our proposal by the simulation and show this effectiveness.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130611102","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}