Pub Date : 2017-01-26DOI: 10.1109/ICCNC.2017.7876156
Cheng Leong Lim, C. Goh, Asiya Khan, Yun Li
Wireless Sensor Network's communication reliability is greatly influenced by the spatial related network challenges found in the physical space between communicating nodes. In this paper, ZigBee based sensor nodes are experimented under the influence of two distinct spatial related network challenges (i) poor deployed environment and (ii) human movements. WSN parameters obtained are used to develop an ANFIS based model designed to predict these spatial related network challenges. Using ANFIS model prediction accuracies as performance indices, WSN parameters are analysed from the physical and network layers perspective. Physical layer's link properties, reception strength and reception variability, are shown to be key indicators to spatial related network challenges. The parameters observed are Mean RSSI, Average Coefficient of Variation RSSI, Neighbour Table Connectivity and Bi-directional Neighbour Table Connectivity.
无线传感器网络的通信可靠性很大程度上受到通信节点间物理空间空间相关网络挑战的影响。在本文中，基于ZigBee的传感器节点在两种不同的空间相关网络挑战(i)恶劣的部署环境和(ii)人类运动的影响下进行了实验。获得的WSN参数用于开发基于ANFIS的模型，旨在预测这些空间相关的网络挑战。以ANFIS模型预测精度为性能指标，从物理层和网络层对WSN参数进行了分析。物理层的链路属性、接收强度和接收变异性是空间相关网络挑战的关键指标。观测到的参数有Mean RSSI、Average Coefficient of Variation RSSI、Neighbour Table连通性和Bi-directional Neighbour Table连通性。
{"title":"Understanding spatial related network challenges from physical and network layers","authors":"Cheng Leong Lim, C. Goh, Asiya Khan, Yun Li","doi":"10.1109/ICCNC.2017.7876156","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876156","url":null,"abstract":"Wireless Sensor Network's communication reliability is greatly influenced by the spatial related network challenges found in the physical space between communicating nodes. In this paper, ZigBee based sensor nodes are experimented under the influence of two distinct spatial related network challenges (i) poor deployed environment and (ii) human movements. WSN parameters obtained are used to develop an ANFIS based model designed to predict these spatial related network challenges. Using ANFIS model prediction accuracies as performance indices, WSN parameters are analysed from the physical and network layers perspective. Physical layer's link properties, reception strength and reception variability, are shown to be key indicators to spatial related network challenges. The parameters observed are Mean RSSI, Average Coefficient of Variation RSSI, Neighbour Table Connectivity and Bi-directional Neighbour Table Connectivity.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129370125","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 : 2017-01-26DOI: 10.1109/ICCNC.2017.7876096
Zhuocheng Li, Tuong-Bach Nguyen, Quentin Lampin, Isabelle Sivignon, S. Zozor
Low-Power Wide Area Networks (LPWANs) promise to enable nationwide low-power connectivity to Internet of Things (IoT) devices. While transmission ranges meet expectations, concerns on the packet delivery ratio are voiced. Receiver-side diversity is often thought as a solution to improve on delivery ratio, as well as an enabler to the geolocation of devices. In this context, we study the infrastructure density required to achieve k-coverage of the IoT devices, which preludes k-reception. To that purpose, we make use of k-order Voronoi diagram to compute an estimate of the gateway density in reference deployment setups: dense urban, urban and rural networks. We thus provide insights on the feasibility of k-coverage deployment in those scenarios.
{"title":"Ensuring k-coverage in Low-Power Wide Area Networks for Internet of Things","authors":"Zhuocheng Li, Tuong-Bach Nguyen, Quentin Lampin, Isabelle Sivignon, S. Zozor","doi":"10.1109/ICCNC.2017.7876096","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876096","url":null,"abstract":"Low-Power Wide Area Networks (LPWANs) promise to enable nationwide low-power connectivity to Internet of Things (IoT) devices. While transmission ranges meet expectations, concerns on the packet delivery ratio are voiced. Receiver-side diversity is often thought as a solution to improve on delivery ratio, as well as an enabler to the geolocation of devices. In this context, we study the infrastructure density required to achieve k-coverage of the IoT devices, which preludes k-reception. To that purpose, we make use of k-order Voronoi diagram to compute an estimate of the gateway density in reference deployment setups: dense urban, urban and rural networks. We thus provide insights on the feasibility of k-coverage deployment in those scenarios.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124798049","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 : 2017-01-26DOI: 10.1109/ICCNC.2017.7876176
Cristanel Razafimandimby, V. Loscrí, A. Vegni, A. Neri
Nowadays, Internet of Things (IoT) coupled with cloud computing begins to take an important place in economic systems and in society daily life. It has got a large success in several application areas, ranging from smart city applications to smart grids. One major challenge that should be addressed is the huge amount of data generated by the sensing devices, which make the control of sending useless data very important. To face this challenge, we present a Bayesian Inference Approach (BIA), which allows avoiding the transmission of high spatio-temporal correlated data. In this paper, BIA is based on a hierarchical architecture with simple nodes, smart gateways and data centers. Belief Propagation algorithm has been chosen for performing an approximate inference on our model in order to reconstruct the missing sensing data. BIA is evaluated based on the data collected from real sensors and according to different scenarios. The results show that our proposed approach reduces drastically the number of transmitted data and the energy consumption, while maintaining an acceptable level of data prediction accuracy.
{"title":"A Bayesian and smart gateway based communication for noisy IoT scenario","authors":"Cristanel Razafimandimby, V. Loscrí, A. Vegni, A. Neri","doi":"10.1109/ICCNC.2017.7876176","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876176","url":null,"abstract":"Nowadays, Internet of Things (IoT) coupled with cloud computing begins to take an important place in economic systems and in society daily life. It has got a large success in several application areas, ranging from smart city applications to smart grids. One major challenge that should be addressed is the huge amount of data generated by the sensing devices, which make the control of sending useless data very important. To face this challenge, we present a Bayesian Inference Approach (BIA), which allows avoiding the transmission of high spatio-temporal correlated data. In this paper, BIA is based on a hierarchical architecture with simple nodes, smart gateways and data centers. Belief Propagation algorithm has been chosen for performing an approximate inference on our model in order to reconstruct the missing sensing data. BIA is evaluated based on the data collected from real sensors and according to different scenarios. The results show that our proposed approach reduces drastically the number of transmitted data and the energy consumption, while maintaining an acceptable level of data prediction accuracy.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124204297","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 : 2017-01-26DOI: 10.1109/ICCNC.2017.7876127
G. L. Lann
We examine longitudinal and lateral safety-critical scenarios as they arise in VANETs, in the presence of concurrency and unreliable inter-vehicular communications. The Fast Distributed Agreement (FastDA) problem, as well as solutions to the longitudinal and the lateral instantiations of FastDA, are examined and informally specified. Analytical expressions of worst-case time bounds for reaching agreement are provided. We verify that stringent safety requirements are met through realistic examples drawn from various safety-critical scenarios.
{"title":"Fast Distributed Agreements and safety-critical scenarios in VANETs","authors":"G. L. Lann","doi":"10.1109/ICCNC.2017.7876127","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876127","url":null,"abstract":"We examine longitudinal and lateral safety-critical scenarios as they arise in VANETs, in the presence of concurrency and unreliable inter-vehicular communications. The Fast Distributed Agreement (FastDA) problem, as well as solutions to the longitudinal and the lateral instantiations of FastDA, are examined and informally specified. Analytical expressions of worst-case time bounds for reaching agreement are provided. We verify that stringent safety requirements are met through realistic examples drawn from various safety-critical scenarios.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126470298","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-11-30DOI: 10.1109/ICCNC.2017.7876270
Nadieh Moghadam, M. Mohebbi, Hongxiang Li
In this paper queue stability in a single-hop wireless multicast networks over erasure channels is analyzed. First, a queuing model consisting of several sub-queues is introduced. Under the queueing stability constraint, we adopt Lyapunov optimization model and define decision variables to derive a network coding based packet scheduling algorithm, which has significantly less complexity and shorter queue size compared with the existing solutions. Further, the proposed algorithm is modified to meet the requirements of time-critical data. Finally, the simulation results verify the effectiveness of our proposed algorithm.
{"title":"Opportunistic scheduling for network coded data in wireless multicast networks","authors":"Nadieh Moghadam, M. Mohebbi, Hongxiang Li","doi":"10.1109/ICCNC.2017.7876270","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876270","url":null,"abstract":"In this paper queue stability in a single-hop wireless multicast networks over erasure channels is analyzed. First, a queuing model consisting of several sub-queues is introduced. Under the queueing stability constraint, we adopt Lyapunov optimization model and define decision variables to derive a network coding based packet scheduling algorithm, which has significantly less complexity and shorter queue size compared with the existing solutions. Further, the proposed algorithm is modified to meet the requirements of time-critical data. Finally, the simulation results verify the effectiveness of our proposed algorithm.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127058376","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-10-05DOI: 10.1109/ICCNC.2017.7876221
Arsany Guirguis, Mustafa ElNainay
In this work, we propose CSCR, a channel selection scheme for cooperation-based routing protocols in cognitive radio networks. The proposed scheme increases the spectrum utilization through integrating the channels selection in the route discovery phase of the cooperation-based routing protocols. The best channels, that are less congested with primary users and that lead to minimum switching overhead, are chosen while constructing the cooperative group. Evaluating CSCR via NS2 simulations shows that it outperforms its counterparts in terms of goodput, end-to-end delay, and packet delivery ratio. The proposed scheme can enhance the network goodput, in some cases, by more than 150%, as compared to other related protocols.
{"title":"Channel Selection scheme for Cooperative Routing protocols in Cognitive Radio Networks","authors":"Arsany Guirguis, Mustafa ElNainay","doi":"10.1109/ICCNC.2017.7876221","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876221","url":null,"abstract":"In this work, we propose CSCR, a channel selection scheme for cooperation-based routing protocols in cognitive radio networks. The proposed scheme increases the spectrum utilization through integrating the channels selection in the route discovery phase of the cooperation-based routing protocols. The best channels, that are less congested with primary users and that lead to minimum switching overhead, are chosen while constructing the cooperative group. Evaluating CSCR via NS2 simulations shows that it outperforms its counterparts in terms of goodput, end-to-end delay, and packet delivery ratio. The proposed scheme can enhance the network goodput, in some cases, by more than 150%, as compared to other related protocols.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131273174","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-06-07DOI: 10.1109/ICCNC.2017.7876094
P. Oni, S. Blostein
Densification of access points (APs) in wireless local area networks (WLANs) increases the interference and the contention domains of each AP due to multiple overlapped basic service sets (BSSs). Consequently, high interference from multiple co-channel BSS at the target AP impairs system performance. To improve system performance in the presence of multi-BSSs interference, we propose a decentralized AP selection scheme that takes interference at the candidate APs into account and selects AP that offers best signal-interference-plus noise ratio (SINR). In the proposed algorithm, the AP selection process is distributed at the user stations (STAs) and is based on the estimated SINR in the downlink. Estimating SINR in the downlink helps capture the effect of interference from neighboring BSSs or APs. Based on a simulated large-scale 802.11 network, the proposed scheme outperforms the strongest signal first (SSF) AP selection scheme used in current 802.11 standards as well as the mean probe delay (MPD) AP selection algorithm in [3]; it achieves 99% and 43% gains in aggregate throughput over SSF and MPD, respectively. While increasing STA densification, the proposed scheme is shown to increase aggregate network performance.
{"title":"Decentralized AP selection in large-scale wireless LANs considering multi-AP interference","authors":"P. Oni, S. Blostein","doi":"10.1109/ICCNC.2017.7876094","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876094","url":null,"abstract":"Densification of access points (APs) in wireless local area networks (WLANs) increases the interference and the contention domains of each AP due to multiple overlapped basic service sets (BSSs). Consequently, high interference from multiple co-channel BSS at the target AP impairs system performance. To improve system performance in the presence of multi-BSSs interference, we propose a decentralized AP selection scheme that takes interference at the candidate APs into account and selects AP that offers best signal-interference-plus noise ratio (SINR). In the proposed algorithm, the AP selection process is distributed at the user stations (STAs) and is based on the estimated SINR in the downlink. Estimating SINR in the downlink helps capture the effect of interference from neighboring BSSs or APs. Based on a simulated large-scale 802.11 network, the proposed scheme outperforms the strongest signal first (SSF) AP selection scheme used in current 802.11 standards as well as the mean probe delay (MPD) AP selection algorithm in [3]; it achieves 99% and 43% gains in aggregate throughput over SSF and MPD, respectively. While increasing STA densification, the proposed scheme is shown to increase aggregate network performance.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131488325","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-06-06DOI: 10.1109/ICCNC.2017.7876117
S. Baidya, M. Levorato
A novel interference management approach is proposed for modern communication scenarios, where multiple applications and networks coexist on the same channel resource. The leading principle behind the proposed approach is that the interference level should be adapted to the content being transmitted by the data links to maximize the amount of delivered information. A network setting is considered where Device-to-Device (D2D) communications underlay a Long Term Evolution (LTE) link uploading video content to the network infrastructure. For this scenario, an optimization problem is formulated aiming at the maximization of the D2D link's throughput under a constraint on the Peak Signal-to-Noise-Ratio of the video data stream. The resulting optimal policy focuses interference on specific packets within the video stream, and significantly increases the throughput achieved by the D2D link compared to an undifferentiated interference strategy. The optimal strategy is applied to a real-world video streaming application to further demonstrate the performance gain.
{"title":"Content-based interference management for video transmission in D2D communications underlaying LTE","authors":"S. Baidya, M. Levorato","doi":"10.1109/ICCNC.2017.7876117","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876117","url":null,"abstract":"A novel interference management approach is proposed for modern communication scenarios, where multiple applications and networks coexist on the same channel resource. The leading principle behind the proposed approach is that the interference level should be adapted to the content being transmitted by the data links to maximize the amount of delivered information. A network setting is considered where Device-to-Device (D2D) communications underlay a Long Term Evolution (LTE) link uploading video content to the network infrastructure. For this scenario, an optimization problem is formulated aiming at the maximization of the D2D link's throughput under a constraint on the Peak Signal-to-Noise-Ratio of the video data stream. The resulting optimal policy focuses interference on specific packets within the video stream, and significantly increases the throughput achieved by the D2D link compared to an undifferentiated interference strategy. The optimal strategy is applied to a real-world video streaming application to further demonstrate the performance gain.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129928165","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-04-18DOI: 10.1109/ICCNC.2017.7876148
Anna Engelmann, A. Jukan
As more and more data is transmitted in the configurable optical layer, - whereby all optical switches forward packets without electronic layers involved, we envision privacy as the intrinsic property of future optical networks. In this paper, we propose Optical Onion Routing (OOR) and forwarding techniques, inspired by the onion routing in the Internet layer, - the best known realization of anonymous communication today, - but designed with specific features innate to optical networks. We propose to design the optical anonymization network system with a new optical anonymization node architecture, including the optical components and their electronic counterparts to realize layered encryption. We propose modification to the secret key generation using Linear Feedback Shift Register (LFSR), - able to utilize different primitive irreducible polynomials, and the usage optical XOR operation as encryption, an important optical technology coming of age. We prove formally that, for the proposed encryption techniques and distribution of secret information, the optical onion network is perfectly private and secure. The paper aims at providing practical foundations for privacy-enhancing optical network technologies.
{"title":"Optical Onion Routing","authors":"Anna Engelmann, A. Jukan","doi":"10.1109/ICCNC.2017.7876148","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876148","url":null,"abstract":"As more and more data is transmitted in the configurable optical layer, - whereby all optical switches forward packets without electronic layers involved, we envision privacy as the intrinsic property of future optical networks. In this paper, we propose Optical Onion Routing (OOR) and forwarding techniques, inspired by the onion routing in the Internet layer, - the best known realization of anonymous communication today, - but designed with specific features innate to optical networks. We propose to design the optical anonymization network system with a new optical anonymization node architecture, including the optical components and their electronic counterparts to realize layered encryption. We propose modification to the secret key generation using Linear Feedback Shift Register (LFSR), - able to utilize different primitive irreducible polynomials, and the usage optical XOR operation as encryption, an important optical technology coming of age. We prove formally that, for the proposed encryption techniques and distribution of secret information, the optical onion network is perfectly private and secure. The paper aims at providing practical foundations for privacy-enhancing optical network technologies.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126786643","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 : 2015-12-31DOI: 10.1109/ICCNC.2017.7876178
C. Funai, C. Tapparello, W. Heinzelman
With the increasing availability of mobile devices that natively support ad hoc communication protocols, we are presented with a unique opportunity to realize large scale ad hoc wireless networks. Recently, a novel ad hoc protocol named WiFi Direct has been proposed and standardized by the WiFi Alliance with the objective of facilitating the interconnection of nearby devices. However, WiFi Direct has been designed following a client-server hierarchical architecture, where a single device manages all the communications within a group of devices. In this paper, we propose and analyze different practical solutions for supporting the communications between multiple WiFi Direct groups using Android OS devices. By describing the WiFi Direct standard and the limitations of the current implementation of the Android WiFi Direct framework, we present possible solutions to interconnect different groups to create multi-hop ad hoc networks. Experimental results show that our proposed approaches are feasible with different overhead in terms of energy consumption and delay at the gateway node. Additionally, our experimental results demonstrate the superiority of techniques that exploit the device ability to maintain simultaneous physical connections to multiple groups, enabling multi-hop ad hoc networks with low overhead.
{"title":"Enabling multi-hop ad hoc networks through WiFi Direct multi-group networking","authors":"C. Funai, C. Tapparello, W. Heinzelman","doi":"10.1109/ICCNC.2017.7876178","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876178","url":null,"abstract":"With the increasing availability of mobile devices that natively support ad hoc communication protocols, we are presented with a unique opportunity to realize large scale ad hoc wireless networks. Recently, a novel ad hoc protocol named WiFi Direct has been proposed and standardized by the WiFi Alliance with the objective of facilitating the interconnection of nearby devices. However, WiFi Direct has been designed following a client-server hierarchical architecture, where a single device manages all the communications within a group of devices. In this paper, we propose and analyze different practical solutions for supporting the communications between multiple WiFi Direct groups using Android OS devices. By describing the WiFi Direct standard and the limitations of the current implementation of the Android WiFi Direct framework, we present possible solutions to interconnect different groups to create multi-hop ad hoc networks. Experimental results show that our proposed approaches are feasible with different overhead in terms of energy consumption and delay at the gateway node. Additionally, our experimental results demonstrate the superiority of techniques that exploit the device ability to maintain simultaneous physical connections to multiple groups, enabling multi-hop ad hoc networks with low overhead.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125448095","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
扫码关注我们
求助内容：
应助结果提醒方式：