In wired networks there are different physical devices routing the traffic centrally. By consequence, we can create paths in the network by using multiple management rules, but in Ad-Hoc network nodes this work must be done in an autonomous way. For that there are three types of routing protocol proactive, reactive and hybrid. The first one continuously calculates the possible paths to be available at the time of transmission. The second one creates the roads only when they are needed. And the last one is a combination between the two methods. In this study we will focus on three routing protocols AODV, OLSR and ZRP; and compare their performance in terms of loss packets and energy efficient.

No abstract

No abstract

Abstract-Wireless sensor network (MSN) is a wirelessly interconnected network. WSN promises a wide range of potential such as surveillance, military and civilian, to name just a few, applications. A sensor node senses the environment and delivers data to the sink. Energy saving is one of the keys to challenge network life time. LEACH protocol has been incorporated to extend network life time. This protocol forms clusters of the sensor nodes and elect one of them to become a Cluster Head (CH) to route data cluster to sink. In cluster, communication uses TDMA technique. This latter organizes transmission time (Time Slot) which corresponds to each node member of cluster. When a node dies, time slot corresponding to this node will be free. In this paper, we will present LEACH comportments after a node dies, then we will propose some ideas to invest its time slots by alive node members to maximize data reception time parameter so throughput end-to-end. This parameter is very important for real-time data. Finally, we will simulate this idea with Network Simulator (NS2) to argue for our propositions.

A mobile WSN is considered as a collection of wireless mobile nodes and a base station forming an ad-hoc network. This type of network is used in various areas; such as underwater and underground. Each node has a limited energy and a random mobilization. Since the energy consumption is a very important factor, the I. INTRODUCTION:Networks of wireless sensors are used in various fields, including monitoring, environment, industrial monitoring, medical applications and disaster response. Structure deployment of sensors and the way of their mobility require a different approach to networking and communication systems compared to the traditional networks. Wireless Sensor Network is composed of a base station and lots of sensor nodes that are deployed in an area. Each node has an objective to sense data and sends it to the BS. These nodes can be deployed in dangerous areas. As a result, the source energy replacement is not feasible because these nodes are inaccessible to the user since the energy efficiency is a key to their performance. Therefore the network should be enhanced to improve the entire network lifetime. The main objective is to balance the energy consumption between all sensor nodes to extend the lifetime of the network so that there would be no overflow sensor nodes used to run out of energy before the others. Generally, the energy consumption by a sensor node integrated sensing, communication and data processing. Among the three operations, a sensor node expends the maximum energy in the data communication. A major concern is the design and development of communication protocols wish to recover energy in order to extended network lifetime.A practical design scheme of nodes in WSN, It is clustering. This can stabilize the network topology periodically and efficiency at the energetic consumption. LEACH (Low Energy Adaptive Clustering Hierarchy Aggregation) is an increase network lifetime, but this protocol is not effective with mobility. An extension of LEACH is developed, called LEACH-Mobile to support the frequent mobility, in terms of packet loss. CBR Mobile in WSN is also another study to master the management of packet loss but these protocols are consume a lot of energy.W-Leach is a centralized algorithm. As LEACH, an algorithm operates in cycles so that each tower should have two phases, namely a setting phase and a steady state phase. In the configuration phase, W-LEACH selects a number of sensors to be CHs. Each CH is selected based on a weight value which corresponds to each node. Unlike LEACH, whether a sensor is CH or not in the preceding rounds, is independent in W-LEACH. After all CHs are selected clusters are formed such that each sensor is assigned to its closest CH. Leach requires each CH collects data from all sensors in its group at its steady state phase, against W-Leach chooses only x% of sensors in each group to send data to their CH. Candidates for sending data to CHs are selected according to their weight.Although the W-LEACH protocol has advantages in terms of an energ...