Processing math: 100%
--Connectivity Analysis of One-Dimensional Linear VANETs | IEEE Journals & Magazine | IEEE Xplore

k-Connectivity Analysis of One-Dimensional Linear VANETs


Abstract:

In a 1-D linear vehicular ad hoc network (1-DL-VANET), some vehicles may leave the network (e.g., at highway exits), which may make the 1-DL-VANET disconnected. Thus, it ...Show More

Abstract:

In a 1-D linear vehicular ad hoc network (1-DL-VANET), some vehicles may leave the network (e.g., at highway exits), which may make the 1-DL-VANET disconnected. Thus, it is important to analyze the connectivity of the 1-DL-VANET. When removal of any (k - 1) arbitrary nodes from a network does not disconnect the network, the network is said to be k-connected. In this paper, we investigate the k-connectivity of the 1-DL-VANET. Sufficient and necessary conditions are derived for the 1-DL-VANET to be k-connected, and based on this, a method is provided, with the help of matrix decomposition, to obtain expression of the probability of the 1-DL-VANET being k-connected. The expectation of the maximum number of tolerable vehicle departures is also derived. Simulation results confirm the accuracy of our analysis and indicate that the expectation of the maximum number of tolerable vehicle departures almost linearly increases with the total number of vehicles.
Published in: IEEE Transactions on Vehicular Technology ( Volume: 61, Issue: 1, January 2012)
Page(s): 426 - 433
Date of Publication: 22 November 2011

ISSN Information:

References is not available for this document.

I. Introduction

A vehicular ad hoc network (VANET) consists of a group of moving vehicles and probably a fixed infrastructure (such as roadside units), supporting intervehicle communications, and vehicle-to-infrastructure communications. Typical information transmitted in a VANET includes safety messages (such as accident notifications, road condition warnings, and emergency braking alarms) and interactive communications (such as instant message and online games). In this work, we consider intervehicle communications among a group of vehicles on a highway. Considering that the road width of highways is usually much smaller than the wireless transmission range and that the curves on highways are usually not sharp, we can approximately model the group of vehicles as a 1-D linear VANET (1-DL-VANET). A similar model is adopted in [1] and [2]. Here, we consider only intervehicle communications, and thus, roadside units are not involved. In a 1-DL-VANET, some vehicles may leave or quit the current network, e.g., due to arriving at their exits on the highway or due to mechanical faults. Upon departures of those vehicles, it is desired that any two remaining vehicles can still communicate with each other. In other words, the high connectivity level of the 1-DL-VANET is desired. In specific, if there exists a one- or multiple-hop communication path between any two nodes in a network, the network is said to be connected; otherwise, the network is said to be unconnected or disconnected. A network is called -connected if removal of any arbitrary nodes does not disconnect the network [3]. In particular, biconnectivity means that , which is a popular connectivity measure [4]–[8].

Select All
1.
S.-I. Sou, "A power-saving model for roadside unit deployment in vehicular networks", IEEE Commun. Lett., vol. 14, no. 7, pp. 623-625, Jul. 2010.
2.
S. Ukkusuri and L. Du, "Geometric connectivity of vehicular ad hoc networks: Analytical characterization", Transp. Res. C Emerg. Technol., vol. 16, no. 5, pp. 615-634, Oct. 2008.
3.
G. Chartrand and P. Zhang, Introduction to Graph Theory, New York:McGraw-Hill, 2005.
4.
Z. Shen, Y. Chang, H. Jiang, Y. Wang and Z. Yan, "A generic framework for optimal mobile sensor redeployment", IEEE Trans. Veh. Technol., vol. 59, no. 8, pp. 4043-4057, Oct. 2010.
5.
S. Das, H. Liu, A. Nayak and I. Stojmenovic, "A localized algorithm for bi-connectivity of connected mobile robots", Telecommun. Syst., vol. 40, no. 3/4, pp. 129-140, Apr. 2009.
6.
P. Basu and J. Redi, "Movement control algorithms for realization of fault-tolerant ad hoc robot networks", IEEE Netw., vol. 18, no. 4, pp. 36-44, Jul./Aug. 2004.
7.
A. A. Abbasi, K. Akkaya and M. Younis, "A distributed connectivity restoration algorithm in wireless sensor and actor networks", Proc. 32nd IEEE Conf. Local Comput. Netw., pp. 496-503, 2007-Oct.
8.
Z. Yan, Y. Chang, H. Jiang and Z. Shen, "Fault-tolerance in wireless ad hoc networks: Bi-connectivity through movement of removable nodes", Wireless Commun. Mobile Comput..
9.
M. Desai and D. Manjunath, "On the connectivity in finite ad hoc networks", IEEE Commun. Lett., vol. 6, no. 10, pp. 437-439, Oct. 2002.
10.
A. Ghasemi and S. Nader-Esfahani, "Exact probability of connectivity in one-dimensional ad hoc wireless networks", IEEE Commun. Lett., vol. 10, no. 4, pp. 251-253, Apr. 2006.
11.
D. Miorandi and E. Altman, "Connectivity in one-dimensional ad hoc networks: A queueing theoretical approach", Wireless Netw., vol. 12, no. 5, pp. 573-587, Sep. 2006.
12.
G. Han and A. M. Makowski, "A very strong zero-one law for connectivity in one-dimensional geometric random graphs", IEEE Commun. Lett., vol. 11, no. 1, pp. 55-57, Jan. 2007.
13.
Y. Tian, M. Sheng, J. Li, Y. Zhang and J. Yao, "Critical transmitting range for biconnectivity of one-dimensional wireless ad hoc networks", Proc. IEEE Veh. Technol. Conf., pp. 108-112, 2008-Spring.
14.
N. Wisitpongphan, F. Bai, P. Mudalige, V. Sadekar and O. Tonguz, "Routing in sparse vehicular ad hoc wireless networks", IEEE J. Sel. Areas Commun., vol. 25, no. 8, pp. 1538-1556, Oct. 2007.
15.
S. M. Ross, Introduction to Probability Models, CA, San Diego:Academic, 2007.
16.
H. David and H. Nagaraja, Order Statistics, New York:Wiley-Interscience, 2003.
17.
F. Huffer and C.-T. Lin, "Computing the exact distribution of the extremes of sums of consecutive spacings", Comput. Stat. Data Anal., vol. 26, no. 2, pp. 117-132, Dec. 1997.
18.
F. Huffer, "Divided differences and the joint distribution of linear combinations of spacings", J. Appl. Probab., vol. 25, no. 2, pp. 346-354, Jun. 1988.
19.
T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, MA, Cambridge:MIT Press, 2001.
Contact IEEE to Subscribe

References

References is not available for this document.