Mobile Router Research Articles

Departure Control from Layer 3 Queue to MAC Queue in Mobile Routers for Power Saving

Departure Control from Layer 3 Queue to MAC Queue in Mobile Routers for Power Saving

중첩 이동 네트워크에서 Multi-layered Perceptron을 이용한 최적의 이동 라우터 지정 방안

ABSTRACT In the nested mobile network environment, the mobile node selects one of multiple mobile routers. The MR(Mobile Router) by existing top-down or bottom-up methods may not be the optimal MR if the numbers of mobile nodes and routers are substantially increased, and the scale of the network is increased drastically. Since an inappropriate MR decision causes handover or binding renewal to mobile nodes, determining of the optimal MR is important for efficiency. In this paper, we propose an algorithm that decides on the optimal MR using MR QoS(Quality of Service) information, and we describe how to understand the various structured MLP(Multi-Layered Perceptron) based on the algorithm. In conclusion, we prove the ability of the suggested neural network for a nesting mobile network through the performance analysis of each learned MLP. 키워드 : 중첩 이동 네트워크, 이동 라우터, 다층 퍼셉트론, 네트워크 이동성 Key word : Nested Mobile Networks, Mobile Router, Multi-layered Perceptron, Network Mobility Journal of the Korea Institute of Information andCommunication Engineering

A comparative signaling cost analysis of Macro Mobility scheme in NEMO (MM-NEMO) with mobility management protocol

NEMO BSP is an upgraded addition to Mobile IPv6 (MIPv6). As MIPv6 and its enhancements (i.e. HMIPv6) possess some limitations like higher handoff latency, packet loss, NEMO BSP also faces all these shortcomings by inheritance. Network Mobility (NEMO) is involved to handle the movement of Mobile Router (MR) and it's Mobile Network Nodes (MNNs) during handoff. Hence it is essential to upgrade the performance of mobility management protocol to obtain continuous session connectivity with lower delay and packet loss in NEMO environment. The completion of handoff process in NEMO BSP usually takes longer period since MR needs to register its single primary care of address (CoA) with home network that may cause performance degradation of the applications running on Mobile Network Nodes. Moreover, when a change in point of attachment of the mobile network is accompanied by a sudden burst of signaling messages, "Signaling Storm" occurs which eventually results in temporary congestion, packet delays or even packet loss. This effect is particularly significant for wireless environment where a wireless link is not as steady as a wired link since bandwidth is relatively limited in wireless link. Hence, providing continuous Internet connection without any interruption through applying multihoming technique and route optimization mechanism in NEMO are becoming the center of attention to the current researchers. In this paper, we propose a handoff cost model to compare the signaling cost of MM-NEMO with NEMO Basic Support Protocol (NEMO BSP) and HMIPv6.The numerical results shows that the signaling cost for the MM-NEMO scheme is about 69.6 % less than the NEMO-BSP and HMIPv6.

Mobile Agent routing algorithm for WSN based on Q learning hybrid with ant colony optimization

In view of mobile Agent routing problem in Wireless Sensor Networks( WSN), a mobile Agent routing algorithm for WSN based on Q learning hybrid with ant colony optimization was proposed. A new path choosing probability model was introduced and the optimal path was efficiently maintained in the algorithm. The simulation results show that the mobile Agent routing efficiency is highly improved and delay requirements in multiple tasks are fulfilled, the reliability of the optimal path is enhanced, and network energy consumption is reduced.

Exploiting 3D Structure for Scalable Routing in MANETs

Avoiding the mismatch between a physical network (PT) and a logical identifier structure (LIS) in a distributed hash table (DHT) based routing for mobile ad hoc networks (MANETs) would prevent the problems of long routes, high path-stretch ratio, and increased traffic overhead. To address this mismatch problem, the proposed scheme exploits a 3-dimensional (3D) logical identifier space (LS), where each node computes a consecutive logical identifier (LID) to route packets. The proposed scheme also utilizes 3D-logical identifier structure (3D-LIS) to maintain multi-paths by exploiting multihops at a node to the destination node. Simulation results show that the proposed protocol is better than existing DHT-based routing protocol.

Security in Network Mobility (NEMO): Issues, Solutions, Classification, Evaluation, and Future Research Directions

The IETF has standardized network mobility (NEMO) basic support protocol (BSP) to extend Internet services to networks in motion such as in bus, trains etc. The NEMO BSP uses a bidirectional tunnel between the mobile router (MR) and its home agent (HA) resulting in suboptimal routing. Route optimization may be incorporated between the MR and the correspondent node (CN), by informing the HA and the CN about the MR’s current location through binding updates. However, these binding updates are vulnerable to different attacks as malicious users may send fabricated binding updates to fool the MR, the HA, and the CN. Although the path between the MR and the HA is protected by IPSec tunnel, the path between the MR and CN, between the HA and CN, and between a mobile network node and the MR remains unprotected. So the requirements of extending Internet services in NEMO and use of optimized route between the MR and the CN have introduced several security threats in NEMO. In this survey, we describe security requirements, issues, and attacks with their corresponding countermeasures in NEMO. Major attacks in NEMO include bombing attack, redirection attack, denial of service attack, man-in-the-middle attack, replay attack, home agent poisoning attack etc. These attacks can affect the integrity and privacy of data. This survey also provides an in-depth and categorized description of various security protocols and key management techniques which are specifically targeted for NEMO. Along the way we highlight the advantages and disadvantages of existing NEMO security protocols, evaluate them, and discuss open research issues.

A novel enhancement of TCP for on-board IP networks with wireless cellular connectivity

Network mobility (NEMO) allows various types of in-vehicle networks (e.g., WLANs inside public transport vehicle) to be seamlessly connected to the Internet. An on-board mobile router (MR) connects the moving network to the Internet by means of high-speed cellular mobile data services. Unlike terminal mobility, where the mobile hosts (MHs) connect to the cellular base station directly, MHs in NEMO encounter an additional wireless link (MR–MH) before they get connected to the Internet. In this paper, we first note the impact of this additional wireless link on the performance of the wireless enhancements of TCP and observe that the existing TCP enhancement schemes designed for conventional terminal mobility are not equally effective in NEMO. So, we propose an extension of TCP, called on-board TCP (obTCP), to effectively address the double wireless link related issues in NEMO. We compare obTCP against a classical scheme, called snoop, known for its effectiveness in terminal mobility, and analytically demonstrate that the performance gain of obTCP over snoop increases linearly with the delays, and non-linearly with the loss probabilities in the wireless links. Finally, we extend these analyses to obtain throughput models for snoop and obTCP in NEMO. The throughput models are validated through ns-2 simulations.

A novel network mobility management scheme supporting seamless handover for high-speed trains

Automotive telematics has become an important technology for high-speed rail systems, which are being increasingly popular in this era of green technology. As the train speed increases, however, communications between the train and infrastructure encounter major difficulties of maintaining high quality communication. Handovers on high-speed trains occur more frequently and have shorter permissible handling times than for traditional vehicles. In this paper, the proposed 2MR network mobility scheme takes advantage of the physical size of high-speed trains to deploy two mobile routers (MRs) in the first and last carriages. This scheme provides a protocol to allow the two MRs to cooperate with a wireless network infrastructure in facilitating seamless handovers. Our simulation results demonstrate that compared to the traditional single MR schemes, the 2MR scheme noticeably improves the communication quality during handover by significantly reducing handover latency as well as packet loss for high-speed trains.

무선 센서 망에서 실시간 응용의 이벤트 이동성을 지원하기 위한 라우팅 기법

In wireless sensor networks, real-time applications have to ensure the timely delivery of real-time data. Recently, OMLRP (On-demand Multi-hop Look-ahead Routing Protocol) has been proposed to improve the timeliness of wireless sensor networks. The protocol needs initialization time to establish multi-hop information based routing path because it performs incremental look-ahead of the information. Consequently, the protocol deteriorates DDSR (Deadline Delivery Success Ratio) as an event moves because it takes little consideration of event mobility. In this paper, we proposed a Real-time Routing for Events Mobility (RREM) which exploits a data redirection in order to improve the DDSR of moving events. Instead of recollecting muti-hop look-ahead information, the RREM redirects the data to a sensor node holding the information collected in a previous round. We verify the timeliness and energy efficiency of RREM using various MatLab simulations.

Application Research of Improved Ant Colony Algorithm in Hybrid Mobile Agent Routing

Mobile agent routing essentially is a multi-constraint optimization problem, for Ant Colony algorithm for global search capability is weak, the feedback information of the system does not use and has the problem of low efficiency of finding exact solutions, propose an improved Ant Colony Algorithm for WSN mobile agent routing. This algorithm takes full use of the wireless sensor node energy, the direction of ants is determined according to the residual energy and the distance of nodes, quickly find the global optimal solution for mobile agent route. Simulation results show that the algorithm can find optimal mobile agent route in a relatively short time, relative to other routing algorithms, reducing network latency and average energy consumption, effectively alleviate network congestion, and extend the network lifetime.

