• Title/Summary/Keyword: routing decision

Search Result 140, Processing Time 0.026 seconds

Partially Distributed Dynamic Model for Secure and Reliable Routing in Mobile Ad hoc Networks

  • Anand, Anjali;Aggarwal, Himanshu;Rani, Rinkle
    • Journal of Communications and Networks
    • /
    • v.18 no.6
    • /
    • pp.938-947
    • /
    • 2016
  • A mobile ad hoc network (MANET) is a collection of mobile nodes communicating in an infrastructure-less environment without the aid of a central administrating authority. Such networks entail greater dependency on synergy amongst the nodes to execute fundamental network operations. The scarcity of resources makes it economically logical for nodes to misbehave to preserve their resources which makes secure routing difficult to achieve. To ensure secure routing a mechanism is required to discourage misbehavior and maintain the synergy in the network. The proposed scheme employs a partially distributed dynamic model at each node for enhancing the security of the network. Supplementary information regarding misbehavior in the network is partially distributed among the nodes during route establishment which is used as a cautionary measure to ensure secure routing. The proposed scheme contemplates the real world scenario where a node may exhibit different kinds of misbehavior at different times. Thus, it provides a dynamic decision making procedure to deal with nodes exhibiting varying misbehaviors in accordance to their severity. Simulations conducted to evaluate the performance of the model demonstrate its effectiveness in dealing with misbehaving nodes.

An Efficient Ad Hoc Routing Method for Tactical Networks using Integrated Metrics and Traffic Characteristics (전술 네트워크 환경의 트래픽 특성을 고려한 통합 매트릭 기반 애드혹 라우팅 기법)

  • Roh, Bong-Soo;Hoh, Mi-Jeong;Hwang, Ki-Min;Park, Gui-Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.11B
    • /
    • pp.1676-1684
    • /
    • 2010
  • Tactical network environments are characterized by unreliable connectivity, communication links which has limited bandwidth compared to commercial networks and distributed architecture where users have high mobility. The best route should be selected based on the required traffic characteristics which can be a wireless channel environments and a status of nodes which are moving. Those characteristics are self aware and should be a routing decision factor in order to guarantee a reliable data transfer. In this paper we define the requirements of services and traffic characteristics on tactical network environments and suggest the new routing method "AODV-IMTC" based on selective routing metric to enable efficient data transfer in wireless ad hoc networks.

FARS: A Fairness-aware Routing Strategy for Mobile Opportunistic Networks

  • Ma, Huahong;Wu, Honghai;Zheng, Guoqiang;Ji, Baofeng;Li, Jishun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.1992-2008
    • /
    • 2018
  • Mobile opportunistic network is a kind of ad hoc networks, which implements the multi-hop routing communication with the help of contact opportunity brought about by the mobility of the nodes. It always uses opportunistic data transmission mode based on store-carry-forward to solve intermittent connect problem of link. Although many routing schemes have been proposed, most of them adopt the greedy transmission mode to pursue a higher delivery efficient, which result in unfairness extremely among nodes. While, this issue has not been paid enough attention up to now. In this paper, we analyzed the main factors that reflect fairness among nodes, modeled routing selection as a multiple attribute decision making problem, and proposed our Fairness-aware Routing Strategy, named FARS. To evaluate the performance of our FARS, extensive simulations and analysis have been done based on a real-life dataset and a synthetic dataset, respectively. The results show that, compared with other existing protocols, our FARS can greatly improve the fairness of the nodes when ensuring the overall delivery performance of the network.

Setup and Operation Sequence Generation from Manufacturability Evaluation for Prismatic Parts (제조성 평가를 기반으로 한 비회전형상 부품의 작업준비 및 작업순서 생성)

  • Choi, Hoo Gon;Han, Jung Hyun;Kang, Mujin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.31 no.4
    • /
    • pp.316-333
    • /
    • 2005
  • Although some successful recognition algorithms have been developed, most of them did emphasize on extracting accurate interpretations without considerations of manufacturability. Evaluating the manufacturability for multiple features leads to produce the machining sequences. In this paper, the A* algorithm guarantees the optimal setup sequences with minimizing the machining cost. Also, tolerances including surface roughness are converted to STEP formats to be utilized for more reliable process plans. Finally, decision tables are used to create the detailed operational sequences based on geometric tolerances and surface roughness. Machining parameters such as feed, depth of cut, and cutting speed for each operation are added to the routing sheet. Windows are presented to show how the entire system works for a sample part.

Simultaneous Consideration of Delivery and Pick-Up in Vehicle Routing Problem (배달과 회수를 고려한 차량 경로 문제)

  • 김내헌
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.16 no.28
    • /
    • pp.195-202
    • /
    • 1993
  • This paper considers the vehicle routing problem taking account of not only delivery but pick-up at the same time. A mathematical formulation is presented for finding the route which satisfies all the demands of customers and enables picking up most containers without exceeding the capacity of the vehicle. A table comparing traveling distance and the pick-up amount is provided by using heuristic method, which will be of help to the decision makers.

  • PDF

