Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Joshi, Brijendra Kumar
- Single-Path Streaming Optimized Routing Protocol for Dense Wireless Sensor Networks
Abstract Views :112 |
PDF Views:0
Authors
Affiliations
1 Military College of Telecommunication Engineering, Mhow-453441, MP, IN
1 Military College of Telecommunication Engineering, Mhow-453441, MP, IN
Source
International Journal of Advanced Networking and Applications, Vol 2, No 2 (2010), Pagination: 631-635Abstract
The Wireless Sensor Networks (WSNs) have advanced to the multimedia processing and streaming applications in the recent past with the advent of higher end motes like the iMote2. The data rates available from the radios of the WSN nodes are low so that for streaming applications to be sustained in these networks, special cares have to be taken to allow only one streaming path in any node’s neighborhood, which means in a common sink network, all the protocol layers in the nodes are optimized for maintaining a single streaming path in the network at any point of time. In a dense WSN, for single path optimized streaming for maximum throughput, the MAC and routing layers have to be specially designed to avoid traffic generation from nodes in the vicinity of an ongoing streaming path. In this paper, a routing protocol is described which is built on top of a streaming MAC protocol called MLMAC. The Single-path Streaming Optimized Routing Protocol (SPSORP) establishes the routing table during the initialization phase of the protocol and suspends the route updates when streaming is detected in the vicinity of a node. The simulation in OMNeT++ simulator confirms the possibility of streaming in a dense WSN with the combination of MLMAC and SPSORD to the tune of compressed voice streaming rates with iMote2 hardware platform.Keywords
Multihop Routing, QoS, Real-Time, Streaming, Wireless Multimedia Sensor Networks, Wireless Sensor Networks.- A Security Assessment Framework for Routing and Authentication Protocols of Mobile Ad-Hoc Networks
Abstract Views :112 |
PDF Views:0
Authors
Affiliations
1 Military College of Telecommunication Engineering, Mhow, IN
2 Swami Vivekanand College of Engineering, Indore, IN
1 Military College of Telecommunication Engineering, Mhow, IN
2 Swami Vivekanand College of Engineering, Indore, IN
Source
International Journal of Advanced Networking and Applications, Vol 14, No 1 (2022), Pagination: 5287-5293Abstract
Security assessment of routing and authentication protocols is based on the comparison of basic and secured versions of protocols such as AODV, SAODV, DSDV, SEAD, ZRP, SRP, LHAP, HEAP etc. In this paper, a framework for security assessment is presented. It is a complete system that attempts to provide the promised services to each user or application. To assess the security of different protocols, a security index is assigned. The value of security index shows how much a protocol is secured. To assign the security index, security parameters have been found out and the performance of different protocols have been analyzed under normal condition, Black Hole attack, Wormhole attack, and DoS attack.Keywords
Routing, Authentication, Framework, Security Index, Performance Index.References
- A. Y. Zomaya, Algorithms and protocols for Wireless and Mobile Ad-hoc Networks: A Taxonomy of Routing Protocols for Mobile Ad Hoc Networks,(John Wiley Canada2009).
- M. Soni, and B. K. Joshi, Security Assessment of Routing Protocols in Mobile Ad-hoc Networks, Proceeding of the International Conference on ICT in Business, Industry and Government, Indore, India, 2016, 24
- M. Soni, and B. K. Joshi, Security Assessment of SAODV Protocols in Mobile Ad-hoc Networks. Proceeding of the International Symposium Data Science and Big Data Analytics, Indore, India, 2018, 347-355.
- R. Akbani, T. Korkmaz, and G.V.S. Raju, HEAP: Hop-by-hop Efficient Authentication Protocol for Mobile Ad-hoc Networks, Proceedings of the Spring Simulation Multi conference, Virginia, USA, 2007, 157-165.
- M. Soni, and B. K. Joshi, Security Assessment of Authentication Protocols in Mobile Ad hoc Networks, International Journal of Computer Science and. Information Security,19(5), 2021, 36-40.
- S. Kaur, and A. Gupta, A Review On Different Secure Routing Protocols And Security Attacks In Mobile Ad Hoc Networks, International Journal of Advance Engineering Technology5(4), 2014,01-05.
- Argyroudis P. G. and O’Mahony D., Secure Routing For Mobile Ad Hoc Networks, IEEE Journal on Communications Surveys & Tutorials,7(3), 2005, 2-21.
- Shawkat, K. and Saaid G. O. S., Evaluating the performance of secure routing protocols in Mobile Ad-hoc Networks, International Journal of Advanced Research in Computer and Communication Engineering, 1(9), 2012, 710-716.
- A. Mohamed, Abdelshafy and P. J.B. King, AODV and SAODV under Attack Performance Comparison, Proceeding of 13th International Conference on Ad-Hoc Networks and Wireless ADHOC-NOW, Benidorm, Spain, 2014, 318-331
- P. Singh, N. Mann and T.G. Kaur, Study the impact of different attacks on Zone routing protocol in MANET. International Journal of Modern Computer Science and Applications, 4(3), 2016, 14-17.
- M. C. Trivedi, S. Yadav, and V. K. Singh, Securing ZRP Routing Protocol Against D DoS Attack in Mobile Ad Hoc Network, Proceeding of International Conference on Data and Information Systems, Singapore, 2019, 387-394.
- A. Saini and Anu, Analysis of Security Attacks and Solution on Routing Protocols in MANETs, International Journal of Computer Science and Mobile Compting, 5(6), 2016, 182-189.
- M. F. Juwad and H. S. Al- Raweshidy, Experimental Performance Comparisons between SAODV & AODV, Proceeding of the 2nd Asia International Conference on Modeling & Simulation, Kuala Lumpur, Malaysia, 2008, 247-252.
- S. M. Basha, S. R. Kumar, and R.V. Matam, Inclusive performance scrutiny of DSDV AODV and ZRP MANETs Routing Protocols, International Journal of Advanced Computer Technology, 2(5), 2014, 31-42.
- Ashwin Perti, Evaluate Dynamic Source Routing Protocol Performance in Wireless MANET, Int. J. Advanced Networking and Applications, 5(5) , 2016, 2056-2059.
- Nitish Balachandran, Surveying Solutions to Securing On-Demand Routing Protocols in MANETs, Int. J. Advanced Networking and Applications, 4(1), 2012, 1486-1491
- Finding All Graphic Sequences and Generating Random Graphs
Abstract Views :93 |
PDF Views:0
Authors
Affiliations
1 Indore Institute of Science and Technology, Indore - 453331, IN
1 Indore Institute of Science and Technology, Indore - 453331, IN
Source
International Journal of Advanced Networking and Applications, Vol 15, No 1 (2023), Pagination: 5781-5785Abstract
Graphs are basic requirement of research in many fields like electrical circuits, computer networks, Genome sequencing, traffic flow, compiler design and cryptography to name a few. There are three fundamental issues one has to address in respect of an undirected graph. First, given a number of nodes, how many unique degree sequences can be there to handle? Second, out of these unique degree sequences, how many are graphic? And third, how to generate random graphs for a degree sequence? This paper presents working solutions for all these issues. An efficient algorithm to find all unique degree sequences for a given number of nodes is presented. An algorithm based on Havel-Kasami algorithm is presented which is more efficient than Erdos-Gallai algorithm to test the connectivity. Finally, an algorithm to generate random graphs is also presented.Keywords
Adjacency List, Connected Graph, Degree Sequence, Erdos-Gallai, Havel-Kasami.References
- N. Deo, Graph Theory with Applications to Engineering and Computer Science (New Delhi: Prentice-Hall of India, 1974).
- F. Harary, Graph Theory (New Delhi: Narosa Publishing House, 1987).
- S. A. Choudham, A First Course in Graph Theory (Madras: MacMillan India, 1987).
- P. Erdos and T. Gallai, Graphs with prescribed degrees of vertices, Mat. Lapok, 11, 1960, 264-274.
- A. Tripathi and H. Tyagi, A simple criterion on degrees of vertices, Discrete Applied Mathematics, 156, 2008, 3516-3517.
- A. Tripathi, S. Venugopalan, and D. B. West, A short constructive proof of the Erdos-Gallai characterization of graphic lists, Discrete Mathematics, 310, 2010, 843-844.
- V. Havel, A remark on existence of finite graphs, Casopis propestovani matematiky (in Czech), 80, 1955, 477-480.1962, 496-506.
- S. L. Hakimi, On the realizability of a set of integers as degrees of the vertices of a graph, SIAM Journal on Applied Mathematics, 10, 1962, 496-506.
- B. K. Joshi, Digit and Vector classes for graph applications, unpublished.