ROUTING DIAGRAM FOR THE TRANSPORT OF VIDEO TRAFFIC IN A WSN
Belghachi Mohammed, Mohammed Feham, Laboratoire Stic · 2010
The technology is currently training an emerging area of research and has been the subject of numerous studies in recent years. The wireless sensor networks (WSNs) raises fundamental problems for the scientific community. These problems, in addition to the problems encountered in ad hoc networks classics, are due to wireless communications, the density distribution of nodes, the constraints of resources (energy, processor, and memory), the low reliability of nodes, and the highly distributed nature of the application and supported the mobility of nodes. These features specific to sensor networks systems are unreliable and whose behaviour is hardly predictable. Currently, sensors equipped with cameras have emerged which will undoubtedly strengthen the monitoring application in all areas. However, applications of multimedia transport in WSNs are in embryonic stage and very little work has been done so far. A multimedia stream is characterized primarily by its needs delivered in terms of bandwidth, a scarce resource in WSNs. The rapid development of multimedia technology and the commercial interest of companies to popularize this type of application, the quality of service (QoS) a sector of great importance. In addition, ensure QoS in such networks is very delicate. However, the unexpected change of topology may affect the continuity of service and makes it extremely difficult if not impossible. It is therefore legitimate to consider the reliability of roads as the main constraint on QoS to be considered for the transmission of video streams. The mission of routing is to determine the best path between the source and destination in the network according to a certain performance criterion. This article presents a solution that allows to extend the protocol AODV (AODV: Ad hoc On-demand Distance Vector) to ensure the quality of service in terms of bandwidth for the transmission of video streams. The improvement we make is to define a function that maximizes the chances of selecting the road more easily repairable and therefore whose deadlines reconstruction will lowest since involve a re-routing local. In this decision-making phase, we seek to maximize the parameters contained in messages connection request reached the destination. These parameters are, for each route, the number of nodes involved the average density and the number of bottlenecks. But use of these data is not obvious. In this context, we must choose the road with the following characteristics: