{"title":"A wireless Channel Allocation Algorithm with the Minimum Interference","authors":"Lin Chen, D. Liu, Ming He, Zhihong Liu","doi":"10.1109/COMCOMAP.2012.6154007","DOIUrl":"https://doi.org/10.1109/COMCOMAP.2012.6154007","url":null,"abstract":"Wireless channel allocation plays as an important role in the design of wireless network, as it greatly influences the throughput and performance of the network. Based on the measurement over a small test-bed, we find the relationship between network throughput and interference. We introduce a wireless channel allocation model, which is able to minimize the network interference. Based on these works, we put forward to a new algorithm named WCAAMI (Wireless Channel Allocation Algorithm with the Minimum Interference), which can converge to a stable optimal point and obtain the better network performance.","PeriodicalId":281865,"journal":{"name":"2012 Computing, Communications and Applications Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130693484","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":"Optimizing spectrum sensing efficiency in Cognitive Radio networks","authors":"L. Yang, S. H. Song, K. Letaief","doi":"10.1109/COMCOMAP.2012.6154854","DOIUrl":"https://doi.org/10.1109/COMCOMAP.2012.6154854","url":null,"abstract":"Cognitive Radio (CR) is a promising solution to meet the increasing demands of wireless communications by letting the secondary users (SUs) opportunistically utilize the spectrum licensed to primary users (PUs). For this purpose, spectrum sensing is an inevitable step to identify the available spectrum holes for the SUs. Cooperative spectrum sensing (CSS) is a powerful method which outperforms conventional single-user sensing technology due to multiuser diversity. To apply CSS, the fusion rule in the fusion center (FC) plays an important rule in obtaining a satisfying sensing performance. In this paper, we shall investigate the optimal fusion rule for combining hard decisions from energy-based detectors so as to maximize the spectrum sensing efficiency. For a given false alarm probability requirement, we will determine the optimal threshold for the K/N fusion rule. It is shown that the K/N fusion rule outperforms the AND and OR fusion rules in terms of sensing efficiency.","PeriodicalId":281865,"journal":{"name":"2012 Computing, Communications and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133109836","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":"Emerging consumer technology applications developed at PVAMU","authors":"A. Lodgher, K. Bellam","doi":"10.1109/COMCOMAP.2012.6154861","DOIUrl":"https://doi.org/10.1109/COMCOMAP.2012.6154861","url":null,"abstract":"Faculty and graduate students in the Computer Science (CS) and Computer Information Systems (CIS) at Prairie View A&M University (PVAMU) are working on several emerging technology applications. In this paper, we present several such applications. Graduate students in both these programs are taught to use innovation in their approach, to designing a new system or modifying an existing system. This approach is emphasized in a series of courses, which then culminates in their Masters Thesis or projects. One important component of this approach is that their concept should be implementable with the current available technologies or emerging technologies. This will enable them to think in more practical ways of implementing and marketing their product or process in the immediate future. Two of the systems presented here are based on RFID, and two systems are based on intelligent web services. The benefit of this approach is to create a new breed of workforce consisting of effective thinkers and innovators. It also teaches students that innovation is a never ending process - and that innovation can happen by looking at everyday systems in a different light, including application of new technologies to existing products, creating efficient processes, or creating new products.","PeriodicalId":281865,"journal":{"name":"2012 Computing, Communications and Applications Conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125745909","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":"Design and performance evaluation of tag caching router architecture for CGM content","authors":"H. Kurose","doi":"10.1109/COMCOMAP.2012.6154002","DOIUrl":"https://doi.org/10.1109/COMCOMAP.2012.6154002","url":null,"abstract":"In recent years, social interest in viewing consumer-generated media (CGM) contents has been rapidly growing, so their network traffic has been increasing considerably. To cope with this new increase in network traffic, we propose a tag caching router (TCR) architecture that supports folksonomies-based search and content caching for CGM content. Folksonomies are key words or metadata attached to the associated content by CGM-content creators, providers, and viewers to characterize the CGM content. The falksonomies-based search helps a user to find his/her interesting content because it automatically collects from the network the information of candidate contents with the folksonomy specified by the user and presents it as a content list to the user. The TCR architecture caches both content lists for content search and the associated contents for content downloading. We call this enhanced caching method as content caching. The performance of the proposed caching architecture was evaluated by performing a simulation for a wide variety of CGM contents with different traffic characteristics. The simulation results indicate that under a network model with 5 × 5 mesh-topology TCRs, content caching enables the TCR architecture combined with a conventional URI-based search to support a maximum of six-times more CGM access requests due to content caching than the number of accesses that can be supported by a conventional TCP/IP-based end-to-end architecture with a URI-based search. The number of accesses supported by the TCR architecture combined with folksonomies-based search increases to 17-times the number of accesses supported by the conventional TCP/IP-based end-to-end architecture with a URI-based search.","PeriodicalId":281865,"journal":{"name":"2012 Computing, Communications and Applications Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128775001","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}
Mingjie Feng, Da Chen, Zhiqiang Wang, Tao Jiang, Daiming Qu
{"title":"Throughput improvement for OFDMA femtocell networks through spectrum allocation and access control strategy","authors":"Mingjie Feng, Da Chen, Zhiqiang Wang, Tao Jiang, Daiming Qu","doi":"10.1109/COMCOMAP.2012.6154878","DOIUrl":"https://doi.org/10.1109/COMCOMAP.2012.6154878","url":null,"abstract":"In this paper, we propose a novel scheme to improve the throughput of femtocell networks. The proposed scheme consists of two steps: spectrum allocation for femtocells and dealing with nearby macro-users with access control strategy. Since the positions of femtocells are relatively stable, we firstly deal with inter-femtocell interference and formulate it as an integer programming problem. Then we analyze the effects of different access strategies on system throughput for each sub-channel and propose a novel access control strategy. Finally, the superiority of the proposed scheme is verified by simulation results.","PeriodicalId":281865,"journal":{"name":"2012 Computing, Communications and Applications Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133563014","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":"Semantically enabled data mashups using ontology learning method for Web APIs","authors":"Yong-Ju Lee, Jeong-Hong Kim","doi":"10.1109/COMCOMAP.2012.6154862","DOIUrl":"https://doi.org/10.1109/COMCOMAP.2012.6154862","url":null,"abstract":"Data mashups enable users to create new applications by combining Web APIs from several data sources. However, the existing data mashup framework requires some programming knowledge, hence it is not suitable for use by non-expert users. In this paper, we present an ontology learning method that builds semantic ontologies automatically, and propose an interactive composition approach based on a similarity search method that supports the dynamic composition of APIs. These techniques allow mashup developers to automate the discovery and composition of Web APIs eliminating the need for programmer involvement.","PeriodicalId":281865,"journal":{"name":"2012 Computing, Communications and Applications Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125132552","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":"Geographical opportunistic routing in dynamic multi-hop cognitive radio networks","authors":"Xing Tang, Yanan Chang, Kunxiao Zhou","doi":"10.1109/COMCOMAP.2012.6154853","DOIUrl":"https://doi.org/10.1109/COMCOMAP.2012.6154853","url":null,"abstract":"In this paper, we discuss the issue of unicast routing in dynamic CR networks. The problem of our concern is: given a set of CR nodes with geographical positions and temporarily available channels, how to design a protocol so that the average number of transmissions per packet for a unicast transmission is minimized. We propose a novel distributed protocol where packets are transmitted through successively geographic closer intermediate destination nodes, until eventually destination is reached. The intermediate destination nodes are within a two-hop neighborhood and locally chosen by a heuristic algorithm we develop. A priority-based opportunistic routing method is adopted to forward the packets between two nearby intermediate destination nodes. Extensive simulations are conducted to show the performance of our protocol.","PeriodicalId":281865,"journal":{"name":"2012 Computing, Communications and Applications Conference","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133767786","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}
Liu Yang, Ki-Ryong Kwon, Kwang-Seok Moon, Suk-Hwan Lee, Seong-Geun Kwon
{"title":"Broken traffic sign recognition based on local histogram matching","authors":"Liu Yang, Ki-Ryong Kwon, Kwang-Seok Moon, Suk-Hwan Lee, Seong-Geun Kwon","doi":"10.1109/COMCOMAP.2012.6154884","DOIUrl":"https://doi.org/10.1109/COMCOMAP.2012.6154884","url":null,"abstract":"We present an approach for recognizing the broken area of the traffic signs. The method is based on the Recognition System for Traffic Signs (RSTS). This paper describes an approach to using the location histogram matching for the broken traffic signs recognition, after the general process of the image detection and image categorization. The recognition proceeds by using the SIFT matching to adjust the acquired image to a standard position, then the histogram bin will be compared the preprocessed image with reference image, and finally output the location and percent values of the broken area.","PeriodicalId":281865,"journal":{"name":"2012 Computing, Communications and Applications Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122681381","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":"From NS-2 to NS-3 - Implementation and evaluation","authors":"N. Kamoltham, K. N. Nakorn, K. Rojviboonchai","doi":"10.1109/COMCOMAP.2012.6153999","DOIUrl":"https://doi.org/10.1109/COMCOMAP.2012.6153999","url":null,"abstract":"NS-2 is the most famous simulator among other network simulators. Most of researchers use NS-2 to evaluate their new protocols/architectures. Although NS-2 has much resource and many available tools to generate different characteristics and network scenarios, source codes created on NS-2 is not able to be reused for real implementation. The releasing of NS-3 changes the way researchers work. NS-3 allows the researchers to work on both simulations and emulations with the same implementation and source codes. These can help researchers to evaluate their works on a single computer for simulation or on a real system without wasting their time to implement their works twice; one in NS-2 simulation and the other in real system. In this paper, we elaborate different points of protocol implementation between NS-2 and NS-3. We recommend a setting for mobility trace in order to obtain correct results between NS-2 and NS-3. Then, as a case study, we use DECA, which is a reliable broadcasting protocol for VANETs and previously implemented on NS-2. How to transfer DECA from NS-2 to NS-3 and how to validate its performance are shown. Moreover, an emulation of DECA on real system using NS-3 is described. The emulation results show a problem caused by asymmetric links which is not concerned in most of literatures. In this paper, therefore, we also propose a simple solution to help protocols' operation in the asymmetric link scenarios. The simulation results show that our solution can improve protocol performance.","PeriodicalId":281865,"journal":{"name":"2012 Computing, Communications and Applications Conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129684276","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":"Hierarchical flow balancing protocol for data aggregation in wireless sensor networks","authors":"Y. Tao, Yongbing Zhang","doi":"10.1109/COMCOMAP.2012.6153994","DOIUrl":"https://doi.org/10.1109/COMCOMAP.2012.6153994","url":null,"abstract":"In this paper, we proposed a distributed hierarchical flow balancing (HFB) protocol for data aggregation in wireless sensor networks. A clustering algorithm is firstly proposed to group several sensors into one cluster based on the overlapping degrees of those sensors. Then, a backbone construction algorithm is proposed to construct a multi-level backbone network using the cluster heads. Furthermore, a flow balancing algorithm is designed to convey the sensed data from sensors to the sink. Lastly, a rerouting algorithm is proposed to reconstruct the network topology only around the locations where some cluster heads run out of their energy and drop out from the backbone. The proposed scheme has been evaluated in comparison with previous approaches using simulations. The simulation results show that HFB yields much longer lifetime than the others.","PeriodicalId":281865,"journal":{"name":"2012 Computing, Communications and Applications Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120925464","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}