Notice Board: Call for Paper Vol. 8 Issue 10      Submission Start Date: September 30, 2021      Acceptence Notification Start: October 12, 2021      Submission End: October 18, 2021      Final MenuScript Due: October 22, 2021      Publication Date: October 31, 2021






Volume 3 Issue 6

Author Name
Garima Mishra , Arjun Rajput
Year Of Publication
2016
Volume and Issue
Volume 3 Issue 6
Abstract
A Mobile Ad hoc NETwork (MANET) is a set of mobile devices (nodes), which over a shared wireless medium communicate with each other without the presence of a predefined infrastructure or a central authority. The member nodes are themselves responsible for the creation, operation and maintenance of the network. The nature of the networks places two fundamental requirements on the routing protocols. First, it has to be distributed. Secondly, since the topology changes are frequent, it should compute multiple, loop-free routes while keeping the communication overheads to a minimum. Due to the dynamic change in topology finding route is very difficult. Some nodes misbehave as they participate in route establishment phase but refuse to forward the data packets to conserve their own energy. However, due to the absence of central Infrastructure the devices in the ad-hoc network can move randomly gives rise to various kind of problems, such as routing and security. In this chapter, two approa
PaperID
2016/03/IJMERT/06/177

Author Name
Hiresh Singh Sengar, B.L. Rai, Deepak Jain
Year Of Publication
2016
Volume and Issue
Volume 3 Issue 6
Abstract
String matching algorithms plays an important role in real life example of computer science engineering. The searching time of pattern is an overhead so requirement of the fast pattern searching is needed. Character based searching is limited upto certain level due to this Bit Parallel String Matching Algorithms comes into existence. The intrinsic parallelism in bit operations like AND/OR inside a computer word is known as bit parallelism. Since 1992, this bit parallelism is directly used in string matching for matching efficiency improvement. Some of the popular bit parallel string matching algorithms Shift OR, Shift OR with Q-Gram, BNDM, TNDM, SBNDM, LBNDM, FBNDM, BNDMq, and Multiple pattern BNDM. This paper discusses the working of various bit parallel string matching algorithms with example. Here we present how bit parallelism is useful for efficiency improvement in various algorithms with their detailed explanation and comparative analysis between these algorithms.
PaperID
2016/03/IJMERT/06/185



Notice Board :

Call for Paper
Vol. 8 Issue 10

Submission Start Date:
September 30, 2021

Acceptence Notification Start:
October 12, 2021

Submission End:
October 18, 2021

Final MenuScript Due:
October 22, 2021

Publication Date:
October 31, 2021