Mobility-Based Mobile Relay Selection in MANETs

Gilnam KIM  Hyoungjoo LEE  Kwang Bok LEE  

IEICE TRANSACTIONS on Communications   Vol.E95-B   No.5   pp.1643-1650
Publication Date: 2012/05/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E95.B.1643
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
mobile ad hoc networks (MANETs),  lifetime,  relative mobility,  

Full Text: PDF>>
Buy this Article

The future wireless mobile communication networks are expected to provide seamless wireless access and data exchange to mobile users. In particular, it is expected that the demand for ubiquitous data exchange between mobile users will increase with the widespread use of various wireless applications of the intelligent transportation system (ITS) and intelligent vehicles. Mobile ad hoc networks (MANETs) are one of the representative research areas pursuing the technology needed to satisfy the increasing mobile communication requirements. However, most of the works on MANET systems do not take into account the continuous and dynamic changes of nodal mobility to accommodate system design and performance evaluation. The mobility of nodes limits the reliability of communication between the source and the destination node since a link between two continuously moving nodes is established only when one node enters the transmission range of the other. To alleviate this problem, mobile relay has been studied. In particular, it is shown that relay selection is an efficient way to support nodal mobility in MANET systems. In this paper, we propose a mobility-based relay selection algorithm for the MANET environment. Firstly, we define the lifetime as the maximum link duration for which the link between two nodes remains active. Therefore, the lifetime indicates the reliability of the relay link which measures its capability to successfully support relayed communication when requested by the source node. Furthermore, we consider a series of realistic scenarios according to the randomness of nodal mobility. Thus, the proposed algorithm can be easily applied in practical MANET systems by choosing the appropriate node mobility behavior. The numerical results show that the improved reliability of the proposed algorithm's relayed communication is achieved with a proper number of mobile relay nodes rather than with the conventional selection algorithm. Lastly, we show that random mobility of the individual nodes enhances reliability of the network in a sparse network environment.