• Title/Summary/Keyword: Source Routing

Search Result 414, Processing Time 0.029 seconds

A Power Aware QoS Routing in Multimedia Ad-hoc Networks (멀티미디어 Ad-hoc 네트워크에서의 전력인지 QoS 라우팅)

  • Kim, Yoon-Do;Seo, Kyung-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.2
    • /
    • pp.258-264
    • /
    • 2010
  • In the Ad-hoc networks, the limitation on the availability of power for operation is a significant bottleneck, given the requirements of portability, weight, and size of mobile devices. Hence, the use of routing metrics that consider the capabilities of the power sources of the network nodes contributes to the efficient utilization of energy. This paper presents a QoS routing protocol that minimize the power consumed by a packet in traversing from source node to the destination node. Results obtained of simulation show that, with our approach we can reduce the power consumption of nodes and increases the life time of the network.

Geographical Time Back-off Routing Protocol for Wireless Sensor Networks (무선 센서 네트워크에서 쥐치 정보의 시간차를 이용한 에너지 효율적인 라우팅 프로토콜)

  • Kim, Jae-Hyun;Sim, In-Bo;Kim, Hong;Lee, Jai-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5B
    • /
    • pp.247-256
    • /
    • 2007
  • In this paper, we propose Geographical Back-off Routing (Geo-Back Routing) protocol for wireless sensor networks. Geo-Back uses the positions of nodes, a packet's destination and a optimal back-off time to make the packet forwarding decisions using only source and destination's location information without information about neighbor nodes' location or the number of one hop neighbor nodes. Under the frequent topology changes in WSNs, the proposed protocol can find optimal next hop location quickly without broadcast algorithm for update. In our analysis, Geo-Back's scalability and better performance is demonstrated on densely deployed wireless sensor networks.

REVIEW ON ENERGY EFFICIENT OPPORTUNISTIC ROUTING PROTOCOL FOR UNDERWATER WIRELESS SENSOR NETWORKS

  • Ismail, Nasarudin;Mohamad, Mohd Murtadha
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.7
    • /
    • pp.3064-3094
    • /
    • 2018
  • Currently, the Underwater Sensor Networks (UWSNs) is mainly an interesting area due to its ability to provide a technology to gather many valuable data from underwater environment such as tsunami monitoring sensor, military tactical application, environmental monitoring and many more. However, UWSNs is suffering from limited energy, high packet loss and the use of acoustic communication. In UWSNs most of the energy consumption is used during the forwarding of packet data from the source to the destination. Therefore, many researchers are eager to design energy efficient routing protocol to minimize energy consumption in UWSNs. As the opportunistic routing (OR) is the most promising method to be used in UWSNs, this paper focuses on the existing proposed energy efficient OR protocol in UWSNs. This paper reviews the existing proposed energy efficient OR protocol, classifying them into 3 categories namely sender-side-based, receiver-side-based and hybrid. Furthermore each of the protocols is reviewed in detail, and its advantages and disadvantages are discussed. Finally, we discuss potential future work research directions in UWSNs, especially for energy efficient OR protocol design.

An Efficient Overlay for Unstructured P2P File Sharing over MANET using Underlying Cluster-based Routing

  • Shah, Nadir;Qian, Depei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.5
    • /
    • pp.799-818
    • /
    • 2010
  • In traditional unstructured P2P file sharing network, each peer establishes connections with a certain number of randomly chosen other peers. This would lead to redundant traffic and P2P network partition in mobile ad hoc network (MANET). We propose an approach to construct an efficient unstructured P2P overlay over MANET using underlying cluster-based routing (CBRP). One of the peers in the P2P network is used as a root-peer to connect all peers. Each peer maintains connection with physically closer peers such that it can reach the root-peer. The peer constructs a minimum-spanning tree consisting of itself, its directly connected neighbor peers and 2-hop away neighbor peers to remove far away redundant links and to build an overlay closer to the physical network. Due to on-demand nature of inter-cluster routing of CBRP, the positioning algorithm for MANET is used to retrieve the file by a peer from the source peer via shorter path in the physical network. We can show by simulation that our approach performs better in comparison with the existing approach.

Performance Oriented Docket-NoC (Dt-NoC) Scheme for Fast Communication in NoC

  • Vijayaraj, M.;Balamurugan, K.
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.3
    • /
    • pp.359-366
    • /
    • 2016
  • Today's multi-core technology rapidly increases with more and more Intellectual Property cores on a single chip. Network-on-Chip (NoC) is an emerging communication network design for SoC. For efficient on-chip communication, routing algorithms plays an important role. This paper proposes a novel multicast routing technique entitled as Docket NoC (Dt-NoC), which eliminates the need of routing tables for faster communication. This technique reduces the latency and computing power of NoC. This work uses a CURVE restriction based algorithm to restrict few CURVES during the communication between source and destination and it prevents the network from deadlock and livelock. Performance evaluation is done by utilizing cycle accurate RTL simulator and by Cadence TSMC 18 nm technology. Experimental results show that the Dt-NoC architecture consumes power approximately 33.75% 27.65% and 24.85% less than Baseline XY, EnA, OEnA architectures respectively. Dt-NoC performs good as compared to other routing algorithms such as baseline XY, EnA, OEnA distributed architecture in terms of latency, power and throughput.

