A MANEMO node is an IP-based mobile node that has interface attachments to both a mobile network, using Network Mobility (NEMO), and a Mobile Ad Hoc Network (MANET). While communicating with a correspondent node in the Internet, the MANEMO node should use the best possible path. Therefore, as conditions change, a handover between NEMO and MANET is desirable. This paper describes the operation of a MANEMO handover when IEEE 802.11 is used. An analytical model illustrates that packet loss during a MANEMO handover may severely affect data and real-time applications. We therefore propose using buffering during the handover, by making use of the Power Save Mode in IEEE 802.11. In the proposed algorithm, a MANEMO node may rapidly switch between the two interfaces, eventually receiving packets delivered via the old network interface while initiating the Mobile IP/NEMO handover on the new interface. Performance results show that packet loss can be significantly reduced, with small and acceptable increases in signalling overhead and end-to-end delay.

Mobile Ad Hoc Networks (MANETs) are temporal and infrastructure-independent wireless networks that consist of mobile nodes. For instance, a MANET can be used as an emergent network for communication among people when a disaster occurred. Since there is no central server in the network, each node has to find out its desired information (objects) by itself. Constructing a mobile Peer-to-Peer (P2P) network over the MANET can support the object search. Some researchers proposed construction schemes of mobile P2P networks, such as Ekta and MADPastry. They integrated DHT-based application-layer routing and network-layer routing to increase search efficiency. Furthermore, MADPastry proposed a clustering method which groups the overlay nodes according to their physical distance. However, it has also been pointed out that the search efficiency deteriorates in highly dynamic environments where nodes quickly move around. In this paper, we focus on route disappearances in the network layer which cause the deterioration of search efficiency. We describe the detail of this problem and evaluate quantitatively it through simulation experiments. We extend MADPastry by introducing a method sharing objects among nodes in a cluster. Through simulation experiments, we show that the proposed method can achieve up to 2.5 times larger success rate of object search than MADPastry.

Ad Hoc Networks are transmission networks in the structure of wireless networks that consist of many mobile hosts. They do so without the support from other communication infrastructures like Base Stations, and directly use wireless networks for data-transmission. This paper provides a general explanation of related protocols for setting up routes and their possible problems. In addition, related researches are described with their method of solving problems and reducing the possibility of problems occurring. Then, a novel constructive protocol called Partition-Timing Routing Protocol (PTR) is presented. If any covered node needs to transmit data to others outside the scope, it has to be managed by a core node. This protocol is able to adjust neighboring nodes covered in the scope, to select certain nodes to be their own core node. In addition, the timing for updating and adjusting the data of the covered scope is different from other methods, and at the same time it reduces the load of the entire network and makes it more flexible.

A mobile ad hoc network (MANET) is characterized by multi-hop wireless links in the absence of any cellular infrastructure as well as by frequent host mobility. This paper proposes a SMPQ: Spiral-Multi-Path QoS routing protocol in a MANET, while the MAC sub-layer adopts the CDMA-over-TDMA channel model. This work investigates the bandwidth reservation problem of on-demand QoS routing in a wireless mobile ad-hoc network. The proposed approach increases the ability of a route to identify a robust path, namely a spiral-multi-path, from source host to destination host, in a MANET to satisfy certain bandwidth requirements. Two important contributions of the proposed spiral-multi-path are: (1) the spiral-multi-path strengthens route-robustness and route-stability properties and (2) the spiral-multi-path increases the success rate of finding the QoS route. Performance analysis results demonstrate that our SMPQ protocol outperforms other protocols.