Urban military operation mobility model

A Mobile Ad-hoc NETwork (MANET) is collection of wireless mobile nodes without a network infrastructure or centralized administration. Although MANETs can be used in many applications, such as mobile Internet, military communication, and disaster relief networks, a number of challenges remain. These include routing, medium access control, security, scalability, energy efficiency, mobility, etc. In order to study the viability of large-scale MANETs, researchers rely on wireless network simulators to test new ideas. Wireless network simulations require several important parameters, such as routing protocols, mobility models, and data traffic models. Among these, developing realistic mobility models is crucial for accurately evaluating the performance of MANETs. There are many models that emulate mobility of users. The most representative are entity and group mobility models. In a battlefield, mobility patterns of military units are different than mobility patterns of civilians. Thus, a special group mobility model is needed to appropriately simulate military operations on the battlefield. Hong et al. proposed the Reference Point Group Mobility (RPGM) model, which relates a group movement by a logical center. The Virtual Track (VT) mobility model and Reference Region Group Mobility (RRGM) model adds a group partitioning and merging scheme. The VT mobility model uses a Switch Station for group partitioning and merging, and the RRGM employs the Reference Region for assigning a group mission and dividing a group. These mobility models can be used to model operations in open areas or within specific building structures. However, group movements for military operations exhibit a more complicated pattern in urban areas. For example, a group is divided into smaller groups for accomplishing new mission and the small groups must be merged with their main forces at specific location or group destination after achieving their new tasks. Unfortunately, VT and RRGM mobility models do not specify a group merging event and location with their main forces. This thesis proposes a new group mobility model for military urban operation called Urban Military Operation Mobility Model (UMOMM). In UMOMM, the group moves along a road and employs group partitioning for new missions and allows for merging at the specific locations. UMOMM also employs a time delay to model soldiers encountering and overcoming obstacles during a missions. Finally, the impact of the proposed mobility model on different routing protocols is studied

A new routing protocol for ad hoc wireless networks design, implementation and performance evaluation

A collection of mobile nodes can form a multi-hop radio network with a dynamic topology and without the need for any infrastructure such as base stations or wired network. Such a Mobile Ad Hoc Networks (MANETs) maintain their structure and connectivity in a decentralised and distributed fashion. Each mobile node acts as both a router for other nodes traffic, as well as a source of traffic of its own In this thesis we develop and present a new hybrid routing protocol called Multipath Distance Vector Zone Routing Protocol, which is referred to as MDVZRP. In MDVZRP we assume that all the routes in the routing table are active and usable at any time, unless the node received or discovered a broken link. There is no need to periodically update the routing tables, therefore reducing the periodic update messages and hence reducing the control traffic in the entire network. The protocol guarantees loop freedom and alternative disjoint paths. Routes are immediately available within each routing zone. For destinations outside the zone, MDVZRP employs a route discovery technique known as routing information on demand. Once the node is informed by either the MAC layer or itself that it should discover the non- reachable nodes, MDVZRP adopts a new technique. First, we discuss the Ad Hoc networks and routing in general, then the motivation of MDVZRP regarding the nodes‟ flat view, and the selection and acquisition of multipath getting and selection. Furthermore, we describe the stages of MDVZRP and the protocol routing process with examples. The performance of MDVZRP is then evaluated to determine its operating parameters, and also to investigate its performance in a range of different scenarios. Finally, MDVZRP is compared with DSDV and AODV ordinary routing protocols (standard) delivering CBR traffic. Simulation results show that MDVZRP gives a better performance than DSDV in all circumstances, it is also better than AODV in most of the scenarios, especially at low mobility

A new routing protocol for ad hoc wireless networks design, implementation and performance evaluation

A collection of mobile nodes can form a multi-hop radio network with a dynamic topology and without the need for any infrastructure such as base stations or wired network. Such a Mobile Ad Hoc Networks (MANETs) maintain their structure and connectivity in a decentralised and distributed fashion. Each mobile node acts as both a router for other nodes traffic, as well as a source of traffic of its own In this thesis we develop and present a new hybrid routing protocol called Multipath Distance Vector Zone Routing Protocol, which is referred to as MDVZRP. In MDVZRP we assume that all the routes in the routing table are active and usable at any time, unless the node received or discovered a broken link. There is no need to periodically update the routing tables, therefore reducing the periodic update messages and hence reducing the control traffic in the entire network. The protocol guarantees loop freedom and alternative disjoint paths. Routes are immediately available within each routing zone. For destinations outside the zone, MDVZRP employs a route discovery technique known as routing information on demand. Once the node is informed by either the MAC layer or itself that it should discover the non- reachable nodes, MDVZRP adopts a new technique. First, we discuss the Ad Hoc networks and routing in general, then the motivation of MDVZRP regarding the nodes‟ flat view, and the selection and acquisition of multipath getting and selection. Furthermore, we describe the stages of MDVZRP and the protocol routing process with examples. The performance of MDVZRP is then evaluated to determine its operating parameters, and also to investigate its performance in a range of different scenarios. Finally, MDVZRP is compared with DSDV and AODV ordinary routing protocols (standard) delivering CBR traffic. Simulation results show that MDVZRP gives a better performance than DSDV in all circumstances, it is also better than AODV in most of the scenarios, especially at low mobility