Network

An overlay network is a computer network which is built on the top of another network. Overlay networks can be mainly classified into two types of networks, Peer-to-Peer networks and Content Delivery Networks (CDN). This paper complements the current research on routing in Ad hoc network by proposing a new protocol EADOV. In this paper we have measure the performance of mobile wireless network UPD-based application for various routing protocol and compare them with proposed EAODV protocol. Also QoS based performance analysis of EAODV protocol in different scenario has been done and results are compared. Network Simulator NS2 on Fedora environment is used for simulation which included two mobile nodes with four types of traffic VoIP, video, CBR and FTP for creating heavy load and to simulate the protocols.

Wireless sensor networks basically consist of low cost sensor nodes which collect data from environment and relay them to a sink, where they will be subsequently processed. Since wireless nodes are severely power-constrained, the major concern is how to conserve the nodes' energy so that network lifetime can be extended significantly. Employing one static sink can rapidly exhaust the energy of sink neighbors. Furthermore, using a non-optimal single path together with a maximum transmission power level may quickly deplete the energy of individual nodes on the route. This all results in unbalanced energy consumption through the sensor field, and hence a negative effect on the network lifetime. In this paper, we present a comprehensive taxonomy of the various mechanisms applied for increasing the network lifetime. These techniques, whether in the routing or cross-layer area, fall within the following types: multi-sink, mobile sink, multi-path, power control and bio-inspired algorithms, depending on the protocol operation. In this taxonomy, special attention has been devoted to the multi-sink, power control and bio-inspired algorithms, which have not yet received much consideration in the literature. Moreover, each class covers a variety of the state-of-the-art protocols, which should provide ideas for potential future works. Finally, we compare these mechanisms and discuss open research issues.

MANET consist of nodes that are often vulnerable to failure of delivering packets due to wireless network. All the existing Ad-hoc routing protocol are node moveable for geographic network specified. As multiple node are disjoint path from source to destination node. Due to this we have proposed an efficient mechanism which is position based opportunistic routing (POR) protocol when take advantage of the stateless property of geographic routing and broadcast in nature of wireless network. In this survey we have classified the void handling techniques which is used for the virtual destination based void handling method that helps us in providing multi hop packet delivery in robust manner is used together with position based opportunistic routing protocol(POR). This POR is stateless geographic routing and broadcast in effective way. Thus we utilize free air backup method of communications along with multi hop facility without interruption in POR. During this opportunistic of forwarding in void handling process virtual destination is obtained in the manet. This method is local route recovery method which overcomes the problem of duplication caused due to rerouting of packet when delivery of the packet fails. This might reduce rerouting of packet where not necessary thus reduce the cost. Then it necessary places a call to node which is mainly reliable node with a reliable path in multiple segment the Mobile ad hoc (manet) environments. In opportunistic routing neighbourhood location information can be exchange using one hop or multi hop where network varies.

Wireless ATM is upcoming as solution in the era of telecommunication. As wireless ATM gaining popularity is essential to find the subsequent use of ATM network . One of the major issue is the optimized usage of bandwidth for ATM networks. In this paper an Enhanced Genetic Algorithm (EGA) algorithm approach based solution is proposed for optimization of bandwidth through dynamic routing in ATM network. In this paper non-traditional optimization technique for EGA has been approached. The results obtained thus prove that EGA can algorithm solves the purpose for obtaining optimized bandwidth and minimization cell delay. Due to it many attractive business applications like high speed LAN interconnection, teleconferencing would become feasible. A comparative study of the selection mechanisms in GA and listed the best selection mechanism. It is a new technique which improves the efficiency of the EGA.