Pub Date : 2017-11-28DOI: 10.23919/PEMWN.2017.8308021
P. Mühlethaler, Younes Bouchaala, O. Shagdar, N. Achir
Maximizing the throughput of point-to-point communication has been the crux of wireless networks. In IEEE 802.11 networks, the first and prominent wireless technology, the model of point-to-point communication is still applicable today: the transmissions are between the wireless nodes and the access point, which usually serves as a gateway to the Internet. But this model is not well suited to more recent wireless systems such as Wireless Sensor Networks (WSNs) and Vehicular Ad Hoc NETworks (VANETs). In such networks, a very significant part of communication is between one node and its neighbors and simultaneous transmissions or, in other words spatial reuse, is required to insure good performance. When we consider communication from one node to its neighbor, an important metric is the density of successful simultaneous transmissions. Several studies such as [1], [2] have shown how this density of transmissions can be improved in Aloha or in CSMA networks. The aim of this paper is to show that the use of directional antennas can greatly improve the performance of the network in our neighbor-to-neighbor communication model because interference is greatly reduced. The model we build here allows a quantitative study of the performance and the improvement obtained with directional antennas to be be achieved. The study of Aloha (slotted and non-slotted) is very easy to accomplish and leads to closed formulas for the density of successful transmissions. The study of CSMA is more complex. We use a Matern selection process to mimic the behavior of CSMA in a random pattern of nodes distributed as a Poisson Point Process (PPP): each node receives a random mark and the nodes that have the smallest mark in their neighborhood are elected for transmission. Previous studies, such as [2], show that in CSMA networks, the density of successful transmissions is greatly influenced by the carrier sense detection threshold, which is one of the main parameters of CSMA. In this study we will assume that the carrier sense detection threshold is optimized to obtain the best performance of the CSMA network and our evaluations are performed under this condition. Our analytical models and our computation show that using directional antennas can lead to an improvement of up to more than 100% in the density of throughput compared to the normal use of unidirectional antennas.
{"title":"Evaluating the gain of directional antennas in linear VANETs using stochastic geometry","authors":"P. Mühlethaler, Younes Bouchaala, O. Shagdar, N. Achir","doi":"10.23919/PEMWN.2017.8308021","DOIUrl":"https://doi.org/10.23919/PEMWN.2017.8308021","url":null,"abstract":"Maximizing the throughput of point-to-point communication has been the crux of wireless networks. In IEEE 802.11 networks, the first and prominent wireless technology, the model of point-to-point communication is still applicable today: the transmissions are between the wireless nodes and the access point, which usually serves as a gateway to the Internet. But this model is not well suited to more recent wireless systems such as Wireless Sensor Networks (WSNs) and Vehicular Ad Hoc NETworks (VANETs). In such networks, a very significant part of communication is between one node and its neighbors and simultaneous transmissions or, in other words spatial reuse, is required to insure good performance. When we consider communication from one node to its neighbor, an important metric is the density of successful simultaneous transmissions. Several studies such as [1], [2] have shown how this density of transmissions can be improved in Aloha or in CSMA networks. The aim of this paper is to show that the use of directional antennas can greatly improve the performance of the network in our neighbor-to-neighbor communication model because interference is greatly reduced. The model we build here allows a quantitative study of the performance and the improvement obtained with directional antennas to be be achieved. The study of Aloha (slotted and non-slotted) is very easy to accomplish and leads to closed formulas for the density of successful transmissions. The study of CSMA is more complex. We use a Matern selection process to mimic the behavior of CSMA in a random pattern of nodes distributed as a Poisson Point Process (PPP): each node receives a random mark and the nodes that have the smallest mark in their neighborhood are elected for transmission. Previous studies, such as [2], show that in CSMA networks, the density of successful transmissions is greatly influenced by the carrier sense detection threshold, which is one of the main parameters of CSMA. In this study we will assume that the carrier sense detection threshold is optimized to obtain the best performance of the CSMA network and our evaluations are performed under this condition. Our analytical models and our computation show that using directional antennas can lead to an improvement of up to more than 100% in the density of throughput compared to the normal use of unidirectional antennas.","PeriodicalId":383978,"journal":{"name":"2017 International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125669964","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-11-28DOI: 10.23919/PEMWN.2017.8308028
Walid Khallef, M. Molnár, A. Benslimane, Sylvain Durand
Internet of Things is one of the most promising domain for developing new and smart applications. For some applications, Quality of Service requirement may be imposed. However, the things connected in this kind of networks are often vulnerable and dotted by limited energy (Low-power and Lossy Networks, LLNs). These networks need special solutions for routing and RPL is a standard IPv6 routing protocol to respond to needs. RPL build Destination Oriented Directed Acyclic Graphs (DODAGs) for routing. Recently, some propositions have been formulated to satisfy QoS requirements in LLNs using RPL even if there are several QoS constraints. A greedy DODAG construction has been proposed based on a Non-Linear Length which takes into account any number of constraints for QoS routing. However, it is known that the multi-constrained QoS routing is an NP-hard problem and its solution is not always a simple acyclic graph (not a tree). In this paper we present the computation of the exact solution in LLNs between a Border Router and the nodes respecting a set of QoS constraints. We propose the modification of RPL for this. Our analysis also covers a set of parameterized polynomial algorithms. We evaluate the performance of the proposed algorithms in term of execution time and scalability, the number of missing nodes during the construction of the DODAG and the quality of the paths from the Border Router to each node in the constructed DODAG.
物联网是开发新型智能应用最有前途的领域之一。对于某些申请，可能会施加服务质量要求。然而，在这种网络中连接的事物往往是脆弱的，并且点缀着有限的能量(Low-power and Lossy networks, lln)。这些网络需要特殊的路由解决方案，RPL是一种标准的IPv6路由协议来满足需求。RPL为路由构建了目标导向无环图(dodag)。近年来，人们提出了一些命题来满足使用RPL的lln中的QoS要求，即使存在一些QoS约束。提出了一种基于非线性长度的贪心DODAG结构，该结构考虑了任意数量的QoS路由约束。然而，众所周知，多约束QoS路由是一个np困难问题，其解决方案并不总是一个简单的无环图(不是树)。本文给出了边界路由器与一组QoS约束的节点之间lln的精确解的计算。为此，我们建议修改RPL。我们的分析还涵盖了一组参数化多项式算法。我们从执行时间和可扩展性、DODAG构建过程中缺失节点的数量以及从边界路由器到构建DODAG中每个节点的路径质量等方面评估了所提出算法的性能。
{"title":"On the QoS routing with RPL","authors":"Walid Khallef, M. Molnár, A. Benslimane, Sylvain Durand","doi":"10.23919/PEMWN.2017.8308028","DOIUrl":"https://doi.org/10.23919/PEMWN.2017.8308028","url":null,"abstract":"Internet of Things is one of the most promising domain for developing new and smart applications. For some applications, Quality of Service requirement may be imposed. However, the things connected in this kind of networks are often vulnerable and dotted by limited energy (Low-power and Lossy Networks, LLNs). These networks need special solutions for routing and RPL is a standard IPv6 routing protocol to respond to needs. RPL build Destination Oriented Directed Acyclic Graphs (DODAGs) for routing. Recently, some propositions have been formulated to satisfy QoS requirements in LLNs using RPL even if there are several QoS constraints. A greedy DODAG construction has been proposed based on a Non-Linear Length which takes into account any number of constraints for QoS routing. However, it is known that the multi-constrained QoS routing is an NP-hard problem and its solution is not always a simple acyclic graph (not a tree). In this paper we present the computation of the exact solution in LLNs between a Border Router and the nodes respecting a set of QoS constraints. We propose the modification of RPL for this. Our analysis also covers a set of parameterized polynomial algorithms. We evaluate the performance of the proposed algorithms in term of execution time and scalability, the number of missing nodes during the construction of the DODAG and the quality of the paths from the Border Router to each node in the constructed DODAG.","PeriodicalId":383978,"journal":{"name":"2017 International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132710597","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-11-28DOI: 10.23919/PEMWN.2017.8308027
Jinpeng Wang, G. Chalhoub, M. Misson
In recent years, Low Power and Lossy Networks (LLNs) have attracted the attention of researchers. They typically operate with strict resource constraints in communication, computation, memory, and energy. Routing Protocol for Low-Power and Lossy Networks (RPL) is an ad-hoc Distance Vector routing protocol for LLNs that adapts IPv6 and runs on top of IEEE 802.15.4 standard. Although RPL was originally designed for static topologies, for many applications mobility support has been a major requirement in LLNs. This paper focuses on addressing mobility support in RPL. We propose an enhancement based on signal strength monitoring and rank updating in order to improve the RPL performance in mobility scenarios where all nodes are moving. This enhancement helps RPL to better cope with mobility scenarios and to make faster decisions on updating next-hop neighbors. Moreover, we propose a dynamic management of control messages in order to reduce the overhead in the network. The simulation results show that our technique outperforms the standard RPL for different routing metrics.
近年来，低功耗和有损网络(LLNs)引起了研究人员的广泛关注。它们通常在通信、计算、内存和能源方面有严格的资源限制。低功耗损耗网络路由协议(Routing Protocol for Low-Power and Lossy Networks, RPL)是一种针对lln的自组织距离矢量路由协议，它适应IPv6，运行在IEEE 802.15.4标准之上。尽管RPL最初是为静态拓扑设计的，但对于许多应用程序来说，移动性支持已经成为lln中的主要需求。本文的重点是解决RPL中的移动性支持。我们提出了一种基于信号强度监测和等级更新的增强方法，以提高所有节点都在移动的移动场景下RPL的性能。这种增强有助于RPL更好地应对移动场景，并在更新下一跳邻居时更快地做出决策。此外，我们还提出了控制消息的动态管理，以减少网络开销。仿真结果表明，对于不同的路由度量，我们的技术优于标准RPL。
{"title":"Mobility support enhancement for RPL","authors":"Jinpeng Wang, G. Chalhoub, M. Misson","doi":"10.23919/PEMWN.2017.8308027","DOIUrl":"https://doi.org/10.23919/PEMWN.2017.8308027","url":null,"abstract":"In recent years, Low Power and Lossy Networks (LLNs) have attracted the attention of researchers. They typically operate with strict resource constraints in communication, computation, memory, and energy. Routing Protocol for Low-Power and Lossy Networks (RPL) is an ad-hoc Distance Vector routing protocol for LLNs that adapts IPv6 and runs on top of IEEE 802.15.4 standard. Although RPL was originally designed for static topologies, for many applications mobility support has been a major requirement in LLNs. This paper focuses on addressing mobility support in RPL. We propose an enhancement based on signal strength monitoring and rank updating in order to improve the RPL performance in mobility scenarios where all nodes are moving. This enhancement helps RPL to better cope with mobility scenarios and to make faster decisions on updating next-hop neighbors. Moreover, we propose a dynamic management of control messages in order to reduce the overhead in the network. The simulation results show that our technique outperforms the standard RPL for different routing metrics.","PeriodicalId":383978,"journal":{"name":"2017 International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115514580","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-11-01DOI: 10.23919/PEMWN.2017.8308020
Paul Farrow
There are a number of congestion control algorithms currently deployed and in use on the Internet today. These have a direct influence on streaming quality when delivering video content. The congestion algorithm determines how a stream behaves, such as how it reacts to congestion in the network, as well as influencing the maximum throughput that the stream is able to achieve. These are important metrics when discussing streaming video, as the streaming behaviour has a direct impact on the end user experience. An analysis on the state of TCP congestion control is presented, with the aim of highlighting conflicts that can occur in a heterogeneous congestion control environment. This includes some initial observations on the experimental congestion control algorithm, BBR, which is currently being developed by Google.
{"title":"Performance analysis of heterogeneous TCP congestion control environments","authors":"Paul Farrow","doi":"10.23919/PEMWN.2017.8308020","DOIUrl":"https://doi.org/10.23919/PEMWN.2017.8308020","url":null,"abstract":"There are a number of congestion control algorithms currently deployed and in use on the Internet today. These have a direct influence on streaming quality when delivering video content. The congestion algorithm determines how a stream behaves, such as how it reacts to congestion in the network, as well as influencing the maximum throughput that the stream is able to achieve. These are important metrics when discussing streaming video, as the streaming behaviour has a direct impact on the end user experience. An analysis on the state of TCP congestion control is presented, with the aim of highlighting conflicts that can occur in a heterogeneous congestion control environment. This includes some initial observations on the experimental congestion control algorithm, BBR, which is currently being developed by Google.","PeriodicalId":383978,"journal":{"name":"2017 International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124631500","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-11-01DOI: 10.23919/PEMWN.2017.8308024
Joshua Oladipo, M. D. Plessis, T. Gibbon
In this paper, we present a newly developed simulator based on the Omnet++ framework, for simulating Dense Wavelength Division Multiplexed, optical burst switched networks in the presence of optical impairments. The simulator is validated against a reduced link load model for optical burst switched networks, and simulations are performed in order to determine the effects of flexi-grid and impairments modelling on simulation results. We find that flexi-grid substantially reduces the burst loss probability on the simulated network, and that impairments modelling has a noticeable effect on simulation results, particularly in flexi-grid scenarios.
{"title":"Implementation and validation of an Omnet++ optical burst switching simulator","authors":"Joshua Oladipo, M. D. Plessis, T. Gibbon","doi":"10.23919/PEMWN.2017.8308024","DOIUrl":"https://doi.org/10.23919/PEMWN.2017.8308024","url":null,"abstract":"In this paper, we present a newly developed simulator based on the Omnet++ framework, for simulating Dense Wavelength Division Multiplexed, optical burst switched networks in the presence of optical impairments. The simulator is validated against a reduced link load model for optical burst switched networks, and simulations are performed in order to determine the effects of flexi-grid and impairments modelling on simulation results. We find that flexi-grid substantially reduces the burst loss probability on the simulated network, and that impairments modelling has a noticeable effect on simulation results, particularly in flexi-grid scenarios.","PeriodicalId":383978,"journal":{"name":"2017 International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114218991","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-11-01DOI: 10.23919/PEMWN.2017.8308035
K. M. Rahman, N. Hakem, B. Barua
This paper develops an efficient Self-Interference (SI) mitigation algorithm for Multiple-Input and Multiple-Output (MIMO) for Full-Duplex (FD) relays in the indoor wireless communication system. The relayed signal create an SI around the relay transceivers due to the loop-back (LI) signals. The main challenge of implementing FD-MIMO relay is to mitigate the performance degradation induced by the SI. This paper presents an efficient algorithm using Two Stage Projection Algorithm (TSPA) to reduce or remove the SI. The simulation results show that the proposed method minimize efficiently the SI.
{"title":"Self-interference mitigation in two-hop relay using two stage projection algorithms","authors":"K. M. Rahman, N. Hakem, B. Barua","doi":"10.23919/PEMWN.2017.8308035","DOIUrl":"https://doi.org/10.23919/PEMWN.2017.8308035","url":null,"abstract":"This paper develops an efficient Self-Interference (SI) mitigation algorithm for Multiple-Input and Multiple-Output (MIMO) for Full-Duplex (FD) relays in the indoor wireless communication system. The relayed signal create an SI around the relay transceivers due to the loop-back (LI) signals. The main challenge of implementing FD-MIMO relay is to mitigate the performance degradation induced by the SI. This paper presents an efficient algorithm using Two Stage Projection Algorithm (TSPA) to reduce or remove the SI. The simulation results show that the proposed method minimize efficiently the SI.","PeriodicalId":383978,"journal":{"name":"2017 International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131574069","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-11-01DOI: 10.23919/PEMWN.2017.8308032
D. Arivudainambi, S. Balaji, T. S. Poorani
Underwater wireless sensor network has fetched the attention of many researchers from the past few years due to its wide range of applications. To implement the UWSN in real-time, efficient techniques of deployment, scheduling, routing, and communication are required. But the research works in UWSN are relatively less when compared to conventional Terrestrial WSN. Hence a deterministic deployment strategy for deployment of sensors in a three-dimensional underwater environment with the intention of minimizing the energy consumption is proposed. The deployment of sensors is modeled as an optimization problem with the objective of maximizing the target coverage with a minimum number of sensors. In order to address the target coverage problem, a nature-inspired evolutionary algorithm called Cuckoo search algorithm is proposed to find the optimal locations of the sensors. The efficiency of the proposed algorithm is assessed in terms of coverage rate, by varying the number of targets, sensing range and number of sensors for both large-scale and small-scale networks and also compared with random deployment.
{"title":"Sensor deployment for target coverage in underwater wireless sensor network","authors":"D. Arivudainambi, S. Balaji, T. S. Poorani","doi":"10.23919/PEMWN.2017.8308032","DOIUrl":"https://doi.org/10.23919/PEMWN.2017.8308032","url":null,"abstract":"Underwater wireless sensor network has fetched the attention of many researchers from the past few years due to its wide range of applications. To implement the UWSN in real-time, efficient techniques of deployment, scheduling, routing, and communication are required. But the research works in UWSN are relatively less when compared to conventional Terrestrial WSN. Hence a deterministic deployment strategy for deployment of sensors in a three-dimensional underwater environment with the intention of minimizing the energy consumption is proposed. The deployment of sensors is modeled as an optimization problem with the objective of maximizing the target coverage with a minimum number of sensors. In order to address the target coverage problem, a nature-inspired evolutionary algorithm called Cuckoo search algorithm is proposed to find the optimal locations of the sensors. The efficiency of the proposed algorithm is assessed in terms of coverage rate, by varying the number of targets, sensing range and number of sensors for both large-scale and small-scale networks and also compared with random deployment.","PeriodicalId":383978,"journal":{"name":"2017 International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128730282","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-11-01DOI: 10.23919/PEMWN.2017.8308026
Mounir Tahar Abbes, Pr. Senouci Mohamed, Cherif Benharaoua, Amar Belhadia
In this paper, we present a technique for indoor localization that uses the results of the Trilateration method and RSSI signal strength to know what is expected in specific locations. Indoor positioning in systems confronts particular problems of precision. This study aims to implement a technical solution that can precisely and efficiently give the position of a target and facilitate the localization of mobile nodes deployed in a given zone. The main objective of this work is to estimate the position of the node with precision. This work was conducted on the basis of the combination of two concepts: trilateration method and RSSI measurement in different positions. The study of a set of simulations indicates that the estimation of the node position; using RSSI level; does not differ from mathematical calculations used by trilateration method. Besides; the network performance is not affected significantly. This is the major concern of our work; mainly in emergency situations; as it gives the right position of individuals to the rescuers.
{"title":"Positioning system for emergency situation based on RSSI measurements for WSN","authors":"Mounir Tahar Abbes, Pr. Senouci Mohamed, Cherif Benharaoua, Amar Belhadia","doi":"10.23919/PEMWN.2017.8308026","DOIUrl":"https://doi.org/10.23919/PEMWN.2017.8308026","url":null,"abstract":"In this paper, we present a technique for indoor localization that uses the results of the Trilateration method and RSSI signal strength to know what is expected in specific locations. Indoor positioning in systems confronts particular problems of precision. This study aims to implement a technical solution that can precisely and efficiently give the position of a target and facilitate the localization of mobile nodes deployed in a given zone. The main objective of this work is to estimate the position of the node with precision. This work was conducted on the basis of the combination of two concepts: trilateration method and RSSI measurement in different positions. The study of a set of simulations indicates that the estimation of the node position; using RSSI level; does not differ from mathematical calculations used by trilateration method. Besides; the network performance is not affected significantly. This is the major concern of our work; mainly in emergency situations; as it gives the right position of individuals to the rescuers.","PeriodicalId":383978,"journal":{"name":"2017 International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN)","volume":"47 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120925705","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-11-01DOI: 10.23919/PEMWN.2017.8308018
Konstantinos A. Lizos, S. A. El-atty
Motivated by the requirement to circumvent the scale and complexity of handling packet traffic flows, two computationally-wise scheduling schemes are investigated in this study. Those schedulers focus on recursive algorithmic structures to map delay and volume characteristics onto the allocation decision process. Particularly for context and location aware services highlighting machine-to-machine communication, we demonstrate that both schedulers promote fairness and efficiency in respect to mean packet service delay and packet loss, while maintaining a reduced complexity.
{"title":"Two recursive schedulers for the uplink of LTE/LTE-A networks: M2M case study","authors":"Konstantinos A. Lizos, S. A. El-atty","doi":"10.23919/PEMWN.2017.8308018","DOIUrl":"https://doi.org/10.23919/PEMWN.2017.8308018","url":null,"abstract":"Motivated by the requirement to circumvent the scale and complexity of handling packet traffic flows, two computationally-wise scheduling schemes are investigated in this study. Those schedulers focus on recursive algorithmic structures to map delay and volume characteristics onto the allocation decision process. Particularly for context and location aware services highlighting machine-to-machine communication, we demonstrate that both schedulers promote fairness and efficiency in respect to mean packet service delay and packet loss, while maintaining a reduced complexity.","PeriodicalId":383978,"journal":{"name":"2017 International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127499012","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-11-01DOI: 10.23919/PEMWN.2017.8308033
Minyoung Park, Hyoungwon Seo, Pyoung-soo Park, Young-sik Kim, Junho Jeong
Conventional cell radius of LTE system is limited up to 100 km. However, there has been needs for the longer coverage, especially in LTE maritime system for public safety. In this paper, we demonstrate the feasibility of an LTE maritime system with coverage ranging more than 100 km through experiments. The experiments were performed with multi-cell configuration, where one cell covers up to 100 km and another covers 80 km to 180 km. We also propose a simplified three-slope radio propagation model in ocean area with various base station antenna heights based on the measurement performed in the experiments.
{"title":"LTE maritime coverage solution and ocean propagation loss model","authors":"Minyoung Park, Hyoungwon Seo, Pyoung-soo Park, Young-sik Kim, Junho Jeong","doi":"10.23919/PEMWN.2017.8308033","DOIUrl":"https://doi.org/10.23919/PEMWN.2017.8308033","url":null,"abstract":"Conventional cell radius of LTE system is limited up to 100 km. However, there has been needs for the longer coverage, especially in LTE maritime system for public safety. In this paper, we demonstrate the feasibility of an LTE maritime system with coverage ranging more than 100 km through experiments. The experiments were performed with multi-cell configuration, where one cell covers up to 100 km and another covers 80 km to 180 km. We also propose a simplified three-slope radio propagation model in ocean area with various base station antenna heights based on the measurement performed in the experiments.","PeriodicalId":383978,"journal":{"name":"2017 International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130306819","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
扫码关注我们
求助内容：
应助结果提醒方式：