We present a suite of algorithms for self-organization of wireless sensor networks, in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation of ad hoc subnetworks for carrying out cooperative signal processing functions among a set of the nodes.

Abstract-Clustering is an important research topic in wireless networks, because cluster structures can facilitate resource reuse and increase system capacity. In this paper, we present a new clustering algorithm that considers both node position and node mobility in vehicular ad hoc environments. The proposed algorithm intends to create stable clusters by reducing reclustering overhead, prolonging cluster lifetime, and shortening the average distance between cluster heads and their cluster members. Most important, this algorithm supports single and multiple cluster heads. Simulation results show the superiority of our clustering algorithm over the other three well-known algorithms.

No abstract

Delay-Tolerant Networks (DTNs) are special types of network environments that are subject to delays and disruptions. Traditional end-to-end routing fails in DTNs due to intermittent connections. We apply the concept of DTN to vehicular environments, and propose a new routing protocol that applies both diversity and accuracy in routing decisions. Our proposed routing has one excellent feature that supports its use for a distributed location discovery service. We evaluate this routing, using a real street map, in terms of different performance aspects. Experimental results show the superiority of this protocol over other existing ones.

Vehicular Ad Hoc Network (VANET) is an emerging new technology and a promising platform for the intelligent transportation system. The most important application of VANET is disseminating emergency messages to drivers in case of dangerous events. The effectiveness depends on the design of a broadcast scheme. A simple broadcast scheme encounters many problems such as broadcast storm, connection hole, building shadow, and intersection problems. In this paper, we propose an efficient broadcast scheme that simulates water wave propagation to spread emergency messages. This scheme provides warning services with both space and time constraints. Most existing broadcast schemes provide inadequate strategies for limiting the time period of a warning. We verified the performance of our proposed scheme in a simulated street environment with vehicle movements to show the superiority of this scheme in high broadcast coverage areas.

No abstract