Mobile Router Research Articles

Coruscations and Requirements for Quality of Services in Mobile Ad hoc Networks

A mobile Ad hoc network (MANET) is an autonomous system of mobile routers (and associated hosts) connected by wireless links. In some applications, the routers are fixed and sometimes mobile free to move randomly and organize themselves arbitrarily. Due to mobile nature, the network’s wireless topology may change rapidly and unpredictably. Such a network may operate in a stand-alone fashion, or may be connected to the larger Internet. MANET’S were initially proposed for use in military and battle field, due to the rapid expansion of the Multimedia Technology, Mobile Technology and civilian applications has to strictly adhere to QoS. The paper presents the description about the QoS and the issues of MANETS like Routing, Medium (or Channel) access, Mobility Management, Security and Reliability, and Power Consumption and also the current approaches including models and solution strategies. The paper presents a literature study on the requirements of Quality of Services (QoS) in Mobile Ad-Hoc Networks (MANET’S) which is universally growing area.

Securing mobile network prefix provisioning for NEMO based vehicular networks

The recently developed mobile network prefix provisioning (MNPP) enables a direct communication, i.e., Route Optimization (RO), between vehicular mobile routers (VMRs). However, without being secured, MNPP is vulnerable to various threats such as spoofing, replay, and wormhole attacks as well as location tracking. In this paper, possible threats to MNPP are identified with suggestions of security requirements. Then, three different security approaches (five different security mechanisms) for securing MNPP are introduced and compared.

Unsustainable Livelihoods, Health Shocks and Urban Chronic Poverty: Rickshaw Pullers as a Case Study

Five ideas constitute the central message of this study. First, urban rickshaw pullers come from a very poor economic background consistent with the characteristics of chronic poverty. Second, rickshaw pulling provides a route of modest upward mobility for those among the rural chronically poor who come to the city for work. Third, the rickshaw pullers are susceptible to systematic health risks. Deteriorating health combined with health shocks can impose a significant burden on the urban poor, dragging down the pace of upward mobility during their lifetime. Fourth, the activity of rickshaw pulling represents an unsustainable livelihood, as the initial welfare gain tapers off with length of involvement in the sector. As longitudinal data is lacking, this story has emerged through an inductive comparison of younger, recent joiners and long duration, older rickshaw pullers, as well as current and former pullers. Fifth, intergenerational mobility of rickshaw puller households is constrained by very limited schooling and the poor range of occupational choices for children. Public policy has an important role to play in mitigating health shocks, as well as supporting targeted education for the urban poor in the informal sector, for sustainable urban poverty reduction.

NEMO 환경에서 RMTP를 지원하기 위한 개선된 경로 최적화 알고리즘

All IP 기반의 네트워크를 위해 이동 단말의 이동성을 지원하는 프로토콜이 현재까지 진행 중이다. 특히 NEMO(NEtwork MObility)는 이동 단말 각각의 이동성을 지원하는 방법이 아닌 이동 단말 그룹, 즉 이동 네트워크의 이동성을 제공하는 것을 목적으로 연구되고 있다. 또한 이러한 환경에서 유선 기반의 기존 프로토콜을 통해 무선이라는 제약을 극복하고 마치 유선 통신처럼 성능을 유지하려는 연구가 진행 중이다. 특히 NEMO 환경에서 기존의 멀티캐스트 방식을 적용하려는 연구가 진행 중이지만, 신뢰성을 가진 멀티캐스트 연구는 전무하다. 따라서 본 논문에서는 NEMO 환경에서 기존 멀티캐스트에 보다 높은 신뢰성을 기반으로 제안된 RMTP(Reliable Multicast Transport Protocol)를 적용하는 방법을 고려하여, 기존 NEMO 환경에 RMTP를 적용하였을 때 발생하는 문제점을 해결하는 효율적인 알고리즘을 제안한다. 또한 본 논문에서 기존의 NEMO 환경에서 RMTP를 그대로 적용했을 때와 제안된 알고리즘을 Delay 측면에서 AR(Access Router)과 TLMR(Top-Level Mobile Router)간의 전송 성공확률과 NEMO 레벨에 따른 성능 비교를 통해 제안된 알고리즘의 우수함을 증명한다. There are lots of researches for mobility of MS(mobile station) in All IP based network. Specially, NEMO(NEwork MObility) is not supporting mobility of each MS but supporting mobility of network that include group of MS. Some research try to overcome limitation of wireless with the protocol in wired state and it maintains the performance such as wire environment. There are no researches about multicast with reliability in NEMO. Therefore, this paper suggests efficient algorithm to solve problems when RMTP(Reliable Multicast Transport Protocol) apply to NEMO environment to support high reliability with multicast. And this paper shows the better performance of proposed algorithm for delay and transmission rate between AR and TLMR comparing with RMTP in NEMO.

