• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2011년도 추계학술발표대회
• /
• pp.97-100
• /
• 2011

Underwater Wireless Acoustic Sensor Networks have become an important area of research over the recent decades. Designing an underwater network, especially a media access control (MAC) protocol, faces many challenges due to the peculiarities of underwater environment. One of the most important problems is resulted from long and variable propagation delay of the acoustic wave. In this paper, we propose a new method, namely Dynamic Timeout over Multiple Access with Collision Avoidance (DT/MACA), which is designed to handle long and high variable propagation delay in underwater acoustic sensor networks. In this proposed method, the difference timeout intervals are evaluated and applied to each network transmission. Simulation results show that our work not only improves the network throughput, but also decreases the unnecessary retransmission and end-to-end delay.

• 정보처리학회논문지C
• /
• 제9C권4호
• /
• pp.513-522
• /
• 2002

기존의 end-to-end 방식에서는 네트워크 내부에서 혼잡(congestion)이 발생했을 경우 각 전송자가 즉시 알아 낼 수 없기 때문에 일정시간 동안 수신된 패킷(packet)의 순서에 대한 정보로 흔잡이 발생했는지에 대해 추론하는 것이다. 이와 같은 방법은 RTT(Round Trip Time)가 커지면 혼잡이 발생할 경우 전송자가 전송 양을 줄인다 해도 이미 전송된 패킷들로 인하여 흔잡이 가중되며 전체적인 TCP 동기화 (TCP Global synchronization) 현상을 피할 수 없게 된다. 반면 네트워크 내부에서 직접적으로 정보를 얻거나 처리를 해 줄 수 있다면 혼잡 발생과 동시에 처리가 가능함으로 기존 방식보다 처리율이 향상될 것이다. 본 논문에서는 액티브 라우터의(Active Network) 피드백 메커니즘을 이용하여 네트워크 내부 정보를 각 전송자가 이용할 수 있도록 하기 위해 라우터와의 통신을 이용하였으며, 코어 라우터의 큐 모듈은 RED(Random Early Detection)를 응용하여 ACC의 누락 메커니즘을 개선하였다. ACC를 확장한 메커니즘인 EACC(Enhanced Active Congestion Control)를 제시하고 모의실험을 통해 기존의 혼잡제어나 ACC(Active Congestion Control)보다 성능이 향상됨을 보여준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권9호
• /
• pp.4272-4286
• /
• 2016

In resource constrained sensor networks, usage of efficient routing protocols can have significant impact on energy dissipation. To save energy, we propose an energy efficient routing protocol. In our approach, which integrates clustering and routing in sensor networks, we perform network coding during data routing in order to achieve additional power savings in the cluster head nodes. Efficacy of the proposed method in terms of the throughput and end-to-end delay is demonstrated through simulation results. Significant network lifetime is also achieved as compared with other techniques.

• Journal of Information Processing Systems
• /
• 제4권2호
• /
• pp.41-52
• /
• 2008

In this paper, we discuss a novel reservation-based, asynchronous MAC protocol called 'Multi-rate Multi-hop MAC Protocol' (MMMP) for multi-hop ad hoc networks that provides QoS guarantees for multimedia traffic. MMMP achieves this by providing service differentiation for multirate real-time traffic (both constant and variable bit rate traffic) and guaranteeing a bounded end-to-end delay for the same while still catering to the throughput requirements of non real time traffic. In addition, it administers bandwidth preservation via a feature called 'Smart Drop' and implements efficient bandwidth usage through a mechanism called 'Release Bandwidth'. Simulation results on the QualNet simulator indicate that MMMP outperforms IEEE 802.11 on all performance metrics and can efficiently handle a large range of traffic intensity. It also outperforms other similar state-of-the-art MAC protocols.

• International Journal of Computer Science & Network Security
• /
• 제21권1호
• /
• pp.152-161
• /
• 2021

