{"title":"Spoofing cyber attack detection in probe-based traffic monitoring systems using mixed integer linear programming","authors":"E. Canepa, A. Bayen, C. Claudel","doi":"10.3934/nhm.2013.8.783","DOIUrl":"https://doi.org/10.3934/nhm.2013.8.783","url":null,"abstract":"Traffic sensing systems rely more and more on user generated (insecure) data, which can pose a security risk whenever the data is used for traffic flow control. In this article, we propose a new formulation for detecting malicious data injection in traffic flow monitoring systems by using the underlying traffic flow model. The state of traffic is modeled by the Lighthill-Whitham-Richards traffic flow model, which is a first order scalar conservation law with concave flux function. Given a set of traffic flow data, we show that the constraints resulting from this partial differential equation are mixed integer linear inequalities for some decision variable. We use this fact to pose the problem of detecting spoofing cyber-attacks in probe-based traffic flow information systems as mixed integer linear feasibility problem. The resulting framework can be used to detect spoofing attacks in real time, or to evaluate the worst-case effects of an attack offline. A numerical implementation is performed on a cyber-attack scenario involving experimental data from the Mobile Century experiment and the Mobile Millennium system currently operational in Northern California.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129521184","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":"BER modeling for interference canceling FIR Wiener equalizer","authors":"Tamoghna Roy, L. Beex","doi":"10.1109/ICCNC.2013.6504095","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504095","url":null,"abstract":"The performance of a narrowband interference canceling FIR Wiener equalizer is analyzed. While mean squared error (MSE) relates to bit error rate (BER), their connection is not necessarily a direct one when the detector output noise is not Gaussian. We show that BER can be increasing for increasing signal power (or decreasing noise power) even though MSE is decreasing. A Gaussian BER model may not be accurate then. For digital modulation schemes using FIR Wiener equalizers in a narrowband interference dominated environment, a Gaussian sum model is derived for the Wiener filter output. The analytical evaluation of the probability of bit error based on the Gaussian sum model produces a BER prediction that is shown to provide a close match with observed/estimated BER, in particular for lower order equalizers.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129760073","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":"Fast wireless data access scheme in wireless networks","authors":"Giwon Lee, Insun Jang, Sangheon Pack","doi":"10.1109/ICCNC.2013.6504050","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504050","url":null,"abstract":"For wireless data access applications where objects are frequently updated and fast access to objects is required, we propose a fast wireless data access scheme (FW - DAS), which extends the callback (CB) scheme to minimize the access latency and combines it with the poll each read (PER) scheme to mitigate the traffic load over the wireless link. Extensive simulations are carried out to show the effects of operation mode, access-to-update ratio, data popularity, and cache size. Simulation results show that FW-DAS can reduce the access latency with reasonable traffic load compared with PER/CB and their combinations.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128296989","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 optimization for efficient spectrum utilization in cognitive radios","authors":"Ali H. Mahdi, M. Kalil, A. Mitschele-Thiel","doi":"10.1109/ICCNC.2013.6504100","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504100","url":null,"abstract":"Cognitive Radio (CR) systems are smart systems capable of sensing the surrounding radio environment and adapting their operating parameters for efficient utilization of the available radio spectrum. To reach this goal, different operating parameters across the OSI layers of a device should be optimized such as transmit power, modulation scheme and packet length etc. In this paper, we propose an efficient algorithm for optimizing and adapting CR operating parameters from physical, MAC and network layers for better utilization of radio spectrum. We include Automatic Repeat reQuest (ARQ) inside our proposed algorithm to check the validity of best parameters at the receiver side under specific link state. The proposed algorithm is called ARQ-Adaptive Discrete Particle Swarm Optimization (ARQ-ADPSO). The simulation results show an improvement by ARQ-ADPSO compared to the well-known genetic algorithm.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127007214","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":"Protocol independent multicast: From wired to wireless networks","authors":"A. Russo, R. Cigno, I. Rubin","doi":"10.1109/ICCNC.2013.6504156","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504156","url":null,"abstract":"Multicast operations across wireless networks have received much attention, involving network architectures that range from ad-hoc networks to structured multi-hop meshes layouts. The use for this purpose of the standard Protocol Independent Multicast (PIM) protocol suite has been dismissed as non practical, or non feasible, noting that its straightforward application across wireless networks does not function properly. In this work, we analyze the reasons why PIM standard based implementations improperly interact when employed across wireless networks. We propose simple fixes that do not require modifications of the standard, but entail only minor modifications of the underlying implementation. We evaluate the Dense Mode version of PIM through its implementation in a network that is modeled by using the ns-3 simulation program. We present performance results that confirm the effective operation of the protocol, as well as identify the involved overhead levels, in mesh networks that employ fixed mesh routers and both fixed and mobile end-user clients.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114062388","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":"Low-complexity iterative demapping for rotated QAM constellations in DVB-T2 system","authors":"Feng Yang, Bo Zhang, Lianghui Ding","doi":"10.1109/ICCNC.2013.6504121","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504121","url":null,"abstract":"Bit-Interleaved Coded Modulation (BICM) with rotated constellation is utilized to increase the signal space diversity in the second generation digital video broadcasting system, i.e., DVB-T2. However, at the receiver side, the complexity increases with product of the number of constellation points and the modulation order. In this paper, we propose a low-complexity iterative demapping algorithm which uses the hard decision results as the feedback input. Comprehensive simulation is conducted with different channel models, modulation orders and channel coding rates. Results show that the proposed algorithm performs well for both Ricean and Rayleigh fading channels. It can achieve performance gains for all 4-,16-,64- and 256-QAM modulation types and different LDPC coding rates. At least 4dB gain on required Signal to Noise Ratio (SNR) can be achieved after 5 iteration in DVBT-P Rayleigh fading channels for each modulation type.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114318389","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":"Lightweight Internet protocols for web enablement of sensors using constrained gateway devices","authors":"S. Bandyopadhyay, Abhijan Bhattacharyya","doi":"10.1109/ICCNC.2013.6504105","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504105","url":null,"abstract":"Lightweight Internet protocols are increasingly being used in ubiquitous environment in order to optimize the resource usage of a constrained device like a smart mobile gateway. This paper presents a study on the various such protocols to optimize the usage of energy, and network resources, computation cost of a constrained gateway device. Comprehensive analysis and feature wise categorization of existing dominant protocols, namely MQTT (message queue telemetry transport), CoAP (constrained application protocol) are provided here to achieve improved understanding of the existing issues and gaps in this domain. The present work further identifies the best suited application areas for each protocol based on the results corresponding to typical resource requirements and performance attributes. Finally our vision on the research scope is presented here mainly for optimization of energy usage.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116203553","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}
Karim Habak, Mohammed Abdelatif, Hazem Hagrass, Karim Rizc, M. Youssef
{"title":"A location-aided routing protocol for cognitive radio networks","authors":"Karim Habak, Mohammed Abdelatif, Hazem Hagrass, Karim Rizc, M. Youssef","doi":"10.1109/ICCNC.2013.6504178","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504178","url":null,"abstract":"Multi-hop cognitive radio networks (CRNs) are gaining interest recently in many practical applications. With location information becoming more available, designing location-aware routing protocols that fit the nature of CRNs becomes a necessity. We present LAUNCH as a location-aided routing protocol for CRNs that has a set of desirable properties: efficient use of the common control channel, has a minimal route setup delay, prefers stable routes, handles primary users heterogeneity, and handles secondary users mobility. LAUNCH is based on four main concepts: (1) a novel location-aware CRN routing metric that takes into account the PUs activity; (2) distributed calculations at the neighbors; (3) a channel locking mechanism to achieve the route stability and minimize channel switching time; (4) an efficient route maintenance strategy. Evaluation of LAUNCH on the NS2 simulator shows that its performance significantly outperforms the current state-of-the-art CRNs routing protocols in terms of end-to-end delay and packet loss rate. In addition, LAUNCH incurs a low control overhead with a fast route establishment delay.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114859084","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 MAC protocol for wireless personal area networks","authors":"G. Ding, Richard Farley","doi":"10.1109/ICCNC.2013.6504209","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504209","url":null,"abstract":"This paper proposes several extensions to IEEE Wireless Personal Area Network (WPAN) MAC protocol in order to enable a more robust and flexible solution to WPANs and sensor networks. Specifically, four extensions are proposed: a priority access period is added to handle emergency data transmission needed in some use cases, a scheduling protocol to resolve beacon transmission conflict between multiple WPANs operating in the same vicinity, a resource reservation protocol for interference- free data communication in a tree-topology WPAN, and a network alignment method to coordinate multiple coexisting unsynchronized WPANs.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127763266","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":"Secure spectrum sharing via rate adaptation","authors":"Behrooz Makki, T. Eriksson","doi":"10.1109/ICCNC.2013.6504043","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504043","url":null,"abstract":"This paper addresses the problem of secure communication in spectrum sharing networks. The achievable rates are determined such that the unlicensed user security is guaranteed, i.e., the unlicensed user massages are not decodable by the license holders. Considering slowly-fading channels, the results are obtained under the licensed user interference- and signal-to-interference-and-noise ratio (SINR)-limited conditions. The results indicate that there is considerable potential for the unlicensed user secure data transmission under different license holder's quality-of-service requirements. Moreover, depending on the channel condition and the license holder's SINR constraint, the unlicensed user's achievable rates may increase with the license holder transmission power.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128114913","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}