Stephen Bock, S. Newsome, Q. Wang, W. Zeng, X. Lin, Jian Lu
{"title":"iImage: An Image Based Information Retrieval Application for the iPhone","authors":"Stephen Bock, S. Newsome, Q. Wang, W. Zeng, X. Lin, Jian Lu","doi":"10.1109/CCNC.2010.5421733","DOIUrl":"https://doi.org/10.1109/CCNC.2010.5421733","url":null,"abstract":"Image processing is a powerful technology that can be used to analyze an image for many useful purposes. However, software like this is often out ofthe typical user's reach. iImage directly confronts this problem. The iImage application takes the sophisticated technologies of image analysis and identification based on MPEG-7 image feature tools and makes them readily available on the go. With the use of the iPhone Source Development Kit, iImage has become an application that is available on the world's most popular mobile device. The user simply takes a photo using the iPhone's built in camera, and in seconds appear similar images with relevant information from within our database.","PeriodicalId":172400,"journal":{"name":"2010 7th IEEE Consumer Communications and Networking Conference","volume":"487 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116323340","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 Distributed Inter-Cell Interference Coordination Scheme in Downlink Multicell OFDMA Systems","authors":"K. Dong, Hui Tian, Xingming Li, Qiaoyun Sun","doi":"10.1109/CCNC.2010.5421833","DOIUrl":"https://doi.org/10.1109/CCNC.2010.5421833","url":null,"abstract":"In this paper, the inter-cell interference coordination (ICIC) is investigated for the downlink transmission in OFDMA-based multi-cellular systems. The utility function is introduced to balance efficiency and fairness. Firstly, the system model is built based on the resource allocation rules of soft frequency reuse (SFR) and the utility-based optimization problem is formulated. Secondly, the problem is simplified and analyzed in the 3-cell layout to obtain a local optimizing allocation rule. Thirdly, a distributed heuristic ICIC scheme is developed in which a part of the spectrum is defined to be the spectrum pool. Cells make occupation decisions of the spectrum pool according to locally available information of traffic load. The proposed scheme has little signaling overhead and low complexity. Simulation results validate it can improve the cell edge throughput performance effectively.","PeriodicalId":172400,"journal":{"name":"2010 7th IEEE Consumer Communications and Networking Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116791728","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":"Query Based Clustering Method in Structured P2P Overlay Networks","authors":"Q. Ma, Kun Zhao, Xiaoxiang Wang","doi":"10.1109/CCNC.2010.5421738","DOIUrl":"https://doi.org/10.1109/CCNC.2010.5421738","url":null,"abstract":"In structured Peer-to-Peer (P2P) overlay networks, similar documents are randomly distributed over peers with their data identifiers consistently hashed, which makes complex search challenging. Current state-of-the-art complex query approaches in structured P2P systems are mainly based on inverted list intersection. When the identifiers are distributed among peers, a complex query may involve many peers and cause a large amount of network traffic. One solution of implementing efficient complex query is to organize documents on each peer using clustering. In this paper, we propose a clustering method, QBC, which is composed of Pull Mode and Push Mode. Pull Mode uses historical queries to direct clustering in structured P2P overlay networks and Push Mode applies modified Vector Space Model (VSM) to define document set on each peer in order to assist clustering. Experiments show that QBC can reduce the number of peers visited during complex search, hence both query response time and network traffic are decreased.","PeriodicalId":172400,"journal":{"name":"2010 7th IEEE Consumer Communications and Networking Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115526645","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 Architecture of Intrusion Detection System","authors":"Da Zhang, C. Yeo","doi":"10.1109/CCNC.2010.5421824","DOIUrl":"https://doi.org/10.1109/CCNC.2010.5421824","url":null,"abstract":"In this paper, we propose a novel Intrusion Detection System (IDS), Court-like Cluster-based IDS (CCIDS), to secure routing protocoh: in Mobile Ad Hoc Networks (MANETs). After the network is divided into one-hop clusters, each of these clusters performs similar functions as a court in real-life, such as accusation, investigation and defence. We show that court like IDS is effective in many aspects, especially the capability to prevent malicious alerts and reduce false positive rate. To further prove its effectiveness, we then apply CCIDS in securing the Optimized Link State Routing (OLSR) protocol to solve two most severe attacks--link spoofing and link deletion. Through extensive simulation, four performance parameters, namely, detection rate, false positive rate, detection delay, and communication overhead are evaluated.","PeriodicalId":172400,"journal":{"name":"2010 7th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116205788","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":"ConBrowse - Contextual Content Browsing","authors":"C. Jacob, S. Steglich","doi":"10.1109/CCNC.2010.5421724","DOIUrl":"https://doi.org/10.1109/CCNC.2010.5421724","url":null,"abstract":"The World Wide Web today underlies a number of trends and visions that will change the manner of using and browsing it in a significant manner. The Semantic Web, the Mobile Web, or the Web of Things are three of these visions that already have produced manifold approaches and concepts, which, amongst others, focus on context-aware applications as a use case. These applications have the potential of usefully linking legacy web services and the personal area network of the user enabling novel services and tools. \u0000 \u0000As an approach that combines and harmonizes these different trends, we propose the concept of contextual content browsing in this paper, i.e., a context-aware approach for web browsing that utilizes personal information from the user to adapt web pages while he or she is browsing. In this manner, personalized and context-aware web content provisioning is enabled by connecting personal context sources and the web browser. Accordingly, we propose a framework, markup language, and software components to enable our approach.","PeriodicalId":172400,"journal":{"name":"2010 7th IEEE Consumer Communications and Networking Conference","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114846222","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}
Hyunwoo Hwang, Ju-hyun Kim, June-Sup Lee, Kyung-Geun Lee
{"title":"Fast Handoff Scheme Using Multicast Group for Intra-Domain in PMIPv6 Networks","authors":"Hyunwoo Hwang, Ju-hyun Kim, June-Sup Lee, Kyung-Geun Lee","doi":"10.1109/CCNC.2010.5421681","DOIUrl":"https://doi.org/10.1109/CCNC.2010.5421681","url":null,"abstract":"IETF (Internet Engineering Task Force) has proposed a PMIPv6 (Proxy Mobile IPv6) to make up for the weak points caused by handoff delay and signaling overhead. The handoff delay and signaling overhead occur due to frequent binding updates during handoff in the MIPv6 (Mobile lPv6). Although the handoff in the PMIPv6 can be faster than that in the MIPv6, there still exists the handoff delay and packet loss during the handoff. For these reasons, the researches to reduce the handoff delay and retransmit missing packets have been investigated [1]. We propose a scheme in order to set up the multicast group. As a result, the scheme reduces the handoff delay by using the cache and prevents the packet loss in the PMIPv6. We have analyzed general handoff performance in the PMIPv6 and packet loss occurring interval from a practical point of view to verify the proposed scheme.","PeriodicalId":172400,"journal":{"name":"2010 7th IEEE Consumer Communications and Networking Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127601065","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 Harmonization Among Power Saving Class in the IEEE 802.16e Systems","authors":"Sang-Wook Kwon, D. Cho","doi":"10.1109/CCNC.2010.5421621","DOIUrl":"https://doi.org/10.1109/CCNC.2010.5421621","url":null,"abstract":"The power saving mechanisms of the current IEEE 802.16e system are designed to take no consideration of the harmonization between power saving classes (PSCs) I and II. Hence, we propose a harmonized power saving mechanism between PSC I and PSC II to increase unavailability interval when a mobile station (MS) uses PSCs. The proposed mechanism adjusts the timing of the sleep window of PSC I to maximize the unavailability interval of the MSs. As a result, the proposed mechanism achieves power saving of the MSs. Through the simulation, we show that the proposed mechanism can reduce the power consumption of the MSs considerably compared with conventional mechanisms.","PeriodicalId":172400,"journal":{"name":"2010 7th IEEE Consumer Communications and Networking Conference","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125629436","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 Pipelined CRC Calculation Using Lookup Tables","authors":"Yan Sun, Min Sik Kim","doi":"10.1109/CCNC.2010.5421679","DOIUrl":"https://doi.org/10.1109/CCNC.2010.5421679","url":null,"abstract":"We present a fast cyclic redundancy check (CRC) algorithm that performs CRC computation for any length of message in parallel. Traditional CRC implementations have feedbacks, which make pipelining problematic. In the proposed approach, we eliminate feedbacks and implement a pipelined calculation of 32-bit CRC in the SMIC 0.13µm CMOS technology. For a given message, the algorithm first chunks the message into blocks, each of which has a fixed size equal to the degree of the generator polynomial. Then it computes CRC for the chunked blocks in parallel using lookup tables, and the results are combined together by performing XOR operations. The simulation results show that our proposed pipelined CRC is more efficient than existing CRC implementations.","PeriodicalId":172400,"journal":{"name":"2010 7th IEEE Consumer Communications and Networking Conference","volume":"77 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128087034","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":"Cross-Layer Forward Error Control for Reliable Transfer in Wireless Multimedia Sensor Networks","authors":"Yang Yang, Yongrui Chen, Weidong Yi","doi":"10.1109/CCNC.2010.5421716","DOIUrl":"https://doi.org/10.1109/CCNC.2010.5421716","url":null,"abstract":"A cross-layer forward error control (FEC) scheme for wireless multimedia sensor networks (WMSNs) is proposed in this paper. Employing a novel fountain code so called iterative joint source-channel fountain code (ISCFC), this cross-layer FEC scheme joint exploits the physical layer, transport layer and the application layer FEC approaches, and is capable of offering strong bit error correction capability as well as overcoming the packet loss in the multi-hop wireless communication.","PeriodicalId":172400,"journal":{"name":"2010 7th IEEE Consumer Communications and Networking Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125976624","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":"Distributed Spectrum Sharing in Cognitive Radio Networks - Game Theoretical View","authors":"Yu-Yu Lin, Kwang-Cheng Chen","doi":"10.1109/CCNC.2010.5421750","DOIUrl":"https://doi.org/10.1109/CCNC.2010.5421750","url":null,"abstract":"Consumer communication networking allows connections among consumer devices for possible Ad Hoc or heterogeneous networking on licensed and unlicensed bands. To support maximum flexibility of consumer communication networks, cognitive radio (CR) technology by spectrum sharing can well serve the purpose. Realistic spectrum sharing for cognitive radio networks (CRN) shall be distributed and based on partially available information of spectrum sensing, due to a possible good number of cognitive radios and impossible to perfectly exchange channel availability information. However, existing study assumes either centralized or perfect spectrum sensing. In this paper, we pioneer explore spectrum sensing as a side information and take imperfection of spectrum sensing results into consideration. We therefore develop spectrum sharing algorithms for spectrum access strategy of CRs under two general scenarios: public spectrum information broadcast from the base station and private spectrum information via individual spectrum sensing. Under the public spectrum in-formation, CRs are aware of the strategy of its opponents and therefore game theory model reaches Nash eqUilibrium as a solution. On the other hand, CRs have to follow maximin criterion with only local spectrum information. Difference in the behaviors of CRs between the two scenarios is identified and the optimal spectrum access strategy is proposed accordingly for both cases. Numerical results demonstrate that the proposed algorithms work effectively and prevent the system from collision even in a large network.","PeriodicalId":172400,"journal":{"name":"2010 7th IEEE Consumer Communications and Networking Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126827897","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}