The paper focuses on Device-to-device (D2D) Architectures evaluation frameworks. D2D communication and discovery can improve spectrum usage efficiency and optimize the tradeoffs between throughput and energy consumption. The target operation modes involve both indirect communication between two nodes via a base station or the direct communication among proximal nodes, enabling use cases that can support communications out of cellular coverage, as well as low end-end delay requirements. The paper will present the architectural evolution of D2D networks within 3GPP standardization and will highlight key network functionalities and signaling protocols. It will also identify key analytical and simulation models that can be used to assess the performance and energy efficiency of resource allocation strategies, and it will present a suitable cross-layer integrated framework.

• 대한핵의학회지
• /
• 제36권1호
• /
• pp.80-86
• /
• 2002

Presently, PET is widely used in oncology, but suffers from limitations of poor anatomical information. To compensate for this weakness, a combined PET/CT has been developed by Professor Townsend at the University of Pittsburgh Medical Center. The prototype was designed as PET and CT components combined serially in a gantry. The CT images provide not only accurate anatomical location of the lesions but also transmission map for attenuation correction. More than 300 cancer patients have been studied with the prototype of PET/CT since July, 1998. The PET/CT studies affected the managements in about $20{\sim}30%$ of cancer patients. These changes are a consequence of the more accurate localization of functional abnormalities, and the distinction of pathological from normal physiological uptake. Now a variety of combined PET/CT scanners with high-end PET and high-end CT components are commercially available. With the high speed of multi-slice helical CT, throughput of patient's increases compared to conventional PET. Although some problems (such as a discrepancy in breathing state between the two modalities) still remain, the role of PET/CT in oncology is very promising.

• Journal of Communications and Networks
• /
• 제5권3호
• /
• pp.202-214
• /
• 2003

The central challenge in the design of ad-hoc networks is the development of dynamic routing protocol that efficiently finds route between mobile nodes. Several routing protocols such as DSR, AODV and DSDV have been proposed in the literature to facilitate communication in such dynamically changing network topology. In this paper, a Node Transition Probability (NTP) based routing algorithm, which determines stable routes using the received power from all other neighboring nodes is proposed. NTP based routing algorithm is designed and implemented using Global Mobile Simulator (GloMoSim), a scalable network simulator. The performance of this routing algorithm is studied for various mobility models and throughput, control overhead, average end-to-end delay, and percentage of packet dropped are compared with the existing routing protocols. This algorithm shows acceptable performance under all mobility conditions. The results show that this algorithm maximizes the bandwidth utilization during heavy traffic with lesser overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2362-2378
• /
• 2017

To mitigate the performance degradation caused by performance anomaly, a number of channel assignment algorithms have been proposed for multi-rate wireless mesh networks. However, network conditions have not been fully considered for routing process in these algorithms. In this paper, a joint scheme called Multi-rate Dijkstra's Shortest path - Rate Separated (MDSRS) is proposed, combining routing metrics and channel assignment algorithm. In MDSRS, the routing metric are determined through the synthesized deliberations of link costs and rate matches; then the rate separated channel assignment is operated based on the determined routing metric. In this way, the competitions between high and low rate links are avoided, and performance anomaly problem is settled, and the network capacity is efficiently improved. Theoretical analysis and NS-3 simulation results indicate that, the proposed MDSRS can significantly improve the network throughput, and decrease the average end-to-end delay as well as packet loss probability. Performance improvements could be achieved even in the heavy load network conditions.

• 대한임베디드공학회논문지
• /
• 제18권2호
• /
• pp.67-73
• /
• 2023

Tree routing is one of appropriate routing schemes in wireless sensor network because the complexity of this approach is relatively low. But, congestion at a specific node may happen because a parent node toward a sink node is usually selected in one hop way, specially where large number of node are deployed. As feasible solution for this problem, multiple paths and sinks schemes can be applied. However, the performance of these schemes are not proved and analyzed yet. In this paper, we conduct diverse simulaton scenarios performance evaluation for these cases to identify the improvement and analyze the impact of schemes. The performance is measured in the aspects of packet transmission rate, throughput, and end-to-end delay as a function of amount of network traffic.

• 한국경영과학회지
• /
• 제41권2호
• /
• pp.53-65
• /
• 2016

Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.