• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.59-69
• /
• 2006

Bluetooth is reputed as a wireless networking technology supplying ad-hoc networks between digital devices. In particular, Bluetooth scatternet is an essential part of dynamic ad-hoc networks. Yet, there have not been sufficient researches performed on scatternet environment. This paper proposes a scatternet reformation algorithm for ad-hoc networks for instances where some nodes enter or leave the scatternet. The proposed algorithm is a general algorithm that can be applied to many types of Bluetooth scatternet regardless of the topology. The proposed algorithm is made for two reformation cases, i.e., nodes leaving and nodes entering. For the reformation when nodes leave a scatternet, the recovery node vector (RNV) algorithm is proposed. It has short reformation setup delay because the process involves a single page process (not including inquiry process). For the reformation when nodes enter a scatternet, the entry node algorithm is proposed. This is a simple and easily implementable algorithm. In this paper, real hardware experiments are carried out to evaluate the algorithm's performance where the reformation setup delay, the reformation setup probability and the data transfer rate are measured. The proposed algorithm has shown improvement in the reformation setup delay and probability.

• Journal of Communications and Networks
• /
• 제12권4호
• /
• pp.334-345
• /
• 2010

In this paper, we study optimal tradeoffs of achievable throughput versus consumed power in wireless ad-hoc networks formed by a collection of multiple antenna nodes. Relying on adaptive modulation and/or dynamic channel coding rate allocation techniques for multiple antenna systems, we examine the maximization of throughput under power constraints as well as the minimization of transmission power under throughput constraints. In our examination, we also consider the impacts of enforcing quality of service requirements expressed in the form of channel coding block loss constraints. In order to properly model temporally correlated loss observed in fading wireless channels, we propose the use of finite-state Markov chains. Details of fading statistics of signal-to-interference-noise ratio, an important indicator of transmission quality, are presented. Further, we objectively inspect complexity versus accuracy tradeoff of solving our proposed optimization problems at a global as oppose to a local topology level. Our numerical simulations profile and compare the performance of a variety of scenarios for a number of sample network topologies.

• 한국통신학회논문지
• /
• 제36권5A호
• /
• pp.502-510
• /
• 2011

본 논문에서는 트리 기반의 센서네트워크에서 전력소모의 균형을 이루기 위한 시간 슬랏을 할당하는 알고리즘을 제안한다. 트리 토폴로지를 갖는 센서네트워크에서는 낮은 트리 깊이를 갖는 노드들이 더 많은 패킷을 처리하기 때문에 더 많은 전력을 소모한다. 따라서, 네트워크 생명이 단축되는 문제가 있다. 본 논문에서 제안하는 슬랏 스케줄링 알고리즘은 각 노드에게 수신 슬랏들을 먼저 할당하고 송신 슬랏들을 할당한다. 이러한 할당 방식은 패킷 결합과 필터링을 용이하게 하기 때문에 낮은 트리 깊이에 위치한 노드들의 부하를 감소시키는 효과가 있다. 시뮬레이션을 사용하여 제안한 알고리즘을 TreeMAC 에서 제안한 프레임-슬랏 할당 알고리즘과 비교함으로써 전력소모의 균형을 이룬다는 것을 확인하였다.

• Journal of Information Technology Applications and Management
• /
• 제15권1호
• /
• pp.261-270
• /
• 2008

Wireless Mesh Networks (WMNs) have emerged as one of the new hot topics in wireless communications. WMNs have been suggested for use in situations in which some or all of the users are mobile or are located in inaccessible environments. Unconstrained transmission in a WMN may lead to the time overlap of two or more packet receptions, called collisions or interferences, resulting in damaged useless packets at the destination. There are two types of collisions; primary collision, due to the transmission of the stations which can hear each other, and hidden terminal collision, when stations outside the hearing range of each other transmit to the same receiving stations. For a WMN, direct collisions can be minimized by short propagation and carrier sense times. Thus, in this paper we only consider hidden terminal collision while neglecting direct collisions. To reduce or eliminate hidden terminal collision, code division multiple access (CDMA) protocols have been introduced. The collision-free property is guaranteed by the use of spread spectrum communication techniques and the proper assignment of orthogonal codes. Such codes share the fixed channel capacity allocated to the network in the design stage. Thus, it is very important to minimize the number of codes while achieving a proper transmission quality level in CDMA WMNs. In this paper, an efficient heuristic code assignment algorithm for eliminating hidden terminal collision in CDMA WMNs with general topology.

• 한국통신학회논문지
• /
• 제30권11B호
• /
• pp.722-729
• /
• 2005

EPON망은 점대 다중점 구조를 가진 경제적인 가입자망 기술로 떠오르고 있다. 점대 다중점 구조는 하향 브로드캐스팅과 상향 점대점 종신을 제공하므로, EPON에서는 다중점 제어 프로토콜(MPCP)를 이용하여 점대점 에뮬레이션과 공유 LAN 에뮬레이션 기능을 제공한다. 본 논문에서는 EPON망에서 OLT와 ONU사이의 논리적 링크기반의 멀티캐스팅 또는 VLAN 서비스를 제공하기 위하여 논리적 그룹 식별자(LGID: Logical Group Identification)를 제안한다. 논리적 그룹 식별자와 더불어 프레임 설정 및 필터링 규칙을 제안함으로써 가입자별 차별화된 방송 및 멀티캐스팅 서비스 제공 방안을 제시한다. 더불어, 논리적 링크 기반의 VLAN 서비스를 제공함으로써 동일한 OLT에 연결된 ONU들을 복수의 서브 그룹으로 분리하는 방안을 제시한다.

• Journal of Communications and Networks
• /
• 제3권4호
• /
• pp.324-333
• /
• 2001

The Differentiated Services (Diffserv) framework has been proposed by the IETF as a simple service structure that can provide different Quality of Service (QoS) to different classes of packets in IP networks. IP packets are classified into one of a limited number of service classes, and are marked in the packet header for easy classification and differentiated treatments when transferred within a Diffserv domain. The Diffserv framework defines simple and efficient QoS differentiation mechanisms for the Internet. However, the original Diffserv concept does not provide a complete QoS management framework. Since traffic flows in IP networks are unidirectional from one network point to the other and routing paths and traffic demand get dynamically altered, it is important to monitor end-to-end traffic status, as well as traffic status in a single node. This paper suggests a distributed QoS monitoring method that collects the statistical data of each service class in every Diffserv router and calculates edge-to-edge QoS of the aggregated IP flows by combining routing topology and traffic status. A format modeling of edge-to-edge Diffserv flows and algorithms for aggregating edge-to-edge QoS is presented. Also an SNMP-based QoS management prototype system for Diffserv networks is presented, which validates our QoS management framework and demonstrates useful service management functionality.

• 한국통신학회논문지
• /
• 제32권5B호
• /
• pp.247-256
• /
• 2007

본 논문에서는 무선 센서 네트워크를 위한 위치 정보의 시간차를 이용한 라우팅 프로토콜(Geo-Back)을 제안한다. Geo-Back은 기존의 위치 기반 라우팅 알고리즘과 달리 주기적인 이웃 노드들의 위치 정보 혹은 하나의 홉 내에 있는 이웃 노드들 수의 정보를 이용하지 않고, 오직 소스와 목적지 노드의 위치 정보만을 이용하며, 최적의 back-off 시간 메커니즘을 사용하여 패킷 전송을 결정한다. 빈번한 토폴로지 변화 환경 하에서, 제안하는 Geo-Back 프로토콜은 업데이트를 위한 브로드캐스트 알고리즘을 사용하지 알고 빠르게 목적지까지 전송하기 위한 최적의 다음 홉을 찾을 수 있으며, 분석 결과 밀집 환경의 무선 센서 네트워크에서 확장성과 향상된 성능을 확인 하였다.

• BMB Reports
• /
• 제46권1호
• /
• pp.41-46
• /
• 2013

Identifying genes indispensable for an organism's life and their characteristics is one of the central questions in current biological research, and hence it would be helpful to develop computational approaches towards the prediction of essential genes. The performance of a predictor is usually measured by the area under the receiver operating characteristic curve (AUC). We propose a novel method by implementing genetic algorithms to maximize the partial AUC that is restricted to a specific interval of lower false positive rate (FPR), the region relevant to follow-up experimental validation. Our predictor uses various features based on sequence information, protein-protein interaction network topology, and gene expression profiles. A feature selection wrapper was developed to alleviate the over-fitting problem and to weigh each feature's relevance to prediction. We evaluated our method using the proteome of budding yeast. Our implementation of genetic algorithms maximizing the partial AUC below 0.05 or 0.10 of FPR outperformed other popular classification methods.

• 제어로봇시스템학회논문지
• /
• 제13권9호
• /
• pp.920-926
• /
• 2007

Establishing a fixed path for the message delivery through a wireless network is impossible due to the mobility. Among the number of routing protocols that have been proposed for wireless ad-hoc networks, the AODV(Ad-hoc On-demand Distance Vector) algorithm is suitable in the case of highly dynamic topology changes, along with ZigBee Routing(ZBR), with the exception of route maintenance. Accordingly, this paper introduces a routing scheme focusing on the energy efficiency and route discovery time for wireless alarm systems using IEEE 802.15.4-based ZigBee. Essentially, the proposed routing algorithm utilizes a cluster structure and applies ZBR within a cluster and DSR (Dynamic Source Routing) between clusters. The proposed algorithm does not require a routing table for the cluster heads, as the inter-cluster routing is performed using DSR. The performance of the proposed algorithm is evaluated and compared with ZBR using an NS2 simulator. The results confirm that the proposed Cluster-based AODV (CAODV) algorithm is more efficient than ZBR in terms of the route discovery time and energy consumption.

• Journal of Computing Science and Engineering
• /
• 제4권2호
• /
• pp.128-152
• /
• 2010

With the advance of computer and communication technologies, wireless sensor networks (WSNs) are increasingly used in many aspects of our daily life. However, since the battery lifetime of WSN nodes is restricted, the WSN lifetime is also limited. Therefore, it is crucial to determine this limited lifetime in advance for preventing service interruptions in critical applications. This paper proposes a feasible static analysis approach to estimating the worstcase lifetime of a WSN. Assuming known routes with a given sensor network topology and SMAC as the underlying MAC protocol, we statically estimate the lifetime of each sensor node with a fixed initial energy budget. These estimations are then compared with the results obtained through simulation which run with the same energy budget on each node. Experimental results of our research on TinyOS applications indicate that our approach can safely and accurately estimate worst-case lifetime of the WSN. To the best of our knowledge, our work is the first one to estimate the worst-case lifetime of WSNs through a static analysis method.