Pub Date : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342841
R. Lent
The use of anycast routing in challenged networks, which include space networks, can help to alleviate the performance impact of the intermittent network connectivity and large communication delays that characterize such operational environments. With the anycast service, each data bundle can be delivered to any member of the anycast group and by establishing an adequate routing mechanism, bundles can be directed toward the member offering the lowest end-to-end delivery time. This possibility is explored in this study through a design extension to the Cognitive Space Gateway (CSG) approach to DTN routing. The advantage of the proposed method is that it adaptively determines the path for each bundle considering the estimated network congestion, which allows dynamically deciding the (near) optimal member as the destination node. The process allows for low bundle response times and high throughput. Testbed experiments are reported which confirm the performance advantages of the proposed method over unicast routing.
{"title":"An Anycast Service with Cognitive DTN Routing","authors":"R. Lent","doi":"10.1109/ANTS50601.2020.9342841","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342841","url":null,"abstract":"The use of anycast routing in challenged networks, which include space networks, can help to alleviate the performance impact of the intermittent network connectivity and large communication delays that characterize such operational environments. With the anycast service, each data bundle can be delivered to any member of the anycast group and by establishing an adequate routing mechanism, bundles can be directed toward the member offering the lowest end-to-end delivery time. This possibility is explored in this study through a design extension to the Cognitive Space Gateway (CSG) approach to DTN routing. The advantage of the proposed method is that it adaptively determines the path for each bundle considering the estimated network congestion, which allows dynamically deciding the (near) optimal member as the destination node. The process allows for low bundle response times and high throughput. Testbed experiments are reported which confirm the performance advantages of the proposed method over unicast routing.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133743910","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 : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342803
S. B. Chetty, H. Ahmadi, A. Nag
With the emergence of various types of applications such as delay-sensitive applications, future communication networks are expected to be increasingly complex and dynamic. Network Function Virtualization (NFV) provides the necessary support towards efficient management of such complex networks, by disintegrating the dependency on the hardware devices via virtualizing the network functions and placing them on shared data centres. However, one of the main challenges of the NFV paradigm is the resource allocation problem which is known as NFV-Resource Allocation (NFV-RA). NFV-RA is a method of deploying software-based network functions on the substrate nodes, subject to the constraints imposed by the underlying infrastructure and the agreed Service Level Agreement (SLA). This work investigates the potential of Reinforcement Learning (RL) as a fast yet accurate means (as compared to integer linear programming) for deploying the softwarized network functions onto substrate networks under several Quality of Service (QoS) constraints. In addition to the regular resource constraints and latency constraints, we introduced the concept of a complete outage of certain nodes in the network. This outage can be either due to a disaster or unavailability of network topology information due to proprietary and ownership issues. We have analyzed the network performance on different network topologies, different capacities of the nodes and the links, and different degrees of the nodal outage. The computational time escalated with the increase in the network density to achieve the optimal solutions; this is because Q-Learning is an iterative process which results in a slow exploration. Our results also show that for certain topologies and a certain combination of resources, we can achieve between 7090% service acceptance rate even with a 40% nodal outage.
随着各种类型的应用，如延迟敏感应用的出现，未来的通信网络将越来越复杂和动态。网络功能虚拟化(Network Function Virtualization, NFV)通过虚拟化网络功能并将其放置在共享数据中心上，从而瓦解对硬件设备的依赖，从而为有效管理此类复杂网络提供了必要的支持。然而，NFV模式的主要挑战之一是资源分配问题，即NFV-资源分配(NFV- ra)。NFV-RA是一种在底层节点上部署基于软件的网络功能的方法，受底层基础设施和商定的服务水平协议(SLA)的约束。这项工作研究了强化学习(RL)作为一种快速而准确的方法(与整数线性规划相比)的潜力，用于在几种服务质量(QoS)约束下将软件网络功能部署到基板网络上。除了常规的资源约束和延迟约束之外，我们还引入了网络中某些节点完全中断的概念。这种中断可能是由于灾难或由于专有和所有权问题导致的网络拓扑信息不可用。我们分析了不同网络拓扑结构下的网络性能、不同节点和链路的容量以及不同程度的节点中断。计算时间随着网络密度的增加而增加，以达到最优解;这是因为Q-Learning是一个迭代的过程，导致缓慢的探索。我们的结果还表明，对于某些拓扑和某些资源组合，即使在40%的节点中断情况下，我们也可以实现7090%之间的服务接受率。
{"title":"Virtual Network Function Embedding under Nodal Outage using Reinforcement Learning","authors":"S. B. Chetty, H. Ahmadi, A. Nag","doi":"10.1109/ANTS50601.2020.9342803","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342803","url":null,"abstract":"With the emergence of various types of applications such as delay-sensitive applications, future communication networks are expected to be increasingly complex and dynamic. Network Function Virtualization (NFV) provides the necessary support towards efficient management of such complex networks, by disintegrating the dependency on the hardware devices via virtualizing the network functions and placing them on shared data centres. However, one of the main challenges of the NFV paradigm is the resource allocation problem which is known as NFV-Resource Allocation (NFV-RA). NFV-RA is a method of deploying software-based network functions on the substrate nodes, subject to the constraints imposed by the underlying infrastructure and the agreed Service Level Agreement (SLA). This work investigates the potential of Reinforcement Learning (RL) as a fast yet accurate means (as compared to integer linear programming) for deploying the softwarized network functions onto substrate networks under several Quality of Service (QoS) constraints. In addition to the regular resource constraints and latency constraints, we introduced the concept of a complete outage of certain nodes in the network. This outage can be either due to a disaster or unavailability of network topology information due to proprietary and ownership issues. We have analyzed the network performance on different network topologies, different capacities of the nodes and the links, and different degrees of the nodal outage. The computational time escalated with the increase in the network density to achieve the optimal solutions; this is because Q-Learning is an iterative process which results in a slow exploration. Our results also show that for certain topologies and a certain combination of resources, we can achieve between 7090% service acceptance rate even with a 40% nodal outage.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124428968","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 : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342761
Purva Sharma, V. Bhatia, S. Prakash
In quantum key distribution (QKD)-secured optical networks, blocking increases with the number of QKD lightpath requests as well as with the number of times modification required to improve the security level of QKD lightpath requests. The blocking is severe problem in such networks because of the limited number of resources (wavelengths and time-slots) in each fiber link. In this paper, we propose a priority order-based routing wavelength and time-slot allocation (POB-RWTA) scheme to reduce the blocking of QKD lightpath requests. In the proposed POB-RWTA scheme, the QKD lightpath requests are served according to their priority order. The priority order of each QKD lightpath request is based on the security level. The blocking of high priority lightpath requests (HPLRs) and total incoming QKD lightpath requests due to limited resources can be reduced using the above criterion of priority order. The performance analysis of the proposed POB-RWTA scheme is made in terms of the success probability of QKD lightpath requests considering different wavelengths for QSCh and the probability of secret key update failure. We compared the proposed POB-RWTA scheme with a non-priority order-based routing wavelength and time-slot allocation (NPOB-RWTA) scheme. Simulations performed on NSFNET topology show that by using the POB-RWTA scheme, the success probability of HPLRs and total incoming QKD lightpath requests are significantly improved as compared to NPOB-RWTA.
{"title":"Priority Order-Based Key Distribution in QKD-Secured Optical Networks","authors":"Purva Sharma, V. Bhatia, S. Prakash","doi":"10.1109/ANTS50601.2020.9342761","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342761","url":null,"abstract":"In quantum key distribution (QKD)-secured optical networks, blocking increases with the number of QKD lightpath requests as well as with the number of times modification required to improve the security level of QKD lightpath requests. The blocking is severe problem in such networks because of the limited number of resources (wavelengths and time-slots) in each fiber link. In this paper, we propose a priority order-based routing wavelength and time-slot allocation (POB-RWTA) scheme to reduce the blocking of QKD lightpath requests. In the proposed POB-RWTA scheme, the QKD lightpath requests are served according to their priority order. The priority order of each QKD lightpath request is based on the security level. The blocking of high priority lightpath requests (HPLRs) and total incoming QKD lightpath requests due to limited resources can be reduced using the above criterion of priority order. The performance analysis of the proposed POB-RWTA scheme is made in terms of the success probability of QKD lightpath requests considering different wavelengths for QSCh and the probability of secret key update failure. We compared the proposed POB-RWTA scheme with a non-priority order-based routing wavelength and time-slot allocation (NPOB-RWTA) scheme. Simulations performed on NSFNET topology show that by using the POB-RWTA scheme, the success probability of HPLRs and total incoming QKD lightpath requests are significantly improved as compared to NPOB-RWTA.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116476817","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 : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342754
Abhay Deep Seth, S. Biswas, Amit Kumar Dhar
The IPv6 over Low-power Wireless Personal Area Network (6LoWPAN) supports IP over Lossy networks. RPL (Routing Protocol for Low-power and Lossy Networks) routing protocol has been developed for 6LoWPAN routing. RPL is vulnerable to various types of attacks namely external and internal. One of the internal attacks for the RPL-based IoT Network is Rank Attack. A spiteful node advertises false decreased rank information to disturb the topology of the network. This attack creates network disruption, loop formation, and degrades network performance in terms of packet delivery ratio, packet delay, and throughput. This paper proposes a novel mechanism to detect and verify the decreased rank attack and exclude the spiteful node from the network using the round trip time (RTT).
IPv6 over Low-power Wireless Personal Area Network (6LoWPAN)支持IP over Lossy网络。RPL (Routing Protocol for Low-power and Lossy Networks)路由协议是为6LoWPAN路由而开发的。RPL容易受到各种类型的攻击，包括外部攻击和内部攻击。基于rpl的物联网网络的内部攻击之一是秩攻击。恶意节点发布虚假的降级信息来扰乱网络的拓扑结构。这种攻击会造成网络中断、形成环路，并降低网络性能，包括数据包传送率、数据包延迟和吞吐量。本文提出了一种利用往返时间(RTT)检测和验证降秩攻击的新机制，并将恶意节点排除在网络之外。
{"title":"Detection and Verification of Decreased Rank Attack using Round-Trip Times in RPL-Based 6LoWPAN Networks","authors":"Abhay Deep Seth, S. Biswas, Amit Kumar Dhar","doi":"10.1109/ANTS50601.2020.9342754","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342754","url":null,"abstract":"The IPv6 over Low-power Wireless Personal Area Network (6LoWPAN) supports IP over Lossy networks. RPL (Routing Protocol for Low-power and Lossy Networks) routing protocol has been developed for 6LoWPAN routing. RPL is vulnerable to various types of attacks namely external and internal. One of the internal attacks for the RPL-based IoT Network is Rank Attack. A spiteful node advertises false decreased rank information to disturb the topology of the network. This attack creates network disruption, loop formation, and degrades network performance in terms of packet delivery ratio, packet delay, and throughput. This paper proposes a novel mechanism to detect and verify the decreased rank attack and exclude the spiteful node from the network using the round trip time (RTT).","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125321521","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 : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342776
A. Meena, N. Hubballi, Yogendra Singh, V. Bhatia, K. Franke
Network perimeter security appliances like firewalls, intrusion detection systems mediate communications and log details pertaining to various events. Logs generated by these systems are used to identify security compromises, vulnerable systems, mis-configurations, etc and serve as a valuable asset for a network administrator. In this paper, we report on a study conducted using logs generated by production level security appliances deployed in our university network. In particular, we process the logs generated by firewall, intrusion detection/prevention system and domain name system service to identify trends and gain insights. We process 71 million network connection records which includes 95.7 thousand alerts generated by an open source intrusion detection system collected over a period of 31 days and derive statistics to understand end host level behavioral trends. In our analysis we compare hosts which are known to be infected with malware or running Peer-to-Peer applications and remaining using a set of relevant parameters and identify clearly differentiated behavioral trends.
{"title":"Network Security Systems Log Analysis for Trends and Insights: A Case Study","authors":"A. Meena, N. Hubballi, Yogendra Singh, V. Bhatia, K. Franke","doi":"10.1109/ANTS50601.2020.9342776","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342776","url":null,"abstract":"Network perimeter security appliances like firewalls, intrusion detection systems mediate communications and log details pertaining to various events. Logs generated by these systems are used to identify security compromises, vulnerable systems, mis-configurations, etc and serve as a valuable asset for a network administrator. In this paper, we report on a study conducted using logs generated by production level security appliances deployed in our university network. In particular, we process the logs generated by firewall, intrusion detection/prevention system and domain name system service to identify trends and gain insights. We process 71 million network connection records which includes 95.7 thousand alerts generated by an open source intrusion detection system collected over a period of 31 days and derive statistics to understand end host level behavioral trends. In our analysis we compare hosts which are known to be infected with malware or running Peer-to-Peer applications and remaining using a set of relevant parameters and identify clearly differentiated behavioral trends.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126445143","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 : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342816
Yashita Goswami, Ankit Agrawal, Ashutosh Bhatia
E-governance, i.e., the use of information technology for government activities to provide services, exchange information, etc. are becoming increasingly popular. One such area of e-governance is e-tendering. While e-tendering makes the tendering process more efficient, a trust deficit remains between the citizens and the government, due to the centralized management of the whole tendering process. Several research works provide a decentralized solution to make the process of e-tendering more secure, transparent, and fair. However, in the present time, the government posts the problems/issues currently they are dealing with; and seems interested in taking the suggestions from the citizens to make the better solution for the problem. Thus, in this paper, a permissioned blockchain-based approach to provide a transparent and fair tendering system with citizens’ active participation and tracking of funds is presented. In the proposed scheme, the citizens can see the tendering activities transparently and give ideas and suggestions to solve the government’s posted problems and receive a due credit of that contribution is a fair manner.
{"title":"E-Governance: A Tendering Framework Using Blockchain With Active Participation of Citizens","authors":"Yashita Goswami, Ankit Agrawal, Ashutosh Bhatia","doi":"10.1109/ANTS50601.2020.9342816","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342816","url":null,"abstract":"E-governance, i.e., the use of information technology for government activities to provide services, exchange information, etc. are becoming increasingly popular. One such area of e-governance is e-tendering. While e-tendering makes the tendering process more efficient, a trust deficit remains between the citizens and the government, due to the centralized management of the whole tendering process. Several research works provide a decentralized solution to make the process of e-tendering more secure, transparent, and fair. However, in the present time, the government posts the problems/issues currently they are dealing with; and seems interested in taking the suggestions from the citizens to make the better solution for the problem. Thus, in this paper, a permissioned blockchain-based approach to provide a transparent and fair tendering system with citizens’ active participation and tracking of funds is presented. In the proposed scheme, the citizens can see the tendering activities transparently and give ideas and suggestions to solve the government’s posted problems and receive a due credit of that contribution is a fair manner.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121517190","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 : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342757
R. Mukhopadhyay, S. Neogy, Samiran Chattopadhyay
One of the primary challenges of relay assisted communications in ad hoc network and device-to-device (D2D) communications in cellular network is sustenance of QoS requirements of mobile users. This paper proposes a relay selection technique based on a greedy clustering scheme that takes relay load and willingness into consideration during relay selection. With a dynamic selection imperative in a mobile environment this technique aims at optimizing the number of selected relays of a node by monitoring the current status of the relays. We compare our proposed technique with the relay selection technique of optimized Link State Routing (RFC 7181) over two scenarios: the first in an ad hoc scenario with a collection of mobile nodes and the second in D2D communication over cellular scenario. Simulation results show an overall improvement in performance in terms of average network throughput, packet loss rate and end-to-end delay for our proposed technique.
{"title":"Dynamic Relay Selection using a Greedy Cluster Strategy","authors":"R. Mukhopadhyay, S. Neogy, Samiran Chattopadhyay","doi":"10.1109/ANTS50601.2020.9342757","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342757","url":null,"abstract":"One of the primary challenges of relay assisted communications in ad hoc network and device-to-device (D2D) communications in cellular network is sustenance of QoS requirements of mobile users. This paper proposes a relay selection technique based on a greedy clustering scheme that takes relay load and willingness into consideration during relay selection. With a dynamic selection imperative in a mobile environment this technique aims at optimizing the number of selected relays of a node by monitoring the current status of the relays. We compare our proposed technique with the relay selection technique of optimized Link State Routing (RFC 7181) over two scenarios: the first in an ad hoc scenario with a collection of mobile nodes and the second in D2D communication over cellular scenario. Simulation results show an overall improvement in performance in terms of average network throughput, packet loss rate and end-to-end delay for our proposed technique.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126262030","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 : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342809
A. Ibrahim, M. Darweesh, T. Ismail
This paper develops a lane-change geometric representation that can be used in an on-road vehicle. The design of the proposed system uses the data collected from active a host vehicle and measures the relative speed between host vehicle and obstacle vehicles in real-time. The available distance to the target lanes measures the separated distance between the host and obstacle vehicles in real-time. These data are generated automatically using a dynamic environment and updated using time and object dynamics laws. The main algorithm uses the data to test the availability of using lane-change while checking if there is a slight break applied not to waste the testing time of the testing, then the smart searching algorithm applies to find the most suitable solution to change the lane safely as fast as possible. The desired system has been achieved with accepted real-time results that exceed the standard driver response time. Also, full accepted safety results allow the vehicle to get out of the lane with particular speed and steering angles to avoid collisions and avoid crashes in the host vehicle.
{"title":"Real-Time Geometric Representation of Lane-Change Decision for Autonomous Vehicles Using Dynamic Optimization Algorithm","authors":"A. Ibrahim, M. Darweesh, T. Ismail","doi":"10.1109/ANTS50601.2020.9342809","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342809","url":null,"abstract":"This paper develops a lane-change geometric representation that can be used in an on-road vehicle. The design of the proposed system uses the data collected from active a host vehicle and measures the relative speed between host vehicle and obstacle vehicles in real-time. The available distance to the target lanes measures the separated distance between the host and obstacle vehicles in real-time. These data are generated automatically using a dynamic environment and updated using time and object dynamics laws. The main algorithm uses the data to test the availability of using lane-change while checking if there is a slight break applied not to waste the testing time of the testing, then the smart searching algorithm applies to find the most suitable solution to change the lane safely as fast as possible. The desired system has been achieved with accepted real-time results that exceed the standard driver response time. Also, full accepted safety results allow the vehicle to get out of the lane with particular speed and steering angles to avoid collisions and avoid crashes in the host vehicle.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"76 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121217683","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 : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342775
Christian Salim, N. Mitton
Nowadays, climate change is one of the numerous factors affecting the agricultural sector. Optimizing the usage of natural resources is one of the challenges this sector faces. For this reason, it could be necessary to locally monitor weather data and soil conditions to make faster and better decisions locally adapted to the crop. Wireless sensor networks (WSNs) can serve as a monitoring system for these types of parameters. However, in WSNs, sensor nodes suffer from limited energy resources. The process of sending a large amount of data from the nodes to the sink results in high energy consumption at the sensor node and significant use of network bandwidth, which reduces the lifetime of the overall network. In this paper, for data reduction, a data correlation and prediction technique is proposed both at the sensor node level and at the sink level. The aim of this approach is to reduce the amount of transmitted data to the sink, depending on the degree of correlation between different parameters. In this work we propose the Pearson Data Correlation and Prediction (PDCP) algorithm to detect this correlation. This data reduction maintains the accuracy of the information while reducing the amount of data sent from the nodes to the sink. This approach is validated through simulations on MATLAB using real meteorological data-sets from Weather-Underground sensor network. The results show the validity of our approach by reducing the amount of data by a percentage up to 69% while maintaining the accuracy of the information. The humidity values prediction based on the temperature parameter is accurate and the deviation from the real value does not surpass 7% of humidity.
{"title":"On-Node Correlation Based Data Reduction in WSN for Smart Agriculture","authors":"Christian Salim, N. Mitton","doi":"10.1109/ANTS50601.2020.9342775","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342775","url":null,"abstract":"Nowadays, climate change is one of the numerous factors affecting the agricultural sector. Optimizing the usage of natural resources is one of the challenges this sector faces. For this reason, it could be necessary to locally monitor weather data and soil conditions to make faster and better decisions locally adapted to the crop. Wireless sensor networks (WSNs) can serve as a monitoring system for these types of parameters. However, in WSNs, sensor nodes suffer from limited energy resources. The process of sending a large amount of data from the nodes to the sink results in high energy consumption at the sensor node and significant use of network bandwidth, which reduces the lifetime of the overall network. In this paper, for data reduction, a data correlation and prediction technique is proposed both at the sensor node level and at the sink level. The aim of this approach is to reduce the amount of transmitted data to the sink, depending on the degree of correlation between different parameters. In this work we propose the Pearson Data Correlation and Prediction (PDCP) algorithm to detect this correlation. This data reduction maintains the accuracy of the information while reducing the amount of data sent from the nodes to the sink. This approach is validated through simulations on MATLAB using real meteorological data-sets from Weather-Underground sensor network. The results show the validity of our approach by reducing the amount of data by a percentage up to 69% while maintaining the accuracy of the information. The humidity values prediction based on the temperature parameter is accurate and the deviation from the real value does not surpass 7% of humidity.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134328832","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 : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342837
S. Ananthakrishnan, M. Tahiliani, D. Tandur, H. Satheesh
Named Data Networking (NDN), an information centric network architecture, aims to provide an efficient and scalable alternative for content distribution. Modern Internet applications have more emphasis on data, and are less concerned about the location from where data is retrieved. NDN’s communication primitives being strictly pull based help in bringing this focus shift from location of data to the data itself. A concern for NDN is to enable the support of other popular communication primitives, such as the Publisher-Subscriber (Pub-Sub) model, seamlessly. The Pub-Sub model is well suited for applications that require periodic retrieval of data or event triggered data, such as in Industrial Automation Control Systems (IACS). This paper presents the design and development of a model to support the group based Pub-Sub communication primitives in ndnSIM, a popular ns-3 based network simulator for NDN. The functionality of the proposed model is tested by developing an end-to-end simulation environment in ndnSIM that is representative of the popular use cases of Pub-Sub communication primitives.
{"title":"Group based Publisher-Subscriber Communication Primitives for ndnSIM","authors":"S. Ananthakrishnan, M. Tahiliani, D. Tandur, H. Satheesh","doi":"10.1109/ANTS50601.2020.9342837","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342837","url":null,"abstract":"Named Data Networking (NDN), an information centric network architecture, aims to provide an efficient and scalable alternative for content distribution. Modern Internet applications have more emphasis on data, and are less concerned about the location from where data is retrieved. NDN’s communication primitives being strictly pull based help in bringing this focus shift from location of data to the data itself. A concern for NDN is to enable the support of other popular communication primitives, such as the Publisher-Subscriber (Pub-Sub) model, seamlessly. The Pub-Sub model is well suited for applications that require periodic retrieval of data or event triggered data, such as in Industrial Automation Control Systems (IACS). This paper presents the design and development of a model to support the group based Pub-Sub communication primitives in ndnSIM, a popular ns-3 based network simulator for NDN. The functionality of the proposed model is tested by developing an end-to-end simulation environment in ndnSIM that is representative of the popular use cases of Pub-Sub communication primitives.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115502296","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
扫码关注我们
求助内容：
应助结果提醒方式：