Visible to the public Biblio

Found 116 results

Filters: Keyword is Throughput  [Clear All Filters]
2021-11-08
Rao, G Balu Narasimha, Veeraiah, D, Rao, D Srinivasa.  2020.  Power and Trust Based Routing for MANET Using RRRP Algorithm. 2020 2nd International Conference on Innovative Mechanisms for Industry Applications (ICIMIA). :160–164.
In MANET's (MOBILE Adhoc Network), the origin node will communicate the target node with the help of in-between nodes by Multi-hop communication to save power [1]. Thus, the main objective in MANETs is to identify the feasible route such that the parcels of the data can be done in an organized manner. So, the nodes in the selected route are honest and reliable. However, bad behavior nodes may affect routing performance. This work aims to discover the route does not have egotistic nodes, i.e., nodes which having honest & energy are less not considered for the route between origin and target. The proposed procedure holds the input from the end-user and results in the boundary values i.e. avg. throughput, appropriateness and drop fraction of egotistic nodes were stored in a result location. After the simulation, the discovered route by using the proposed protocol improves the overall network performance for output parameters.
Sisodiya, Mraduraje, Dahima, Vartika, Joshi, Sunil.  2020.  Trust Based Mechanism Using Multicast Routing in RPL for the Internet of Things. 2020 12th International Conference on Computational Intelligence and Communication Networks (CICN). :392–397.
RPL, the IPv6 Routing Protocol for low-power and lossy networks, was standardized by the Internet Engineering Task Force (IETF) in 2011. It is developed to connect resource constrained devices enabled by low-power and lossy networks (LLNs). RPL prominently becomes the routing protocol for IoT. However, the RPL protocol is facing many challenges such as trustworthiness among the nodes which need to be addressed and resolved to make the network secure and efficient. In this paper, a multicasting technique is developed that is based on trust mechanism to resolve this issue. This mechanism manages and protects the network from untrusted nodes which can hamper the security and result in delayed and distorted transmission of data. It allows any node to decide whether to trust other nodes or not during the construction of the topology. This is then proved efficient by comparing it with broadcasting nature of the transmission among the nodes in terms of energy, throughput, percentage of alive and dead nodes.
Qaisar, Muhammad Umar Farooq, Wang, Xingfu, Hawbani, Ammar, Khan, Asad, Ahmed, Adeel, Wedaj, Fisseha Teju.  2020.  TORP: Load Balanced Reliable Opportunistic Routing for Asynchronous Wireless Sensor Networks. 2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom). :1384–1389.
Opportunistic routing (OR) is gaining popularity in low-duty wireless sensor network (WSN), so the need for efficient and reliable data transmission is becoming more essential. Reliable transmission is only feasible if the routing protocols are secure and efficient. Due to high energy consumption, current cryptographic schemes for WSN are not suitable. Trust-based OR will ensure security and reliability with fewer resources and minimum energy consumption. OR selects the set of potential candidates for each sensor node using a prioritized metric by load balancing among the nodes. This paper introduces a trust-based load-balanced OR for duty-cycled wireless sensor networks. The candidates are prioritized on the basis of a trusted OR metric that is divided into two parts. First, the OR metric is based on the average of four probability distributions: the distance from node to sink distribution, the expected number of hops distribution, the node degree distribution, and the residual energy distribution. Second, the trust metric is based on the average of two probability distributions: the direct trust distribution and the recommended trust distribution. Finally, the trusted OR metric is calculated by multiplying the average of two metrics distributions in order to direct more traffic through the higher priority nodes. The simulation results show that our proposed protocol provides a significant improvement in the performance of the network compared to the benchmarks in terms of energy consumption, end to end delay, throughput, and packet delivery ratio.
2021-10-12
El-Sobky, Mariam, Sarhan, Hisham, Abu-ElKheir, Mervat.  2020.  Security Assessment of the Contextual Multi-Armed Bandit - RL Algorithm for Link Adaptation. 2020 2nd Novel Intelligent and Leading Emerging Sciences Conference (NILES). :514–519.
Industry is increasingly adopting Reinforcement Learning algorithms (RL) in production without thoroughly analyzing their security features. In addition to the potential threats that may arise if the functionality of these algorithms is compromised while in operation. One of the well-known RL algorithms is the Contextual Multi-Armed Bandit (CMAB) algorithm. In this paper, we explore how the CMAB can be used to solve the Link Adaptation problem - a well-known problem in the telecommunication industry by learning the optimal transmission parameters that will maximize a communication link's throughput. We analyze the potential vulnerabilities of the algorithm and how they may adversely affect link parameters computation. Additionally, we present a provable security assessment for the Contextual Multi-Armed Bandit Reinforcement Learning (CMAB-RL) algorithm in a network simulated environment using Ray. This is by demonstrating CMAB security vulnerabilities theoretically and practically. Some security controls are proposed for CMAB agent and the surrounding environment. In order to fix those vulnerabilities and mitigate the risk. These controls can be applied to other RL agents in order to design more robust and secure RL agents.
2021-10-04
Madi, Nadim K. M., Madi, Mohammed.  2020.  Analysis of Downlink Scheduling to Bridge between Delay and Throughput in LTE Networks. 2020 7th International Conference on Electrical and Electronics Engineering (ICEEE). :243–247.
The steady growing trend of user demand in using various 4G mobile broadband applications obligates telecom operators to thoroughly plan a precise Quality of Service (QoS) contract with its subscribers. This directly reveals a challenge in figuring out a sophisticated behavior of radio resources (RBs) at the base station to effectively handle the oscillated loads to fulfill their QoS profiles. This paper elaborates on the above issue by analyzing the behavior of the downlink packet scheduling scheme and proposes a solution to bridge between the two major QoS indicators for Real-Time (RT) services, that are, throughput and delay. The proposed scheduling scheme emphasizes that a prior RBs planning indeed has an immense impact on the behavior of the deployed scheduling rule, particularly, when heterogeneous flows share the channel capacity. System-level simulations are performed to evaluate the proposed scheduling scheme in a comparative manner. The numerical results of throughput and delay assured that diverse QoS profiles can be satisfied in case of considering RBs planning.
2021-09-30
Gautam, Savita, Umar, M. Sarosh, Samad, Abdus.  2020.  Multi-Fold Scheduling Algorithm for Multi-Core Multi-Processor Systems. 2020 5th International Conference on Computing, Communication and Security (ICCCS). :1–5.
Adapting parallel scheduling function in the design of multi-scheduling algorithm results significant impact in the operation of high performance parallel systems. The various methods of parallelizing scheduling functions are widely applied in traditional multiprocessor systems. In this paper a novel algorithm is introduced which works not only for parallel execution of jobs but also focuses the parallelization of scheduling function. It gives attention on reducing the execution time, minimizing the load balance performance by selecting the volume of tasks for migration in terms of packets. Jobs are grouped into packets consisting of 2n jobs which are scheduled in parallel. Thus, an enhancement in the scheduling mechanism by packet formation is made to carry out high utilization of underlying architecture with increased throughput. The proposed method is assessed on a desktop computer equipped with multi-core processors in cube based multiprocessor systems. The algorithm is implemented with different configuration of multi-core systems. The simulation results indicate that the proposed technique reduces the overall makespan of execution with an improved performance of the system.
2021-09-21
Taranum, Fahmina, Sarvat, Ayesha, Ali, Nooria, Siddiqui, Shamekh.  2020.  Detection and Prevention of Blackhole Node. 2020 4th International Conference on Electronics, Materials Engineering Nano-Technology (IEMENTech). :1–7.
Mobile Adhoc networks (MANETs) comprises of mobile devices or nodes that are connected wirelessly and have no infrastructure. Detecting malicious activities in MANETs is a challenging task as they are vulnerable to attacks where the performance of the entire network degrades. Hence it is necessary to provide security to the network so that the nodes are prone to attack. Selecting a good routing protocol in MANET is also important as frequent change of topology causes the route reply to not arrive at the source node. In this paper, R-AODV (Reverse Adhoc On-Demand Distance Vector) protocol along with ECC (Elliptic Key Cryptography) algorithm is designed and implemented to detect and to prevent the malicious node and to secure data transmission against blackhole attack. The main objective is to keep the data packets secure. ECC provides a smaller key size compared to other public-key encryption and eliminates the requirement of pre-distributed keys also makes the path more secure against blackhole attacks in a MANET. The performance of this proposed system is simulated by using the NS-2.35 network simulator. Simulation results show that the proposed protocol provides good experimental results on various metrics like throughput, end-to-end delay, and PDR. Analysis of the results points to an improvement in the overall network performance.
2021-08-17
Primo, Abena.  2020.  A Comparison of Blockchain-Based Wireless Sensor Network Protocols. 2020 11th IEEE Annual Ubiquitous Computing, Electronics Mobile Communication Conference (UEMCON). :0793—0799.
Wireless sensors are often deployed in environments where it is difficult for them to discern friend from enemy. An example case is a military tactical scenario, where sensors are deployed to map the location of an item but where some of the nodes have been compromised or where there are other malicious nodes present. In this scenario, sharing data with other network nodes may present a critical security risk to the sensor nodes. Blockchain technology, with its ability to house a secure distributed ledger, offers a possible solution. However, blockchain applications for Wireless Sensor Networks suffer from poor latency in block propagation which in turn decreases throughput and network scalability. Several researchers have proposed solutions for improved network throughput. In this work, a comparison of these existing works is performed leading to a taxonomy of existing algorithms. Characteristics consistently found in algorithms reporting improved throughput are presented and, later, these characteristics are used in the development of a new algorithm for improving throughput. The proposed algorithm utilizes a proof-of- authority consensus algorithm with a node trust-based scheme. The proposed algorithm shows strong results over the base case algorithm and was evaluated with blockchain network simulations of up to 20000 nodes.
Zhang, Yu-Yan, Chen, Xing-Xing, Zhang, Xu.  2020.  PCHA: A Fast Packet Classification Algorithm For IPv6 Based On Hash And AVL Tree. 2020 IEEE 13th International Conference on Cloud Computing (CLOUD). :397–404.
As the core infrastructure of cloud data operation, exchange and storage, data centerneeds to ensure its security and reliability, which are the important prerequisites for the development of cloud computing. Due to various illegal accesses, attacks, viruses and other security threats, it is necessary to protect the boundary of cloud data center through security gateway. Since the traffic growing up to gigabyte level, the secure gateway must ensure high transmission efficiency and different network services to support the cloud services. In addition, data center is gradually evolving from IPv4 to IPv6 due to excessive consumption of IP addresses. Packet classification algorithm, which can divide packets into different specific streams, is very important for QoS, real-time data stream application and firewall. Therefore, it is necessary to design a high performance IPv6 packet classification algorithm suitable for security gateway.AsIPv6 has a128-bitIP address and a different packet structure compared with IPv4, the traditional IPv4 packet classification algorithm is not suitable properly for IPv6 situations. This paper proposes a fast packet classification algorithm for IPv6 - PCHA (packet classification based on hash andAdelson-Velsky-Landis Tree). It adopts the three flow classification fields of source IPaddress(SA), destination IPaddress(DA) and flow label(FL) in the IPv6 packet defined by RFC3697 to implement fast three-tuple matching of IPv6 packet. It is through hash matching of variable length IPv6 address and tree matching of shorter flow label. Analysis and testing show that the algorithm has a time complexity close to O(1) in the acceptable range of space complexity, which meets the requirements of fast classification of IPv6 packetsand can adapt well to the changes in the size of rule sets, supporting fast preprocessing of rule sets. Our algorithm supports the storage of 500,000 3-tuple rules on the gateway device and can maintain 75% of the performance of throughput for small packets of 78 bytes.
Abranches, Marcelo, Keller, Eric.  2020.  A Userspace Transport Stack Doesn't Have to Mean Losing Linux Processing. 2020 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN). :84—90.
While we cannot question the high performance capabilities of the kernel bypass approach in the network functions world, we recognize that the Linux kernel provides a rich ecosystem with an efficient resource management and an effective resource sharing ability that cannot be ignored. In this work we argue that by mixing kernel-bypass and in kernel processing can benefit applications and network function middleboxes. We leverage a high-performance user space TCP stack and recent additions to the Linux kernel to propose a hybrid approach (kernel-user space) to accelerate SDN/NFV deployments leveraging services of the reliable transport layer (i.e., stateful middleboxes, Layer 7 network functions and applications). Our results show that this approach enables highperformance, high CPU efficiency, and enhanced integration with the kernel ecosystem. We build our solution by extending mTCP which is the basis of some state-of-the-art L4-L7 NFV frameworks. By having more efficient CPU usage, NFV applications can have more CPU cycles available to run the network functions and applications logic. We show that for a CPU intense workload, mTCP/AF\_XDP can have up to 64% more throughput than the previous implementation. We also show that by receiving cooperation from the kernel, mTCP/AF\_XDP enables the creation of protection mechanisms for mTCP. We create a simulated DDoS attack and show that mTCP/AF\_XDP can maintain up to 287% more throughput than the unprotected system during the attack.
2021-08-11
Masuduzzaman, Md, Islam, Anik, Rahim, Tariq, Young Shin, Soo.  2020.  Blockchain-Assisted UAV-Employed Casualty Detection Scheme in Search and Rescue Mission in the Internet of Battlefield Things. 2020 International Conference on Information and Communication Technology Convergence (ICTC). :412–416.
As the unmanned aerial vehicle (UAV) can play a vital role to collect information remotely in a military battlefield, researchers have shown great interest to reveal the domain of internet of battlefield Things (IoBT). In a rescue mission on a battlefield, UAV can collect data from different regions to identify the casualty of a soldier. One of the major challenges in IoBT is to identify the soldier in a complex environment. Image processing algorithm can be helpful if proper methodology can be applied to identify the victims. However, due to the limited hardware resources of a UAV, processing task can be handover to the nearby edge computing server for offloading the task as every second is very crucial in a battlefield. Furthermore, to avoid any third-party interaction in the network and to store the data securely, blockchain can help to create a trusted network as it forms a distributed ledger among the participants. This paper proposes a UAV assisted casualty detection scheme based on image processing algorithm where data is protected using blockchain technology. Result analysis has been conducted to identify the victims on the battlefield successfully using image processing algorithm and network issues like throughput and delay has been analyzed in details using public-key cryptography.
2021-08-02
Fernandez, J., Allen, B., Thulasiraman, P., Bingham, B..  2020.  Performance Study of the Robot Operating System 2 with QoS and Cyber Security Settings. 2020 IEEE International Systems Conference (SysCon). :1—6.
Throughout the Department of Defense, there are ongoing efforts to increase cybersecurity and improve data transfer in unmanned robotic systems (UxS). This paper explores the performance of the Robot Operating System (ROS) 2, which is built with the Data Distribution Service (DDS) standard as a middleware. Based on how quality of service (QoS) parameters are defined in the robotic middleware interface, it is possible to implement strict delivery requirements to different nodes on a dynamic nodal network with multiple unmanned systems connected. Through this research, different scenarios with varying QoS settings were implemented and compared to baseline values to help illustrate the impact of latency and throughput on data flow. DDS security settings were also enabled to help understand the cost of overhead and performance when secured data is compared to plaintext baseline values. Our experiments were performed using a basic ROS 2 network consisting of two nodes (one publisher and one subscriber). Our experiments showed a measurable latency and throughput change between different QoS profiles and security settings. We analyze the trends and tradeoffs associated with varying QoS and security settings. This paper provides performance data points that can be used to help future researchers and developers make informative choices when using ROS 2 for UxS.
Sharma, Nisha, Sharma, Durga Prasad, Sharma, Manish.  2020.  Wormhole Formation and Simulation in Dynamic Source Routing Protocol using NS3. 2020 9th International Conference System Modeling and Advancement in Research Trends (SMART). :318–322.
Mobile Ad hoc networks (MANET) are becoming extremely popular because of the expedient features that also make them more exposed to various kinds of security attacks. The Wormhole attack is considered to be the most unsafe attack due to its unusual pattern of tunnel creation between two malevolent nodes. In it, one malevolent node attracts all the traffic towards the tunnel and forwards it to another malevolent node at the other end of the tunnel and replays them again in the network. Once the Wormhole tunnel is created it can launch different kind of other attacks such as routing attack, packet dropping, spoofing etc. In past few years a lot of research is done for securing routing protocols. Dynamic Source Routing (DSR) protocol is considered foremost MANET routing protocols. In this paper we are forming the wormhole tunnel in which malevolent nodes use different interfaces for communication in DSR protocol. NS3 simulator is being used for the analysis of the DSR routing protocol under the wormhole attack. This paper provides better understanding of the wormhole attack in DSR protocol which can benefit further research.
S, Kanthimathi, Prathuri, Jhansi Rani.  2020.  Classification of Misbehaving nodes in MANETS using Machine Learning Techniques. 2020 2nd PhD Colloquium on Ethically Driven Innovation and Technology for Society (PhD EDITS). :1–2.
Classification of Misbehaving Nodes in wireless mobile adhoc networks (MANET) by applying machine learning techniques is an attempt to enhance security by detecting the presence of malicious nodes. MANETs are prone to many security vulnerabilities due to its significant features. The paper compares two machine learning techniques namely Support Vector Machine (SVM) and Back Propagation Neural Network (BPNN) and finds out the best technique to detect the misbehaving nodes. This paper is simulated with an on-demand routing protocol in NS2.35 and the results can be compared using parameters like packet Delivery Ratio (PDR), End-To-End delay, Average Throughput.
Thapar, Shruti, Sharma, Sudhir Kumar.  2020.  Direct Trust-based Detection Algorithm for Preventing Jellyfish Attack in MANET. 2020 4th International Conference on Electronics, Communication and Aerospace Technology (ICECA). :749–753.
The dynamic and adaptable characteristics of mobile ad hoc networks have made it a significant field for deploying various applications in wireless sensor networks. Increasing popularity of the portable devices is the main reason for the development of mobile ad hoc networks. Furthermore, the network does not require a fixed architecture and it is easy to deploy. This type of network is highly vulnerable to cyber-attacks as the nodes communicate with each other through a Wireless medium. The most critical attack in ad hoc network is jellyfish attack. In this research we have proposed a Direct Trust-based Detection Algorithm to detect and prevent jellyfish attack in MANET.
2021-06-30
Gonçalves, Charles F., Menasche, Daniel S., Avritzer, Alberto, Antunes, Nuno, Vieira, Marco.  2020.  A Model-Based Approach to Anomaly Detection Trading Detection Time and False Alarm Rate. 2020 Mediterranean Communication and Computer Networking Conference (MedComNet). :1—8.
The complexity and ubiquity of modern computing systems is a fertile ground for anomalies, including security and privacy breaches. In this paper, we propose a new methodology that addresses the practical challenges to implement anomaly detection approaches. Specifically, it is challenging to define normal behavior comprehensively and to acquire data on anomalies in diverse cloud environments. To tackle those challenges, we focus on anomaly detection approaches based on system performance signatures. In particular, performance signatures have the potential of detecting zero-day attacks, as those approaches are based on detecting performance deviations and do not require detailed knowledge of attack history. The proposed methodology leverages an analytical performance model and experimentation, and allows to control the rate of false positives in a principled manner. The methodology is evaluated using the TPCx-V workload, which was profiled during a set of executions using resource exhaustion anomalies that emulate the effects of anomalies affecting system performance. The proposed approach was able to successfully detect the anomalies, with a low number of false positives (precision 90%-98%).
2021-06-01
Pandey, Pragya, Kaur, Inderjeet.  2020.  Improved MODLEACH with Effective Energy Utilization Technique for WSN. 2020 8th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO). :987—992.
Wireless sensor network (WSNs) formed from an enormous number of sensor hub with the capacity to detect and process information in the physical world in a convenient way. The sensor nodes contain a battery imperative, which point of confinement the system lifetime. Because of vitality limitations, the arrangement of WSNs will required development methods to keep up the system lifetime. The vitality productive steering is the need of the innovative WSN systems to build the process time of system. The WSN system is for the most part battery worked which should be ration as conceivable as to cause system to continue longer and more. WSN has developed as a significant figuring stage in the ongoing couple of years. WSN comprises of countless sensor points, which are worked by a little battery. The vitality of the battery worked nodes is the defenseless asset of the WSN, which is exhausted at a high rate when data is transmitted, because transmission vitality is subject to the separation of transmission. Sensor nodes can be sent in the cruel condition. When they are conveyed, it ends up difficult to supplant or energize its battery. Therefore, the battery intensity of sensor hub ought to be utilized proficiently. Many steering conventions have been proposed so far to boost the system lifetime and abatement the utilization vitality, the fundamental point of the sensor hubs is information correspondence, implies move of information packs from one hub to other inside the system. This correspondence is finished utilizing grouping and normal vitality of a hub. Each bunch chooses a pioneer called group head. The group heads CHs are chosen based by and large vitality and the likelihood. There are number of bunching conventions utilized for the group Head determination, the principle idea is the existence time of a system which relies on the normal vitality of the hub. In this work we proposed a model, which utilizes the leftover vitality for group head choice and LZW pressure Technique during the transmission of information bundles from CHs to base station. Work enhanced the throughput and life time of system and recoveries the vitality of hub during transmission and moves more information in less vitality utilization. The Proposed convention is called COMPRESSED MODLEACH.
2021-05-25
Karimov, Madjit, Tashev, Komil, Rustamova, Sanobar.  2020.  Application of the Aho-Corasick algorithm to create a network intrusion detection system. 2020 International Conference on Information Science and Communications Technologies (ICISCT). :1—5.
One of the main goals of studying pattern matching techniques is their significant role in real-world applications, such as the intrusion detection systems branch. The purpose of the network attack detection systems NIDS is to protect the infocommunication network from unauthorized access. This article provides an analysis of the exact match and fuzzy matching methods, and discusses a new implementation of the classic Aho-Korasik pattern matching algorithm at the hardware level. The proposed approach to the implementation of the Aho-Korasik algorithm can make it possible to ensure the efficient use of resources, such as memory and energy.
2021-04-08
Lin, X., Zhang, Z., Chen, M., Sun, Y., Li, Y., Liu, M., Wang, Y., Liu, M..  2020.  GDGCA: A Gene Driven Cache Scheduling Algorithm in Information-Centric Network. 2020 IEEE 3rd International Conference on Information Systems and Computer Aided Education (ICISCAE). :167–172.
The disadvantages and inextensibility of the traditional network require more novel thoughts for the future network architecture, as for ICN (Information-Centric Network), is an information centered and self-caching network, ICN is deeply rooted in the 5G era, of which concept is user-centered and content-centered. Although the ICN enables cache replacement of content, an information distribution scheduling algorithm is still needed to allocate resources properly due to its limited cache capacity. This paper starts with data popularity, information epilepsy and other data related attributes in the ICN environment. Then it analyzes the factors affecting the cache, proposes the concept and calculation method of Gene value. Since the ICN is still in a theoretical state, this paper describes an ICN scenario that is close to the reality and processes a greedy caching algorithm named GDGCA (Gene Driven Greedy Caching Algorithm). The GDGCA tries to design an optimal simulation model, which based on the thoughts of throughput balance and satisfaction degree (SSD), then compares with the regular distributed scheduling algorithm in related research fields, such as the QoE indexes and satisfaction degree under different Poisson data volumes and cycles, the final simulation results prove that GDGCA has better performance in cache scheduling of ICN edge router, especially with the aid of Information Gene value.
2021-03-29
Dorri, A., Jurdak, R..  2020.  Tree-Chain: A Fast Lightweight Consensus Algorithm for IoT Applications. 2020 IEEE 45th Conference on Local Computer Networks (LCN). :369–372.
Blockchain has received tremendous attention in non-monetary applications including the Internet of Things (IoT) due to its salient features including decentralization, security, auditability, and anonymity. Most conventional blockchains rely on computationally expensive validator selection and consensus algorithms, have limited throughput, and high transaction delays. In this paper, we propose tree-chain a scalable fast blockchain instantiation that introduces two levels of randomization among the validators: i) transaction level where the validator of each transaction is selected randomly based on the most significant characters of the hash function output (known as consensus code), and ii) blockchain level where validator is randomly allocated to a particular consensus code based on the hash of their public key. Tree-chain introduces parallel chain branches where each validator commits the corresponding transactions in a unique ledger.
Grochol, D., Sekanina, L..  2020.  Evolutionary Design of Hash Functions for IPv6 Network Flow Hashing. 2020 IEEE Congress on Evolutionary Computation (CEC). :1–8.
Fast and high-quality network flow hashing is an essential operation in many high-speed network systems such as network monitoring probes. We propose a multi-objective evolutionary design method capable of evolving hash functions for IPv4 and IPv6 flow hashing. Our approach combines Cartesian genetic programming (CGP) with Non-dominated sorting genetic algorithm II (NSGA-II) and aims to optimize not only the quality of hashing, but also the execution time of the hash function. The evolved hash functions are evaluated on real data sets collected in computer network and compared against other evolved and conventionally created hash functions.
2021-03-16
Netalkar, P. P., Maheshwari, S., Raychaudhuri, D..  2020.  Evaluation of Network Assisted Handoffs in Heterogeneous Networks. 2020 29th International Conference on Computer Communications and Networks (ICCCN). :1—9.

