Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
2 results
Search Results
Item Secure optimal routing protocol in MANETs(Institute of Electrical and Electronics Engineers Inc., 2014) Bhuvaneswari, M.; Naik, D.MANET consists of the number of mobile nodes that form a wireless communication. MANETs are self configuring network where the nodes can move freely and randomly. It can dynamically join the network and leave the network at any time. It is widely used in industrial and commercial applications like vehicular communication, agricultural needs and disaster management, etc. There are studies based on routing protocols in MANETs to improve their quality and efficiency of the protocols. However, there may lot of research about routing protocols, always it lacks in security. The proposed algorithm uses public key cryptographic technique to make the protocol more secure. Cryptography provides more secure and optimal transactions. © 2014 IEEE.Item Stochastic dynamic programming model for optimal resource allocation in vehicular ad hoc networks(Springer India, 2018) Bhuvaneswari, M.; Paramasivan, B.; Kandasamy, A.Vehicular ad hoc network (VANET) is an emerging trend where vehicles communicate with each other and possibly with a roadside unit to assist various applications like monitoring, managing and optimizing the transportation system. Collaboration among vehicles is significant in VANET. Resource constraint is one of the great challenges of VANETs. Because of the absence of centralized management, there is pitfall in optimal resource allocation, which leads to ineffective routing. Effective reliable routing is quite essential to achieve intelligent transportation. Stochastic dynamic programming is currently employed as a tool to analyse, develop and solve network resource constraint and allocation issues of resources in VANET. We have considered this work as a geographical-angular-zone-based two-phase dynamic resource allocation problem with a homogeneous resource class. This work uses a stochastic dynamic programming algorithm based on relaxed approximation to generate optimal resource allocation strategies over time in response to past task completion status history. The second phase resource allocation uses the observed outcome of the first phase task completion to provide optimal viability in resulting decisions. The proposed work will be further extended for the scenario that deals with heterogeneous resource class. Simulation results show that the proposed scheme works significantly well for the problems with identical resources. © 2018, Indian Academy of Sciences.