Monitoring the driver behavior is one of the ways to prevent the fatal accidents and it is necessary to alert the driver when they are drowsy or in a distracted state. Distraction and drowsiness of the driver have been important factors for a large number of major accidents .They reduce the decision making capability and the perception level of the driver which negatively affect the ability of the driver to control the vehicle. A large number of serious or fatal accidents are occurred due to excessive or inappropriate speed of the vehicle and fatigue nature of the driver. With the new developed systems (sensors) there is a possibility of self controlling the vehicle when the driver was drunk or reckless or fatigue in order to reduce the major accidents. There is also a possibility of tracking the location of the accident, if occurs, through wireless access technology (GSM, GPS) so that proper measures are taken at a correct time.

Wireless Sensor Networks (WSN) has been proposed as a solution to environment sensing, target tracking, data collection and other applications. Sensor positioning is one of the important problems in WSN. Strong antenna arrays at each node or sensor arrays at different positions are used to localize the sources. This paper proposes a sensor positioning algorithm for WSN. A comparative analysis is made for proposed method along with existing methods with respect to computational cost, shortest path, and number of nodes, radio range and ranging error. The results show that proposed method: iterative routing algorithm provides improved performance over existing methods in the aspects considered.

Wireless sensor networks determine probable in military, environments, health and commercial applications. The process of transferring of information from a remote sensor node to other nodes in a network holds importance for such applications. Various constraints such as limited computation, storage and power makes the process of transferring of information routing interesting and has opened new arenas for researchers. The fundamental problem in sensor networks states the significance and routing of information through a real path as path length decides some basic performance parameters for sensor networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The simulations are performed on NS2 and the results obtained discuss the role of transferring of information through a shortest path.

In Wireless Sensor Network (WSN), the existing sensor positioning technique may result in increased cost, energy consumption, connectivity failure and less accuracy. In order to overcome these issues, in this paper, we propose a rangefree sensor positioning based on Bacterial Foraging Algorithm (BFO) in WSN. In this technique, initially the anchor nodes are placed using the coverage ratio. The coverage ratio depends on the network size. Then the anchor nodes use the BFO algorithm to estimate the distance between the unknown sensor nodes using neighbor density. BFO is a computational intelligence based technique that is not largely affected by the size and nonlinearity of the problem and can converge to the optimal solution in many problems where most analytical methods fail to converge. By simulation results, we show that the proposed technique enhances the accuracy and reduces the energy consumption.

Wireless sensor networks discover probable in military, environments, health and commercial applications. The process of transferring of information from a remote sensor node to other nodes in a network holds importance for such applications. Various constraints such as limited computation, storage and power makes the process of transferring of information routing interesting and has opened new arenas for researchers. The fundamental problem in sensor networks states the significance and routing of information through a real path as path length decides some basic performance parameters for sensor networks. This paper strongly focuses