• 제목/요약/키워드: Data forwarding protocol

Search Result 87, Processing Time 0.028 seconds

An Efficient Data Dissemination Protocol for Cluster-based Wireless Sensor Networks (클러스터 기반의 무선 센서네트워크에서 통신량을 줄인 데이터 보급방법)

  • Cho, Ji-Eun;Choe, Jong-Won
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.3
    • /
    • pp.222-230
    • /
    • 2009
  • A sensor network is an important element of the ubiquitous and it consists of sensor fields that contain sensor nodes and sink nodes that collect data from sensor nodes. Since each sensor node has limited resources, one of the important issues covered in the past sensor network studies has been maximizing the usage of limited energy to extend network lifetime. However, most studies have only considered fixed sink nodes, which created various problems for cases with multiple mobile sink nodes. Accordingly, while maintaining routes to mobile sink nodes, this study aims to deploy the hybrid communication mode that combines single and multi-hop modes for intra-cluster and inter-cluster transmission to resolve the problem of failed data transmission to mobile sink nodes caused by disconnected routes. Furthermore, a 2-level hierarchical routing protocol was used to reduce the number of sensor nodes participating in data transmission, and cross-shape trajectory forwarding was employed in packet transmission to provide an efficient data dissemination method.

Restricted Multi-hop Information Lookahead Scheme for Real-Time Data Dissemination in Wireless Sensor Networks (무선 센서 망에서 실시간 데이터 전송을 위한 제한적 멀티-홉 정보 예측 기법)

  • Jung, Ju-Hyun;Oh, Seung-Min;Lee, Jeong-Cheol;Park, Ho-Sung;Yim, Yong-Bin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7A
    • /
    • pp.706-714
    • /
    • 2010
  • In wireless sensor networks, real-time data delivery schemes typically achieve a desired delivery speed by performing one-hop lookahead. Recently, to reduce the deadline miss ratio against the desired delivery speed, a study has proposed a real-time routing protocol based on proactively performing two-hop lookahead. However, the study might cause heavy message exchange overhead and high computing complexity to carry out obtainment of two-hop neighborhood speed information in the entire sensor nodes whether data are delivered or not. Moreover, although multi-hop lookahead provides the least deadline miss ratio, due to the restriction from the overhead and the complexity, the recent study merely adopts the two-hop lookahead manner. In this paper, we propose a novel real-time routing protocol that adopts on-demand neighborhood multi-hop information obtainments only around data forwarding paths. Simulation results prove that the proposed routing protocol offers better performances with respect to deadline miss ratio, total communication costs, energy efficiency, and network lifetime.