Evolutionary Game Based Access Control Protocol in Wireless Networks with Mobile Routers

In existing systems of mobile routers, the frequency band is shared in uplinks from wireless terminals to mobile routers, and carrier sense multiple access with collision avoidance (CSMA/CA) is generally used as the medium access control protocol. To use the frequency band effectively, adaptive control is one promising approach. In this paper, a decentralized access control protocol in which mobile routers adaptively select the minimum contention window size is proposed. However, because of their mobility, which is one of the main difference between mobile routers and fixed access points, individual local area networks (LANs) consisting of the mobile routers and wireless terminals randomly interact with each other, and such random interactions can cause instability. To analyze the stability of the proposed control, evolutionary game theory is introduced because a system with random interactions between numerous decision-making entities can be analyzed by using evolutionary game theory. Using evolutionary game theory, the condition for existence of a convergence point is obtained. In addition, to implement the decentralized access control, a learning rule is proposed. In the proposed learning rule, each mobile router selects a strategy based on the result of past trials. From the simulation result, it is confirmed that the decentralized access control converges to a point closed to the stable state derived through evolutionary game theory.

Mobile IP Router in Ad Hoc Network

This paper addresses mobile IP router which communicate between nodes in Ad Hoc network as well as supply attachment to outer Internet. Ad Hoc network is one which exchanges information through cooperations among nodes without wire infrastructure, mobile IP router considers the network as one mobile unit, and supports Internet connection in mobile as well as fixed spaces. Therefore, this router can accommodate the routing of Ad Hoc network, and provide nodes in Ad Hoc network with Internet connection. So mobile IP router can provide Ad-Hoc terminals with the diverse wireless services, such as Internet connection service, routing, mobility, and so on.

Performance of an Interworking on the VLC

Abstract This paper represents an interworking architecture for keeping the VLC audio quality between Worldwide Interoperability for Microwave Access (WiMAX) and IEEE 802.11 Mobile Ad hoc Network (MANET) where both mobile routers and mobile nodes are moving dynamically. Systematic performance analysis on the interworking architecture has been conducted by using OPNET simulator to show the results such as Packet Delivery Ratio (PDR) and throughput. Based on simulation results, when the number of MANET nodes is small, PDR remains relatively stable even though data packets increase. However, with the many MANET nodes, PDR decreases as data traffic increases. Throughput is affected by the number of MANET nodes. Especially when the MANET node density has increased further, throughput is much higher, but it is not affected by the mobility speed. However, FTP download and upload response time is not affected much by both the number of MANET nodes and the mobility speed. Key Words : VLC, MANET, OPNET, QoS, performance, WiMAX

NEMO-based Path Aggregation System Using Mobile Routers on Multiple Vehicles

This paper describes the implementation and the evaluation of a link aggregation system using Network Mobility (NEMO). The link aggregation system, called NEMO SHAKE, constructs a temporal network (called an alliance) between multiple mobile routers (MRs) carried by vehicles and aggregates external links between multiple MRs and the Internet to provide a fast and reliable transmission with mobile devices in vehicles carrying MRs. We also designed a system for controlling alliances. By estimating the distance and the link condition between MRs, it can achieve a high throughput and the stability of the aggregated paths between vehicles and the Internet. We evaluated the usefulness of NEMO SHAKE and its alliance-control mechanism in real vehicular networks. We confirmed that the alliance-control mechanism can achieve a high throughput by changing the member of the alliance dynamically.

