Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

Modern French novel has gained a distinctive status in the history of French literature during the first half of the twentieth century. This is due to many factors including the new literary descriptive objective style adopted by novelists like Alain Robbe – Grillet that  has long been regarded as the outstanding writer of the nouveau roman, as well as its major spokesman, a representative writer and a leading theoretician of the new novel that has broken the classical rules of the one hero and evolved, through questioning the relationship of man and the world and  reevaluating the limits of contemporary fiction , into  creating a new form of narrative.

Résumé:

En vue de résu

Developing an efficient algorithm for automated Magnetic Resonance Imaging (MRI) segmentation to characterize tumor abnormalities in an accurate and reproducible manner is ever demanding. This paper presents an overview of the recent development and challenges of the energy minimizing active contour segmentation model called snake for the MRI. This model is successfully used in contour detection for object recognition, computer vision and graphics as well as biomedical image processing including X-ray, MRI and Ultrasound images. Snakes being deformable well-defined curves in the image domain can move under the influence of internal forces and external forces are subsequently derived from the image data. We underscore a critical appraisal