Sensory Data Gathering for Road Traffic Monitoring: Energy Efficiency, Reliability, and Fault Tolerance
01 Jan 2015-pp 89-112
TL;DR: In this Chapter, a novel tree-based data gathering scheme has been proposed, exploiting the strip-like structure of the road network, and an efficient scheduling mechanism is implemented to assure both the coverage and the critical power savings of the sensor nodes.
Abstract: Vehicular traffic monitoring and control using through road sensor network is challenging due to a continuous data streaming over the resource constrained sensor devices. The delay sensitivity and reliability of the large volume of application data as well as the scarcity of sensor resources demand efficient designing of data collection protocol. In this Chapter, a novel tree-based data gathering scheme has been proposed, exploiting the strip-like structure of the road network. An efficient scheduling mechanism is implemented to assure both the coverage and the critical power savings of the sensor nodes. The network connectivity is guaranteed throughout by the proposed tree maintenance module that handles the dynamics of the network as a result of sensor node joining and leaving events. An application message controller has been designed that works cooperatively with the tree management module, and handles continuous streaming of the application data to ensure no loss or redundancy in data delivery. The performance of the proposed scheme is evaluated using the simulation results and compared with other approaches for large data collection in sensor network.
Citations
More filters
16 Dec 2022
TL;DR: In this article , the authors proposed an efficient traffic monitoring system, which can detect the vehicle flow on the roads in real time, which has three made components including evaluating vehicle density that is based on background subtraction procedures.
Abstract: Traffic analysis true video monitoring is quite a complex job. The reason for the same include different appearances, light changes, and variation in speeds. This paper proposed an efficient traffic monitoring system, which can detect the vehicle flow on the roads in real time. This system has three made components including evaluating vehicle density that is based on background subtraction procedures. the second component evaluate the speed of the traffic flow using optical flow mechanism first up the third component includes evaluating the number of vehicles using improved differential approach. From the fundamental information extracted, our system can predict events such as high traffic zones, vehicles over speeding and many more. The simulation is conducted by using the traffic data set derived from Kaggle.
References
More filters
18 Apr 2006
TL;DR: It is shown that the network performance can be improved by using EZRP, which calculates the reliability of the route and sends the data packet directly to the destination node using that route without route searching.
Abstract: In mobile ad-hoc networks (MANET), the nodes intercommunicate through single-hop and multi-hop paths in a peer-to-peer fashion. Intermediate nodes between two pairs of communication nodes act as routers. Thus the nodes operate both as hosts and routers. The nodes are mobile, so the topology of the network may change rapidly and unexpectedly. One of well-known routing protocol for ad-hoc networks is zone routing protocol (ZRP). However when the protocol searches for a new route, it sends many useless control packets, which increase the network load and decrease the network performance. In this paper, we propose an enhanced zone routing protocol (EZRP). In EZRP, each node calculates the reliability of the route. In the case of reliable route, the source node sends the data packet directly to the destination node using that route without route searching. While, in the case of unreliable route, the source node searches for a new route again. We show that the network performance can be improved by using EZRP.
18 citations
TL;DR: A novel approach based on the passive vehicular traffic measurement, called Autonomous Passive Localization (APL), inspired by the fact that vehicles move along routes with a known map, which shows that the localization scheme is effective in a road network with 18 intersections.
Abstract: Road networks are one of important surveillance areas in military scenarios. In these road networks, sensors will be sparsely deployed (hundreds of meters apart) for the cost-effective deployment. This makes the existing localization solutions based on the ranging ineffective. To address this issue, this paper introduces a novel approach based on the passive vehicular traffic measurement, called Autonomous Passive Localization (APL). Our work is inspired by the fact that vehicles move along routes with a known map. Using binary vehicle-detection time stamps, we can obtain distance estimates between any pair of sensors on roadways to construct a virtual graph composed of sensor identifications (i.e., vertices) and distance estimates (i.e., edges). The virtual graph is then matched with the topology of the road map, in order to identify where sensors are located on roadways. We evaluate our design outdoors on Minnesota roadways and show that our distance estimate method works well despite traffic noises. In addition, we show that our localization scheme is effective in a road network with 18 intersections, where we found no location matching error, even with a maximum sensor time synchronization error of 0.07 sec and a vehicle speed deviation of 10 km/h.
16 citations
20 Jun 2011
TL;DR: A point coverage mechanism and two connectivity mechanisms are proposed, based on making a virtual spanning tree and converting this tree to a physical tree and a combination of distance of nodes and number of hops to select edges and construct the tree.
Abstract: Energy limitation is one of the most critical challenges in the area of sensor networks. Sleep scheduling mechanisms can reduce the energy consumption. Coverage mechanisms attempt to cover the area with the minimum possible number of sensors. There are many area coverage approaches which also consider the connectivity problem. However, in the area of point coverage, there are limited mechanisms that maintain connectivity. In this paper, we propose a point coverage mechanism and two connectivity mechanisms. We compare these mechanisms to one of the best methods that consider both point coverage and connectivity. In the point coverage mechanism, we present a method for computing the waiting time, which reduces the number of the required sensors. For preserving the connectivity, virtual robust spanning tree (VRST) and modified virtual robust spanning tree (MVRST) are proposed. These mechanisms are based on making a virtual spanning tree and converting this tree to a physical tree. In order to spread out sensed data to the sink from different paths and decrease the loss probability, instead of using a minimum spanning tree (MST) to connect nodes to the sink, we use a combination of distance of nodes and number of hops to select edges and construct the tree. The simulation results show that the proposed coverage method reduces energy consumption by up to 7% compared to the Cardei method. The VRST and MVRST use more energy than the Cardei method, but the average data loss decreases by up to 40%. Moreover, VRST and MVRST have less depth and data latency.
16 citations
11 May 2008
TL;DR: A novel multi-hop data dissemination method using data replication technique to collect sensor data in vehicular sensor networks (VSN) and a simulation study conducted using the QualNet 4.0 simulator shows the effectiveness of this scheme.
Abstract: This paper proposes a novel multi-hop data dissemination method using data replication technique to collect sensor data in vehicular sensor networks (VSN). Currently, existing network protocols for general sensor networks pose problems when used in VSN applications. Even the majority of research based on VSN network protocols has some problems, as they limit their data harvesting schemes to only single-hop or short distance transmissions, or use high-cost relay stations to support multi-hop cases. As a result, these works cannot completely solve some critical issues in VSN, such as data transmission delay, packet overhead, and network connectivity. We believe such problems can be alleviated by our scheme, which uses replicas in a multi-hop data dissemination scheme. Our simulation study conducted using the QualNet 4.0 simulator shows the effectiveness of the proposed scheme.
15 citations
10 Oct 2008
TL;DR: This work designed a wireless sensor node for vehicle velocity measurement using two magnetic sensors and proposed an implementation method for the SAD algorithm for which a hardware accelerator can be designed.
Abstract: Wireless sensor nodes capable of vehicle speed measurement can replace traditional speed measurement systems such as dual loop detectors. We designed a wireless sensor node for vehicle velocity measurement using two magnetic sensors. We present the sensor node architecture, velocity measurement methods, algorithms, and propose an implementation method for the SAD algorithm for which a hardware accelerator can be designed. We performed experiments to test how the velocity measurement accuracy depends on the sensor separation and algorithm used.
15 citations