Pub Date : 2010-03-18DOI: 10.1109/COMSNETS.2010.5432000
Timothy G. Griffin
In the last ten years it has become clear that some Internet routing protocols do not compute globally optimal paths, but only locally optimal ones. This represents something rather novel in the context of the vast literature on routing protocols for data networking. This paper introduces the Stratified Shortest-Paths Problem as a tool for exploring the borderline between local and global optimality problems. The paper contains a tutorial overview of the algebraic concepts used.
{"title":"The Stratified Shortest-Paths Problem (invited paper)","authors":"Timothy G. Griffin","doi":"10.1109/COMSNETS.2010.5432000","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432000","url":null,"abstract":"In the last ten years it has become clear that some Internet routing protocols do not compute globally optimal paths, but only locally optimal ones. This represents something rather novel in the context of the vast literature on routing protocols for data networking. This paper introduces the Stratified Shortest-Paths Problem as a tool for exploring the borderline between local and global optimality problems. The paper contains a tutorial overview of the algebraic concepts used.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121526106","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}
Pub Date : 2010-01-05DOI: 10.1109/COMSNETS.2010.5431992
P. Lee, V. Misra, D. Rubenstein
The quality of wireless links is inherently dynamic, and this often makes the measurements of link delivery probabilities inaccurate over short timescales. We present Stable Opportunistic Routing (SOR), which improves unicast throughput for wireless mesh routing in the presence of inaccurate link-level measurements. In essence, SOR integrates two key features of prior approaches: (i) nodes trigger or suppress transmissions by inferring the actual reception of packets by neighboring nodes through channel overhearing, and (ii) nodes use network coding to avoid redundant transmissions. In addition, SOR is less dependent on accurate timing estimates or measured loss rates than prior approaches. Our stance is to argue that by carefully incorporating prior approaches into the design space of SOR, we can make opportunistic routing more robust toward link-level measurement errors, a practical issue in wireless mesh routing. Using nsclick simulation, we show that SOR has higher throughput than existing shortest-path and opportunistic routing protocols in large-scale networks, and the performance gain is more prominent when link-level measurements are erroneous.
{"title":"On the robustness of wireless opportunistic routing toward inaccurate link-level measurements","authors":"P. Lee, V. Misra, D. Rubenstein","doi":"10.1109/COMSNETS.2010.5431992","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431992","url":null,"abstract":"The quality of wireless links is inherently dynamic, and this often makes the measurements of link delivery probabilities inaccurate over short timescales. We present Stable Opportunistic Routing (SOR), which improves unicast throughput for wireless mesh routing in the presence of inaccurate link-level measurements. In essence, SOR integrates two key features of prior approaches: (i) nodes trigger or suppress transmissions by inferring the actual reception of packets by neighboring nodes through channel overhearing, and (ii) nodes use network coding to avoid redundant transmissions. In addition, SOR is less dependent on accurate timing estimates or measured loss rates than prior approaches. Our stance is to argue that by carefully incorporating prior approaches into the design space of SOR, we can make opportunistic routing more robust toward link-level measurement errors, a practical issue in wireless mesh routing. Using nsclick simulation, we show that SOR has higher throughput than existing shortest-path and opportunistic routing protocols in large-scale networks, and the performance gain is more prominent when link-level measurements are erroneous.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115245257","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}
Pub Date : 2010-01-05DOI: 10.1109/COMSNETS.2010.5431979
P. Agrawal, Hitesh Khandelwal, R. Ghosh
In this paper we address the problem of repetitive data transmission in BitTorrent. and propose a new protocol called MTorrent to restrict the same by exploiting IP Multicast functionality wherever available. A prototype system of our protocol have been implemented, and large scale measurement studies were conducted over Emulab network consisting of 44 nodes, spread over 9 LANs and 36 end clients. MTorrent leads to 44% reduction in download time, 65% reduction in traffic load on the Internet links and 40% reduction in download of redundant packets when compared to the BitTorrent. MTorrent is interoperable with BitTorrent, and requires only a few changes at the client end.
{"title":"MTorrent: A multicast enabled BitTorrent protocol","authors":"P. Agrawal, Hitesh Khandelwal, R. Ghosh","doi":"10.1109/COMSNETS.2010.5431979","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431979","url":null,"abstract":"In this paper we address the problem of repetitive data transmission in BitTorrent. and propose a new protocol called MTorrent to restrict the same by exploiting IP Multicast functionality wherever available. A prototype system of our protocol have been implemented, and large scale measurement studies were conducted over Emulab network consisting of 44 nodes, spread over 9 LANs and 36 end clients. MTorrent leads to 44% reduction in download time, 65% reduction in traffic load on the Internet links and 40% reduction in download of redundant packets when compared to the BitTorrent. MTorrent is interoperable with BitTorrent, and requires only a few changes at the client end.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"281 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116072200","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}
Pub Date : 2010-01-05DOI: 10.1109/COMSNETS.2010.5431964
A. Kapoor, V. Ribeiro
In this paper, we propose a greedy framework for distributed scheduling in the IEEE 802.16 MeSH mode, which uses a novel “End-to-end QoS aware bandwidth Reservation Protocol” (EQRP) to provide end-to-end QoS guarantee to intramesh flows. The proposed framework provides an efficient and integrated solution to QoS aware routing and call admission control in distributed WiMAX mesh networks. The framework does not rely on any special node for resource management which makes it more scalable and robust to node failures. To save expensive control overheads, EQRP learns from previous bandwidth reservation failures to maintain a rank list of next hops for every destination and uses the “Greedy Forwarding” algorithm to do bandwidth reservation using slot information from only two hop neighbor routers'. We compare EQRP with Race Free Protocol (RFP) and evaluate its performance with extensive simulations in ns2. Simulations show that for static WiMAX mesh network, the “Greedy Forwarding” algorithm used by EQRP admits approximately 10% more VOIP calls. For a random topology of 25 mesh routers, the aggregate signaling overhead generated by EQRP at a high call arrival rate of 1/2000 (calls/milli-seconds) is 76% less than that generated by RFP. In comparison with RFP, EQRP took 200 milli-seconds less average call setup time.
{"title":"An end-to-end QoS aware greedy distributed scheduling framework for WiMAX mesh networks","authors":"A. Kapoor, V. Ribeiro","doi":"10.1109/COMSNETS.2010.5431964","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431964","url":null,"abstract":"In this paper, we propose a greedy framework for distributed scheduling in the IEEE 802.16 MeSH mode, which uses a novel “End-to-end QoS aware bandwidth Reservation Protocol” (EQRP) to provide end-to-end QoS guarantee to intramesh flows. The proposed framework provides an efficient and integrated solution to QoS aware routing and call admission control in distributed WiMAX mesh networks. The framework does not rely on any special node for resource management which makes it more scalable and robust to node failures. To save expensive control overheads, EQRP learns from previous bandwidth reservation failures to maintain a rank list of next hops for every destination and uses the “Greedy Forwarding” algorithm to do bandwidth reservation using slot information from only two hop neighbor routers'. We compare EQRP with Race Free Protocol (RFP) and evaluate its performance with extensive simulations in ns2. Simulations show that for static WiMAX mesh network, the “Greedy Forwarding” algorithm used by EQRP admits approximately 10% more VOIP calls. For a random topology of 25 mesh routers, the aggregate signaling overhead generated by EQRP at a high call arrival rate of 1/2000 (calls/milli-seconds) is 76% less than that generated by RFP. In comparison with RFP, EQRP took 200 milli-seconds less average call setup time.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129037927","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}
Pub Date : 2010-01-05DOI: 10.1109/COMSNETS.2010.5431965
K. Mathew, Purushottam Kulkarni, V. Apte
Performance differentiation has always been a requirement in virtualized environments, especially in case where virtualization is used in high-end data center applications. In this paper, we present a command-line tool for Network bandwidth differentiation in Xen, which is an open source solution for virtualization. Though the CPU credit scheduler in Xen can be configured using command-line tools to specify weights and caps for a virtual machine, no such tools exist to specify the network bandwidth limits. Through our tool, xmsetbw, network bandwidth limits for a virtual machine in Xen can be specified and dynamically reconfigured (without kernel recompilation). Experimental evaluations show that bandwidth utilization is limited within specified values.
{"title":"Network bandwidth configuration tool for Xen virtual machines","authors":"K. Mathew, Purushottam Kulkarni, V. Apte","doi":"10.1109/COMSNETS.2010.5431965","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431965","url":null,"abstract":"Performance differentiation has always been a requirement in virtualized environments, especially in case where virtualization is used in high-end data center applications. In this paper, we present a command-line tool for Network bandwidth differentiation in Xen, which is an open source solution for virtualization. Though the CPU credit scheduler in Xen can be configured using command-line tools to specify weights and caps for a virtual machine, no such tools exist to specify the network bandwidth limits. Through our tool, xmsetbw, network bandwidth limits for a virtual machine in Xen can be specified and dynamically reconfigured (without kernel recompilation). Experimental evaluations show that bandwidth utilization is limited within specified values.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127018613","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}
Pub Date : 2010-01-05DOI: 10.1109/COMSNETS.2010.5432009
Amulya Ratna Swain, R. Hansdah
Recent advances in the development of wireless sensor networks(WSNs) have considerably increased the interest in their applications for a wide range of problems such as environmental monitoring, target tracking, habitat monitoring etc. Many of these applications and the wireless sensor network(WSN) itself require that the clocks of the sensor nodes are synchronized with certain accuracy. Existing approaches to clock synchronization in WSNs are mostly hierarchical in nature. A hierarchical structure is usually difficult to maintain, and it results in longer synchronization phase and reduced synchronization accuracy for large WSNs. Traditional internal clock synchronization protocols that have been proposed for distributed systems assume that the network is complete, i.e., every node can communicate with every other node directly. But WSNs, in general, are not a complete network, and hence, traditional internal clock synchronization protocols are not directly suitable for WSNs. In this paper, we propose a novel peer-to-peer based fully distributed internal clock synchronization protocol for wireless sensor networks which are not a complete network. We have analyzed our protocol for bounds on synchronization error, and shown that the synchronization error is always upper bounded. We have carried out extensive simulation studies using Castalia simulator (up to 1000 nodes) to evaluate the performance of our protocol and also compared its performance with that of TPSN. The accuracy achieved is consistently better than that of TPSN, and the energy consumption per node is considerably less than that of TPSN except for small WSNs requiring higher accuracy. We have also implemented our protocol using TinyOS in a WSN consisting of a few TelosB motes. The experimental results from the above implementation of our protocol show that the synchronization error is bounded and the accuracy is within a few tics of the external clock.
{"title":"An energy efficient and Fault-Tolerant Clock Synchronization Protocol for wireless sensor networks","authors":"Amulya Ratna Swain, R. Hansdah","doi":"10.1109/COMSNETS.2010.5432009","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432009","url":null,"abstract":"Recent advances in the development of wireless sensor networks(WSNs) have considerably increased the interest in their applications for a wide range of problems such as environmental monitoring, target tracking, habitat monitoring etc. Many of these applications and the wireless sensor network(WSN) itself require that the clocks of the sensor nodes are synchronized with certain accuracy. Existing approaches to clock synchronization in WSNs are mostly hierarchical in nature. A hierarchical structure is usually difficult to maintain, and it results in longer synchronization phase and reduced synchronization accuracy for large WSNs. Traditional internal clock synchronization protocols that have been proposed for distributed systems assume that the network is complete, i.e., every node can communicate with every other node directly. But WSNs, in general, are not a complete network, and hence, traditional internal clock synchronization protocols are not directly suitable for WSNs. In this paper, we propose a novel peer-to-peer based fully distributed internal clock synchronization protocol for wireless sensor networks which are not a complete network. We have analyzed our protocol for bounds on synchronization error, and shown that the synchronization error is always upper bounded. We have carried out extensive simulation studies using Castalia simulator (up to 1000 nodes) to evaluate the performance of our protocol and also compared its performance with that of TPSN. The accuracy achieved is consistently better than that of TPSN, and the energy consumption per node is considerably less than that of TPSN except for small WSNs requiring higher accuracy. We have also implemented our protocol using TinyOS in a WSN consisting of a few TelosB motes. The experimental results from the above implementation of our protocol show that the synchronization error is bounded and the accuracy is within a few tics of the external clock.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131905676","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}
Pub Date : 2010-01-05DOI: 10.1109/COMSNETS.2010.5431998
Ketan Mayer-Patel, Andrew Jones
Existing streaming peer-to-peer distribution architectures are designed to balance inherent trade-offs between stretch, stress, and robustness to churn. Several rely on multiple description coding in order to facilitate mesh-based or forest-based approaches. We believe, however, that a number of important applications such as broadcast video, pyramid video-on-demand, digital fountains, and data cycles to name a few exhibit a great deal of latency tolerance. For these applications, stretch is immaterial as long as join/leave latencies are minimized. If stretch is no longer a concern, simply chaining peers into a line emerges as a natural design choice for minimizing stress. The realities of loss, churn, and heterogeneous peer capabilities make implementing such a design challenging. In this paper, we show that by using a layered data model, a linear distribution scheme can be very effectively achieved and can be superior to MDC-based schemes. The paper describes our system called StrandCast and presents simulation results demonstrating its effectiveness and comparing it to SplitStream.
{"title":"StrandCast: Peer-to-peer content distribution for latency tolerant applications","authors":"Ketan Mayer-Patel, Andrew Jones","doi":"10.1109/COMSNETS.2010.5431998","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431998","url":null,"abstract":"Existing streaming peer-to-peer distribution architectures are designed to balance inherent trade-offs between stretch, stress, and robustness to churn. Several rely on multiple description coding in order to facilitate mesh-based or forest-based approaches. We believe, however, that a number of important applications such as broadcast video, pyramid video-on-demand, digital fountains, and data cycles to name a few exhibit a great deal of latency tolerance. For these applications, stretch is immaterial as long as join/leave latencies are minimized. If stretch is no longer a concern, simply chaining peers into a line emerges as a natural design choice for minimizing stress. The realities of loss, churn, and heterogeneous peer capabilities make implementing such a design challenging. In this paper, we show that by using a layered data model, a linear distribution scheme can be very effectively achieved and can be superior to MDC-based schemes. The paper describes our system called StrandCast and presents simulation results demonstrating its effectiveness and comparing it to SplitStream.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"349 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124303105","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}
Pub Date : 2010-01-05DOI: 10.1109/COMSNETS.2010.5432005
M. Sbai, Emna Salhi, C. Barakat
Spontaneous multi-hop wireless networks provide a new environment for sharing content among communities of end users. Nodes interested in some content can share it on a multi-hop basis by relying on the collaboration of intermediate nodes. Organizing the communication overlay in such an environment is then a challenging task especially given the mobility of the nodes, the interference, and the scarcity of resources. In this work, we propose and implement a general, stand-alone and efficient P2P content sharing protocol for wireless ad hoc networks. We consider general and realistic scenarios ranging from a single overlay to multiple overlays coexisting in the same network, and for every single overlay, we consider different peer densities in the network. The main challenges are overlay disconnections, routing overhead, low sharing opportunities and instability of distant paths. Our protocol proposes efficient solutions for these problems leading to the best download times while guaranteeing the maximum sharing opportunities among the peers. We validate our protocol through extensive simulations and experimentations on the ORBIT platform.
{"title":"P2P content sharing in spontaneous multi-hop wireless networks","authors":"M. Sbai, Emna Salhi, C. Barakat","doi":"10.1109/COMSNETS.2010.5432005","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432005","url":null,"abstract":"Spontaneous multi-hop wireless networks provide a new environment for sharing content among communities of end users. Nodes interested in some content can share it on a multi-hop basis by relying on the collaboration of intermediate nodes. Organizing the communication overlay in such an environment is then a challenging task especially given the mobility of the nodes, the interference, and the scarcity of resources. In this work, we propose and implement a general, stand-alone and efficient P2P content sharing protocol for wireless ad hoc networks. We consider general and realistic scenarios ranging from a single overlay to multiple overlays coexisting in the same network, and for every single overlay, we consider different peer densities in the network. The main challenges are overlay disconnections, routing overhead, low sharing opportunities and instability of distant paths. Our protocol proposes efficient solutions for these problems leading to the best download times while guaranteeing the maximum sharing opportunities among the peers. We validate our protocol through extensive simulations and experimentations on the ORBIT platform.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114829306","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}
Pub Date : 2010-01-05DOI: 10.1109/COMSNETS.2010.5432002
M. Ramakrishnan, P. Ranjan
In this paper, Adaptive Power Control with Overhearing Avoidance (APC-OA) has been proposed. The proposed power control algorithm has been implemented in PICSENSE wireless sensor nodes. The energy consumption of proposed MAC has been compared with that of On Demand Transmission Power Control[1] (ODTPC) protocol and it is shown that the Adaptive Power Control with Overhearing Avoidance gives higher energy conservation compared to ODTPC. The power level convergence towards the optimal power for APC-OA is two times faster than the ODTPC.
{"title":"Adaptive Power Control with Overhearing Avoidance for wireless sensor networks","authors":"M. Ramakrishnan, P. Ranjan","doi":"10.1109/COMSNETS.2010.5432002","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432002","url":null,"abstract":"In this paper, Adaptive Power Control with Overhearing Avoidance (APC-OA) has been proposed. The proposed power control algorithm has been implemented in PICSENSE wireless sensor nodes. The energy consumption of proposed MAC has been compared with that of On Demand Transmission Power Control[1] (ODTPC) protocol and it is shown that the Adaptive Power Control with Overhearing Avoidance gives higher energy conservation compared to ODTPC. The power level convergence towards the optimal power for APC-OA is two times faster than the ODTPC.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127190727","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}
Pub Date : 2010-01-05DOI: 10.1109/COMSNETS.2010.5432018
Jitendra Tugnait, Hyosung Kim
We consider a physical layer approach to enhance wireless security by using the unique wireless channel state information (CSI) of a legitimate user to authenticate subsequent transmissions from this user, thereby denying access to any spoofer whose CSI would significantly differ from that of the legitimate user by virtue of a different spatial location. In some existing approaches, multicarrier systems have been considered where the channel frequency response at distinct frequencies is used to devise a hypothesis testing approach: is the CSI of the current transmission (packet) the same as that of the previous transmission? In this paper we investigate a single-carrier timedomain approach via either residual testing or time-domain CSI comparison. A hypothesis testing approach is formulated to test whiteness of residuals from current transmission where the residuals are generated using the estimated channel from the previous transmission. We also consider a hypothesis testing approach where the time-domain CSI of the current transmission is compared with that of the previous transmission. Two binary hypothesis testing approaches are formulated and illustrated via simulations.
{"title":"A channel-based hypothesis testing approach to enhance user authentication in wireless networks","authors":"Jitendra Tugnait, Hyosung Kim","doi":"10.1109/COMSNETS.2010.5432018","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432018","url":null,"abstract":"We consider a physical layer approach to enhance wireless security by using the unique wireless channel state information (CSI) of a legitimate user to authenticate subsequent transmissions from this user, thereby denying access to any spoofer whose CSI would significantly differ from that of the legitimate user by virtue of a different spatial location. In some existing approaches, multicarrier systems have been considered where the channel frequency response at distinct frequencies is used to devise a hypothesis testing approach: is the CSI of the current transmission (packet) the same as that of the previous transmission? In this paper we investigate a single-carrier timedomain approach via either residual testing or time-domain CSI comparison. A hypothesis testing approach is formulated to test whiteness of residuals from current transmission where the residuals are generated using the estimated channel from the previous transmission. We also consider a hypothesis testing approach where the time-domain CSI of the current transmission is compared with that of the previous transmission. Two binary hypothesis testing approaches are formulated and illustrated via simulations.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127361820","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：