This paper describes a novel distributed mobility management (DMM) scheme for the "named-object" information centric network (ICN) architecture in which the routers forward data based on unique identifiers which are dynamically mapped to the current network addresses of a device. The work proposes and evaluates two specific handover schemes namely, hard handoff with rebinding and soft handoff with multihoming intended to provide seamless data transfer with improved throughput during handovers. The evaluation of the proposed handover schemes using system simulation along with proof-of-concept implementation in ORBIT testbed is described. The proposed handoff and scheduling throughput gains are 12.5% and 44% respectively over multiple interfaces when compared to traditional IP network with equal share split scheme. The handover performance with respect to RTT and throughput demonstrate the benefits of clean slate network architecture for beyond 5G networks.

2021-03-15
Thanuja, T. C., Daman, K. A., Patil, A. S..  2020.  Optimized Spectrum sensing Techniques for Enhanced Throughput in Cognitive Radio Network. 2020 International Conference on Emerging Smart Computing and Informatics (ESCI). :137–141.
The wireless communication is a backbone for a development of a nation. But spectrum is finite resource and issues like spectrum scarcity, loss of signal quality, transmission delay, raised in wireless communication system due to growth of wireless applications and exponentially increased number of users. Secondary use of a spectrum using Software Defined Radio (SDR) is one of the solutions which is also supported by TRAI. The spectrum sensing is key process in communication based on secondary use of spectrum. But energy consumption, added delay, primary users security are some threats in this system. Here in this paper we mainly focused on throughput optimization in secondary use of spectrum based on optimal sensing time and number of Secondary users during cooperative spectrum sensing in Cognitive radio networks.
2021-03-09
Venkataramana, B., Jadhav, A..  2020.  Performance Evaluation of Routing Protocols under Black Hole Attack in Cognitive Radio Mesh Network. 2020 International Conference on Emerging Smart Computing and Informatics (ESCI). :98–102.
Wireless technology is rapidly proliferating. Devices such as Laptops, PDAs and cell-phones gained a lot of importance due to the use of wireless technology. Nowadays there is also a huge demand for spectrum allocation and there is a need to utilize the maximum available spectrum in efficient manner. Cognitive Radio (CR) Network is one such intelligent radio network, designed to utilize the maximum licensed bandwidth to un-licensed users. Cognitive Radio has the capability to understand unused spectrum at a given time at a specific location. This capability helps to minimize the interference to the licensed users and improves the performance of the network. Routing protocol selection is one of the main strategies to design any wireless or wired networks. In Cognitive radio networks the selected routing protocol should be best in terms of establishing an efficient route, addressing challenges in network topology and should be able to reduce bandwidth consumption. Performance analysis of the protocols helps to select the best protocol in the network. Objective of this study is to evaluate performance of various cognitive radio network routing protocols like Spectrum Aware On Demand Routing Protocol (SORP), Spectrum Aware Mesh Routing in Cognitive Radio Networks (SAMER) and Dynamic Source Routing (DSR) with and without black hole attack using various performance parameters like Throughput, E2E delay and Packet delivery ratio with the help of NS2 simulator.
Oakley, I..  2020.  Solutions to Black Hole Attacks in MANETs. 2020 12th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP). :1–6.
Self-organising networks, such as mobile ad-hoc networks (MANETs), are growing more and more in importance each day. However, due to their nature and constraints MANETs are vulnerable to a wide array of attacks, such as black hole attacks. Furthermore, there are numerous routing protocols in use in MANETs, and what works for one might not for another. In this paper, we present a review of previous surveys of black hole attack solutions, followed by a collation of recently published papers categorised by original routing protocol and evaluated on a set of common metrics. Finally, we suggest areas for further research.