Vehicle Fleet Planning Problems : The State of the Art and Prospects (배차문제 : 연구현황과 전망)

  • Song Seong-Heon;Park Sun-Dal
    • Journal of the military operations research society of Korea
    • /
    • v.12 no.2
    • /
    • pp.37-55
    • /
    • 1986
  • Vehicle fleet planning problem is generic name given to a whole class of practical decision making problems which find the vehicle routes and schedules to accomplish the reqired service to customers using vehicles. In this paper the various problems are classified into the three groups according to their characteristics: (1) vehicle routing problems, (2) vehicle scheduling problems, and (3) vehicle routing and scheduling problems. The State of the art of each group is described and the future research directions are presented.

  • PDF

Air Path Establishment Based on Multi-Criteria Decision Making Method in Tactical Ad Hoc Networks (전술 애드혹 네트워크에서 다속성 의사결정 방법 기반 공중 경로 생성 방안)

  • Kim, Beom-Su;Roh, BongSoo;Kim, Ki-Il
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.15 no.1
    • /
    • pp.25-33
    • /
    • 2020
  • Multipath routing protocols with unmanned aerial vehicles have been proposed to improve reliability in tactical ad hoc networks. Most of existing studies tend to establish the paths with multiple metrics. However, these approaches suffer from link loss and congestion problems according to the network condition because they apply same metric for both ground and air path or employ the simple weight value to combine multiple metrics. To overcome this limitation, in this study, we propose new routing metrics for path over unmanned aerial vehicles and use the multi-criteria decision making (MCDM) method to determine the weight factors between multiple metrics. For the case studies, we extend the ad-hoc on-demand distance vector protocol and propose a strategy for modifying the route discovery and route recovery procedure. The simulation results show that the proposed mechanism is able to achieve high end-to-end reliability and low end-to-end delay in tactical ad hoc networks.

TAILWIND: Mobility information based Routing for Delay Tolerant Network (이동 방향 정보를 이용한 DTN 라우팅: TAILWIND)

  • Cho, Seoik;Kim, Sunhyun;Moon, Soohoon;Han, Seungjae
    • Journal of KIISE
    • /
    • v.42 no.3
    • /
    • pp.408-412
    • /
    • 2015
  • In base station based networks, traffic overload at the base station is inevitable. Peer-to-peer DTN which disperses the traffic overhead to each node can relieve the traffic overload at the base station. To increase the message delivery ratio and reduce the message overhead, we present novel routing using mobility information which can be obtained from each node, unlike the existing flooding based routings. In the proposed routing scheme, the routing decision metric, which is defined based on the node mobility information, is computed by using the expected distance between each node to the destination. The message is copied to other nodes that have lower expected distance to the destination than the value for the node willing to copy the message. We conducted simulations by using both a random mobility model and a real mobility trace to compare the performance of the proposed routing scheme to the existing routing scheme that does not utilize the mobility information. The performance evaluation showed the proposed routing successfully delivers messages with 10% to 30% less copies compared to previously proposed routing schemes.

Parallel Multistage Interconnection Switching Network for Broadband ISDN (광대역 ISDN을 위한 병렬 다단계 상호 연결 스위치 네트워크)

  • 박병수
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.3 no.4
    • /
    • pp.274-279
    • /
    • 2002
  • ATM packet switching technologies for the purpose of the B-ISDN service are focused on high performance which represents good qualities on throughput, packet loss, and packet delay. ATM switch designs on a class of parallel interconnection network have been researched. But these are based on the self-routing function of it. It leads to conflict with each other, and to lose the packets. Therefore, this paper proposes the method based on Sort-Banyan network should be adopted for optimal routing algorithm. It is difficult to expect good hardware complexity. For good performance, a switch design based on the development of new routing algorithm is required. For the design of switch network, the packet distributor and multiplane are proposed. They prevent each packet from blocking as being transmitted selectively by two step distributed decision algorithm. This switch will be proved to be a good performance switch network that internal blocking caused from self-routing function is removed. Also, it is expected to minimize the packet loss and decrease the packet delay according to packet transmission.

  • PDF

Routing Method based on Prediction of Link State between UAVs in FANET (FANET에서 UAV간 링크 상태 예측에 기반한 라우팅 기법)

  • Hwang, HeeDoo
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.11
    • /
    • pp.1829-1836
    • /
    • 2016
  • Today, the application area and scope of FANET(Flying Ad Hoc Network) has been extended. As a result, FANET related research are actively conducted, but there is no decision yet as the routing protocol for FANET. In this paper, we propose the OLSR-Pds (Prediction with direction and speed) which is added a method to predict status of link for OLSR protocol. The mobility of nodes are modeled using Gauss-Markov algorithm, and relative speed between nodes were calculated by derive equation of movement, and thereby we can predict link status. An experiment for comparing AODV, OLSR and, OLSR-Pds was conducted by three factors such as packet delivery ratio, end to end delay, and routing overhead. In experiment result, we were confirm that OLSR-Pds performance are superior in these three factors. OLSR-Pds has the disadvantage that requires time-consuming calculations for link state and required for computing resources, but we were confirm that OLSR-Pds is suitable for routing to the FANET environment because it has all the characteristics of proactive protocol and reactive protocol.