NEMO-based Path Aggregation System Using Mobile Routers on Multiple Vehicles

NEMO-based Path Aggregation System Using Mobile Routers on Multiple Vehicles

Mapping Evenki Land: The Study of Mobility Patterns in Eastern Siberia

In this article the Evenki way of moving is studied with an intention to reformulate the place of movement in modern hunter-gathering cultures. Firstly, the data collected during the fieldworks among two Evenki groups will be presented in a form of special maps carrying information not only about the routes but also various activities. Both groups are cut from each other by a mountain ridge and live in slightly different ecological and social environments, which have a contribution to the difference in their movements. With the one group of horse herders living on the frontier between steppe and taiga and the other group relying on reindeer herding and living deep in taiga, the consequen- tial differences in their mobility routes did not touch the basic patterns in the way their mobility is organized. The second part of the article is devoted to one of this shared basic pattern, the way the Evenki walk by foot. This part is devoted to a comparison between how this cultural practice is understood by Buryats, cattle breeding people, and our own interpretations based on fieldwork materials. The comparing of this two views of outsiders on the one of the most basic and routine practice will give the opportunity to study the relationship between a specific way of moving and hunting. The remained part of the article tracks the interrelations between such aspects of Evenki culture as ways of moving, the idea of self and territory organization. Hunter-gatherer communities are usually very mobile, the trips they conduct in a year could cover thousands of kilometers 1 . Modern hunter-gatherers even when sedentary manage to spend most of their time travelling, practicing hunt- ing and foraging in the vast surroundings of their villages and camps. Evenki hunters of East Siberia present a fine example of such a mobile ethos. During our fieldworks amongst two neighbouring Evenki groups we discovered that the everyday routines at camps and villages consist of packing and prepara- tions for various trips, in the direction of the central settlements or to the taiga, waiting for somebody and welcoming the returning people. Sometimes these trips took most of the family resources, increased petrol usage and were time consuming, bringing no obvious benefit to the families fortunes. Yet still the emotional reward of moving seemed to outweigh any material losses.

Asynchronous Checkpointing And Optimistic Message Logging For Mobile Ad Hoc Networks

In recent years the advancements in wireless communication technology and mobile computing fueled a steady increase in both number and types of applications for wireless networks. Wireless networks can roughly be classified into cellular networks which use dedicated infrastructure (like base stations) and ad hoc networks without infrastructure. A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that can communicate with each other using Multihop wireless links without using any fixed infrastructure and centralized controller. Since this type of networks exhibits a dynamic topology, that is, the nodes move very frequently, it is hard to establish some intermittent connectivity in this scenario. Fault tolerance is one of the key issues for MANETs. In a cluster federation, clusters are gathered to provide huge computing power. Clustering methods allow fast connection and also better routing and topology management of mobile ad hoc networks (MANET). To work efficiently on such systems, networks characteristics have to be taken into account, for e.g. the latency between two nodes of different clusters is much higher than the latency between two nodes of the same cluster. In this paper, we present a message logging protocol well-suited to provide fault tolerance for cluster federations in mobile ad hoc networks. The proposed scheme is based on optimistic message logging.

Agent based Congestion Control Performance in Mobile ad-hoc Network:A Survey paper

A Congestion control is a key problem in mobile adhoc networks. The standard TCP congestion control mechanism is not able to handle the special properties of a shared wireless channel. Many approaches have been proposed to overcome these difficulties. ideas and show their interrelations. mobile agent based congestion control Technique routing is proposed to avoid congestion in ad hoc network. Some mobile agents are added in ad hoc network, which carry routing information and nodes congestion status. When mobile agent travels through the network, it can select a less-loaded neighbor node as its next hop and update the routing table according to the node’s congestion status. With the aid of mobile agents, the nodes can get the dynamic network topology in time. In this paper, we give an verview over existing proposals, explain their key ideas, TCP Issues, Reduce the Congestion, delay in mobile ad-hoc network and proposed solution

NAT-MANEMO: Route Optimization for Unlimited Network Extensibility in MANEMO

