Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413639
Y. Reddy, D. Krishnaswamy, B. S. Manoj
Software-defined networking (SDN) is evolving to be one of the most important technologies for managing networks efficiently with minimum complexity. SDN achieves flexible routing by decoupling control and data planes. The control-plane populates forwarding devices with flow tables which contain actions to forward packets. OpenFlow is a standard protocol which enables the communication between the control-plane and the data-plane. Communications between a controller and a switch in Software-defined Wireless Networks are prone to failure. In this regard, a distributed control plane can be worth considering. In addition, since a controller possesses limited packet processing capabilities, we need to have an efficient solution for switch handover. In this work, we have studied the issues associated with OpenFlow wireless networks and have proposed a cross-layer handover solution for efficient switch handover. Our Cross-Layer OpenFlow Switch handover utilizes the RSSI of wireless links and the traffic load of Controllers for effective handover decision-making. We have further enhanced our cross-layer switch handover with a soft handover capability in order to avoid the packet drops due to hard handover. We have developed a test-bed for OpenFlow Wireless networks for evaluating the performance of our handover strategies. On an average, the packet drops observed were 10 and 8 during high traffic load and moderate traffic load, respectively, in Cross-Layer OpenFlow Switch handovers. Additionally, the soft handover extension eliminated the packet drops during switch handovers. The time taken for the switch handover is measured to be around 4.92 ms.
{"title":"Cross-layer switch handover in Software defined Wireless Networks","authors":"Y. Reddy, D. Krishnaswamy, B. S. Manoj","doi":"10.1109/ANTS.2015.7413639","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413639","url":null,"abstract":"Software-defined networking (SDN) is evolving to be one of the most important technologies for managing networks efficiently with minimum complexity. SDN achieves flexible routing by decoupling control and data planes. The control-plane populates forwarding devices with flow tables which contain actions to forward packets. OpenFlow is a standard protocol which enables the communication between the control-plane and the data-plane. Communications between a controller and a switch in Software-defined Wireless Networks are prone to failure. In this regard, a distributed control plane can be worth considering. In addition, since a controller possesses limited packet processing capabilities, we need to have an efficient solution for switch handover. In this work, we have studied the issues associated with OpenFlow wireless networks and have proposed a cross-layer handover solution for efficient switch handover. Our Cross-Layer OpenFlow Switch handover utilizes the RSSI of wireless links and the traffic load of Controllers for effective handover decision-making. We have further enhanced our cross-layer switch handover with a soft handover capability in order to avoid the packet drops due to hard handover. We have developed a test-bed for OpenFlow Wireless networks for evaluating the performance of our handover strategies. On an average, the packet drops observed were 10 and 8 during high traffic load and moderate traffic load, respectively, in Cross-Layer OpenFlow Switch handovers. Additionally, the soft handover extension eliminated the packet drops during switch handovers. The time taken for the switch handover is measured to be around 4.92 ms.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129833027","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}
Online social media websites like Twitter has become one of the most popular platforms for people to obtain or spread information. However, in absence of any moderation and use of crowd sourcing, there is no guarantee that the information shared is credible or not. This makes online social media highly susceptible to the spread of rumors. As part of our work, we investigate in retrospect a dataset on which rumor detection was done in the past in 2009 and perform machine learning algorithms like k-nearest neighbor and naive bayes classifier to detect tweets spreading rumors. We present the results of our retrospective analysis and extraction of user attributes. An algorithm for preprocessing on tweet content is proposed to retain key information to be passed on to learning algorithm to obtain improved results as far as rumor detection accuracy is concerned.
{"title":"Rumor detection in twitter: An analysis in retrospect","authors":"Raveena Dayani, Nikita Chhabra, Taruna Kadian, Rishabh Kaushal","doi":"10.1109/ANTS.2015.7413660","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413660","url":null,"abstract":"Online social media websites like Twitter has become one of the most popular platforms for people to obtain or spread information. However, in absence of any moderation and use of crowd sourcing, there is no guarantee that the information shared is credible or not. This makes online social media highly susceptible to the spread of rumors. As part of our work, we investigate in retrospect a dataset on which rumor detection was done in the past in 2009 and perform machine learning algorithms like k-nearest neighbor and naive bayes classifier to detect tweets spreading rumors. We present the results of our retrospective analysis and extraction of user attributes. An algorithm for preprocessing on tweet content is proposed to retain key information to be passed on to learning algorithm to obtain improved results as far as rumor detection accuracy is concerned.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127764140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413651
Biplab K. Sen, Sunirmal Khatua, R. Das
Nowadays Sensor-cloud has received a lot of interests among researchers in the field of Wireless Sensor Networks (WSN) as well as Cloud Computing. An integral part of the Sensor Cloud platform is the Collaboration of WSN providers which improves the utilization of sensor resources. The physical sensors in such a collaborative environment are shared among multiple applications from different administrative domains. In this paper, we propose a Sensor Cloud Architecture which allows the users to deploy their sensor applications on-demand within the collaborative platform. The sensor resources used by the application are provided as a service to the user. The cost for offering such service depends on the number of physical sensors selected for covering the targets (locations of interest) for that application as well as connecting the selected physical sensors to the base station. In this paper, we proposed a two phase algorithm for this problem. In the first phase (Coverage), an Integer Programming Problem(IPP) is used to find a minimum set of sensors to cover the targets. In the next phase (Connectivity) a heuristic is used to extend the set such that connectivity of all the selected sensors is ensured. The performance of the proposed approach is validated through simulation which shows significant improvement of using collaboration over multiple non-collaborative WSNs. We also establish the superiority of the heuristic for ensuring connectivity over one such algorithm in the literature.
{"title":"Target coverage using a collaborative platform for sensor cloud","authors":"Biplab K. Sen, Sunirmal Khatua, R. Das","doi":"10.1109/ANTS.2015.7413651","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413651","url":null,"abstract":"Nowadays Sensor-cloud has received a lot of interests among researchers in the field of Wireless Sensor Networks (WSN) as well as Cloud Computing. An integral part of the Sensor Cloud platform is the Collaboration of WSN providers which improves the utilization of sensor resources. The physical sensors in such a collaborative environment are shared among multiple applications from different administrative domains. In this paper, we propose a Sensor Cloud Architecture which allows the users to deploy their sensor applications on-demand within the collaborative platform. The sensor resources used by the application are provided as a service to the user. The cost for offering such service depends on the number of physical sensors selected for covering the targets (locations of interest) for that application as well as connecting the selected physical sensors to the base station. In this paper, we proposed a two phase algorithm for this problem. In the first phase (Coverage), an Integer Programming Problem(IPP) is used to find a minimum set of sensors to cover the targets. In the next phase (Connectivity) a heuristic is used to extend the set such that connectivity of all the selected sensors is ensured. The performance of the proposed approach is validated through simulation which shows significant improvement of using collaboration over multiple non-collaborative WSNs. We also establish the superiority of the heuristic for ensuring connectivity over one such algorithm in the literature.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"62 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116816457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413665
A. Bhowmick, Sanjay Dhar Roy, S. Kundu
In this paper the performance of a cognitive radio (CR)network is investigated under harvesting of energy from combined RF signal and ambient sources, i.e., non-RF signal. The CR harvests energy from ambient sources as well as from primary user (PU) signal depending on the sensing decision. The quality of service (QoS) of PU is protected in terms of collision probability. The performance has been investigated in terms of harvested energy, throughput and harvested energy left for next detection cycle with respect to different sensing parameters such as sensing channel SNR, collision probability and sensing time etc. A Novel analytical expressions of harvested energy and throughput are developed under such scenario.
{"title":"Performance of secondary user with combined RF and non-RF based energy-harvesting in cognitive radio network","authors":"A. Bhowmick, Sanjay Dhar Roy, S. Kundu","doi":"10.1109/ANTS.2015.7413665","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413665","url":null,"abstract":"In this paper the performance of a cognitive radio (CR)network is investigated under harvesting of energy from combined RF signal and ambient sources, i.e., non-RF signal. The CR harvests energy from ambient sources as well as from primary user (PU) signal depending on the sensing decision. The quality of service (QoS) of PU is protected in terms of collision probability. The performance has been investigated in terms of harvested energy, throughput and harvested energy left for next detection cycle with respect to different sensing parameters such as sensing channel SNR, collision probability and sensing time etc. A Novel analytical expressions of harvested energy and throughput are developed under such scenario.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115777612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413629
D. Saha, Avirup Das
Given a random deployment of heterogeneous mobile nodes having different sensing ranges, this paper addresses the problem of covering a region using minimum number of nodes with minimum displacement. We propose an energy-efficient and light-weight self-organized distributed greedy heuristic to maximize area coverage such that the amount of computation, rounds of communication, and the distance traversed by a node, can be reduced utilizing minimal number of nodes. Extensive simulation studies on random deployment of nodes with sufficient node density over a 2-D area, show that our proposed technique results hole free area coverage with small number of nodes with minimum possible displacement, both in turn help to prolong the network lifetime.
{"title":"Coverage area maximization by heterogeneous sensor nodes with minimum displacement in mobile networks","authors":"D. Saha, Avirup Das","doi":"10.1109/ANTS.2015.7413629","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413629","url":null,"abstract":"Given a random deployment of heterogeneous mobile nodes having different sensing ranges, this paper addresses the problem of covering a region using minimum number of nodes with minimum displacement. We propose an energy-efficient and light-weight self-organized distributed greedy heuristic to maximize area coverage such that the amount of computation, rounds of communication, and the distance traversed by a node, can be reduced utilizing minimal number of nodes. Extensive simulation studies on random deployment of nodes with sufficient node density over a 2-D area, show that our proposed technique results hole free area coverage with small number of nodes with minimum possible displacement, both in turn help to prolong the network lifetime.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125670031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413631
R. Naumann, S. Dietzel, B. Scheuermann
As smart factory trends gain momentum, there is a growing need for robust information transmission protocols that make available sensor information gathered by individual machines and enable their algorithmic exploitation. Wireless transmission enables often-called-for flexibility, yet it poses challenges for reliable and timely transmission of information. This paper proposes a wireless transmission scheme for sensor information of production cycles in industrial environments. We include a preview functionality based on a discrete cosine transform that allows for rapid detection of problematic characteristics. The transmitted information's precision is improved using incremental updates as wireless capacity permits. Further, we include compact meta data that allows receivers to bound the received information's error. Evaluation results show that, even with high packet loss, characteristic features of sensor information are available early, and that error bounds closely follow the actual error.
{"title":"INFLATE: Incremental wireless transmission for sensor information in industrial environments","authors":"R. Naumann, S. Dietzel, B. Scheuermann","doi":"10.1109/ANTS.2015.7413631","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413631","url":null,"abstract":"As smart factory trends gain momentum, there is a growing need for robust information transmission protocols that make available sensor information gathered by individual machines and enable their algorithmic exploitation. Wireless transmission enables often-called-for flexibility, yet it poses challenges for reliable and timely transmission of information. This paper proposes a wireless transmission scheme for sensor information of production cycles in industrial environments. We include a preview functionality based on a discrete cosine transform that allows for rapid detection of problematic characteristics. The transmitted information's precision is improved using incremental updates as wireless capacity permits. Further, we include compact meta data that allows receivers to bound the received information's error. Evaluation results show that, even with high packet loss, characteristic features of sensor information are available early, and that error bounds closely follow the actual error.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127048809","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413655
A. Banerjee, M. Gavrilas, G. Grigoraș, Samiran Chattopadhyay
Reliability Redundancy Allocation Problem (RRAP) in Wireless Sensor Network (WSN) system is obviously an important problem. The basic function of WSN system is to provide surveillance data transmission over a specified area maintaining minimum power consumption (minimum cost), occupying minimum volume and weight of system components with a reasonable level of reliability. In this paper, a decision making assessment of reliability of Redundancy Allocation Problem (RAP) is proposed using fuzzy approach. The fuzzy approach incurs the virtue of uncertainty in account to make the approach more practical. Triangular Fuzzy membership function is introduced to produce fuzzy number set as input variables (cost, weight and volume) to a hybrid optimization algorithm. The hybrid meta-heuristic algorithm aiming for reliability optimization in RAP of system components of WSN is discussed. This algorithm is based on a new hybrid algorithm using Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). The fuzzy results obtained are used to exhibit decision making matrix to enhance decidability property of WSN. Finally after defuzzification crisp data are obtained and compared with other approaches from literature and found satisfactory.
{"title":"Decision making in assessment of RRAP of WSN using fuzzy-hybrid approach","authors":"A. Banerjee, M. Gavrilas, G. Grigoraș, Samiran Chattopadhyay","doi":"10.1109/ANTS.2015.7413655","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413655","url":null,"abstract":"Reliability Redundancy Allocation Problem (RRAP) in Wireless Sensor Network (WSN) system is obviously an important problem. The basic function of WSN system is to provide surveillance data transmission over a specified area maintaining minimum power consumption (minimum cost), occupying minimum volume and weight of system components with a reasonable level of reliability. In this paper, a decision making assessment of reliability of Redundancy Allocation Problem (RAP) is proposed using fuzzy approach. The fuzzy approach incurs the virtue of uncertainty in account to make the approach more practical. Triangular Fuzzy membership function is introduced to produce fuzzy number set as input variables (cost, weight and volume) to a hybrid optimization algorithm. The hybrid meta-heuristic algorithm aiming for reliability optimization in RAP of system components of WSN is discussed. This algorithm is based on a new hybrid algorithm using Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). The fuzzy results obtained are used to exhibit decision making matrix to enhance decidability property of WSN. Finally after defuzzification crisp data are obtained and compared with other approaches from literature and found satisfactory.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132506861","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413662
Rajiv Kumar, P. Chołda
A framework for the continuous delivery of mission-critical network services is proposed. The risk involved is assessed in a binary way, i.e., there is no risk until the network system supports the services up to the intended duration; otherwise, the mission fails and this gives rise to failure impact. The proposed framework is used to allocate network resources.
{"title":"A framework for continuity of mission-critical network services","authors":"Rajiv Kumar, P. Chołda","doi":"10.1109/ANTS.2015.7413662","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413662","url":null,"abstract":"A framework for the continuous delivery of mission-critical network services is proposed. The risk involved is assessed in a binary way, i.e., there is no risk until the network system supports the services up to the intended duration; otherwise, the mission fails and this gives rise to failure impact. The proposed framework is used to allocate network resources.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116162178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413636
A. Kamal, M. M. Islam
For better protection of surreptitious information from the intruders, steganography is now a widely used technique for hiding information through bits embedding inside a picture, speech and other multimedia contents. Among many different steganography schemes, prediction errors based reversible data hiding methods are more effective for security reasons. Nevertheless such techniques presented so far can embed limited number of message bits in a cover media and thus limit the length of covert message to be sent through embedding. In this paper, the authors presented a novel embedding process, called double cycle embedding scheme, where embedding capacity is increased significantly by modifying the scheme of estimation of pixel values, the block-variance calculation technique, selecting two highest most peaks in the histogram regardless their positions and embedding twice in the same cover image. The scheme also modified the pixel-prediction technique for the better predictions and for generalization of block-sizes in the cover image to increase the robustness of the policy. The experimental results demonstrate that the proposed scheme dictates other competing schemes with an embedding gain of 40%~700% depending on the cover image. The experimental results also demonstrate that the scheme exhibits stronger resistance against several statistical attacks, e.g. Benford generalized laws, SPAM features.
{"title":"Capacity improvement of reversible data hiding scheme through better prediction and double cycle embedding process","authors":"A. Kamal, M. M. Islam","doi":"10.1109/ANTS.2015.7413636","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413636","url":null,"abstract":"For better protection of surreptitious information from the intruders, steganography is now a widely used technique for hiding information through bits embedding inside a picture, speech and other multimedia contents. Among many different steganography schemes, prediction errors based reversible data hiding methods are more effective for security reasons. Nevertheless such techniques presented so far can embed limited number of message bits in a cover media and thus limit the length of covert message to be sent through embedding. In this paper, the authors presented a novel embedding process, called double cycle embedding scheme, where embedding capacity is increased significantly by modifying the scheme of estimation of pixel values, the block-variance calculation technique, selecting two highest most peaks in the histogram regardless their positions and embedding twice in the same cover image. The scheme also modified the pixel-prediction technique for the better predictions and for generalization of block-sizes in the cover image to increase the robustness of the policy. The experimental results demonstrate that the proposed scheme dictates other competing schemes with an embedding gain of 40%~700% depending on the cover image. The experimental results also demonstrate that the scheme exhibits stronger resistance against several statistical attacks, e.g. Benford generalized laws, SPAM features.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"366 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122852840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413661
Nikhil Tripathi, N. Hubballi
Dynamic Host Configuration Protocol (DHCP) starvation is an insider attack which prevents legitimate DHCP clients from acquiring network configuration parameters from DHCP server. The classical methods of creating starvation attack has a practical difficulty in wireless networks where an Access Point (AP) mandates a client to associate with unique MAC address before it can transmit such requests. This limits the effectiveness of starvation in wireless networks. In this paper, we describe a new method of creating starvation which is effective in both wired and wireless networks. This new method exploits a precautionary probing done by a DHCP server as described in RFC 2131. This probing verifies the to be offered IP address for accidental usage by other clients in the network. We show that a malicious insider can just send spoofed replies to these probes to create the effect of starvation in both wired and wireless networks.
{"title":"Exploiting DHCP server-side IP address conflict detection: A DHCP starvation attack","authors":"Nikhil Tripathi, N. Hubballi","doi":"10.1109/ANTS.2015.7413661","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413661","url":null,"abstract":"Dynamic Host Configuration Protocol (DHCP) starvation is an insider attack which prevents legitimate DHCP clients from acquiring network configuration parameters from DHCP server. The classical methods of creating starvation attack has a practical difficulty in wireless networks where an Access Point (AP) mandates a client to associate with unique MAC address before it can transmit such requests. This limits the effectiveness of starvation in wireless networks. In this paper, we describe a new method of creating starvation which is effective in both wired and wireless networks. This new method exploits a precautionary probing done by a DHCP server as described in RFC 2131. This probing verifies the to be offered IP address for accidental usage by other clients in the network. We show that a malicious insider can just send spoofed replies to these probes to create the effect of starvation in both wired and wireless networks.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116940320","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
扫码关注我们
求助内容：
应助结果提醒方式：