Comparative Analysis of Mobile Ad Hoc Network Routing Protocols Simulation

A Mobile Ad Hoc Network (MANET) is a popular research topic. In this paper, we first describe characteristics of MANET, proactive and reactive routing protocols. Then AODV and DSDV, which are widely investigated in Ad Hoc network are introduced. We use simulation tool NS-2 to design three experiments to evaluate AODV and DSDV based on measure such as the packet drop rate, delays and average throughout. According to experimental results, conclusions and improvement suggestions are given to help further develop and optimize routing protocols.

Interference aware routing for mobile ad hoc networks based on node's sending and receiving capabilities

How to efficiently build routes among nodes is increasing important for mobile ad hoc networks (MANETs). This paper puts forward an interference aware routing protocol called Interference aware cross layer routing protocol (IA-CLR) for MANETs based on the IEEE 802.11 medium access layer (MAC). By defining the node's sending and receiving capabilities, IA-CLR can indicate the interference strength of the link in a real and comprehensive way. Further more, in order to choose the route with minimum bottleneck link interference, a new routing metric is proposed by combining the MAC layer and the network layer for cross layer design. Simulation results show that IA-CLR can significantly improve the performances of network such as the average end-to-end delay, the packets loss ratio and the throughput.

Research of Hybrid Mobile Agent Routing in Wireless Sensor Network

The mobile agent route is essentially a multi-constraint optimization problem, Genetic Algorithms has fast random global search ability, but the feedback information of the system does not use and has the problem of low efficiency of finding exact solutions, propose a genetic hybrid ant colony algorithm for WSN mobile agent route. Use of the fast random global search capabilities of genetic algorithm to find better solutions, then the better solution replaced by the initial pheromone of the ant colony algorithm, finally use the advantages of convergence speed of ant colony algorithm to find the global optimal solution for mobile agent route. Simulation results show that the algorithm can find optimal mobile agent route in a relatively short time, relative to other routing algorithms, reducing network latency and average energy consumption, improving the speed and efficiency of data transfer.

Wireless Sensor Network Node Deployment Method for Soil Salinization Monitoring

Soil salinization is one form of soil degradation. In this paper, the formation of physical topology known as node deployment in wireless sensor networks is studied based on the characteristics of wireless sensor networks. After calculating the value of the edge length of the grid, the minimum number nodes achieved according to the relationship between the radius of node sensing and radius of node communication. For data transmission, a mobile sink energy efficient routing algorithm based on the shortest path was applied to reduce the energy consumption.

Tunnel-Free Scheme Using a Routing Table in a PMIPv6-Based Nested NEMO Environment

In this paper, we propose a novel tunnel-free scheme in a proxy mobile IPv6 (PMIPv6)-based nested network mobility environment; several mobile nodes (MNs) and mobile routers (MRs) compose a hierarchical wireless network topology. Because tunnels created by several MRs overlap and data packets travel along several local mobility anchors (LMAs), the utilization of the wireless section is reduced and the packet forwarding path of the wire-line section is not optimal. In our tunnel-free scheme, the mobile access gateway (MAG) plays an important role in both the wireless and wire-line sections. Using a local binding update, this tunnel-free scheme forwards data packets with a host-based routing table without any tunnel. Establishing a direct tunnel between the MAG and the last LMA, this scheme removes nested tunnels between intermediate LMAs and MRs, and optimizes the forwarding path to the MN in the wire-line section.

ANFIS and agent based bandwidth and delay aware anycast routing in mobile ad hoc networks

Anycast is a point to point flow of packets for obtaining services or sending data to one of a multitude of destinations that share one address. To meet needs of real time and multimedia applications, anycast routing in Mobile Ad hoc Networks (MANETs) must provide faster service with better Quality of Service (QoS). This paper proposes an Adaptive Neuro-Fuzzy Inference System (ANFIS) based multiple QoS constrained anycast routing in MANETs by using a set of static and mobile agents. Three types of agents are used in the scheme: static anycast manager agent, static optimization agent, and mobile anycast route creation agent. The scheme operates in the following steps. (1) Optimization agent at the client optimizes membership functions for bandwidth, link delay and packet loss rate to develop Fuzzy Inference System (FIS) by using ANFIS. (2) Anycast route creation agents are employed by the client to explore multiple paths from source (client) to all anycast members (servers) through intermediate nodes. These agents gather intermediate node's information such as available bandwidth, link delay, residual battery power, and stability of anycast servers. The information is passed on to the client. (3) Anycast manager agent at the client performs finding QoS factor by using optimized FIS for every path, and selects QoS anycast path based on QoS and server stability factor, and (4) Anycast route creation agent is also employed for maintaining the QoS path in the event of node/link failures. The simulation results demonstrate reduction in end-to-end delay and control overhead, improvement in packet delivery ratio and path success ratio, as compared to shortcut tree based anycast routing (SATR) in MANETs.

