Research Papers - Dept of Computer Systems Engineering
Permanent URI for this collection https://rda.sliit.lk/handle/123456789/1253
Browse
4 results
Search Results
Publication Embargo SecAODV-Lightweight Authentication for AODV Protocol(International Journal of Computer Applications, 2016) Jayakody, A; Samarasinghe, R; Kodituwakku, S. RIn nature of the transmission medium the broadcast, Wireless sensor networks are vulnerable to security attacks. The nodes are placed in a hostile or dangerous environment where they are not tangibly safe in the MANETs. In many application, the data obtained from the sensing nodes need a false, or malicious node could intercept private information or could send false messages to nodes in the network. Among the major attacks Eavesdropping, Spoof Attack, Denial of Service, Wormhole attack, Sinkhole attack, Sybil attack, Selective Forwarding attack, Passive information gathering, Node capturing, and False or malicious node, Hello flood attack are common. In this paper, authors have proposed and implemented an efficient light weighted authentication secure routing protocol on top of an AODV. The focused area of the proposed routing protocol is increasing the network security of the MANET. Additionally, the paper evaluates the implemented protocol using NS2 simulator in different networks with SecAODV.Publication Embargo Improving trusted routing by identifying malicious nodes in a MANET using reinforcement learning(IEEE, 2017-09-06) Mayadunna, H; De Silva, S. L; Wedage, L; Pabasara, S; Rupasinghe, L; Liyanapathirana, C; Kesavan, K; Nawarathna, C; Sampath, K. KMobile ad-hoc networks (MANETs) are decentralized and self-organizing communication systems. They have become pervasive in the current technological framework. MANETs have become a vital solution to the services that need flexible establishments, dynamic and wireless connections such as military operations, healthcare systems, vehicular networks, mobile conferences, etc. Hence it is more important to estimate the trustworthiness of moving devices. In this research, we have proposed a model to improve a trusted routing in mobile ad-hoc networks by identifying malicious nodes. The proposed system uses Reinforcement Learning (RL) agent that learns to detect malicious nodes. The work focuses on a MANET with Ad-hoc On-demand Distance Vector (AODV) Protocol. Most of the systems were developed with the assumption of a small network with limited number of neighbours. But with the introduction of reinforcement learning concepts this work tries to minimize those limitations. The main objective of the research is to introduce a new model which has the capability to detect malicious nodes that decrease the performance of a MANET significantly. The malicious behaviour is simulated with black holes that move randomly across the network. After identifying the technology stack and concepts of RL, system design was designed and the implementation was carried out. Then tests were performed and defects and further improvements were identified. The research deliverables concluded that the proposed model arranges for highly accurate and reliable trust improvement by detecting malicious nodes in a dynamic MANET environment.Publication Embargo Compromising AODV for better performance(Faculty of Graduate Studies and Research, 2017-01-26) Jayakody, A.; Paranavithana, P.MANETs became a principal research area as a promising routing protocol for a large scale of applications, due to its' behavior of self-configuring ability according to the infrastructure. Energy efficient in MANETs is a significant area in MANETs related researchers. Nodes in a MANET networks are basically battery operated, and thus have access to a limited amount of energy. The lack of energy can lead to a link failure during an active communication session, which affects the throughput and energy wastage due to a re-run of the algorithm. These papers presents a modified AODV algorithm, where a node calculates its residual energy and select the best path based on the existing matrices and total energy of the path. During the RREQ packet exchange, each node adds its residual energy to the packet and forwards it until it reaches the destination. At the destination, the total energy value is copied to the RREP packet from RREQ packet and sent to the source node through the reverse path. During the process of route selection, the path with the highest energy value gets the priority.Publication Open Access Modified expanding ring search in common node scenario for AODV(Faculty of Graduate Studies and Research, 2017-01-26) Jawadul, A. S.; Jayakody, A.Mobile ad-hoc networks (MANET) are a collection of nodes without any static infrastructure. Ad-hoc networks establish connections between nodes without the help of centralized nodes but with the help of its neighbour nodes. The nodes are movable and can change its position frequently, so it maintains a dynamic interconnection between nodes in the network and adapts to dynamic topologies. MANETs are characterized by dynamic mobile nodes, with limited battery sourced power. These mobile nodes also act as routers taking its roles such as finding new routes, acting as an intermediate node, deciding best routes and keep a connection with mobile nodes. Any mobile node in the network can make the connection directly to any node within its transmission range, but due to its limited power, its transmission range also limited. Reactive routing protocols are effective than proactive routing protocols on MANETs since it can reduce extra overheads. However, reactive routing protocol suffers from excessive flooding in route discovery process. Authors focus on an existing solution called Expanding Ring Search (ERS) which decreases the flooding by manipulating Time to live (TTL) in AODV. ERS is also is inefficient in some scenarios. When the source is far from the destination ERS is worse than flooding [4]. Authors proposing a modification in ERS to avoid this problem which will make ERS efficient when the MANET consists a node (common node) that frequently accessed by most of the nodes.