Pub Date : 2015-04-14DOI: 10.4304/jnw.10.4.176-187
J. Saldaña, David de Hoz, J. Fernández-Navajas, José Ruíz, F. Pascual, D. López, D. Florez, J. A. Castell, M. Nunez
This paper proposes a method for optimizing bandwidth usage in Software Defined Networks (SDNs) based on OpenFlow. Flows of small packets presenting a high overhead, as the ones generated by emerging services, can be identified by the SDN controller, in order to remove header fields that are common to any packet in the flow, only during their way through the SDN. At the same time, several packets can be multiplexed together in the same frame, thus reducing the overall number of frames. The method can be useful for providing QoS while the packets are traversing the SDN. Four kinds of small-packet traffic flows are considered (VoIP, UDP and TCP-based online games, and ACKs from TCP flows). Both IPv4 and IPv6 are studied, and significant bandwidth savings (up to 68 % for IPv4 and 78 % for IPv6) can be obtained for the considered kinds of traffic. The optimization method is also applied to different public Internet traffic traces, and significant reductions in terms of packets per second are achieved. Results show that bandwidth consumption is also reduced, especially in those traces where the percentage of small packets is high. Regarding the effect on QoS, the additional delay can be kept very low (below 1 millisecond) when the throughput is high, but it may become significant for low- throughput scenarios. Thus, a trade-off between bandwidth saving and additional delay appears in those cases.
{"title":"Small-Packet Flows in Software Defined Networks: Traffic Profile Optimization","authors":"J. Saldaña, David de Hoz, J. Fernández-Navajas, José Ruíz, F. Pascual, D. López, D. Florez, J. A. Castell, M. Nunez","doi":"10.4304/jnw.10.4.176-187","DOIUrl":"https://doi.org/10.4304/jnw.10.4.176-187","url":null,"abstract":"This paper proposes a method for optimizing bandwidth usage in Software Defined Networks (SDNs) based on OpenFlow. Flows of small packets presenting a high overhead, as the ones generated by emerging services, can be identified by the SDN controller, in order to remove header fields that are common to any packet in the flow, only during their way through the SDN. At the same time, several packets can be multiplexed together in the same frame, thus reducing the overall number of frames. The method can be useful for providing QoS while the packets are traversing the SDN. Four kinds of small-packet traffic flows are considered (VoIP, UDP and TCP-based online games, and ACKs from TCP flows). Both IPv4 and IPv6 are studied, and significant bandwidth savings (up to 68 % for IPv4 and 78 % for IPv6) can be obtained for the considered kinds of traffic. The optimization method is also applied to different public Internet traffic traces, and significant reductions in terms of packets per second are achieved. Results show that bandwidth consumption is also reduced, especially in those traces where the percentage of small packets is high. Regarding the effect on QoS, the additional delay can be kept very low (below 1 millisecond) when the throughput is high, but it may become significant for low- throughput scenarios. Thus, a trade-off between bandwidth saving and additional delay appears in those cases.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"22 1","pages":"176-187"},"PeriodicalIF":0.0,"publicationDate":"2015-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86503172","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-04-14DOI: 10.4304/jnw.10.4.240-251
Andrea Lupia, F. Rango
Nodes in mobile ad-hoc networks communicate each other using the wireless transmission. Many protocols have been proposed allowing the establishment of multi-hop paths to connect source and destination nodes. The absence of a physical link between the nodes and the multi-hop routing lead to a lack of security. Different typologies of attack effective against MANETs have been investigated thoroughly, and many solutions have been proposed to take the required countermeasures. Many of them are based on the cryptography, protecting data with digital signatures and hash chains, but they are not useful when a fair node is compromised later in time. Using a Trust Management Scheme can help in these situations, allowing to evaluate dynamically if a node is trustworthy or not. The computation of a trust value requires the monitoring of the interactions between nodes, therefore it has an effect on the energy consumption, which is an important issue of ad-hoc networks. Energy availability is limited for the nodes in a MANET, so the security measures that they adopt must not excessively increase the consumption.
{"title":"Evaluation of the Energy Consumption Introduced by a Trust Management Scheme on Mobile Ad-hoc Networks","authors":"Andrea Lupia, F. Rango","doi":"10.4304/jnw.10.4.240-251","DOIUrl":"https://doi.org/10.4304/jnw.10.4.240-251","url":null,"abstract":"Nodes in mobile ad-hoc networks communicate each other using the wireless transmission. Many protocols have been proposed allowing the establishment of multi-hop paths to connect source and destination nodes. The absence of a physical link between the nodes and the multi-hop routing lead to a lack of security. Different typologies of attack effective against MANETs have been investigated thoroughly, and many solutions have been proposed to take the required countermeasures. Many of them are based on the cryptography, protecting data with digital signatures and hash chains, but they are not useful when a fair node is compromised later in time. Using a Trust Management Scheme can help in these situations, allowing to evaluate dynamically if a node is trustworthy or not. The computation of a trust value requires the monitoring of the interactions between nodes, therefore it has an effect on the energy consumption, which is an important issue of ad-hoc networks. Energy availability is limited for the nodes in a MANET, so the security measures that they adopt must not excessively increase the consumption.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"14 1","pages":"240-251"},"PeriodicalIF":0.0,"publicationDate":"2015-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87118424","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-04-14DOI: 10.4304/jnw.10.4.252-264
M. Tavanpour, J. Mikhail, M. Moallemi, Gabriel A. Wainer, G. Boudreau, Ronald Casselman
There have been ongoing efforts focused on improving mobile networks standards to support the ever-increasing user demands of high data rate services. These efforts are more crucial for cell-edge users where their long distance from their serving Base Station (BS), and the higher interference from the neighbouring cells, degrades their performance. Contemporary communication standards, proposed for Fourth Generation (4G) of mobile telecommunication standards, use different techniques to deal with these bottlenecks. Long Term Evolution Advanced (LTE-A), is a promising standard for 4G mobile networks, and it uses different technologies to enhance users’ performance regardless of their location in the coverage area. LTE-A employs Coordinated Multi-Point (CoMP) technique particularly to provide high data rate services for cell-edge users. In this context, we present Shared Segmented Upload (SSU), a novel method for uploading large files from User Equipment (UE) to multiple BSs in a CoMP communication scenario. We use Discrete EVent System Specification (DEVS) formalism to model an LTE-A mobile network using SSU. In addition, we employ DEVS to simulate a conventional non-cooperative algorithm to evaluate the effectiveness of SSU in two scenarios: rural and urban area settings. The simulation results show that, compared to the conventional method, SSU improves cell-edge users’ uplink performance and reduces the latency for a UE to upload its data to the network.
{"title":"Data Upload in LTE-A Mobile Networks by Using Shared Segmented Upload","authors":"M. Tavanpour, J. Mikhail, M. Moallemi, Gabriel A. Wainer, G. Boudreau, Ronald Casselman","doi":"10.4304/jnw.10.4.252-264","DOIUrl":"https://doi.org/10.4304/jnw.10.4.252-264","url":null,"abstract":"There have been ongoing efforts focused on improving mobile networks standards to support the ever-increasing user demands of high data rate services. These efforts are more crucial for cell-edge users where their long distance from their serving Base Station (BS), and the higher interference from the neighbouring cells, degrades their performance. Contemporary communication standards, proposed for Fourth Generation (4G) of mobile telecommunication standards, use different techniques to deal with these bottlenecks. Long Term Evolution Advanced (LTE-A), is a promising standard for 4G mobile networks, and it uses different technologies to enhance users’ performance regardless of their location in the coverage area. LTE-A employs Coordinated Multi-Point (CoMP) technique particularly to provide high data rate services for cell-edge users. In this context, we present Shared Segmented Upload (SSU), a novel method for uploading large files from User Equipment (UE) to multiple BSs in a CoMP communication scenario. We use Discrete EVent System Specification (DEVS) formalism to model an LTE-A mobile network using SSU. In addition, we employ DEVS to simulate a conventional non-cooperative algorithm to evaluate the effectiveness of SSU in two scenarios: rural and urban area settings. The simulation results show that, compared to the conventional method, SSU improves cell-edge users’ uplink performance and reduces the latency for a UE to upload its data to the network.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"359 1","pages":"252-264"},"PeriodicalIF":0.0,"publicationDate":"2015-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76389896","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-04-14DOI: 10.4304/jnw.10.4.232-239
J. Frnda, M. Voznák, L. Sevcik, P. Fazio
This paper brings a QoS (Quality of Service) assessment model which can estimate voice and video quality. Based on the proposed model, speech or video quality is computed with regard to congestion management QoS configuration in the network and its level of total utilization. The contribution of this paper lies in designing a new mathematical model capable of predicting the quality of multimedia services respecting network behavior and performance.
{"title":"Prediction Model of Triple play services for QoS Assessment in IP Based Networks","authors":"J. Frnda, M. Voznák, L. Sevcik, P. Fazio","doi":"10.4304/jnw.10.4.232-239","DOIUrl":"https://doi.org/10.4304/jnw.10.4.232-239","url":null,"abstract":"This paper brings a QoS (Quality of Service) assessment model which can estimate voice and video quality. Based on the proposed model, speech or video quality is computed with regard to congestion management QoS configuration in the network and its level of total utilization. The contribution of this paper lies in designing a new mathematical model capable of predicting the quality of multimedia services respecting network behavior and performance.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"17 1","pages":"232-239"},"PeriodicalIF":0.0,"publicationDate":"2015-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74055348","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-04-13DOI: 10.4304/jnw.10.3.141-151
M. Cypriani, G. Delisle, N. Hakem
Underground mining tunnels constitute a very particular environment for radio wave propagation – with characteristics of both indoor and outdoor “regular” environments. This paper shows how a general-purpose Wi- Fi-based indoor positioning system, OwlPS (Owl Positioning System) was adapted to work in that particular environment. A series of experiments, conducted in a formerly exploited gold mine at 70 metres below the surface, across about 400 metres of drifts, is then introduced; it primarily aims at determining the positioning accuracy that can be reached in such a context with a Wi-Fi-based positioning system using the signal strength at 2.4 GHz. The results obtained are improved with a filter, and the mean Euclidean distance error is under 10 metres in most cases when the terminal is carried by an operator; this makes OwlPS usable as is for asset management and emergency positioning of workers underground.
{"title":"Wi-Fi-based Positioning in a Complex Underground Environment","authors":"M. Cypriani, G. Delisle, N. Hakem","doi":"10.4304/jnw.10.3.141-151","DOIUrl":"https://doi.org/10.4304/jnw.10.3.141-151","url":null,"abstract":"Underground mining tunnels constitute a very particular environment for radio wave propagation – with characteristics of both indoor and outdoor “regular” environments. This paper shows how a general-purpose Wi- Fi-based indoor positioning system, OwlPS (Owl Positioning System) was adapted to work in that particular environment. A series of experiments, conducted in a formerly exploited gold mine at 70 metres below the surface, across about 400 metres of drifts, is then introduced; it primarily aims at determining the positioning accuracy that can be reached in such a context with a Wi-Fi-based positioning system using the signal strength at 2.4 GHz. The results obtained are improved with a filter, and the mean Euclidean distance error is under 10 metres in most cases when the terminal is carried by an operator; this makes OwlPS usable as is for asset management and emergency positioning of workers underground.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"4 1","pages":"141-151"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75539972","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-04-13DOI: 10.4304/jnw.10.3.152-158
Zhixiang Chen, Jinjie Hu, F. Cao
This paper investigates the learning algorithm of neural network on the spherical cap. Firstly, we construct the inner weights and biases from sample data, such that the network has the interpolation property on the sampling points. Secondly, we construct the BP network and BP learning algorithm. Finally, we analyze the generalization ability for the constructed networks and give the numerical experiments
{"title":"Learning Algorithm of Neural Networks on Spherical Cap","authors":"Zhixiang Chen, Jinjie Hu, F. Cao","doi":"10.4304/jnw.10.3.152-158","DOIUrl":"https://doi.org/10.4304/jnw.10.3.152-158","url":null,"abstract":"This paper investigates the learning algorithm of neural network on the spherical cap. Firstly, we construct the inner weights and biases from sample data, such that the network has the interpolation property on the sampling points. Secondly, we construct the BP network and BP learning algorithm. Finally, we analyze the generalization ability for the constructed networks and give the numerical experiments","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"92 1","pages":"152-158"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80472797","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-04-13DOI: 10.4304/jnw.10.3.125-133
Adil Benabbou, Abdelali Boushaba, Azeddine Zahi, Rachid Benabbou, M. Oumsis, S. E. Ouatik
OLSR (Optimized Link State Routing Protocol) is a routing protocol designed especially for MANETs (Mobile Ad hoc Networks) and is currently the most widely deployed for this type of networks. OLSR uses multipoint relay (MPR: MultiPoint Relay) flooding mechanism to optimize topology control messages broadcasting throughout the network. Each node of the network selects a subset of nodes (MPR) among its neighbors to disseminate control messages. Reducing topology control packets (TC) is the key functionality of OLSR. In the Ad hoc network, the number of TC depends on the choice of MPR. In this paper, we propose a new cooperative MPR selection algorithm with the aim to reduce TC packets. We implemented this algorithm in NS2 and three other algorithms are known to be performant in the domain. Simulation results show that our algorithm reduces TC packets relative to other algorithms. This reduction is reflected positively on other performance parameters
OLSR (Optimized Link State Routing Protocol)是一种专为移动自组织网络(manet)设计的路由协议，是目前在移动自组织网络中应用最广泛的一种路由协议。OLSR采用多点中继(multipoint relay, MPR)泛洪机制，优化拓扑控制消息在网络中的广播。网络中的每个节点在其邻居中选择一个节点子集(MPR)来传播控制消息。减少拓扑控制包(TC)是OLSR的关键功能。在Ad hoc网络中，TC的数量取决于MPR的选择。本文提出了一种新的以减少TC包为目标的协同MPR选择算法。我们在NS2中实现了该算法，并且已知在该领域中有三种其他算法性能良好。仿真结果表明，与其他算法相比，我们的算法减少了TC数据包。这种减少积极地反映在其他性能参数上
{"title":"NCA: New Cooperative Algorithm for Reducing Topology Control Packets in OLSR","authors":"Adil Benabbou, Abdelali Boushaba, Azeddine Zahi, Rachid Benabbou, M. Oumsis, S. E. Ouatik","doi":"10.4304/jnw.10.3.125-133","DOIUrl":"https://doi.org/10.4304/jnw.10.3.125-133","url":null,"abstract":"OLSR (Optimized Link State Routing Protocol) is a routing protocol designed especially for MANETs (Mobile Ad hoc Networks) and is currently the most widely deployed for this type of networks. OLSR uses multipoint relay (MPR: MultiPoint Relay) flooding mechanism to optimize topology control messages broadcasting throughout the network. Each node of the network selects a subset of nodes (MPR) among its neighbors to disseminate control messages. Reducing topology control packets (TC) is the key functionality of OLSR. In the Ad hoc network, the number of TC depends on the choice of MPR. In this paper, we propose a new cooperative MPR selection algorithm with the aim to reduce TC packets. We implemented this algorithm in NS2 and three other algorithms are known to be performant in the domain. Simulation results show that our algorithm reduces TC packets relative to other algorithms. This reduction is reflected positively on other performance parameters","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"167 1","pages":"125-133"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75383855","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-04-13DOI: 10.4304/jnw.10.3.159-163
Lin Li, Yi-na Deng, Yang Yuan, Wenjiang Feng
To address the secondary users channel selection issue in cognitive radio network, a novel channel selection strategy is proposed. Four typical channel selection models under auction mechanism, machine learning scheme, channel prediction scheme and optimization scheme are compared and analyzed. Based on the optimization theory, the selfish channel selection algorithm and the cooperative channel selection algorithm are proposed in view of the heterogeneity of the channel. The selfish algorithm selects the channel which provides the maximum transmission rate for the secondary users (SU), while the cooperative algorithm selects the channel that benefits overall system throughput. Simulations compare proposed algorithms with random channel selection algorithm, and suggest proposed algorithms outperform random channel selection algorithm in terms of system average throughput, channel utilization, average handoff time and average transmission time.
{"title":"Research on Channel Selection Algorithms in Cognitive Radio Networks","authors":"Lin Li, Yi-na Deng, Yang Yuan, Wenjiang Feng","doi":"10.4304/jnw.10.3.159-163","DOIUrl":"https://doi.org/10.4304/jnw.10.3.159-163","url":null,"abstract":"To address the secondary users channel selection issue in cognitive radio network, a novel channel selection strategy is proposed. Four typical channel selection models under auction mechanism, machine learning scheme, channel prediction scheme and optimization scheme are compared and analyzed. Based on the optimization theory, the selfish channel selection algorithm and the cooperative channel selection algorithm are proposed in view of the heterogeneity of the channel. The selfish algorithm selects the channel which provides the maximum transmission rate for the secondary users (SU), while the cooperative algorithm selects the channel that benefits overall system throughput. Simulations compare proposed algorithms with random channel selection algorithm, and suggest proposed algorithms outperform random channel selection algorithm in terms of system average throughput, channel utilization, average handoff time and average transmission time.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"52 2","pages":"159-163"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91499844","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-04-13DOI: 10.4304/jnw.10.3.164-171
Farhan Siddiqui, S. Zeadally, K. Salah
The ever-growing proliferation of wireless devices and concurrent deployments of bandwidth intensive applications has been having a significant impact on user experience in high-density wireless areas. IEEE 802.11ac is a recently ratified Wireless Local Area Network (WLAN) standard that promises to improve wireless user experience by delivering gigabit speed to end-user applications. 802.11ac utilizes new technologies such as Channel Bonding, Beamforming, and Multi-User Multiple-Input Multiple-Output (MU-MIMO) to improve wireless performance. This article reviews recent technological advances made in the field of WLANs and then focuses on the recent IEEE 802.11ac standard. We present actual data rates attained by currently available 802.11ac hardware, and we also discuss foreseen technical challenges that still need to be addressed to enable efficient and seamless gigabit wireless networking
{"title":"Gigabit Wireless Networking with IEEE 802.11ac: Technical Overview and Challenges","authors":"Farhan Siddiqui, S. Zeadally, K. Salah","doi":"10.4304/jnw.10.3.164-171","DOIUrl":"https://doi.org/10.4304/jnw.10.3.164-171","url":null,"abstract":"The ever-growing proliferation of wireless devices and concurrent deployments of bandwidth intensive applications has been having a significant impact on user experience in high-density wireless areas. IEEE 802.11ac is a recently ratified Wireless Local Area Network (WLAN) standard that promises to improve wireless user experience by delivering gigabit speed to end-user applications. 802.11ac utilizes new technologies such as Channel Bonding, Beamforming, and Multi-User Multiple-Input Multiple-Output (MU-MIMO) to improve wireless performance. This article reviews recent technological advances made in the field of WLANs and then focuses on the recent IEEE 802.11ac standard. We present actual data rates attained by currently available 802.11ac hardware, and we also discuss foreseen technical challenges that still need to be addressed to enable efficient and seamless gigabit wireless networking","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"3 1","pages":"164-171"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87089770","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-04-13DOI: 10.4304/jnw.10.3.134-140
Yuanqing Qin, Fang Wang, Chunjie Zhou
The location of people, mobile terminals and equipment is highly desirable for operational enhancements in the mining industry. In an indoor environment such as a mine, the multipath caused by reflection, diffraction and diffusion on the rough sidewall surfaces are the main sources of range measurement errors. In this paper, a UWB time of flight based localization system is proposed to address the multipath effect in underground mines. To reduce the communication cost and time delay of localization in such a chain type wireless network, a distributed localization algorithm based on particle swarm optimization (PSO) is proposed and implemented on the blind node (the node to be localized). Without extra hardware needed, an accurate but low cost localization system has been achieved. Experimental results verify the proposed scheme
{"title":"A Distributed UWB-based Localization System in Underground Mines","authors":"Yuanqing Qin, Fang Wang, Chunjie Zhou","doi":"10.4304/jnw.10.3.134-140","DOIUrl":"https://doi.org/10.4304/jnw.10.3.134-140","url":null,"abstract":"The location of people, mobile terminals and equipment is highly desirable for operational enhancements in the mining industry. In an indoor environment such as a mine, the multipath caused by reflection, diffraction and diffusion on the rough sidewall surfaces are the main sources of range measurement errors. In this paper, a UWB time of flight based localization system is proposed to address the multipath effect in underground mines. To reduce the communication cost and time delay of localization in such a chain type wireless network, a distributed localization algorithm based on particle swarm optimization (PSO) is proposed and implemented on the blind node (the node to be localized). Without extra hardware needed, an accurate but low cost localization system has been achieved. Experimental results verify the proposed scheme","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"29 1","pages":"134-140"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83398765","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
扫码关注我们
求助内容：
应助结果提醒方式：