{"title":"Unified Metrics for Management of Smart Grid Home Area Networks","authors":"Tim Godfrey, Craig Rodine","doi":"10.1109/ICCW.2010.5503925","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503925","url":null,"abstract":"The advent of the Smart Grid brings new network management challenges and opportunities. Multiple IEEE network technologies, including 802.11, 802.15.4 and P1901 can all support Smart Grid applications in Home Area Networks (HANs). Utilities need visibility into the HAN to ensure the network is operational and able to support critical applications such as Demand Response and Electric Vehicle Charging. This paper describes a set of network performance metrics that are consistent among the most prevalent HAN network technologies. These metrics enable higher layer network monitoring and management entities to support the HAN as part of the overall Smart Grid network.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126381917","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":"Chipless RFID Systems for Car-to-Infrastructure Communication","authors":"L. Reichardt, G. Adamiuk, G. Jereczek, T. Zwick","doi":"10.1109/ICCW.2010.5503936","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503936","url":null,"abstract":"In this paper a chipless RFID system for Car-to-Infrastructure communication is proposed. The system works in the UWB frequency band and is based on spectral information coding. The system, including the tags with resonators, filter arrays and antennas are presented and its functionality is evidenced by measurements.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126434111","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":"Spectrum Sensing Approach Based on Optimal Stochastic Resonance Technique under Color Noise Background in Cognitive Radio Networks","authors":"Di He, Chen He, Ling-ge Jiang, Yingpei Lin","doi":"10.1109/ICCW.2010.5503883","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503883","url":null,"abstract":"An optimal-stochastic-resonance-based spectrum sensing approach under color noise environment is proposed in this paper. It can improve the detection performance of energy detector in color noise background especially under low signal-to-noise radio (SNR). The suitable stochastic resonance (SR) noise and corresponding driving parameter can be introduced to maximize the output SNR of the SR system and the received signal. Computer simulation results show the efficiency of the proposed spectrum sensing approach under different kinds of color noises and its advantages over traditional energy detectors.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125740702","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 Efficient Multiple Relay Selection Scheme for Cognitive Radio Systems","authors":"M. Naeem, D. Lee, U. Pareek","doi":"10.1109/ICCW.2010.5503967","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503967","url":null,"abstract":"In this paper, we present a low-complexity Interference Aware Multiple Relay Selection (IAMRS) scheme for cognitive radio system. The main objective in selecting multiple relays is to maximize the SNR at the destination under the constraint of acceptable interference to the primary users (PU). The computational complexity of finding an optimal IAMRS by exhaustive search grows exponentially with the number of relays. In this paper, we propose an interference-aware greedy algorithm for the relay selection problem. The proposed algorithm has low computational complexity, and its effectiveness is verified through simulation results.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"424 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133898039","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":"Study on Multipath Characteristics for IEEE 802.15.4g SUN Applications in the Frequency Band Used in Japan","authors":"F. Kojima, H. Harada","doi":"10.1109/ICCW.2010.5503923","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503923","url":null,"abstract":"This paper proposes the use of a single-carrier PHY employment for IEEE 802.15.4g SUN (smart utility networks) applications in the frequency band used in Japan. The feasibility of the applications is validated by conducting outdoor experiments and computer simulations. In this paper, the feasibility of employing GFSK (Gaussian frequency shift keying) PHY is investigated under the condition of multipath degradation in the assumed service area; here, transmission power and frequency band are assumed to be 10mW and 400MHz, respectively, as per the Japanese regulations. The results of outdoor experiments and computer simulations confirm that no serious multipath degradation occurs in a service area with a radius of a few hundred- meters and that the application of multi-hop transmission technology can drastically improve the frame success rate, which effectively avoids the degraded radio link by multipath.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132519557","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":"On Predicting and Compressing Vehicular GPS Traces","authors":"S. Kaul, M. Gruteser, V. Rai, J. Kenney","doi":"10.1109/ICCW.2010.5503947","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503947","url":null,"abstract":"Many vehicular safety applications rely on vehicles periodically broadcasting their position information and location trace. In very dense networks, such safety messaging can lead to offered traffic loads that saturate the shared wireless medium. One approach to address this problem is to reduce the frequency of location update messages when the movements of a vehicle can be predicted by nearby vehicles. In this paper, we study how predictable vehicular locations are, given a Global Positioning System trace of a vehicles recent path. We empirically evaluate the performance of linear and higher degree polynomial prediction algorithms using about 2500 vehicle traces collected under city and highway driving conditions. We find that linear polynomial prediction using the two most recent known locations performs best. Also, traces with a time granularity of 0.2s are highly predictable in low speed city environments, and a location update rate of 1Hz may suffice to represent city vehicular movements. Lastly, the paper also evaluates compression of different time-granularity traces using line simplification and polynomial interpolation techniques to reduce message sizes.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123274383","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 Collaborative Wireless Sensor Network Routing Scheme for Reducing Energy Wastage","authors":"Alan W. F. Boyd, D. Balasubramaniam, A. Dearle","doi":"10.1109/ICCW.2010.5503896","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503896","url":null,"abstract":"A Wireless Sensor Network (WSN) is a network of battery-powered nodes in which data is routed from sources to sinks. Each node consumes energy in order to transmit or receive on its radio. Consequently, an intermediate node that is used by multiple sources will quickly expire. If some sources are unable to route without the presence of that node, any remaining energy they have is wasted. We present a new routing scheme known as node reliance, which rates the degree to which nodes are relied upon in routing. The use of node reliance reduces the contention for intermediate nodes, permitting sources to route to sinks for longer and thus maximising the useful lifetime of the network.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122530456","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 Robust and Efficient Cooperative Spectrum Sensing Scheme in Cognitive Radio Networks","authors":"Feng Gao, Wei Yuan, Wei Liu, W. Cheng, Shu Wang","doi":"10.1109/ICCW.2010.5503968","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503968","url":null,"abstract":"Cooperation can improve the performance of spectrum sensing by taking advantage of diversity gains. However, in the process of cooperative spectrum sensing, malicious users could send false local sensing results to the fusion center, which can cause severe distortion to the final sensing decision. To improve the immunity of cooperative spectrum sensing against false sensing information, we propose a robust cooperative spectrum sensing scheme which is based on weighted sequential probability ratio test (WSPRT) technology. Through reputation maintenance, weight allocation and multi-threaded detection, the proposed scheme can effectively deal with different kinds of attack patterns. Simulation results show that our robust scheme can identify and weed out malicious users accurately and efficiently.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125776789","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":"Performance of User Cooperation and Clustering Scheme in Cellular Networks","authors":"Chang Li, Yafeng Wang, W. Xiang, Dacheng Yang","doi":"10.1109/ICCW.2010.5503906","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503906","url":null,"abstract":"In the cooperative system with a large number of users, the base station may select a subset of users to serve in order to maximize the total throughput. The brute-force search for the optimal user set, however, is computationally prohibitive. We propose a clustering algorithm for cooperative communication systems, whose objective is to increase the cellular network throughput and further improve the system performance. In this cellular system, we consider all the available users are divided into two groups. One is the super group which locates in the cell central region, and another is the regular group which locates in the cell boundary. The super group is served by Base Station (BS), and the Mobile Stations (MSs) locate in the cell boundary are served by the clusterhead (CH) which is elected from the regular group. Simulation results show that this scheme can bring higher system throughput, and it also can increase the data rate at the cell edge.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126974162","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}
M. Aida, C. Takano, H. Koto, Y. Honma, Hajime Nakamura
{"title":"Unified Model of Communication Frequency between Users in Social Networks","authors":"M. Aida, C. Takano, H. Koto, Y. Honma, Hajime Nakamura","doi":"10.1109/ICCW.2010.5503931","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503931","url":null,"abstract":"Our previous studies revealed the structure of social networks, which are behind communication networks, by using various metrics of a communication service (amount of traffic, the number of users, etc.). Moreover, we proposed a communication frequency model between users based on a social network structure, and showed that it can reproduce the growth in the number of social networking service (SNS) users. However, when traffic is generated by this communication frequency model, the volume of traffic is inconsistent with the traffic data used in the social network analysis. In this paper, to resolve this contradiction, we propose a unified communication frequency model between users.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132704951","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}