Learn More
IEEE 802.11p and 1609 standards are currently under development to support Vehicle-to-Vehicle and Vehicleto-Infrastructure communications in vehicular networks. For infrastructure-based vehicular relay networks, access probability is an important measure which indicates how well an arbitrary vehicle can access the infrastructure, i.e. a base station (BS).(More)
Coverage is an important problem in wireless networks. Together with the access probability, which measures how well an arbitrary user can access a wireless network, in particular VANET, they are often used as major indicators of the quality of the network. In this paper, we investigate the coverage and access probability of the vehicular networks with(More)
Many wireless multi-hop networks are deployed with some infrastructure support. Existing results on ad-hoc networks are inadequate to fully understand the properties of those networks. In this paper, we study the properties of 1-D infrastructure-based multi-hop networks. Specifically, we consider networks with two types of nodes, i.e. ordinary nodes and(More)
In this paper we investigate the critical node density required to ensure that an arbitrary node in a large-scale wireless multi-hop network is connected (via multi-hop path) to infinitely many other nodes with a positive probability. Specifically we consider a wireless multi-hop network where nodes are distributed in R (d = 2, 3) following a homogeneous(More)
Wireless multi-hop networks with infrastructure support have been actively studied to solve the scalability problem in large scale vehicular and sensor networks that the end-toend throughput and other performance metrics decrease sharply with the increase in the number of nodes in the network. In the infrastructure-based networks, wireless nodes are allowed(More)
In this paper we develop analytical bounds on the critical density for percolation in wireless multi-hop networks, but in contrast to other studies, under a random connection model and with nodes Poissonly distributed in the plane R. The establishment of a direct connection between any two nodes follows a random connection model satisfying some intuitively(More)
We consider wireless multi-hop networks with a finite number of (ordinary) nodes randomly deployed in a given 2D area. A finite number of gateways (infrastructure nodes) are deterministically placed in the same area. We study the connectivity between the ordinary nodes and the gateways. In real applications, it is often desirable to limit the maximum number(More)
Many real wireless multi-hop networks are deployed with some infrastructure support, where the results on ad-hoc networks cannot be readily extended to understand the properties of those networks. In this paper, we study those networks in 1D. Specifically, we consider two types of nodes in the networks: ordinary nodes and powerful nodes, where ordinary(More)
Energy saving is an important design consideration in wireless sensor networks. In this paper, we analyze the energy savings that can be achieved in a sensor network where each sensor is capable of reducing its transmission power from a maximum power pm, compared with that in a sensor network where each sensor can only transmit at a constant power level pm.(More)