Design of Communication System for Intelligent Multi Agent Robot System (지능형 멀티 에이전트 로봇시스템을 위한 통신시스템의 설계)

  • Kim, Jun-Yeup;Park, Seung-Min;Ko, Kwang-Eun;Jang, In-Hun;Sim, Kwee-Bo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.8
    • /
    • pp.758-767
    • /
    • 2012
  • In the ad-hoc wireless network environment, that the fixed sensor nodes and the sensor nodes to move are mixed, as the number of the sensor nodes with mobility are getting more, the costs to recover and maintain the whole network will increase more and more. This paper proposed the CDSR (Cost based Dynamic Source Routing) algorithm being motivated from the typical DSR algorithm, that is one of the reactive routing protocol. The cost function is defined through measuring the cost which any sensor node pays to participate in the whole network for communication. It is also showed in this paper that the proposed routing algorithm will increase the efficiency and life of whole sensor network through a series of experiments.

An Optimal ODAM-Based Broadcast Algorithm for Vehicular Ad-Hoc Networks

  • Sun, Weifeng;Xia, Feng;Ma, Jianhua;Fu, Tong;Sun, Yu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.12
    • /
    • pp.3257-3274
    • /
    • 2012
  • Broadcast routing has become an important research field for vehicular ad-hoc networks (VANETs) recently. However, the packet delivery rate is generally low in existing VANET broadcast routing protocols. Therefore, the design of an appropriate broadcast protocol based on the features of VANET has become a crucial part of the development of VANET. This paper analyzes the disadvantage of existing broadcast routing protocols in VANETs, and proposes an improved algorithm (namely ODAM-C) based on the ODAM (Optimized Dissemination of Alarm Messages) protocol. The ODAM-C algorithm improves the packet delivery rate by two mechanisms based on the forwarding features of ODAM. The first distance-based mechanism reduces the possibility of packet loss by considering the angles between source nodes, forwarding nodes and receiving nodes. The second mechanism increases the redundancy of forwarding nodes to guarantee the packet success delivery ratio. We show by analysis and simulations that the proposed algorithm can improve packet delivery rate for vehicular networks compared against two widely-used existing protocols.

Trust based Secure Reliable Route Discovery in Wireless Mesh Networks

  • Navmani, TM;Yogesh, P
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3386-3411
    • /
    • 2019
  • Secured and reliable routing is a crucial factor for improving the performance of Wireless Mesh Networks (WMN) since these networks are susceptible to many types of attacks. The existing assumption about the internal nodes in wireless mesh networks is that they cooperate well during the forwarding of packets all the time. However, it is not always true due to the presence of malicious and mistrustful nodes. Hence, it is essential to establish a secure, reliable and stable route between a source node and a destination node in WMN. In this paper, a trust based secure routing algorithm is proposed for enhancing security and reliability of WMN, which contains cross layer and subject logic based reliable reputation scheme with security tag model for providing effective secured routing. This model uses only the trusted nodes with the forwarding reliability of data transmission and it isolates the malicious nodes from the providing path. Moreover, every node in this model is assigned with a security tag that is used for efficient authentication. Thus, by combining authentication, trust and subject logic, the proposed approach is capable of choosing the trusted nodes effectively to participate in forwarding the packets of trustful peer nodes successfully. The simulation results obtained from this work show that the proposed routing protocol provides optimal network performance in terms of security and packet delivery ratio.

Comparison of Topology Based-Routing Protocols in Wireless Network

  • Sharma, Vikas;Ganpati, Anita
    • Journal of Multimedia Information System
    • /
    • v.6 no.2
    • /
    • pp.61-66
    • /
    • 2019
  • VANET (Vehicular Ad-hoc Network) is a mobile Ad-hoc Network which deals with the moving vehicles. VANET supports Intelligent Transport Systems (ITS) which is related to different modes of transport and traffic management techniques. VANETs enabled users to be informed and make them safer. VANET uses IEEE 802.11p standard wireless access protocol for communication. An important and necessary issue of VANET is to design routing protocols. In a network, communication takes place by the use of the routing protocols. There are mainly two types of communications used such as Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) in VANET. Vehicles can send and receive messages among them and also to and from infrastructure used. In this paper, AODV, DSR and DSDV are compared by analysing the results of simulation on various metrics such as average throughput, instant throughput, packet delivery ratio and residual energy. Findings indicates utilization of AODV and DSR is more applicable for these metrics as compared to DSDV. A network simulator (NS2) is used for simulation.

The Study Active-based for Improvement of Reliablity In Mobile Ad-hoc Network (이동 애드혹 네트워크에서 신뢰성 향상을 위한 액티브 기반연구)

  • 박경배;강경인;유재휘;김진용
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.4
    • /
    • pp.188-198
    • /
    • 2002
  • In this paper, we propose an active network to support reliable data transmission in the mobile ad-hoc network. The active network uses DSR(Dynamic Source Routing) protocol as its basic routing protocol, and uses source and destination nodes as key active nodes. For reliable improvement the source node is changed to source active node to add function that its buffer to store the last data with the flow control for data transmission per destination node. The destination node is changed to destination active node to add function that it requests the re-transmission for data that was not previously received by the destination active node with the flow control for data reception per source active node As the result of evaluation. we found the proposed active network guaranteed reliable data transmission with almost 100% data reception rate for slowly moving mobile ad-hoc network and with more 95% data reception rate, which is improvement of 3.5737% reception rate compared with none active network, for continuously fast moving mobile ad-hoc network.

  • PDF