Vehicular ad hoc networks (VANETs) have been proposed in order to assist the driver on the road. There are multiple applications where VANETs are needed, for example, proposing routes to reach a given destination, cooperating for traffic management, or preventing the driver of dangers on the road. In this paper, we focus on message broadcast for driver safety. Such broadcasting must be fast and reliable such that all the vehicles in a certain area receive the message as fast as possible. There are several proposals in the literature of broadcast protocols for critical messages in VANETs. In order to get a wide view of the different techniques to broadcast a message, we evaluate a set of protocols representing one or more broadcast techniques. Moreover, we propose PDB, a preset delay broadcast protocol with a fixed delay for vehicles attempting to retransmit a warning message, which provides a fast and reliable dissemination. We show that by adequately setting the waiting time for the relay candidates, we can significantly reduce the delay to cover a given area, while at the same time preserving a good reliability. Moreover, we model different techniques to broadcast an emergency packet in a VANET such as count-based, geographical, distance-based, and opportunistic, and thus we implement a subset of state-of-the-art protocols that implement one or more of those techniques. Finally, our research shows that stopping beacon transmissions when a warning message is detected does not provide a significant performance improvement. Nonetheless, by allowing a continuous channel access, we prove that the performance of any protocol might be greatly increased.
Wireless sensor networks (WSNs) are widely deployed nowadays on a large variety of applications. The major goal of a WSN is to collect information about a set of phenomena. Such a process is non-trivial since batteries' life is limited and thus wireless transmissions as well as computing operations must be minimized. A common task in WSNs is to estimate the sensed data and to spread the estimated samples over the network. Thus, time series estimation mechanisms are vital for this type of processes so as to reduce data transmission. In this paper, we assume a single-hop clustering mechanism in which sensor nodes are grouped into clusters and communicate with a sink through a single hop. We compare three mechanisms based on the autoregressive, moving average, and normalized least mean square models to predict local sensed samples in order to reduce wireless data communication. We prove the efficiency of these algorithms with real samples publicly available and show how suitable they are for processes of different nature.
One of the most important issues of the fourth generation (4G) wireless networks is the capability of mobile devices of handing off running communication sessions to the appropriate interface. It is widely accepted that the handoff decision must consider users, terminal, and network criteria. In the last ten years, several multi-criteria decision mechanisms have been proposed to solve the handoff decision problem. However, it appears that the criteria's choice is somewhat arbitrary and some of the proposed mechanisms even give arguable results. In order to better understand their applicability, we compare extensively by numerical simulation the performance of multicriteriadecision algorithms for vertical handoff. We evaluate each mechanism by considering specific requirements for different classes of service.