Design and Implementation of a Neighbor Discovery Framework Through Base Station Coordination for 5G D2D Communications Manoj Das, Keshav Parihar, Madhurima Buragohain, Sukumar Nandi IEEE Wireless Communications and Networking Conference Wcnc, 2024 With the rapid advancement in cellular communications, there has been significant growth in the number of connected devices like smartphones, tablets, and wearables. Device-to-Device (D2D) communication is one of the emerging technologies to support future generations of Cellular Networks. It improves throughput, energy efficiency and reduces delay by allowing proximal devices to communicate directly. Device discovery is the initial and one of the crucial phases to enable D2D communication. In order to have direct communication, the devices need to find other devices in their proximity. A network-assisted discovery mechanism relying on the serving Base Station (BS) provides incomplete neighborhood information, whereas discovery, if performed by the user equipment(UE)s themselves, increases the number of discovery message exchanges in the network. In this regard, we propose a robust D2D Discovery framework that leverages the collective knowledge of neighboring Base Stations to provide complete neighborhood information. We implement and evaluate our proposed framework on the D2D module of the NS3 simulator. We demonstrate the improvement in terms of the number of discovered UEs, reduction in number of missed UEs compared to existing network-assisted discovery mechanisms, and reduced number of discovery message exchanges compared to the state-of-the-art 3GPP standards.
Lpecn: Leveraging pit placement and explicit marking for congestion control in ndn Madhurima Buragohain, Sukumar Nandi Icn 2021 Proceedings of the 2021 8th ACM Conference on Information Centric Networking, 2021 Named Data Networking (NDN) is designed to address several limitations of the current Internet, such as inefficient content delivery, mobility and security. Pending Interest Table (PIT) is one of the fundamental building blocks in NDN. Its unique design contributes various advantages such as stateful forwarding plane, loop detection, similar request aggregation, multipath forwarding and multicast. However, PIT size may become a bottleneck in network performance in the presence of bursty traffic or unresponsive consumers. Therefore, we propose a congestion control scheme that leverages PIT placement and explicit congestion marking. We have used PIT per outgoing face placement to efficiently limit the Interest sending rate according to the available capacity of the link, which can avoid congestion in the reverse path. In addition that, we utilize Negative Acknowledgement and explicit congestion marking to efficiently detect and limit interests from non-responsive consumers. From the simulation result, we have shown that our proposed scheme can efficiently handle congestion even in the presence of non-responsive consumers.
SCAN: Smart Collaborative Attack in Named Data Networking Madhurima Buragohain, Chinmoy Jyoti Kathar, Chinmoy Kachari, Sunit Kumar Nandi, Sukumar Nandi Proceedings Conference on Local Computer Networks LCN, 2020 Named Data Networking is a promising Future Internet Architecture, where consumers fetch contents from the network using unique names. It has in-built security features like data integrity, and data origin authentication as contents are signed by the original producer. Though, NDN’s stateful forwarding plane helps to remove some of the existing DDoS attacks in the current IP architecture, still it can face one specific kind of attack called Interest flooding attack (IFA). In this paper, we focus on one variant of IFA where malicious consumers and malicious producers collaboratively launch an attack to degrade the QoS of legitimate consumers. Here we have shown how attackers can intelligently fix the Interest sending rate so that attack goes undetected easily. Simulation results demonstrate that with proper placement of malicious consumers and producers, the attackers can successfully launch the attack with moderate traffic and less number of malicious consumers.
EQPR: Enhancing QoS in Named Data Networking using Priority and RTT Driven PIT Replacement Policy Madhurima Buragohain, Prashant Gudipudi, Md. Zaki Anwer, Sukumar Nandi IEEE International Conference on Communications, 2019 Named Data Networking (NDN) is a newly-emerging future Internet Architecture which focuses on content rather than hosts. It changes the communication model from `delivering content to a specific host' to `fetching content by using names'. One of the major components in NDN is Pending Interest Table (PIT). Its unique design brings the following advantages in NDN: anonymity, loop-free forwarding, multipath delivery, and multicast. One of the key challenges in NDN is choosing the appropriate PIT size. Current NFD (NDN Forwarding Daemon) does not limit the PIT size. Over-allocation of the PIT does not help in improving network performance. So, PIT needs to have a limited size. However, under bursty traffic, the PIT may become full. In this paper, we present a novel PIT replacement policy called EQPR. It evicts the existing entry based on two factors: Priority and Estimated Round Trip Time (RTT), aiming towards achieving Quality of Service for the valuable users who pay an additional cost for better service. We evaluate EQPR using ndnSIM simulator and compare the results with basic NDN under moderate to high traffic. Simulation results show that EQPR maintains a similar overall satisfaction rate as Basic NDN and most importantly it provides 99.7% Interest satisfaction rate for valuable users.
PKSN: A pairing based key management scheme for heterogeneous sensor network Madhurima Buragohain, Nityananda Sarma 2018 10th International Conference on Communication Systems and Networks Comsnets 2018, 2018 The applications of wireless sensor network (WSN) such as military sensing and tracking, require highly secure communication. Here, owing to security requirement and resource constrained sensor nodes, we propose a novel key management scheme with the design objectives of i) minimizing computation overhead ii) minimizing communication overhead iii) mitigating the effect of node capture attack, and iv) protecting from known attacks like clone attack and replay attack. We have applied identity-based cryptography which makes use of bilinear pairing on elliptic curves. The security of the protocol has been proved using Strand Space model. Simulation results show that the proposed protocol offers better performance in terms of computation time as compared to the similar protocol in the literature.
