Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440571
Chuhan Gao, Yong Li, Depeng Jin
With the explosive growth of mobile data demands for local services, device-to-device (D2D) communication is proposed as a vital technology for next generation cellular network to enhance the transmission capacity. With the popularity of content-based mobile applications, popular content downloading can be optimized by allowing D2D communications to share the content with each other. Such improvements depend on effective and efficient solutions for the D2D technical problems of mode selection and resource allocation. Existing works dealing with these technical problems usually stand in the viewpoint of some network snapshots with fixed topology of static mobile users to optimization the instantaneous resource utilization. In this paper, from an angle of dynamic networks, we consider the mode selection and resource allocation problems for D2D communication underlaying cellular network with opportunistic change of users' location by fully exploiting their mobility patterns to achieve global optimization. By formulating the above process-oriented optimization problems, we introduce a utility function and contention graph based approaches, termed MAD2D (Mobility assisted D2D), to heuristically solve them effectively. Through extensive simulations, we demonstrate MAD2D greatly enhanced the system performance compared with the state-of-the-art solutions.
{"title":"Mobility assisted device-to-device communications underlaying cellular networks","authors":"Chuhan Gao, Yong Li, Depeng Jin","doi":"10.1109/ICCNC.2016.7440571","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440571","url":null,"abstract":"With the explosive growth of mobile data demands for local services, device-to-device (D2D) communication is proposed as a vital technology for next generation cellular network to enhance the transmission capacity. With the popularity of content-based mobile applications, popular content downloading can be optimized by allowing D2D communications to share the content with each other. Such improvements depend on effective and efficient solutions for the D2D technical problems of mode selection and resource allocation. Existing works dealing with these technical problems usually stand in the viewpoint of some network snapshots with fixed topology of static mobile users to optimization the instantaneous resource utilization. In this paper, from an angle of dynamic networks, we consider the mode selection and resource allocation problems for D2D communication underlaying cellular network with opportunistic change of users' location by fully exploiting their mobility patterns to achieve global optimization. By formulating the above process-oriented optimization problems, we introduce a utility function and contention graph based approaches, termed MAD2D (Mobility assisted D2D), to heuristically solve them effectively. Through extensive simulations, we demonstrate MAD2D greatly enhanced the system performance compared with the state-of-the-art solutions.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129831733","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 : 2016-03-24DOI: 10.1109/ICCNC.2016.7440629
K. S. Rao, N. Jain, Nikhil Limaje, Abhilash Gupta, Mridul Jain, B. Menezes
Cross Site Scripting (XSS) and clickjacking have been ranked among the top web application threats in recent times. This paper introduces XBuster - our client-side defence against XSS, implemented as an extension to the Mozilla Firefox browser. XBuster splits each HTTP request parameter into HTML and JavaScript contexts and stores them separately. It searches for both contexts in the HTTP response and handles each context type differently. It defends against all XSS attack vectors including partial script injection, attribute injection and HTML injection. Also, existing XSS filters may inadvertently disable frame busting code used in web pages as a defence against clickjacking. However, XBuster has been designed to detect and neutralize such attempts.
{"title":"Two for the price of one: A combined browser defense against XSS and clickjacking","authors":"K. S. Rao, N. Jain, Nikhil Limaje, Abhilash Gupta, Mridul Jain, B. Menezes","doi":"10.1109/ICCNC.2016.7440629","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440629","url":null,"abstract":"Cross Site Scripting (XSS) and clickjacking have been ranked among the top web application threats in recent times. This paper introduces XBuster - our client-side defence against XSS, implemented as an extension to the Mozilla Firefox browser. XBuster splits each HTTP request parameter into HTML and JavaScript contexts and stores them separately. It searches for both contexts in the HTTP response and handles each context type differently. It defends against all XSS attack vectors including partial script injection, attribute injection and HTML injection. Also, existing XSS filters may inadvertently disable frame busting code used in web pages as a defence against clickjacking. However, XBuster has been designed to detect and neutralize such attempts.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131936510","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 : 2016-03-24DOI: 10.1109/ICCNC.2016.7440557
Lei Chen, N. Shashidhar, D. Rawat, Ming Yang, Christopher Kadlec
As video games received rapidly increasing attention, modern video games are often concerned with security and privacy issues. Many such video games and game console systems graciously allow player customization, giving people with malicious intent a new vector to lunch security attacks and exchange secretive messages, which posts new challenges to the society of security and digital forensics. In this research, we investigate the security of four popular PC video games and the Sony PlayStation 4 (PS4) game console. Our study showed that each of these video games has at least one feature that may possibly be exploited by attackers for transmitting secretive information, which is very difficult to be detected using current forensic tools. As for gaming consoles, the hard drive of PS4 console is encrypted and consequently most part of its file system cannot be analyzed using current forensic tools such as AccessData's Forensic Toolkit (FTK). However, it is still possible to lunch Denial of Service (DoS) and ARP cache poisoning attacks to the console, which may slow down and halt the system and potentially expose security sensitive information. Based on the above findings, we offer recommendations on how and where security professionals and digital investigators may search for hidden data.
{"title":"Investigating the security and digital forensics of video games and gaming systems: A study of PC games and PS4 console","authors":"Lei Chen, N. Shashidhar, D. Rawat, Ming Yang, Christopher Kadlec","doi":"10.1109/ICCNC.2016.7440557","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440557","url":null,"abstract":"As video games received rapidly increasing attention, modern video games are often concerned with security and privacy issues. Many such video games and game console systems graciously allow player customization, giving people with malicious intent a new vector to lunch security attacks and exchange secretive messages, which posts new challenges to the society of security and digital forensics. In this research, we investigate the security of four popular PC video games and the Sony PlayStation 4 (PS4) game console. Our study showed that each of these video games has at least one feature that may possibly be exploited by attackers for transmitting secretive information, which is very difficult to be detected using current forensic tools. As for gaming consoles, the hard drive of PS4 console is encrypted and consequently most part of its file system cannot be analyzed using current forensic tools such as AccessData's Forensic Toolkit (FTK). However, it is still possible to lunch Denial of Service (DoS) and ARP cache poisoning attacks to the console, which may slow down and halt the system and potentially expose security sensitive information. Based on the above findings, we offer recommendations on how and where security professionals and digital investigators may search for hidden data.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123277897","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 : 2016-03-24DOI: 10.1109/ICCNC.2016.7440550
George P. Corser, A. Arenas, Huirong Fu
In future vehicular ad-hoc networks (VANETs), Basic Safety Messages (BSMs) would be transmitted by all vehicles every 100ms in order to help prevent inter-vehicle crashes. At first not all vehicles would contain the hardware and software necessary to transmit BSMs; there would be an interval when only a percentage of vehicles would transmit. Further, even after all vehicles install the equipment, some privacy researchers recommend silent periods, spans of time during which vehicles deliberately cease transmissions. This is because BSMs may expose vehicle locations to wireless surveillance, and silent periods could thwart eavesdroppers. Whether due to lack of equipment or due to privacy protocols, silent periods would defeat safety provided by BSMs. This paper quantifies this tradeoff, presenting the Safety-Silence Tradeoff Equation, and showing an inverse exponential relationship between the proportion of vehicles transmitting BSMs and the proportion of potential collisions between vehicles unprotected by BSMs.
{"title":"Effect on vehicle safety of nonexistent or silenced basic safety messages","authors":"George P. Corser, A. Arenas, Huirong Fu","doi":"10.1109/ICCNC.2016.7440550","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440550","url":null,"abstract":"In future vehicular ad-hoc networks (VANETs), Basic Safety Messages (BSMs) would be transmitted by all vehicles every 100ms in order to help prevent inter-vehicle crashes. At first not all vehicles would contain the hardware and software necessary to transmit BSMs; there would be an interval when only a percentage of vehicles would transmit. Further, even after all vehicles install the equipment, some privacy researchers recommend silent periods, spans of time during which vehicles deliberately cease transmissions. This is because BSMs may expose vehicle locations to wireless surveillance, and silent periods could thwart eavesdroppers. Whether due to lack of equipment or due to privacy protocols, silent periods would defeat safety provided by BSMs. This paper quantifies this tradeoff, presenting the Safety-Silence Tradeoff Equation, and showing an inverse exponential relationship between the proportion of vehicles transmitting BSMs and the proportion of potential collisions between vehicles unprotected by BSMs.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128155623","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 : 2016-03-24DOI: 10.1109/ICCNC.2016.7440641
Tatsuya Otoshi, Y. Ohsita, M. Murata, Yousuke Takahashi, K. Ishibashi, K. Shiomoto, T. Hashimoto
Traffic engineering (TE) plays an essential role in deciding routes that effectively use network resources. Since managing the routes of a large network takes a large overhead, multiple controllers are introduced in the network which hierarchically decide the routes. We call this approach hierarchical TE. In hierarchical TE, avoiding the route oscillation is a main problem since routes change at a layer causes the additional routes changes at other layers. The existing hierarchical TE avoids these route oscillation by setting the longer control interval on the upper layer. This approach, however, causes another problem that the routes change of upper layer delays to traffic changes. In this paper, we propose a hierarchical TE method called hierarchical model predictive traffic engineering (hierarchical MP-TE) which avoids routing oscillation without setting the long control interval. In hierarchical MP-TE, each control server gradually changes the routes based on the traffic prediction to stabilize the routing instead of setting the long control interval. Through the simulation, we show that the hierarchical MP-TE achieves the routing convergence with the short control interval.
{"title":"Hierarchical traffic engineering based on model predictive control","authors":"Tatsuya Otoshi, Y. Ohsita, M. Murata, Yousuke Takahashi, K. Ishibashi, K. Shiomoto, T. Hashimoto","doi":"10.1109/ICCNC.2016.7440641","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440641","url":null,"abstract":"Traffic engineering (TE) plays an essential role in deciding routes that effectively use network resources. Since managing the routes of a large network takes a large overhead, multiple controllers are introduced in the network which hierarchically decide the routes. We call this approach hierarchical TE. In hierarchical TE, avoiding the route oscillation is a main problem since routes change at a layer causes the additional routes changes at other layers. The existing hierarchical TE avoids these route oscillation by setting the longer control interval on the upper layer. This approach, however, causes another problem that the routes change of upper layer delays to traffic changes. In this paper, we propose a hierarchical TE method called hierarchical model predictive traffic engineering (hierarchical MP-TE) which avoids routing oscillation without setting the long control interval. In hierarchical MP-TE, each control server gradually changes the routes based on the traffic prediction to stabilize the routing instead of setting the long control interval. Through the simulation, we show that the hierarchical MP-TE achieves the routing convergence with the short control interval.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116349946","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 : 2016-03-24DOI: 10.1109/ICCNC.2016.7440562
Arun Das, Anisha Mazumder, Arunabha Sen, N. Mitton
The sensor data collection problem using data mules has been studied fairly extensively in the literature. However, in most of these studies, while the mule is mobile, all sensors are stationary. The objective of most of these studies is to minimize the time needed by the mule to collect data from all the sensors and return to the data collection point from where it embarked on its data collection journey. The problem studied in this paper has two major differences with these earlier studies. First, in this study we assume that both the mule as well as the sensors are mobile. Second, we do not attempt to minimize the data collection time. Instead, we minimize the number of mules that will be needed to collect data from all the sensors, subject to the constraint that the data collection process has to be completed within some pre-specified time. We show that the mule minimization problem is NP-Complete and analyze the problem in two settings. We provide solutions to the problem in both settings by first transforming the problem to a generalized version of the minimum flow problem in a network, and then solving it optimally using Integer Linear Programming. Finally, we evaluate our algorithms through experiments and present our results.
{"title":"On mobile sensor data collection using data mules","authors":"Arun Das, Anisha Mazumder, Arunabha Sen, N. Mitton","doi":"10.1109/ICCNC.2016.7440562","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440562","url":null,"abstract":"The sensor data collection problem using data mules has been studied fairly extensively in the literature. However, in most of these studies, while the mule is mobile, all sensors are stationary. The objective of most of these studies is to minimize the time needed by the mule to collect data from all the sensors and return to the data collection point from where it embarked on its data collection journey. The problem studied in this paper has two major differences with these earlier studies. First, in this study we assume that both the mule as well as the sensors are mobile. Second, we do not attempt to minimize the data collection time. Instead, we minimize the number of mules that will be needed to collect data from all the sensors, subject to the constraint that the data collection process has to be completed within some pre-specified time. We show that the mule minimization problem is NP-Complete and analyze the problem in two settings. We provide solutions to the problem in both settings by first transforming the problem to a generalized version of the minimum flow problem in a network, and then solving it optimally using Integer Linear Programming. Finally, we evaluate our algorithms through experiments and present our results.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125639458","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 : 2016-03-24DOI: 10.1109/ICCNC.2016.7440615
Piotr Zwierko, L. Maksymiuk, J. Siuzdak
The paper presents a two way open space optical link ready for 10/100 Mbit/s Ethernet signal transmission. It uses lighting LEDs as light sources in both transmission directions. A description of used circuitry is given together with experimental results obtained in a real network.
{"title":"Ethernet signal transmission via VLC lighting LED link in a real network","authors":"Piotr Zwierko, L. Maksymiuk, J. Siuzdak","doi":"10.1109/ICCNC.2016.7440615","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440615","url":null,"abstract":"The paper presents a two way open space optical link ready for 10/100 Mbit/s Ethernet signal transmission. It uses lighting LEDs as light sources in both transmission directions. A description of used circuitry is given together with experimental results obtained in a real network.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124313679","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 : 2016-03-24DOI: 10.1109/ICCNC.2016.7440554
Xin Liu, Junhua Yan, Kunqi Chen
In order to improve sensing performance to primary user (PU) and decrease energy wastage of secondary user (SU) in cognitive radio (CR), an energy harvest-based weighed cooperative spectrum sensing is proposed in this paper. The SU harvests the radio frequency (RF) energy of the PU signal, which is then converted into the electric energy to supply the power used for sensing and cooperation. A joint optimization problem is formulated to maximize the spectrum access probability of the SU by jointly optimizing sensing time and number of cooperative SUs. The simulation results have shown that compared to the traditional cooperative sensing, the proposed cooperative sensing can decrease the energy wastage obviously, and there deed exists an optimal set of sensing time and SU number that maximizes the spectrum access probability.
{"title":"Optimal energy harvest-based weighed cooperative spectrum sensing in cognitive radio","authors":"Xin Liu, Junhua Yan, Kunqi Chen","doi":"10.1109/ICCNC.2016.7440554","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440554","url":null,"abstract":"In order to improve sensing performance to primary user (PU) and decrease energy wastage of secondary user (SU) in cognitive radio (CR), an energy harvest-based weighed cooperative spectrum sensing is proposed in this paper. The SU harvests the radio frequency (RF) energy of the PU signal, which is then converted into the electric energy to supply the power used for sensing and cooperation. A joint optimization problem is formulated to maximize the spectrum access probability of the SU by jointly optimizing sensing time and number of cooperative SUs. The simulation results have shown that compared to the traditional cooperative sensing, the proposed cooperative sensing can decrease the energy wastage obviously, and there deed exists an optimal set of sensing time and SU number that maximizes the spectrum access probability.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122495264","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 : 2016-03-24DOI: 10.1109/ICCNC.2016.7440687
S. Basagni, C. Petrioli, Dora Spenza
Allowing the nodes of a wireless sensor network (WSN) to turn their radio off periodically noticeably increases network lifetime. Duty cycling, however, does not eliminate idle listening, comes at the price of longer latencies and obtains lifetimes that are still insufficient for many critical applications. Using a wake-up receiver (WUR) allows actual communications on the main radio only for transmission or reception, virtually eliminating node idling. However, the range of current WUR prototypes is still significantly shorter than that of the main radio, which can challenge the use of existing WSN protocols in WUR-based networks. In this paper we present an approach to mitigate this limitation of wake-up-based networks. In particular, we show that the Collection Tree Protocol (CTP), a standard protocol for data gathering in WSNs, suitably redefined to work on WUR-endowed nodes, achieves lifetimes of several decades. This constitutes a remarkable improvement over duty cycle-based solutions, where CTP makes the network lasts only a handful of months. At the same time, our WUR-based approach obtains data latencies comparable to those obtained by keeping the main radio always on.
{"title":"CTP-WUR: The collection tree protocol in wake-up radio WSNs for critical applications","authors":"S. Basagni, C. Petrioli, Dora Spenza","doi":"10.1109/ICCNC.2016.7440687","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440687","url":null,"abstract":"Allowing the nodes of a wireless sensor network (WSN) to turn their radio off periodically noticeably increases network lifetime. Duty cycling, however, does not eliminate idle listening, comes at the price of longer latencies and obtains lifetimes that are still insufficient for many critical applications. Using a wake-up receiver (WUR) allows actual communications on the main radio only for transmission or reception, virtually eliminating node idling. However, the range of current WUR prototypes is still significantly shorter than that of the main radio, which can challenge the use of existing WSN protocols in WUR-based networks. In this paper we present an approach to mitigate this limitation of wake-up-based networks. In particular, we show that the Collection Tree Protocol (CTP), a standard protocol for data gathering in WSNs, suitably redefined to work on WUR-endowed nodes, achieves lifetimes of several decades. This constitutes a remarkable improvement over duty cycle-based solutions, where CTP makes the network lasts only a handful of months. At the same time, our WUR-based approach obtains data latencies comparable to those obtained by keeping the main radio always on.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125340019","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 : 2016-03-24DOI: 10.1109/ICCNC.2016.7440601
Kosuke Suzuki, T. Nishimura, T. Ohgane, Y. Ogawa
In a wireless mesh network (WMN), the interference from active links in the vicinity of the node of interest is frequently not negligible and thus degrades the area spectral efficiency. An adaptive array is capable to control not only beams but also nulls. Thus, it is expected to help new link establishment. Moreover, the alternative routing boosts such spatial link multiplexing by decreasing the nodes in the stand-by state. In the paper, we evaluate the system throughput performance of the alternative routing in a WMN with an adaptive array of three elements. The evaluation results show that the alternative routing is very effective in the case of a gateway access model or when the average hop counts in the network is not so small.
{"title":"Performance evaluation of alternative routing in a wireless mesh network with an adaptive array","authors":"Kosuke Suzuki, T. Nishimura, T. Ohgane, Y. Ogawa","doi":"10.1109/ICCNC.2016.7440601","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440601","url":null,"abstract":"In a wireless mesh network (WMN), the interference from active links in the vicinity of the node of interest is frequently not negligible and thus degrades the area spectral efficiency. An adaptive array is capable to control not only beams but also nulls. Thus, it is expected to help new link establishment. Moreover, the alternative routing boosts such spatial link multiplexing by decreasing the nodes in the stand-by state. In the paper, we evaluate the system throughput performance of the alternative routing in a WMN with an adaptive array of three elements. The evaluation results show that the alternative routing is very effective in the case of a gateway access model or when the average hop counts in the network is not so small.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127978741","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
扫码关注我们
求助内容：
应助结果提醒方式：