• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1527-1552
• /
• 2018

The rapidly-evolving demand of applications using wireless sensor networks in several areas such as building and industrial automation or smart cities, among other, makes it necessary to determine and provide QoS support mechanisms which can satisfy the requirements of applications. In this paper we propose a mechanism that establishes different QoS levels, based on Publish/Subscribe model for wireless networks to meet application requirements, to provide reliable delivery of packet and timeliness. The first level delivers packets in a best effort way. The second one intends to provide reliable packet delivery with a novel approach for Retransmission Timeout (RTO) calculation, which adjusts the RTO depending on the subscriber Packet Delivery Ratio (PDR). The third one provides the same reliable packet delivery as the second one, but in addition, it provides data aggregation trying to be efficient in terms of energy consumption and the use of network bandwidth. The last one provides timeliness in the packet delivery. We evaluate each QoS Level with several performance metrics such as PDR, Message Delivery Ratio, Duplicated and Retransmitted Packet Ratio and Packet Timeliness Ratio to demonstrate that our proposal provides significant improvements based on the increase of the PDR obtained.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권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.

• 한국멀티미디어학회논문지
• /
• 제13권6호
• /
• pp.849-864
• /
• 2010

This paper proposes a multipath routing protocol called cross-layer multipath AODV (CM-AODV) for wireless ad hoc networks, which selects multiple routes on demand based on the signal-to-interference plus noise ratio (SINR) measured at the physical layer. Note that AODV (Ad hoc On-demand Distance Vector) is one of the most popular routing protocols for mobile ad hoc networks. Each time a route request (RREQ) message is forwarded hop by hop, each forwarding node updates the route quality which is defined as the minimum SINR of serialized links in a route and is contained in the RREQ header. While achieving robust packet delivery, the proposed CM-AODV is amenable to immediate implementation using existing technology by neither defining additional packet types nor increasing packet length. Compared to the conventional multipath version of AODV (which is called AOMDV), CM-AODV assigns the construction of multiple paths to the destination node and makes it algorithmically simple, resulting in the improved performance of packet delivery and the less overhead incurred at intermediate nodes. Our performance study shows that CM-AODV significantly outperforms AOMDV in terms of packet delivery ratio and average end-to-end delay, and results in less routing overhead.

• 스마트미디어저널
• /
• 제13권1호
• /
• pp.45-51
• /
• 2024

Long Range Wide Area Network (LoRaWAN) is a widely adopted Internet of Things (IoT) protocol due to its high range and lower energy consumption. LoRaWAN utilizes Adaptive Data Rate (ADR) for efficient resource (e.g., spreading factor and transmission power) management. The ADR manages these two resource parameters on the network server side and end device side. This paper focuses on analyzing the ADR and Gaussian ADR performance of LoRaWAN. We have performed NS3 simulation under a static scenario by varying the antenna height. The simulation results showed that antenna height has a significant impact on the packet delivery ratio. Higher antenna height (e.g., 50 m) has shown an improved packet success ratio when compared with lower antenna height (e.g., 10 m) in static and mobility scenarios. Based on the results, it is suggested to use the antenna at higher allevation for successful packet delivery.

• 한국군사과학기술학회지
• /
• 제16권3호
• /
• pp.332-339
• /
• 2013

The network nodes in a tactical network moves continuously and due to the physical and electronic obstacles, the connections are not always available. Due to the frequent disconnections, it is hard to discover the path among the nodes in a DTN. According to PROPHET(Probabilistic Routing Protocol using History of Encounters and Transitivity), one of the most well-known DTN routing protocols, a DTN node determines whom to forward a packet according to the packet delivery probability. From the viewpoint of a node, the packet delivery probability of another node is degraded while the nodes are disconnected whereas it is improved when they encounter. In this paper, we enhance the algorithm estimating the packet probability by considering the encounter count as an additional parameter. Our algorithm prefers the node that encounters the destination more frequently in selecting the next hop toward the destination. We evaluated the performance of our algorithm by simulating military operations using a DTN-dedicated simulator. Through the simulations, we show that our proposed algorithm achieve higher packet delivery ratio with similar overhead compared with PROPHET.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.4856-4871
• /
• 2015

