TY - GEN
T1 - Random and linear address allocation for mobile ad hoc networks
AU - Choi, Nakjung
AU - Toh, C. K.
AU - Seok, Yongho
AU - Kim, Dongkyun
AU - Choi, Yanghee
PY - 2005
Y1 - 2005
N2 - To join an IP network and communicate with others, a node needs to be configured either manually by an administrator or automatically through a DHCP server. However, the former method is impractical for large networks, while the latter is infeasible in the case of a mobile ad hoc network due to the mobility of the nodes. This paper introduces two distributed IP address auto-configuration mechanisms for mobile ad hoc networks, namely (a) RADA (Random Address Allocation) and (b) LiA (Linear Allocation). RADA is based on random IP address selection, while LiA linearly assigns new addresses by utilizing the current maximum IP address value. We have also introduced an improved version of LiA, known as LiACR (Linear Allocation with Collision Resolution), which reduces control overhead. Then, we discuss extensions of these mechanisms capable of handling network partitioning and merging. Performance evaluations of RADA, LiA and LiACR were conducted through simulation. The results related to address allocation time and control overhead are presented and compared.
AB - To join an IP network and communicate with others, a node needs to be configured either manually by an administrator or automatically through a DHCP server. However, the former method is impractical for large networks, while the latter is infeasible in the case of a mobile ad hoc network due to the mobility of the nodes. This paper introduces two distributed IP address auto-configuration mechanisms for mobile ad hoc networks, namely (a) RADA (Random Address Allocation) and (b) LiA (Linear Allocation). RADA is based on random IP address selection, while LiA linearly assigns new addresses by utilizing the current maximum IP address value. We have also introduced an improved version of LiA, known as LiACR (Linear Allocation with Collision Resolution), which reduces control overhead. Then, we discuss extensions of these mechanisms capable of handling network partitioning and merging. Performance evaluations of RADA, LiA and LiACR were conducted through simulation. The results related to address allocation time and control overhead are presented and compared.
KW - Ad Hoc Address Acquisition
KW - Address Conflicts
KW - IP Address Auto-Configuration
KW - Resolution Schemes
UR - http://www.scopus.com/inward/record.url?scp=24944547902&partnerID=8YFLogxK
U2 - 10.1109/WCNC.2005.1424863
DO - 10.1109/WCNC.2005.1424863
M3 - Conference contribution
AN - SCOPUS:24944547902
SN - 0780389662
T3 - IEEE Wireless Communications and Networking Conference, WCNC
SP - 2231
EP - 2237
BT - 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005
T2 - 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off
Y2 - 13 March 2005 through 17 March 2005
ER -