MANET for NEMO (MANEMO) is a new type of network that integrates multi-hop mobile wireless networks with global connectivity provided by Network Mobility (NEMO). Two factors limit the scalability of MANEMO: the volatility of topologically correct global addresses, and excessive traffic load caused by inefficient use of nested tunnels and the consequent redundant routing of packets. We propose NAT-MANEMO, which solves both problems by applying NAT for some mobile router addresses, bypassing tunnel nesting. This approach retains global addresses for mobile end nodes, preserving application transparency, and requires only minimal modification to existing specifications. Our ideas are evaluated using simulation and a proof of concept implementation. The simulation shows the additional signaling overhead for the route optimization introduced by our proposal is negligible compare to the bandwidth of an IEEE 802.11 link. The implementation confirms that route optimization reduces latency and improves throughput.

A Decentralized Connectivity Strategy for Mobile Router Swarms

AbstractIn this paper we create a mesh of mobile robots that move in a decentralized fashion (swarming) in a two-dimensional space while maintaining communication constraints. The motion of the agents is dictated by four factors: i) a spring-mass interaction between agents; ii) a repulsive force from the obstacles; iii) an attractive force from the base station; and iv) an attractive field to regions with high probability to find users. Dijkstra's algorithm is implemented for optimal routing and a Bit Error Rate minimization is performed for communication optimization. The network is seen as a switched system in which virtual springs interactions create and delete the sensing links between agents. Stability analysis in the sense of Lyapunov is presented. Simulation results validate the applicability of the proposed method.

A DISJUNCTIVE PROGRAMMING APPROACH FOR MOTION PLANNING OF MOBILE ROUTER NETWORKS

In this paper we develop a framework based on disjunctive programming for motion planning of robotic networks. Although the methodology presented in this paper can be applied to general motion planning problems we focus on coordinating a team of mobile routers to maintain connectivity between a fixed base station and a mobile user within a walled environment. This connectivity management problem is decomposed into three steps: (i) a feasible line-of-sight path between the base station and the mobile user is computed; (ii) the number of required routers and their goal locations are determined; and (iii) the motion planning with obstacle and inter-vehicle collision avoidance problem is solved. To illustrate the flexibility of the proposed approach we also formulate a novel motion planning algorithm for a team of mobile robots as a disjunctive program. Cell decomposition is used to take into account the size and orientation of the robots. In both cases, connectivity and motion planning, the mixed-integer optimization problems are solve using CPLEX. Moreover, the proposed approach can easily accommodate input and other constraints and mission objectives. Simulation results show the applicability of the proposed strategy.

Analytical Studies of Interaction between Mobility Models and Single-Multi Paths Routing Protocols in Mobile Ad Hoc Networks

Mobile ad hoc networks (MANETs) will play a vital role in civilian and military applications where users move around and share information with each other. The movement of users varies depending on the environment, e.g. people may move randomly in different directions (Random Waypoint and Gauss Markov mobility models); or walk, run and drive in two directions in the street (Manhattan Mobility Model); or move as a group (Reference Point Group Mobility model). The interaction between mobility patterns and routing protocols contributes significantly to vary the overall network performance. We build an analytical framework that shows an analysis structure for the overall network performance test. In this framework, we first compare the properties of the mobility models that are designated for MANETs. Second, we measure single path (proactive and reactive) and multipath (proactive and reactive) routing protocols across the mobility models by tuning into TCP and CBR traffic individually. Finally, we examine the performance of each routing protocol across mobility models and discuss the possibility of interaction between them. Most of the previous findings only evaluate the impact of mobility models and single path routing protocols with CBR traffic, whereas a significant finding of this study is that how the interaction between mobility models and single path and multipath routing protocols varies depending on the usage of traffic (TCP and CBR).

Parametric Analysis of Mobile Ad-Hoc Network Environment

