Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710144
Pimmy Gandotra, R. Jha
The most precious resource for the mobile network operators (MNOs) is the radio spectrum, cardinal for meeting the quality of service (QoS) requirements of the users. An integral technology of the budding fifth generation (5G) wireless communication networks (WCNs) is device-to-device (D2D) communication. To make use of the gains offered by D2D communication, optimal resource sharing with the cellular users in the network is necessitated. This paper proposes an adaptive resource block (RB) allocation scheme, using Hidden Markov Model (HMM), to assure adequate resource availability to each demanding D2D pair in the network. The adaptive allocation of resources improves the system throughput and energy efficiency (EE), meeting the QoS demands of the D2D pairs and fostering green communication. Since RB sharing is between pairs and cellular users, interference rises. The improvement in performance is achieved by sectoring the cellular coverage region, which diminishes the interference levels. The potency of the proposed adaptive scheme has been verified through simulations.
{"title":"Adaptive Resource Block Allocation for Green 5G Wireless Communication Networks","authors":"Pimmy Gandotra, R. Jha","doi":"10.1109/ANTS.2018.8710144","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710144","url":null,"abstract":"The most precious resource for the mobile network operators (MNOs) is the radio spectrum, cardinal for meeting the quality of service (QoS) requirements of the users. An integral technology of the budding fifth generation (5G) wireless communication networks (WCNs) is device-to-device (D2D) communication. To make use of the gains offered by D2D communication, optimal resource sharing with the cellular users in the network is necessitated. This paper proposes an adaptive resource block (RB) allocation scheme, using Hidden Markov Model (HMM), to assure adequate resource availability to each demanding D2D pair in the network. The adaptive allocation of resources improves the system throughput and energy efficiency (EE), meeting the QoS demands of the D2D pairs and fostering green communication. Since RB sharing is between pairs and cellular users, interference rises. The improvement in performance is achieved by sectoring the cellular coverage region, which diminishes the interference levels. The potency of the proposed adaptive scheme has been verified through simulations.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133040640","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710073
R. Sahay, G. Geethakumari, Barsha Mitra, V. Thejas
Low power and lossy network (LLN) comprising of constrained devices like sensors and RFIDs, is a major component in the Internet of Things (IoT) environment as these devices provide global connectivity to physical devices or “Things”. LLNs are tied to the Internet or any High Performance Computing environment via an adaptation layer called 6LoWPAN (IPv6 over Low power Personal Area Network). The routing protocol used by 6LoWPAN is RPL (IPv6 Routing Protocol over LLN). Like many other routing protocols, RPL is susceptible to blackhole attacks which cause topological isolation for a subset of nodes in the LLN. A malicious node instigating the blackhole attack drops received packets from nodes in its subtree which it is supposed to forward. Thus, the malicious node successfully isolates nodes in its subtree from the rest of the network. In this paper, we propose an algorithm based on the concept of exponential smoothing to detect the topological isolation of nodes due to blackhole attack. Exponential smoothing is a technique for smoothing time series data using the exponential window function and is used for short, medium and long term forecasting. In our proposed algorithm, exponential smoothing is used to estimate the next arrival time of packets at the sink node from every other node in the LLN. Using this estimation, the algorithm is designed to identify the malicious nodes instigating blackhole attack in real time.
低功耗和损耗网络(LLN)由传感器和rfid等受限设备组成，是物联网(IoT)环境中的主要组成部分，因为这些设备为物理设备或“事物”提供全球连接。lln通过一个称为6LoWPAN(低功耗个人局域网IPv6)的适配层绑定到互联网或任何高性能计算环境。6LoWPAN使用的路由协议是RPL (IPv6 routing protocol over LLN)。与许多其他路由协议一样，RPL容易受到黑洞攻击，从而导致LLN中一部分节点的拓扑隔离。发起黑洞攻击的恶意节点会丢弃从其子树节点接收到的数据包，而这些数据包本应转发。因此，恶意节点成功地将其子树中的节点与网络的其余部分隔离开来。在本文中，我们提出了一种基于指数平滑的算法来检测由于黑洞攻击而导致的节点拓扑隔离。指数平滑是一种利用指数窗口函数平滑时间序列数据的技术，用于短期、中期和长期预测。在我们提出的算法中，使用指数平滑来估计来自LLN中每个其他节点的数据包下一次到达汇聚节点的时间。利用这一估计，设计了实时识别引发黑洞攻击的恶意节点的算法。
{"title":"Exponential Smoothing based Approach for Detection of Blackhole Attacks in IoT","authors":"R. Sahay, G. Geethakumari, Barsha Mitra, V. Thejas","doi":"10.1109/ANTS.2018.8710073","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710073","url":null,"abstract":"Low power and lossy network (LLN) comprising of constrained devices like sensors and RFIDs, is a major component in the Internet of Things (IoT) environment as these devices provide global connectivity to physical devices or “Things”. LLNs are tied to the Internet or any High Performance Computing environment via an adaptation layer called 6LoWPAN (IPv6 over Low power Personal Area Network). The routing protocol used by 6LoWPAN is RPL (IPv6 Routing Protocol over LLN). Like many other routing protocols, RPL is susceptible to blackhole attacks which cause topological isolation for a subset of nodes in the LLN. A malicious node instigating the blackhole attack drops received packets from nodes in its subtree which it is supposed to forward. Thus, the malicious node successfully isolates nodes in its subtree from the rest of the network. In this paper, we propose an algorithm based on the concept of exponential smoothing to detect the topological isolation of nodes due to blackhole attack. Exponential smoothing is a technique for smoothing time series data using the exponential window function and is used for short, medium and long term forecasting. In our proposed algorithm, exponential smoothing is used to estimate the next arrival time of packets at the sink node from every other node in the LLN. Using this estimation, the algorithm is designed to identify the malicious nodes instigating blackhole attack in real time.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123526798","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710106
Shashwat Kumar, D. Vineeth, A. Franklin
Proliferation in mobile devices and the increase in video data consumption on these devices has led to an unprecedented surge of data usage in mobile networks. It is both challenging and expensive for network operators to scale up the network capacity and tackle this ever increasing data demand. Cellular network operators require alternative solutions, like in-network-caching, to solve this problem. Popular streaming services like YouTube use Dynamic Adaptive Streaming over HTTP (DASH) for video streaming where videos are divided into several small segments, and multiple bit-rate versions of each segment are stored in the server. Using store and forward caching method, in the network, may not help as the video segments cached in one session might not be usable for other users. This problem of unusability emerges as different users request different bit-rates of the same video segment. Also, it is not efficient to cache all versions of the video segments at the edge of the network, due to limited storage at the edge. In this paper, we propose a Multi-access Edge Computing (MEC) based video caching mechanism, where only the highest available bit-rate video is cached and by using the processing power available at the MEC it is transcoded to the requested lower bit-rate version. We develop a test-bed to evaluate the performance of the proposed caching mechanism in real time. Through various experimental results, we demonstrate that the proposed method reduces the backhaul traffic load and video load time and increases the cache hit-rate as compared to traditional store and forward caching mechanism.
{"title":"Edge Assisted DASH Video Caching Mechanism for Multi-access Edge Computing","authors":"Shashwat Kumar, D. Vineeth, A. Franklin","doi":"10.1109/ANTS.2018.8710106","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710106","url":null,"abstract":"Proliferation in mobile devices and the increase in video data consumption on these devices has led to an unprecedented surge of data usage in mobile networks. It is both challenging and expensive for network operators to scale up the network capacity and tackle this ever increasing data demand. Cellular network operators require alternative solutions, like in-network-caching, to solve this problem. Popular streaming services like YouTube use Dynamic Adaptive Streaming over HTTP (DASH) for video streaming where videos are divided into several small segments, and multiple bit-rate versions of each segment are stored in the server. Using store and forward caching method, in the network, may not help as the video segments cached in one session might not be usable for other users. This problem of unusability emerges as different users request different bit-rates of the same video segment. Also, it is not efficient to cache all versions of the video segments at the edge of the network, due to limited storage at the edge. In this paper, we propose a Multi-access Edge Computing (MEC) based video caching mechanism, where only the highest available bit-rate video is cached and by using the processing power available at the MEC it is transcoded to the requested lower bit-rate version. We develop a test-bed to evaluate the performance of the proposed caching mechanism in real time. Through various experimental results, we demonstrate that the proposed method reduces the backhaul traffic load and video load time and increases the cache hit-rate as compared to traditional store and forward caching mechanism.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114762380","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710070
Vibhum Singh, P. K. Upadhyay
In this paper, a cognitive hybrid satellite-terrestrial relay network with power splitting-based energy harvesting (EH) has been proposed. Herein, a primary satellite source coexists with a secondary transmitter-receiver pair on the ground and communicates with its terrestrial user by exploiting both direct and relay links. It is further assumed that secondary transmitter has the radio-frequency-based EH capability and harvests energy from the primary satellite’s signal. Hereby, it explores an opportunity for spectrum access through an amplify-and-forward based relay cooperation with the primary satellite network. We analyze the performance of the primary satellite network and secondary terrestrial network by adopting Shadowed-Rician fading for satellite links and Nakagami-m fading for terrestrial links by deriving their corresponding outage probability expressions. In addition, to get useful insights, expressions for throughput and energy efficiency of primary satellite network are provided assuming a delay-limited scenario. Moreover, our results elucidate the impact of power splitting factor and spectrum sharing factor on the system performance.
{"title":"Cognitive Hybrid Satellite-Terrestrial Relay Networks with Simultaneous Energy and Information Transmission","authors":"Vibhum Singh, P. K. Upadhyay","doi":"10.1109/ANTS.2018.8710070","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710070","url":null,"abstract":"In this paper, a cognitive hybrid satellite-terrestrial relay network with power splitting-based energy harvesting (EH) has been proposed. Herein, a primary satellite source coexists with a secondary transmitter-receiver pair on the ground and communicates with its terrestrial user by exploiting both direct and relay links. It is further assumed that secondary transmitter has the radio-frequency-based EH capability and harvests energy from the primary satellite’s signal. Hereby, it explores an opportunity for spectrum access through an amplify-and-forward based relay cooperation with the primary satellite network. We analyze the performance of the primary satellite network and secondary terrestrial network by adopting Shadowed-Rician fading for satellite links and Nakagami-m fading for terrestrial links by deriving their corresponding outage probability expressions. In addition, to get useful insights, expressions for throughput and energy efficiency of primary satellite network are provided assuming a delay-limited scenario. Moreover, our results elucidate the impact of power splitting factor and spectrum sharing factor on the system performance.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125218530","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710042
Monika Bansal, Apurva Gupta
In this paper, an extension of Precision Time Protocol (PTP) to enable energy-efficient clock synchronization between the nodes within Wireless Sensor Network (WSN) is proposed. PTP is nanosecond accuracy clock synchronization protocol in which nodes are organized in master-slave hierarchy on the basis of clock accuracy by means of Best Master Clock (BMC) algorithm. The algorithm considers clock accuracy to select best clock in the system. A novel modification of IEEE 1588 BMC algorithm for energy-constraint multi-hop WSN has been proposed to reduce clock convergence time and energy needed by considering out-degree of clocks without sacrificing synchronization accuracy. The new algorithm results in energy efficient clock synchronization that makes it most appropriate for low-power multi-hop wireless sensor networks. We present NS-3 simulation data that confirms the effectiveness of work.
{"title":"Out-Degree Based Clock Synchronization In Wireless Networks Using Precision Time Protocol","authors":"Monika Bansal, Apurva Gupta","doi":"10.1109/ANTS.2018.8710042","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710042","url":null,"abstract":"In this paper, an extension of Precision Time Protocol (PTP) to enable energy-efficient clock synchronization between the nodes within Wireless Sensor Network (WSN) is proposed. PTP is nanosecond accuracy clock synchronization protocol in which nodes are organized in master-slave hierarchy on the basis of clock accuracy by means of Best Master Clock (BMC) algorithm. The algorithm considers clock accuracy to select best clock in the system. A novel modification of IEEE 1588 BMC algorithm for energy-constraint multi-hop WSN has been proposed to reduce clock convergence time and energy needed by considering out-degree of clocks without sacrificing synchronization accuracy. The new algorithm results in energy efficient clock synchronization that makes it most appropriate for low-power multi-hop wireless sensor networks. We present NS-3 simulation data that confirms the effectiveness of work.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133606523","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710109
M. M. J. Chowdhury, Sadman Hoque Sadi, S. R. Sabuj
Presently there is a globally growing demand across all industries for small and portable electronic devices which feature Internet connectivity. This is largely due to their ease of use provided by robust interoperability and feasibility in almost any scenario. An example of such devices are the sensors used in a wireless sensor network (WSN) where prolonged battery life is a major challenge. This paper presents energy efficiency optimization techniques to reduce transmission power and further validate our findings through the use of single and double-slope modeling in MATLAB. In the simulations multiple aspects have been studied such as the connection quality, energy efficiency and optimal power with respect to distance and transmission power. The results have shown that the proposed optimization technique provides improvement to existing WSN technology (e.g. a 38.9% reduction in optimal power usage at the same pathloss distance).
{"title":"An Analytical Study of Single and Two-slope Model in Wireless Sensor Networks","authors":"M. M. J. Chowdhury, Sadman Hoque Sadi, S. R. Sabuj","doi":"10.1109/ANTS.2018.8710109","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710109","url":null,"abstract":"Presently there is a globally growing demand across all industries for small and portable electronic devices which feature Internet connectivity. This is largely due to their ease of use provided by robust interoperability and feasibility in almost any scenario. An example of such devices are the sensors used in a wireless sensor network (WSN) where prolonged battery life is a major challenge. This paper presents energy efficiency optimization techniques to reduce transmission power and further validate our findings through the use of single and double-slope modeling in MATLAB. In the simulations multiple aspects have been studied such as the connection quality, energy efficiency and optimal power with respect to distance and transmission power. The results have shown that the proposed optimization technique provides improvement to existing WSN technology (e.g. a 38.9% reduction in optimal power usage at the same pathloss distance).","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128186359","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710054
V. Rohit, Aashish Kumar, V. Ravichandran, S. Sudhakar, S. Udupa
The CCSDS standard for CDMA services between Data Relay (GEO) and LEO satellites can optionally be used by a member agency for direct-to-earth link. In the return services related to Non-coherent mode of this standard, the possible modulation for DG1 Mode 2 is SS-BPSK and length of each code is 2047 bits.In this paper, we explain a method which deals with derivation of a code set with truncated lengths from a code set of standard length (2047 bits), for suitability to hardware realization. The degradation in the cross correlation property of the codes caused due to truncation is mitigated by our method of optimizing on the cross correlation protection achieved through computer search for appropriate codes from this derived code set.
{"title":"Selection of truncated codes for implementation of Telemetry CDMA in Satellites","authors":"V. Rohit, Aashish Kumar, V. Ravichandran, S. Sudhakar, S. Udupa","doi":"10.1109/ANTS.2018.8710054","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710054","url":null,"abstract":"The CCSDS standard for CDMA services between Data Relay (GEO) and LEO satellites can optionally be used by a member agency for direct-to-earth link. In the return services related to Non-coherent mode of this standard, the possible modulation for DG1 Mode 2 is SS-BPSK and length of each code is 2047 bits.In this paper, we explain a method which deals with derivation of a code set with truncated lengths from a code set of standard length (2047 bits), for suitability to hardware realization. The degradation in the cross correlation property of the codes caused due to truncation is mitigated by our method of optimizing on the cross correlation protection achieved through computer search for appropriate codes from this derived code set.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"355 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132725829","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710050
Saumya Bhadauria, A. Bohra
Routing in Vehicular Ad-hoc Networks (VANETs) is a complex task due to high mobility. In such cases, short lived routes need to be established, without any prior knowledge about the network topology. Approaching routing for the unpredictable traffic conditions of unplanned cities requires quick node discovery and validation. Moreover, geographic routing gives faster relay selection. The proposed approach includes these two features along with a circular search ensuring wider coverage. Proper radio propagation model with more than two rays need to be implemented for an irregular terrain and to limit the losses due to different elevation of roads. Data redundancy plays a vital role in reducing the losses that might be caused due to misbehaving nodes or failure of a node.
{"title":"Secure Hierarchical VANETs","authors":"Saumya Bhadauria, A. Bohra","doi":"10.1109/ANTS.2018.8710050","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710050","url":null,"abstract":"Routing in Vehicular Ad-hoc Networks (VANETs) is a complex task due to high mobility. In such cases, short lived routes need to be established, without any prior knowledge about the network topology. Approaching routing for the unpredictable traffic conditions of unplanned cities requires quick node discovery and validation. Moreover, geographic routing gives faster relay selection. The proposed approach includes these two features along with a circular search ensuring wider coverage. Proper radio propagation model with more than two rays need to be implemented for an irregular terrain and to limit the losses due to different elevation of roads. Data redundancy plays a vital role in reducing the losses that might be caused due to misbehaving nodes or failure of a node.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128757629","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710095
S. Saurabh, Rishabh Rustogi
Ad-hoc Networks, which are based on wireless medium, are susceptible to various kinds of security threats. One such threat is the jamming attack where the attacker jams the wireless medium using high energy signals. This leads to the disruption in communication. This attack falls under the category of Denial of Service (DoS) attack. For military and disaster management services, where continuous and reliable communication is of utmost importance, this attack poses a serious threat. A potential solution to this problem is to use the automated jammed area mapping schemes, which can identify the jammed region and report it to the concerned authorities for taking required action. There exists a few jammed area mapping protocols, however they suffer from hurdles like extensive flooding, wasted bandwidth and low accuracy-rate. These schemes are based on receiving replies from the nodes located in the jammed region where the probability of sending and receiving messages is quite low. In this paper, we propose an algorithm which can locate the the jammed region without needing to rely on receiving messages from any jammed node. Our algorithm traces the boundary nodes with high accuracy in less amount of time. We performed the simulation of our algorithms using NS3 and observed an accuracy of around 95%, false-positive rate of 4.6% and zero false-negative in identifying the boundary nodes.
基于无线介质的自组织网络容易受到各种安全威胁。其中一种威胁是干扰攻击，攻击者使用高能信号阻塞无线媒体。这就导致了沟通的中断。这种攻击属于DoS (Denial of Service)攻击。对于军事和灾害管理服务来说，持续可靠的通信是至关重要的，这种攻击构成了严重威胁。这个问题的一个潜在解决方案是使用自动阻塞区域制图方案，它可以识别阻塞区域并将其报告给有关当局，以便采取所需的行动。目前存在一些拥堵区域测绘协议，但它们都面临着诸如广泛的洪水、带宽浪费和低准确率等障碍。这些方案是基于接收来自位于阻塞区域的节点的应答，该区域发送和接收消息的概率很低。在本文中，我们提出了一种不依赖于接收来自任何阻塞节点的消息来定位阻塞区域的算法。该算法在较短的时间内以较高的精度跟踪边界节点。我们使用NS3对我们的算法进行了仿真，在识别边界节点时，准确率约为95%，假阳性率为4.6%，假阴性为零。
{"title":"Tracing Jammed Area in Wireless Ad-hoc Network using Boundary Node Detection","authors":"S. Saurabh, Rishabh Rustogi","doi":"10.1109/ANTS.2018.8710095","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710095","url":null,"abstract":"Ad-hoc Networks, which are based on wireless medium, are susceptible to various kinds of security threats. One such threat is the jamming attack where the attacker jams the wireless medium using high energy signals. This leads to the disruption in communication. This attack falls under the category of Denial of Service (DoS) attack. For military and disaster management services, where continuous and reliable communication is of utmost importance, this attack poses a serious threat. A potential solution to this problem is to use the automated jammed area mapping schemes, which can identify the jammed region and report it to the concerned authorities for taking required action. There exists a few jammed area mapping protocols, however they suffer from hurdles like extensive flooding, wasted bandwidth and low accuracy-rate. These schemes are based on receiving replies from the nodes located in the jammed region where the probability of sending and receiving messages is quite low. In this paper, we propose an algorithm which can locate the the jammed region without needing to rely on receiving messages from any jammed node. Our algorithm traces the boundary nodes with high accuracy in less amount of time. We performed the simulation of our algorithms using NS3 and observed an accuracy of around 95%, false-positive rate of 4.6% and zero false-negative in identifying the boundary nodes.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128507797","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 : 2018-12-01DOI: 10.1109/ants.2018.8710085
{"title":"ANTS 2018 Message from TCP Co-Chairs","authors":"","doi":"10.1109/ants.2018.8710085","DOIUrl":"https://doi.org/10.1109/ants.2018.8710085","url":null,"abstract":"","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129308124","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
扫码关注我们
求助内容：
应助结果提醒方式：