Pub Date : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534996
N. Pappas, V. Siris, A. Traganitis
In this paper we investigate the performance that can be achieved by exploiting path diversity through multipath forwarding together with redundancy through linear network coding, in wireless mesh networks with directional links. A key contribution of the paper is to capture the tradeoff between packet delay and throughput achieved by combining multipath forwarding and network coding, and compare this tradeoff with that of simple multipath routing where different flows follow different paths, the transmission of multiple copies of packets over multiple paths, and single path routing. The analytical framework considers the case of end-to-end retransmission for achieving reliability, and is generalized for an arbitrary number of paths and hops. We also derive the minimum and maximum number of coded packets that are needed at the receiver to retrieve all packets sent by the sender; this can be used to obtain a lower and upper bound for the delay in the case of linear network coding with multipath forwarding.
{"title":"Path diversity gain with network coding and multipath transmission in wireless mesh networks","authors":"N. Pappas, V. Siris, A. Traganitis","doi":"10.1109/WOWMOM.2010.5534996","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534996","url":null,"abstract":"In this paper we investigate the performance that can be achieved by exploiting path diversity through multipath forwarding together with redundancy through linear network coding, in wireless mesh networks with directional links. A key contribution of the paper is to capture the tradeoff between packet delay and throughput achieved by combining multipath forwarding and network coding, and compare this tradeoff with that of simple multipath routing where different flows follow different paths, the transmission of multiple copies of packets over multiple paths, and single path routing. The analytical framework considers the case of end-to-end retransmission for achieving reliability, and is generalized for an arbitrary number of paths and hops. We also derive the minimum and maximum number of coded packets that are needed at the receiver to retrieve all packets sent by the sender; this can be used to obtain a lower and upper bound for the delay in the case of linear network coding with multipath forwarding.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121209664","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-06-14DOI: 10.1109/WOWMOM.2010.5534901
M. Monowar, M. Alam, Md. Obaidur Rahman, C. Hong
Considering energy as a crucial resource, several duty cycle based MAC have already been proposed for Wireless Sensor Networks (WSNs) to gain higher energy efficiency during long idle period of the sensors, and are optimized for light traffic loads. Contrastively, considering the bandwidth constraint of WSNs, and to optimize the heavy traffic loads, another research trend is continuing in devising rate and congestion control at the MAC layer. To provide an integrated solution of both these distinct research trends at the MAC layer, in this paper, we present a Load-independent Energy-efficient and Rate-control Integrated Asynchronous Duty Cycle MAC (LER-MAC) for WSNs. Performance of LER-MAC has been evaluated using ns-2 which demonstrates that, LER-MAC conserves energy considerably during light traffic loads along with procures higher throughput and lower latency avoiding packet drops through maximum utilization of the channel during heavy traffic loads.
{"title":"LER-MAC: A Load-independent Energy-efficient and Rate-control Integrated Asynchronous Duty Cycle MAC for Wireless Sensor Networks","authors":"M. Monowar, M. Alam, Md. Obaidur Rahman, C. Hong","doi":"10.1109/WOWMOM.2010.5534901","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534901","url":null,"abstract":"Considering energy as a crucial resource, several duty cycle based MAC have already been proposed for Wireless Sensor Networks (WSNs) to gain higher energy efficiency during long idle period of the sensors, and are optimized for light traffic loads. Contrastively, considering the bandwidth constraint of WSNs, and to optimize the heavy traffic loads, another research trend is continuing in devising rate and congestion control at the MAC layer. To provide an integrated solution of both these distinct research trends at the MAC layer, in this paper, we present a Load-independent Energy-efficient and Rate-control Integrated Asynchronous Duty Cycle MAC (LER-MAC) for WSNs. Performance of LER-MAC has been evaluated using ns-2 which demonstrates that, LER-MAC conserves energy considerably during light traffic loads along with procures higher throughput and lower latency avoiding packet drops through maximum utilization of the channel during heavy traffic loads.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124969567","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-06-14DOI: 10.1109/WOWMOM.2010.5534925
S. Eswaran, D. Shur, S. Samtani, A. Staikos
In recent years, utility-oriented resource allocation for wired and wireless networks has been extensively studied. A key goal of utility based analysis is to provide evaluation criteria for efficient network operation based on subjective user assessments such as usefulness and value of data. Yet the vast majority of the prior work has focused on topics like mathematical functions (concave or otherwise) of network metrics such as bandwidth, delay, packet loss, etc., or information entropy, or user-perceived quality (e.g., MOS) for interpreting utility. In this work1, we propose an alternative mission-oriented definition and metric for utility that is based on the accuracy and speed at which tasks are completed, which we believe is closer to the intent of utility-based analysis. Like previous work, our definition supports the design and engineering of networks by mapping utility metrics to the typical network design metrics (bandwidth, delay, loss, etc). Unlike previous work, it also permits simple solutions to important questions such as the joint utility or usefulness of different data streams, the impact on the utility of one data stream by another, and cross-sensory utility (e.g., the impact of a side audio channel on an image processing task, or a side video channel on an audio processing task). We present a novel experimental approach to the design of such experiments, and provide measurement results. The results quantify the effects of information encoding and the impairments incurred during transmission through imperfect networks on the information's usefulness to end-users in terms of being able to complete tasks correctly and on time.
{"title":"Information utility in mission-oriented networks","authors":"S. Eswaran, D. Shur, S. Samtani, A. Staikos","doi":"10.1109/WOWMOM.2010.5534925","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534925","url":null,"abstract":"In recent years, utility-oriented resource allocation for wired and wireless networks has been extensively studied. A key goal of utility based analysis is to provide evaluation criteria for efficient network operation based on subjective user assessments such as usefulness and value of data. Yet the vast majority of the prior work has focused on topics like mathematical functions (concave or otherwise) of network metrics such as bandwidth, delay, packet loss, etc., or information entropy, or user-perceived quality (e.g., MOS) for interpreting utility. In this work1, we propose an alternative mission-oriented definition and metric for utility that is based on the accuracy and speed at which tasks are completed, which we believe is closer to the intent of utility-based analysis. Like previous work, our definition supports the design and engineering of networks by mapping utility metrics to the typical network design metrics (bandwidth, delay, loss, etc). Unlike previous work, it also permits simple solutions to important questions such as the joint utility or usefulness of different data streams, the impact on the utility of one data stream by another, and cross-sensory utility (e.g., the impact of a side audio channel on an image processing task, or a side video channel on an audio processing task). We present a novel experimental approach to the design of such experiments, and provide measurement results. The results quantify the effects of information encoding and the impairments incurred during transmission through imperfect networks on the information's usefulness to end-users in terms of being able to complete tasks correctly and on time.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127002454","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-06-14DOI: 10.1109/WOWMOM.2010.5534971
S. Adibi
Non-repudiation techniques are to ensure any communication taking place between two or more parties will be undeniable. Therefore it is crucial to include digital signatures of the involving parties while the communication is taking place. In medical practices, involved parties may include patient(s) and doctor(s) who are involved in series of visits, diagnosis, prescription, possible operation, and etc. To avoid possible conflicts, adding non-repudiation techniques help immensely. This thesis considers this issue in a wireless medium and studies the Quality of Service (QoS)/Security requirements in terms of network parameters and performance metrics [1].
{"title":"An application layer non-repudiation wireless system: A cross-layer approach","authors":"S. Adibi","doi":"10.1109/WOWMOM.2010.5534971","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534971","url":null,"abstract":"Non-repudiation techniques are to ensure any communication taking place between two or more parties will be undeniable. Therefore it is crucial to include digital signatures of the involving parties while the communication is taking place. In medical practices, involved parties may include patient(s) and doctor(s) who are involved in series of visits, diagnosis, prescription, possible operation, and etc. To avoid possible conflicts, adding non-repudiation techniques help immensely. This thesis considers this issue in a wireless medium and studies the Quality of Service (QoS)/Security requirements in terms of network parameters and performance metrics [1].","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"33 1-2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123593906","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-06-14DOI: 10.1109/WOWMOM.2010.5534945
Zhongli Liu, Yinjie Chen, Wei Yu, Xinwen Fu
People are benefiting tremendously from pervasively deployed WiFi networks. However, criminals may exploit the anonymity of WiFi communication and wireless routers to access illegal content such as child porn videos. It's becoming an urgent topic as regards to how to preserve and acquire network forensic data from household and small business wireless routers in order to track down criminals. In this paper, we first survey the forensic capacity of nearly all household wireless routers which are available on market. We present our analysis for people who are willing to choose a wireless router to monitor their network. Secondly, we develop a generic network forensic data logging mechanism to monitor traffic into and out of wireless routers which support OpenWrt. Our code running in the wireless routers could log network traffic and send connection information to the administrator via email.
{"title":"Generic network forensic data acquisition from household and small business wireless routers","authors":"Zhongli Liu, Yinjie Chen, Wei Yu, Xinwen Fu","doi":"10.1109/WOWMOM.2010.5534945","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534945","url":null,"abstract":"People are benefiting tremendously from pervasively deployed WiFi networks. However, criminals may exploit the anonymity of WiFi communication and wireless routers to access illegal content such as child porn videos. It's becoming an urgent topic as regards to how to preserve and acquire network forensic data from household and small business wireless routers in order to track down criminals. In this paper, we first survey the forensic capacity of nearly all household wireless routers which are available on market. We present our analysis for people who are willing to choose a wireless router to monitor their network. Secondly, we develop a generic network forensic data logging mechanism to monitor traffic into and out of wireless routers which support OpenWrt. Our code running in the wireless routers could log network traffic and send connection information to the administrator via email.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114820979","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-06-14DOI: 10.1109/WOWMOM.2010.5534966
Bo Wang, Guo-Kai Zeng, M. Mutka, Li Xiao
In TDMA based wireless mesh networks, routing and scheduling algorithms are essential to provide QoS support for mesh clients. In order to maximize the network throughput and minimize session delay, the routing and scheduling algorithms should produce a minimum length schedule. A linear programming formulation enables an optimal solution, however has very high computational cost. In this paper, we consider network scenarios where multiple orthogonal channels are available. With a channel assignment algorithm to eliminate secondary interference, we are able to use a scheduling algorithm that yields the minimum length schedule given a specific routing tree. We then propose a heuristic routing algorithm that aims to build the routing tree that results in the minimum length schedule. Our routing algorithm performs significantly better than simple routing algorithms, which are based on Breadth First Search or Dijkstra algorithms.
{"title":"Routing for minimum length schedule in multi-channel TDMA based wireless mesh networks","authors":"Bo Wang, Guo-Kai Zeng, M. Mutka, Li Xiao","doi":"10.1109/WOWMOM.2010.5534966","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534966","url":null,"abstract":"In TDMA based wireless mesh networks, routing and scheduling algorithms are essential to provide QoS support for mesh clients. In order to maximize the network throughput and minimize session delay, the routing and scheduling algorithms should produce a minimum length schedule. A linear programming formulation enables an optimal solution, however has very high computational cost. In this paper, we consider network scenarios where multiple orthogonal channels are available. With a channel assignment algorithm to eliminate secondary interference, we are able to use a scheduling algorithm that yields the minimum length schedule given a specific routing tree. We then propose a heuristic routing algorithm that aims to build the routing tree that results in the minimum length schedule. Our routing algorithm performs significantly better than simple routing algorithms, which are based on Breadth First Search or Dijkstra algorithms.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132013890","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-06-14DOI: 10.1109/WOWMOM.2010.5534986
V. V. Hees, M. Pias, S. Taherian, U. Ekelund, S. Brage
The accelerometer devices as traditionally used in the epidemiological field for physical activity monitoring (e.g. Actigraph, Actical, and RT3) provide manufacturer-dependent output values called counts that are computed by obscure and proprietary signal processing techniques. This lack of transparency poses a challenge for comparison of historical accelerometer data in counts with data collected using raw accelerometry in S.I. units — m/s2. The purpose of this study was to develop a method that facilitates the compatibility between both methods through conversion of raw accelerometer output data collected with inertial acceleration sensors into Actigraph counts — the most widely used (de facto standard) device brand in epidemiological studies. The basics of the conversion algorithm were captured from the technical specifications of the Actigraph GT1M. Fine-tuning of the algorithm was achieved empirically under controlled conditions using a mechanical shaker device. A pilot evaluation was carried out through physical activity monitoring in free-living scenarios of 19 adult participants (age: 47 ± 11 yrs, BMI: 25.2 ± 4.1 kg-m−2) wearing both devices. The results show that Actigraph counts estimated by the proposed method explain 94.2% of the variation in Actigraph counts (p < 0.001). The concordance correlation coefficient was 0.93 (p < 0.05). The sensitivity for classifying intensity ranged from 93.4% for light physical activity to 70.7% for moderate physical activity.
{"title":"A method to compare new and traditional accelerometry data in physical activity monitoring","authors":"V. V. Hees, M. Pias, S. Taherian, U. Ekelund, S. Brage","doi":"10.1109/WOWMOM.2010.5534986","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534986","url":null,"abstract":"The accelerometer devices as traditionally used in the epidemiological field for physical activity monitoring (e.g. Actigraph, Actical, and RT3) provide manufacturer-dependent output values called counts that are computed by obscure and proprietary signal processing techniques. This lack of transparency poses a challenge for comparison of historical accelerometer data in counts with data collected using raw accelerometry in S.I. units — m/s2. The purpose of this study was to develop a method that facilitates the compatibility between both methods through conversion of raw accelerometer output data collected with inertial acceleration sensors into Actigraph counts — the most widely used (de facto standard) device brand in epidemiological studies. The basics of the conversion algorithm were captured from the technical specifications of the Actigraph GT1M. Fine-tuning of the algorithm was achieved empirically under controlled conditions using a mechanical shaker device. A pilot evaluation was carried out through physical activity monitoring in free-living scenarios of 19 adult participants (age: 47 ± 11 yrs, BMI: 25.2 ± 4.1 kg-m−2) wearing both devices. The results show that Actigraph counts estimated by the proposed method explain 94.2% of the variation in Actigraph counts (p < 0.001). The concordance correlation coefficient was 0.93 (p < 0.05). The sensitivity for classifying intensity ranged from 93.4% for light physical activity to 70.7% for moderate physical activity.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131894996","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-06-14DOI: 10.1109/WOWMOM.2010.5534968
Devan Rehunathan
Outside simulation, the study of mobile network protocols is not trivial and the standard approach usually involves building a testbed and populating it with the relevant entities. While this approach, provides real-life results, it is time consuming and resource intensive. We propose an alternative approach that can be used to compare mobile network protocols with a minimum amount of resources. Our solution explores the possibility of discounting physical layer effects entirely, when doing a comparative analysis of two mobile network protocols. In this paper, we document and discuss our efforts to check if this method is feasible.
{"title":"Comparing network protocols via elimination of MAC/PHY effects","authors":"Devan Rehunathan","doi":"10.1109/WOWMOM.2010.5534968","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534968","url":null,"abstract":"Outside simulation, the study of mobile network protocols is not trivial and the standard approach usually involves building a testbed and populating it with the relevant entities. While this approach, provides real-life results, it is time consuming and resource intensive. We propose an alternative approach that can be used to compare mobile network protocols with a minimum amount of resources. Our solution explores the possibility of discounting physical layer effects entirely, when doing a comparative analysis of two mobile network protocols. In this paper, we document and discuss our efforts to check if this method is feasible.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"516 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133036315","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-06-14DOI: 10.1109/WOWMOM.2010.5534998
K. Gierlowski, J. Konorski
In community wireless mesh (CWM) networks following the IEEE 802.11s standard, wireless nodes combine the functionality of a client application host and a transit packet router. Not being subjected to tight administrative control, CWM nodes may act selfishly by refusing to forward transit packets along (selected) established routes or to participate in the route creation process. Unlike in a mobile ad hoc network (MANET), a CWM node is typically connected to mains electricity, hence unconcerned about energy expenditure; the only rational (as distinct from malicious) motivation behind selfish behavior is then to prevent the incoming transit traffic from competing with the source traffic and thereby achieve a higher source throughput. We examine through simulation the benefits and harms of selfish behavior with a cross-layer view and relate them to the router density, selfish routers' location and details of their behavior. We find many conclusions and intuitions valid in MANET environments incorrect in CWMs.
{"title":"Router selfishness in community wireless mesh networks: Cross-layer benefits and harms","authors":"K. Gierlowski, J. Konorski","doi":"10.1109/WOWMOM.2010.5534998","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534998","url":null,"abstract":"In community wireless mesh (CWM) networks following the IEEE 802.11s standard, wireless nodes combine the functionality of a client application host and a transit packet router. Not being subjected to tight administrative control, CWM nodes may act selfishly by refusing to forward transit packets along (selected) established routes or to participate in the route creation process. Unlike in a mobile ad hoc network (MANET), a CWM node is typically connected to mains electricity, hence unconcerned about energy expenditure; the only rational (as distinct from malicious) motivation behind selfish behavior is then to prevent the incoming transit traffic from competing with the source traffic and thereby achieve a higher source throughput. We examine through simulation the benefits and harms of selfish behavior with a cross-layer view and relate them to the router density, selfish routers' location and details of their behavior. We find many conclusions and intuitions valid in MANET environments incorrect in CWMs.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132445474","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-06-14DOI: 10.1109/WOWMOM.2010.5535003
Yu Zhang, A. Baliga, W. Trappe
Malicious users may reprogram cognitive radios to disregard how their actions may harm other users. To cope with such threats, we propose that cognitive radios must have a trusted domain, which contains an onboard regulation mechanism (ORM) that 'regulates' the radio's behavior by monitoring the radio, and taking appropriate action. We present a scheme for monitoring the link quality, in real-time to assess the proper action to take. Our method promptly prevents misbehavior by taking action in a manner proportional to the level by which the cognitive radio deviates from normal, allowed behavior. We demonstrate a method for the ORM to collect the link state information needed to regulate its cognitive radio. Lastly, we examine the resulting algorithms and study our regulation relative to traditional CSMA and Aloha MAC protocols on the ORBIT testbed using USRP/GNU Radios.
{"title":"Reactive on-board regulation of cognitive radios","authors":"Yu Zhang, A. Baliga, W. Trappe","doi":"10.1109/WOWMOM.2010.5535003","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5535003","url":null,"abstract":"Malicious users may reprogram cognitive radios to disregard how their actions may harm other users. To cope with such threats, we propose that cognitive radios must have a trusted domain, which contains an onboard regulation mechanism (ORM) that 'regulates' the radio's behavior by monitoring the radio, and taking appropriate action. We present a scheme for monitoring the link quality, in real-time to assess the proper action to take. Our method promptly prevents misbehavior by taking action in a manner proportional to the level by which the cognitive radio deviates from normal, allowed behavior. We demonstrate a method for the ORM to collect the link state information needed to regulate its cognitive radio. Lastly, we examine the resulting algorithms and study our regulation relative to traditional CSMA and Aloha MAC protocols on the ORBIT testbed using USRP/GNU Radios.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133093852","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
扫码关注我们
求助内容：
应助结果提醒方式：