A New Proposal for Route Finding in Mobile AdHoc Networks

Mobile Ad hoc Network (MANET) is a kind of wireless ad-hoc network, and is a self-configuring network of mobile routers (and associated hosts) connected by wireless links - the union of which forms an arbitrary topology. The routers are free to move randomly and organize themselves arbitrarily, thus the network's wireless topology may change rapidly and unpredictably. Such a network may operate in a standalone fashion, or may be connected to the larger Internet. There are various routing protocols available for MANETs. The most popular ones are DSR, AODV and DSDV. This paper examines two routing protocols for mobile ad hoc networks- the Destination Sequenced Distance Vector (DSDV and the Ad hoc On- Demand Distance Vector routing (AODV). Generally, the routing algorithms can be classified into Reactive and Proactive. A Hybrid algorithm combines the basic properties of reactive and proactive into one. The proposed approach is a novel routing pattern based on Ant Colony Optimization and Multi Agent System. This pattern integrates two different algorithms together and helps to get optimum routes for a particular radio range. The approaches used here are Ant Colony Optimization (ACO) and Multi Agent System (MAS). The proposed integrated approach has a relatively short route establishment time while using a small number of control messages which makes it a scalable routing approach. The overhead of this routing approach will be inexpensive and also will enable to have an alternate route during route failure. This proposed route finding scheme in order to provide high connectivity of nodes, will minimize the route discovery latency and the end-to-end delay.

Predictable Mobile Routing for Spacecraft Networks

In predictable mobile networks, network nodes move in a predictable way and therefore have dynamically changing but predictable connectivity. We have developed a model that formalizes predictable dynamic topologies as sequences of static snapshots. We use this model to design and evaluate a predictable mobile-routing protocol based on link-state routing, whose performance is superior to its static and ad hoc counterparts. Our routing protocol accounts for occurrences of additional, unpredictable changes, as well as their interaction with predictable changes. We evaluate our protocol using simulations based on randomly generated topologies and spacecraft-network scenarios. In both cases, we show that our protocol outperforms traditional routing protocols and is well suited for routing in next-generation space networks.

Online Victim Tracking and Tracing System (ViTTS) for Major Incident Casualties

Dealing with major incidents requires an immediate and coordinated response by multiple organizations. Communicating and coordinating over multiple geographical locations and organizations is a complex process. One of the greatest challenges is patient tracking and tracing. Often, data about the number of victims, their condition, location and transport is lacking. This hinders an effective response and causes public distress. To address this problem, a Victim Tracing and Tracking system (ViTTS) was developed. An online ViTTS was developed based on a wireless network with routers on ambulances, and direct online registration of victims and their triage data through barcode injury cards. The system was tested for feasibility and usability during disaster drills. The formation of a local radio network of hotspots with mobile routers and connection over General Packet Radio Service (GPRS) to the central database worked well. ViTTS produced accurately stored data, real-time availability, and a real-time overview of the patients (number, seriousness of injury, and location). The ViTTS provides a system for early, unique registration of victims close to the impact site. Online application and connection of the various systems used by the different chains in disaster relief promotes interoperability and enables patient tracking and tracing. It offers a real-time overview of victims to all involved disaster relief partners, which is necessary to generate an adequate disaster response.

Influence of mobility models on the performance of data dissemination and routing in wireless mobile ad hoc networks

Many routing protocols are proposed in the literature on mobile ad hoc networks (MANETs). Some of those protocols which have been investigated under different assumptions are unable to capture the actual characteristics of MANETs. Therefore, there is a necessity to investigate the performance of MANETs under a number of different protocols with various mobility models. This paper evaluates the performance of the single path routing protocols (AODV, DSR, and DSDV), in the presence of different network loads and differing mobility models. Our findings show that DSR routing protocol has a better performance compared to other protocols with respect to various metrics.