Efficient cluster-based group key agreement protocols for wireless ad hoc networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Our research considers the problem of finding loop-free unicast paths in a mobile ad hoc wireless computer network (ad hoc network). In an ad hoc network, systems use radio network interfaces and may move about. Ad hoc networks may range from small groups of personal computers at a business meeting, to hundreds of devices over a campus, to possible large-scale deployment on future battlefields or sensor networks. Ad hoc wireless networks do not use centralized control or fixed infrastructure, such as access points, cell sites, or base stations. The routing problem in a multi-hop network is to find paths between pairs of systems in such a way that minimizes the data loss rate, minimizes the control traffic, and ensures the network is loop-free at every instant. We develop three models of computer networks that explore several aspects of contention based common-channel wireless ad hoc computer networks. The contribution of our models is to examine how correlated broadcasts, such as the propagation of a route request broadcast, behave in an ad hoc network. The models use a combinatorial enumeration method, a Markov chain method, and a differential equation method. The combinatorial and Markov methods find exact solutions to certain problems and have large state spaces. Considering the poor multi-hop broadcast performance of common-channel contention ad hoc networks, we modify an existing routing protocol and develop two novel routing protocols with a design goal of reducing the reliance on broadcast traffic. AODV-DS is a proposed modification to the Ad hoc On-demand Distance Vector (AODV) routing protocol. AODV-DS applies an existing technique for broadcast reduction, dominating sets, to AODV We show an improved performance and lower overhead than conventional AODV. We propose the Label Distance Routing (LDR) protocol, which makes use of unicast traffic in graph re-labeling. LDR has lower packet loss and lower control overhead than AODV and other state-of-the-art ad hoc routing protocols. We present a new class of routing protocols called Split Label Routing (SLR). SLR protocols generalize LDR and allow more localized graph re-labeling, which reduces control overhead. We develop a specific realization of SLR called Split-Label Routing Protocol (SLRP).