A NOVEL METHODOLOGY TO OVERCOME ROUTING MISBEHAVIOR IN MANET USING RETALIATION MODEL

ABSTRACT MANET is a cooperative network in which nodes are responsible for forwarding as well as routing. Noncooperation is still a big challenge that certainly degrades the performance and reliability of a MANET. This paper presents a novel methodology to overcome routing misbehavior in MANET using Retaliation Model. In this model node misbehavior is watched and an equivalent misbehavior is given in return. This model employs several parameters such as number of packets forwarded, number of packets received for forwarding, packet forwarding ratio etc. to calculate Grade and Bonus Points. The Grade is used to isolate selfish nodes from the routing paths and the Bonus Points defines the number of packets dropped by an honest node in retaliation over its misconducts. The implementation is done in "GloMoSi

Power-Constrained Fuzzy Logic Control of Video Streaming over a Wireless Interconnect

Wireless communication of video, with Bluetooth as an example, represents a compromise between channel conditions, display and decode deadlines, and energy constraints. This paper proposes fuzzy logic control (FLC) of automatic repeat request (ARQ) as a way of reconciling these factors, with a 40% saving in power in the worst channel conditions from economizing on transmissions when channel errors occur. Whatever the channel conditions are, FLC is shown to outperform the default Bluetooth scheme and an alternative Bluetooth-adaptive ARQ scheme in terms of reduced packet loss and delay, as well as improved video quality

Cryptographic Key Management in Delay Tolerant Networks (DTNs): A survey

Since their appearance at the dawn of the second millennium, Delay or Disruption Tolerant Networks (DTNs) have gradually evolved, spurring the development of a variety of methods and protocols for making them more secure and resilient. In this context, perhaps, the most challenging problem to deal with is that of cryptographic key management. To the best of our knowledge, the work at hand is the first to survey the relevant literature and classify the various so far proposed key management approaches in such a restricted and harsh environment. Towards this goal, we have grouped the surveyed key management methods into three major categories depending on whether the particular method copes with a) security initialization, b) key establishment, and c) key revocation. We have attempted to provide a concise but fairly complete evaluation of the proposed up-to-date methods in a generalized way with the aim of offering a central reference point for future research

Enhancing Node Cooperation in Mobile Wireless Ad Hoc Networks with Selfish Nodes

In Mobile Ad Hoc Networks (MANETs), nodes depend on each other for routing and forwarding packets. However, to save power and other resources, nodes belonging to independent authorities may behave selfishly, and may not be willing to help other nodes. Such selfish behavior poses a real threat to the proper functioning of MANETs. One way to foster node cooperation is to introduce punishment for selfish nodes. Based on neighbor-monitoring techniques, a fully distributed solution to detect, punish, and re-admit selfish nodes, is proposed here. This solution provides nodes the same opportunity to serve/and be served by others. A light-weight solution regarding battery status is also proposed here. This solution requires neighbor monitoring only when necessary, thereby saving nodes battery power. Another effective way to solve the selfish-node problem is to reward nodes for their service according to their cost. To force nodes to show their true cost, truthful protocols are needed. A low overhead truthful routing protocol to find optimal routes is proposed in this thesis. The most prominent feature of this protocol is the reduction of overhead from existing solutions O(n3) to O(n2). A light-weight scalable truthful routing protocol (LSTOP) is further proposed, which finds near-least-cost paths in dense networks. LSTOP reduces overhead to O(n) on average, and O(n2) in worst case scenarios. Multiple path routing protocols are an effective alternative to single path routing protocols. A generic mechanism that can turn any table-driven multipath routing protocol into a truthful one, is outlined here. A truthful multipath routing protocol (TMRP), based on well-known AOMDV protocol, is presented as an example. TMRP incurs an only 2n message overhead for a route discovery, and can also achieve load balancing without compromising truthfulness. To cope with the selfish-node problem in the area of position-based routing, a truthful geographic forwarding (TGF) algorithm is presented. TGF utilizes three auction-based forwarding schemes to stimulate node cooperation. The truthfulness of these schemes is proven, and their performance is evaluated through statistical analysis and simulation studies

Wireless Multi Hop Access Networks and Protocols

As more and more applications and services in our society now depend on the Internet, it is important that dynamically deployed wireless multi hop networks are able to gain access to the Internet and other infrastructure networks and services. This thesis proposes and evaluates solutions for providing multi hop Internet Access. It investigates how ad hoc networks can be combined with wireless and mesh networks in order to create wireless multi hop access networks. When several access points to the Internet are available, and the mobile node roams to a new access point, the node has to make a decision when and how to change its point of attachment. The thesis describes how to consider the rapid fluctuations of the wireless medium, how to handle the fact that other nodes on the path to the access point are also mobile which results in frequent link and route breaks, and the impact the change of attachment has on already existing connections. Medium access and routing protocols have been developed that consider both the long term and the short term variations of a mobile wireless network. The long term variations consider the fact that as nodes are mobile, links will frequently break and new links appear and thus the network topology map is constantly redrawn. The short term variations consider the rapid fluctuations of the wireless channel caused by mobility and multi path propagation deviations. In order to achieve diversity forwarding, protocols are presented which consider the network topology and the state of the wireless channel when decisions about forwarding need to be made. The medium access protocols are able to perform multi dimensional fast link adaptation on a per packet level with forwarding considerations. This i ncludes power, rate, code and channel adaptation. This will enable the type of performance improvements that are of significant importance for the success of multi hop wireless networks