Backpressure based scheduling has been considered as a promising technique for improving the throughput of a wide range of communication networks. However, this scheduling technique has not been well studied for heterogeneous wireless networks. In this paper, we propose a virtual-queue based backpressure scheduling (VQB) algorithm for heterogeneous multi-hop wireless networks. The VQB algorithm introduces a simple virtual queue for each flow at a node for backpressure scheduling, whose length depends on the cache size of the node. When calculating flow weights and making scheduling decisions, the length of a virtual queue is used instead of the length of a real queue. We theoretically prove that VQB is throughput-optimal. Simulation results show that the VQB algorithm significantly outperforms a classical backpressure scheduling algorithm in heterogeneous multi-hop wireless networks in terms of the packet delivery ratio, packet delivery time, and average sum of the queue lengths of all nodes per timeslot.

• 정보과학회 논문지
• /
• 제44권10호
• /
• pp.1062-1070
• /
• 2017

무선 센서 망에서 실시간 전송 연구들은 실시간 요구사항을 만족시키기 위해 소스 노드부터 싱크 노드까지 응용에서 요구되는 전달 속도보다 높은 전달 속도를 갖는 노드를 이용하는 방안을 제안한다. 이 요구 전달 속도는 패킷이 싱크에 도달하기까지 고정되기 때문에, 전송 범위 내 실시간 요구사항을 만족하는 노드가 없는 혼잡 지역에서 실시간 전송을 보장하기 어렵다. 이 방식은 싱크 노드에 가까워질수록 패킷의 실제 전달 속도는 높아지는 특성을 갖는다. 즉, 패킷은 실시간 전송을 만족하는 시간보다 이른 시간에 싱크 노드에 전달될 수 있다. 본 논문은 패킷 전달 과정에서 발생하는 시간적 이득을 이용하여 패킷의 전달 속도를 조절함으로써 향상된 실시간 전송 방안을 제안한다. 송신 노드는 수신된 패킷 정보를 이용하여 다음 전달 노드를 선택하기 위한 요구 전달 속도를 재계산한다. 시뮬레이션 결과는 실시간 전송관점에서 제안 방안이 기존 방안들보다 실시간 전송 성공률이 향상됨을 보인다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2010년도 춘계학술대회
• /
• pp.750-752
• /
• 2010

MANET은 노드간의 이동성을 지원하고 추가의 인프라가 필요 없는 무선 이동 네트워크로 관심을 받고 있다. MANET의 노드 이동속도는 보행속도에서 차량이동속도에 이르기까지 다양하다. 본 연구에서는 MANET에서 VoIP 성능을 노드 이동속도 측면에서 분석해본다. 노드의 이동속도를 보행속도, 차량속도 및 고속이동으로 분류하여 VoIP 성능을 분석한다. 성능 파라메타로는 PDR(Packet Delivery Ratio), MOS(Mean Opinion Score)를 사용했다.

• 대한임베디드공학회논문지
• /
• 제5권3호
• /
• pp.157-167
• /
• 2010

One of the most famous proactive routing protocols, DSDV (Destination -Sequenced Distance-Vector), is based on the minimum hop count. This paper suggests BIMP(Bypass Information Multi-Path) DSDV routing protocol that this protocol could route reliably as it can take the information of the bypass for the solution of the problem on EHMP DSDV. In this paper, the protocol checks throughput, packet delivery delay, packet delivery ratio, number of management messages, packet transmit finish time, etc on the traffic compared to DSDV, HMP DSDV, and EHMP DSDV protocols.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.433-435
• /
• 2007

Geographic wireless sensor networks use position information for Greedy routing. Greedy routing works well in dense network where as in sparse network it may fail and require the use of recovery algorithms. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costlier for resource constrained position based wireless sensor type networks. In the present work, we propose a Void Avoidance Algorithm (VAA); a novel idea based on virtual distance upgrading that allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forward packet using greedy routing only without recovery algorithm. In VAA, the stuck node upgrades distance unless it finds next hop node which is closer to the destination than itself. VAA guarantees the packet delivery if there is a topologically valid path exists. NS-2 is used to evaluate the performance and correctness of VAA and compared the performance with GPSR. Simulation results show that our proposed algorithm achieves higher delivery ratio, lower energy consumption and efficient path.