ABSTRACT A mobile Ad-Hoc Network (MANET) is a collection of wireless nodes that communicate with each other without any infrastructure. Present day mobile ad hoc networks grow in size and the associated complexity warrant the need to explore the suitability of the various simulation parameters during scenario.their execution. This paper presents a study on the timing Analysis for common MANET (mobile ad hoc network) parameters. Index terms: AODV, DSR, MANET, Random waypoint mobility model, Mobile Node, Transmission Range and scalability I. INTRODUCTION Mobile ad hoc networks (MANETs) is a self-configuring network of mobile routers (and associated hosts) connected by wireless links. Communication must be set up and maintained on the fly over mostly by wireless links. Each node of a network can both route and forward data [1]. The exploding demand for computing and communication on the move has led to reliance for ad hoc networks. Although substantial attempts have been made on research towards design and development of ad hoc network parameters, there is relatively little understanding of their behaviour in terms of the performance by comparing execution times as the system is scaled up [2] & [8]. Figure 1 First, it is unclear whether any existing ad hoc application traffics can be used to successfully perform within the given terrain dimensions which will be necessary in large scale wireless networks. Second, it is also ambiguous that which of the preceding traffics is likely to perform better as the size of the network grows [3]. In this paper represents the execution time analysis by varying different MANET simulation parameters. Because execution time is a main parameter for analyzing the performance of mobile ad-hoc network. Here we are using the simulation tool GloMoSim for large scale scenarios to obtain execution time analysis by varying different simulation parameters. Because it is giving more accuracy while constructing large scale scenarios.

Analysis of Multi-Server Scheduling Paradigm for Service Guarantees during Network Mobility

Multi-server scheduling of traffic flows over heterogeneous wireless channels affix fresh concerns of inter-packet delay variations and associated problems of out-of-sequence reception, buffer management complexity, packet drops and re-ordering overhead. In this paper, we have presented an exclusive multi-server scheduling algorithm that is specifically tuned for mobile routers equipped with multiple wireless interfaces and has attained multiple care-of-address registrations with its home agent (HA). The proposed adaptive, Self-clocked, Multi-server (ASM) scheduling algorithm is based on predetermined transmission deadlines for each arrived packet at the mobile router. The mobile flows receive desired service levels in accordance with their negotiated service rates and are only constraint by the cumulative capacity of all active links. The major challenge lies in the handling of asymmetric channels to stitch into a unified virtual channel of higher capacity with reliable service guarantees during mobility. The sorted list of transmission schedules is used to assign physical channels in increasing order of their availability. This approach specifically encapsulates the physical layer disconnections during the handovers and ensures continuous service to ongoing flows. The proposed scheduling scheme is supplemented by an analytical model and simulations to verify its efficacy. The simulation results demonstrate higher degree of reliability and scalability of service provisioning to flows during mobility.

Fuzzy logic based route optimization in a multihomed mobile networks

The present work is a fuzzy logic based route optimization in multihomed mobile network. The mobile routers in the mobile network use best egress determination algorithm to identify its best egress interface for each service type supported by the mobile network dynamically and send the best egress interface per service type information to a local fixed node inside the mobile network. The mobile network node sends a request message to the local fixed node inside the mobile network to initiate a session. The local fixed node uses best route selection algorithm to select an optimal route from mobile network to Internet for the desired service type of the mobile network node. The performance of the proposed work is evaluated using NEMO_SIM simulator which is implemented using JAVA. Results based on a detailed performance evaluation study are also presented to demonstrate the efficacy of the proposed scheme.

ADAPTIVE DATA MINING APPROACH FOR FLOW REDIRECTION IN MULTIHOMED MOBILE ROUTER

On multihomed mobile router with several interfaces toward Internet, it is important to provide an efficient flow redirection (FR) method that changes the served interface according to each network status or user movement. However, currently as the mobile devices roams, the interface is selected as only the physical signal strength, thus efficient resource use or quality of service (QoS) support is not guaranteed. In this paper, we propose an adaptive data mining approach that provides the selection of influential attributes for FR and the proper FR decision model as the interface type. We analyze assuming network protocols in order to heuristically extract the FR candidate attributes for estimating the required QoS. We abstract theoretically the FR influential attributes through decision-tree algorithm, and finally obtain the proper FR decision models per each interface. Our simulation results show that our FR approach provides improved performances in comparison with current handover.