Inprovement of Handoff Protocol for Real-Time Packet Transmission in Cellular Wireless Networks (셀룰라 무선 망에서 실시간 패킷 전송을 위한 핸드오프 프로토콜 개선)

  • Han, Seung-Jin;Lee, Jung-Hyun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.11S
    • /
    • pp.3675-3683
    • /
    • 2000
  • The Handoff is the core technical factor that is required when mobile host moves from one area to another, while transmitting and receiving data. The existing works try to minimize the loss of pockets by forwarding packets to the Cell which a mobile host will move to. However, though the loss quantity is little, the accumulated loss can del(rade the performance of the TCP, and can be a serious problem if data is sensitive to the loss of packets. In this paper, we can reduce a memory requesting in FA by restricting the mobile host to move within at most 2 movable cells and design the improved handoff protocol for Mil to receive packets seamlessly in spite of handoff. We can evaluate that the suggested method is superior to the previous method, as a result of comparing with it.

  • PDF

A Hierarchical Underwater Acoustic Sensor Network Architecture Utilizing AUVs' Optimal Trajectory Movements (수중 무인기의 최적 궤도 이동을 활용하는 계층적 수중 음향 센서 네트워크 구조)

  • Nguyen, Thi Tham;Yoon, Seokhoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.12
    • /
    • pp.1328-1336
    • /
    • 2012
  • Compared to terrestrial RF communications, underwater acoustic communications have several limitations such as limited bandwidth, high level of fading effects, and a large underwater propagation delay. In this paper, in order to tackle those limitations of underwater communications and to make it possible to form a large underwater monitoring systems, we propose a hierarchical underwater network architecture, which consists of underwater sensors, clusterheads, underwater/surface sink nodes, autonomous underwater vehicles (AUVs). In the proposed architecture, for the maximization of packet delivery ratio and the minimization of underwater sensor's energy consumption, a hybrid routing protocol is used. More specifically, cluster members use Tree based routing to transmit sensing data to clusterheads. AUVs on optimal trajectory movements collect the aggregated data from clusterhead and finally forward the data to the sink node. Also, in order to minimize the maximum travel distance of AUVs, an Integer Linear Programming based algorithm is employed. Performance analysis through simulations shows that the proposed architecture can achieve a higher data delivery ratio and lower energy consumption than existing routing schemes such as gradient based routing and geographical forwarding. Start after striking space key 2 times.

An Enhanced Xcast Protocol for Mobile Nodes in IP Networks (IP 망에서의 이동 노드를 위한 향상된 Xcast, 프로토콜)

  • Nam Sea-Hyeon
    • Journal of Internet Computing and Services
    • /
    • v.6 no.3
    • /
    • pp.85-95
    • /
    • 2005
  • Whereas the traditional multicast schemes based on Mobile IP can support a limited number of very large multicast groups, the Xcast protocol can support a very large number of small multicast groups, In the Xcast, the source node encodes the list of destinations in the Xcast header. Therefore, the maximum packet size in the network limits the number of destinations that a Xcast packet may have. In this paper, an enhanced Xcast protocol is proposed to solve the multicast group size limitation of the existing Xcast protocol in providing multicast service for mobile nodes. Moreover, the SIP (a very flexible control plane protocol) is integrated with the proposed multicast scheme to provide mobility awareness on the application layer. The simulation results verify that the proposed multicast scheme not only increases the packet delivery ratio and the data packet forwarding efficiency but also achieves low latency of packets in the network.

  • PDF

A Tactical Internet Geocasting Protocol for Efficient Message Delivery (효율적인 메시지 전달을 위한 전술인터넷 지오캐스팅 프로토콜)

  • Yoon, Sun-Joong;Ko, Young-Bae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.1050-1061
    • /
    • 2009
  • The Tactical Internet(TI) managed by Infantry Brigades is used for the purpose of sharing information of Command Control and Situation Awareness. When there are more than two destinations to transmit data in the TI system, a multicasting is utilized based on pre-defined multicast groups. However even in the case when a source node needs to send some messages like weathercast and attack alarm etc to only a part of Battalion or Brigades in a specific geographical region (destination region), the current TI multicasting protocol is designed to transmit the messages to the pre-defined group or all of the Battalion/Brigade nodes, resulting in inefficiency in terms of end-to-end delay and overhead. In this paper, we propose more efficient protocol for such cases, named as "Tactical Internet Geocasting (TIG)". The proposed scheme firstly checks whether the destination region belongs to one Battalion region or more than two Battalion regions using location information, and then performs a greedy forwarding from the source node to the destination region, followed by a local flooding inside of the destination region. With performance analysis and simulations using NS-2, TIG is compared to the current TI multicasting protocol (i.e., Simplified MDP) and the LBM (Location-based Multicast). The simulation results show that the proposed TIG is more efficient than both in terms of delay and network overhead.

Design of IoT Gateway for Storing Sensor Data using Ardulink based MQTT (Ardulink 기반 MQTT를 이용한 센서 데이터 저장을위한 IoT 게이트웨이 설계)

  • Nkenyereye, Lionel;Jang, Jong-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.744-747
    • /
    • 2017
  • The Internet of things (IoT) needs to be an event-driven approach for efficient real time response and processing. An IoT gateway is sometimes employed to provide the connection and translation between devices and the cloud. Storing data in the local database, and then forwarding it on the cloud is a task to be relegated to a gateway device In this paper, we propose the design of the IoT gateway with Fog computing for storing data from sensors into a local database. In the procedure of designing storing tasks, we propose to use the interfacing software known as Ardulink MQTT bridge. MQTT is a protocol for sensors to publish data to the clients. When it comes to needing historical data, MQTT connector can push MQTT data into SQL database. We write an MQTT client and based on the message topic insert the values into a SQL Database The design of IoT gateway with Fog computing adds value because it provides processing of the data across multiple devices before it sends to the cloud.

  • PDF

An Efficient Transport Protocol for Ad Hoc Networks: An End-to-End Freeze TCP with Timestamps

  • Cho, Sung-Rae;Sirisena, Harsha;Pawlikowski, Krzysztof
    • Journal of Communications and Networks
    • /
    • v.6 no.4
    • /
    • pp.376-386
    • /
    • 2004
  • In ad hoc networks, loss-based congestion window progression by the traditional means of duplicate ACKs and timeouts causes high network buffer utilization due to large bursts of data, thereby degrading network bandwidth utilization. Moreover, network-oriented feedbacks to handle route disconnection events may impair packet forwarding capability by adding to MAC layer congestion and also dissipate considerable network resources at reluctant intermediate nodes. Here, we propose a new TCP scheme that does not require the participation of intermediate nodes. It is a purely end-to-end scheme using TCP timestamps to deduce link conditions. It also eliminates spurious reductions of the transmission window in cases of timeouts and fast retransmits. The scheme incorporates a receiver-oriented rate controller (rater), and a congestion window delimiter for the 802.11 MAC protocol. In addition, the transient nature of medium availability due to medium contention during the connection time is addressed by a freezing timer (freezer) at the receiver, which freezes the sender whenever heavy contention is perceived. Finally, the sender-end is modified to comply with the receiver-end enhancements, as an optional deployment. Simulation studies show that our modification of TCP for ad hoc networks offers outstanding performance in terms of goodput, as well as throughput.

Routing Protocol for Hybrid Ad Hoc Network using Energy Prediction Model (하이브리드 애드 혹 네트워크에서의 에너지 예측모델을 이용한 라우팅 알고리즘)

  • Kim, Tae-Kyung
    • Journal of Internet Computing and Services
    • /
    • v.9 no.5
    • /
    • pp.165-173
    • /
    • 2008
  • Hybrid ad hoc networks are integrated networks referred to Home Networks, Telematics and Sensor networks can offer various services. Specially, in ad hoc network where each node is responsible for forwarding neighbor nodes' data packets, it should net only reduce the overall energy consumption but also balance individual battery power. Unbalanced energy usage will result in earlier node failure in overloaded nodes. it leads to network partitioning and reduces network lifetime. Therefore, this paper studied the routing protocol considering efficiency of energy. The suggested algorithm can predict the status of energy in each node using the energy prediction model. This can reduce the overload of establishing route path and balance individual battery power. The suggested algorithm can reduce power consumption as well as increase network lifetime.

  • PDF

An Efficient Multi-Hop Cluster Routing Protocol in Mobile Ad Hoc Network (이동 임시무선망에서의 효율적인 다중 홉 클러스터 라우팅 프로토콜)

  • Kim Si-Gwan
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.10 no.2
    • /
    • pp.13-20
    • /
    • 2005
  • An ad hoc wireless networks forms temporary network without the aid of fixed networks or centralized administration with a collection of wireless mobile hosts. In this case, it is necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination. This paper presents an efficient cluster-based routing protocol scheme for ad hoc networks. The cluster is used for path setup and data delivery. Our cluster-based routing algorithm is designed for the improvement of the load balance. Our simulation results show the improved performance for low mobility networks comparing with the previous works.

  • PDF