Epidemic and timer-based message dissemination in VANETs: A performance comparison

Data dissemination is among the key functions of Vehicular Ad-Hoc Networks (VANETs), and it has attracted much attention in the past decade. We address distributed, efficient, and scalable algorithms in the context of VANETs adopting the paradigm. We introduce an epidemic algorithm for message dissemination. The algorithm, named EPIC, is based on few assumptions, and it is very simple to implement. It uses only local information at each node, broadcast communications, and timers. EPIC is designed with the goal to reach the highest number of vehicles “infected” by the message, without overloading the network. It is tested on different scenarios taken from VANET simulations based on real urban environments (Manhattan, Cologne, Luxembourg). We compare our algorithm with a standard-based solution that exploits the contention-based forwarding component of the ETSI GeoNetworking protocol. On the other hand, we adapt literature based on a connected cover set to assess the near-optimality of our proposed algorithm and gain insight into the best selection of relay nodes as the size of the graph over which messages are spread scales up. The performance evaluation shows the behavior of EPIC and allows us to optimize the protocol parameters to minimize delay and overhead

RESOURCE ALLOCATION AND EFFICIENT ROUTING IN WIRELESS NETWORKS

In wireless networks, devices (nodes) are connected by wireless links. An important issue is to set up high quality (high bandwidth) and efficient routing paths when one node wants to send packets to other nodes. Resource allocation is the foundation to guarantee high quality connections. In addition, it is critical to handle void areas in order to set up detour-free paths. Moreover, fast message broadcasting is essential in mobile wireless networks. Thus, my research includes dynamic channel allocation in wireless mesh networks, geographic routing in Ad Hoc networks, and message broadcasting in vehicular networks. The quality of connections in a wireless mesh network can be improved by equip- ping mesh nodes with multi-radios capable of tuning to non-overlapping channels. The essential problem is how to allocate channels to these multi-radio nodes. We develop a new bipartite-graph based channel allocation algorithm, which can improve bandwidth utilization and lower the possibility of starvation. Geographic routing in Ad Hoc networks is scalable and normally loop-free. However, traditional routing protocols often result in long detour paths when holes exist. We propose a routing protocol-Intermediate Target based Geographic Routing (ITGR) to solve this problem. The novelty is that a single forwarding path can be used to reduce the lengths of many future routing paths. We also develop a protocol called Hole Detection and Adaptive Geographic Routing, which identifies the holes efficiently by comparing the length of a routing path with the Euclidean distance between a pair of nodes. We then set up the shortest path based on it. Vehicles play an important role in our daily life. During inter-vehicle communication, it is essential that emergency information can be broadcast to surrounding vehicles quickly. We devise an approach that can find the best re-broadcasting node and propagate the message as fast as possible

Sidelobe Control in Collaborative Beamforming via Node Selection

Collaborative beamforming (CB) is a power efficient method for data communications in wireless sensor networks (WSNs) which aims at increasing the transmission range in the network by radiating the power from a cluster of sensor nodes in the directions of the intended base station(s) or access point(s) (BSs/APs). The CB average beampattern expresses a deterministic behavior and can be used for characterizing/controling the transmission at intended direction(s), since the mainlobe of the CB beampattern is independent on the particular random node locations. However, the CB for a cluster formed by a limited number of collaborative nodes results in a sample beampattern with sidelobes that severely depend on the particular node locations. High level sidelobes can cause unacceptable interference when they occur at directions of unintended BSs/APs. Therefore, sidelobe control in CB has a potential to increase the network capacity and wireless channel availability by decreasing the interference. Traditional sidelobe control techniques are proposed for centralized antenna arrays and, therefore, are not suitable for WSNs. In this paper, we show that distributed, scalable, and low-complexity sidelobe control techniques suitable for CB in WSNs can be developed based on node selection technique which make use of the randomness of the node locations. A node selection algorithm with low-rate feedback is developed to search over different node combinations. The performance of the proposed algorithm is analyzed in terms of the average number of trials required to select the collaborative nodes and the resulting interference. Our simulation results approve the theoretical analysis and show that the interference is significantly reduced when node selection is used with CB.Comment: 30 pages, 10 figures, submitted to the IEEE Trans. Signal Processin