Free Academic Seminars And Projects Reports

Abstract
Mobile Ad Hoc Networks (MANET) are self-organizing multi-hop wireless networks. The MANETs are rapidly deplorable due to the absence of a fixed infrastruc- ture. A number of routing protocols have been proposed in solving routing problems for this type of network to provide and maintain better connectivity in the network. Before being implemented in real life the performance of a routing protocol is eval- uated primarily through the simulation experiments. This paper presents Taguchi s method to optimize networks parameters of dynamic source routing protocol for such mentioned networks. Performance analysis of the drop rate are conducted based on three factors namely terrain size pause time and node velocity. An L orthogonal array was used to design the experiment. The study indicated that among the factors considered terrain was found to have strongest effects followed by pause time. By taking into consideration factorial effects the optimal levels were found to be A B and C corresponding to terrain size of m pause time of seconds and node velocity of . m/s. Using these factor-levels combination a minimum drop rate can be obtained.

---

Presented By:
1Muhammad Hisyam Lee, Mazalan Sarahintu
Faculty of Science, Universiti Teknologi Malaysia

---

Introduction
An ad hoc network is a special type of wireless mobile networks in which a collection of mobile platforms such as PDAs cell-phones and laptops which are also known as nodes formed a temporary network without relying on any organized administration such as base station . This network is useful in disaster recovery situations and places with non-existing or damaged communication infrastructure where a rapid deployment of a communication network is needed. An ad hoc network is also useful in conferences where people in a conference can form a temporary network without engaging the services of pre-existing network for example wireless LANs. In this network since some receiving nodes may be out of the direct transmission range of a sending node intermediate nodes have to act as routers to forward packets to the receiving nodes. For this reason some protocols are necessary to make the routing decisions. These include guidelines that allow nodes to discover and maintain routes to arbitrary destinations in the network to enable continued communication among a group of nodes. Therefore Muhammad Hisyam Lee & Mazalan Sarahintu the goal of the routing protocol is to dynamically establish and maintain routing in the network forwarding packets for each other to allow communication between nodes not directly within wireless transmission range. Until now there are no standard for the routing protocol for mobile ad hoc networks. A number of routing protocols have been proposed in solving routing problems for mobile ad hoc networks utilizing a variety of different algorithms and approaches one of which is DSR a reactive routing protocol. The main feature of this routing protocol is that routes are created when needed. (To know how the DSR operates please refer to ). In order to know how well the DSR performs in a certain situation for example where nodes are highly mobile the performance of the routing protocol is measured primarily through simulation experiments In these experiments the performance of the DSR protocol is evaluated by looking at some performance metrics for example routing overhead where the lower the routing overhead the better the DSR protocol in terms of consuming energy . In practice the performance of the DSR can be influenced by several factors including terrain size pause time and node velocity . Pause time and node velocity can cause page link failures which negatively impact routing and quality of service supports . Terrain size has a considerable impact on the network scalability that is the number of nodes in the network that can be scaled . Considering the facts mentioned above leads to some questions: what is the most sig- nificant factor affecting certain performance metric of the DSR? What are the ranks of the factors? What is the best combination of factor levels (values) that reliable to provide a good response metrics for the DSR? The above mentioned questions may need to be answered due to some beneficial results. For example suppose pause time (node mobility) is shown to have a greater impact on a performance metric of the DSR protocol than any factors. Therefore if there is an attempt to obtain better performance of the DSR protocol with respect to the metric something should be done with the node mobility for example the current model utilizing pause time (i.e. random way point model) is improved or changed with another model. Another benefit the combinations of factor-levels that would suggest here might be used as a reference of factor settings to evaluate performance of any routing protocol when considered a scenario taken from life (either small or moderate border sizes and density). In particular this work aims to estimate the impacts of network factors on the perfor- mance of the DSR with respect to a performance metric namely drop rate. Taguchi method is presented to achieve the aim. The remainder of this paper is organized as follows. In section we discuss the introduction to Taguchi method. In section we discuss the ex- perimental setup. In section we present our analysis and discussions. Finally in section we conclude our results.

---

read full report http://fs.utm.my/matematika/images/stori...082429.pdf

[attachment=5571]

---

ABSTRACT
Advancements in ad-hoc wireless network routing protocols have raced to keep up with the demands of a less structured, mobile, and dynamic routing environment. Along with the rapid development of these protocols, new forms of attacks and exploitations have begun to raise security issues in data transmission. Current ad-hoc mobile network protocols allow for the presence of covert channels, which create secret information transfer across an otherwise secure network policy. In this paper, we present several methods of data encoding and undetectable communication transfer between nodes in the Dynamic Source Routing (DSR) protocol. The DSR protocol uses source routing rather than the hop-by-hop routing used by the majority of other protocols, which eliminates the need for frequent route advertisement and neighbor detection packets. Unlike covert channels seen in other protocols such as the Ad-hoc On-demand Distance Vector (AODV) protocol, due to promiscuous listening and salvaging by intermediate node route caches, a destination node in a DSR network does not always receive routing packets sent from an originating sender node. We therefore present several methods of covert communication which guarantee covert information delivery. We also explore methods of detection and prevention from this manipulation of network resources, and provide a frame of comparison for the protocol s capacity for covert channels versus other network routing protocols. The comparison demonstrates that covert channels in DSR are sometimes impossible to detect; however, measures such as aggressive cache cleanup, neighborhood watches, and digital signatures on forwarded request packets can provide a backdrop of security against malicious users.


As people become increasingly dependent on cell phones and other wireless communication links, the development of efficient and economic routing protocols has gained greater focus. An important factor in weighing the relative capabilities of these protocols is their ability to withstand attacks and exploitation from malicious and selfish users. Protection against covert security breaches across mobile ad hoc networks is hard to achieve due to the dynamic and decentralized topology of these networks. The difficulty of this task is compounded by the inability of an ad-hoc architecture to implement a predefined security architecture or authentication system for the expansion and shrinking of the network. When ad hoc mobile routing protocols face subtle and cleverly coordinated security threats, the lack of built- in defense mechanisms raise multiple vulnerability concerns. A. Covert Channels and Information Hiding Though research in ad-hoc mobile network security protocols have uncovered ways to defend against many complex security hazards, protecting against the surreptitious transfer of data through covert channels has been scarcely considered. A covert channel simply put is the transfer of data between two processes that are not permitted or not known to be in touch with each other. To set up the channel, the sender and receiver communicate covertly over normal ports, exchanging secret messages using the standard procedure without tipping off neighbor nodes or security monitors as to their behavior. The notion of covert communication was first disLampson and was later refined through papers by Huskamp, Schaefer , and Kemmerer . These early sources describe covert channels as processes acting on behalf of another user in an operating system. They are mainly divided into two categories: storage and timing channels. Storage channels allow processes to write covert information to a shared storage medium, while timing channels signal information to another process by altering digits in the CPU system clock. Lampson was the first to point out that nondiscretionary security policies should address such problems of unauthorized information release over covert channels. He and other researchers responded to this threat by providing security models in operating systems that prevented the two stealth processes from communicating with each other.

to get information qabout the topic"Performance Analysis of Dynamic Source Routing Protocol for Ad Hoc Networks"refer the page link bellow

http://seminarsprojects.net/Thread-perfo...9#pid59019

can u please send us the code for this project.. my mail id is : [email protected].
plzz send it as soon as possible .thanq