• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권2호
• /
• pp.209-218
• /
• 2009

In a wireless sensor network(WSN) each sensor node deals with numerous sensing data elements. For the sake of energy efficiency and network lifetime, sensing data must be handled effectively. A technique used for this is data aggregation. Sending/receiving data involves numerous steps such as MAC layer control packet handshakes and route path setup, and these steps consume energy. Because these steps are involved in all data communication, the total cost increases are related to the counts of data sent/received. Therefore, many studies have proposed sending combined data, which is known as data aggregation. Very effective methods to aggregate sensing data have been suggested, but there is no means of deciding how long the sensor node should wait for aggregation. This is a very important issue, because the wait time affects the total communication cost and data reliability. There are two types of data aggregation; the data counting method and the time waiting method. However, each has weaknesses in terms of the delay. A hybrid method can be adopted to alleviate these problems. But, it cannot provide an optimal point of aggregation. In this paper, we suggest a stochastic-based data aggregation scheme, which provides the cost(in terms of communication and delay) optimal aggregation point. We present numerical analysis and results.

• 전기학회논문지P
• /
• 제60권3호
• /
• pp.150-154
• /
• 2011

The technology to build high speed network using low cost DSL in the areas where the cost to build high speed network is high and the network environment is not very accommodating is important in providing the high speed network that meets the user demand and utilizing the network resources in an efficient way. This study presents development of the link aggregation equipment that performs the access control and firewall functions for packet processing based LAN users. The equipments developed support up to 5 line link aggregation as opposed to current 2 line link aggregation. The equipments also allow the use of high speed network in the areas where the network environment is not very accommodating. Also, the fail-over function is added to each line to provide reliability and the self-security function is enhanced to protect the network from unauthorized use and prevents waste of network resources by authorized users.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권5호
• /
• pp.527-547
• /
• 2009

Moving object management is widely used in traffic, logistic and data mining applications in ubiquitous environments. It is required to analyze spatio-temporal data and trajectories for moving object management. In this paper, we proposed a novel index structure for spatio-temporal aggregation of trajectory in a constrained network, named aCN-RB-tree. It manages aggregation values of trajectories using a constraint network-based index and it also supports direction of trajectory. An aCN-RB-tree consists of an aR-tree in its center and an extended B-tree. In this structure, an aR-tree is similar to a Min/Max R-tree, which stores the child nodes' max aggregation value in the parent node. Also, the proposed index structure is based on a constrained network structure such as a FNR-tree, so that it can decrease the dead space of index nodes. Each leaf node of an aR-tree has an extended B-tree which can store timestamp-based aggregation values. As it considers the direction of trajectory, the extended B-tree has a structure with direction. So this kind of aCN-RB-tree index can support efficient search for trajectory and traffic zone. The aCN-RB-tree can find a moving object trajectory in a given time interval efficiently. It can support traffic management systems and mining systems in ubiquitous environments.

• 대한전자공학회논문지TC
• /
• 제39권6호
• /
• pp.1-1
• /
• 2002

본 논문은 기존의 Topology Aggregation 알고리즘에 따른 성능을 비교 평가하는데 초점을 두었다. 이를 위해 PNNI 라우팅 시뮬레이터를 설계 및 구현하여 TA알고리즘의 성능을 비교 분석하였다. ATM Forum에서는 계층으로 구성된 네트워크에서 계층적 라우팅 프로토콜과 토폴로지 정보를 요약하기 위한 PNNI 1.0 규격을 권고하였다. 토폴로지 정보를 요약하는 일련의 과정을 Topology Aggregation 이라 하며, 라우팅과 네트워크의 확장성 및 보안에 중요한 역할을 하게 된다. 따라서 라우팅 알고리즘과 Topology Aggregation 알고리즘이 PNNI 네트워크의 성능에 중요한 변수가 된다. 이를 비교·분석하기 위해 구현된 PNNI 라우팅 시뮬레이터는 라우팅 알고리듬 및 Topology Aggregation 알고리듬 개발에 적용되어 빠른 기간 내에 보다 개선된 알고리듬 개발에 사용될 수 있다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2012년도 춘계학술발표대회
• /
• pp.607-608
• /
• 2012

Data aggregation is a fundamental problem in wireless sensor networks which attracts great attention in recent years. Delay and energy efficiencies are two crucial issues of designing a data aggregation scheme. In this paper, we propose a distributed, energy efficient algorithm for collecting data from all sensor nodes with the minimum latency called Delay-aware Power-efficient Data Aggregation algorithm (DPDA). The DPDA algorithm minimizes the latency in data collection process by building a time efficient data aggregation network structure. It also saves sensor energy by decreasing node transmission distances. Energy is also well-balanced between sensors to achieve acceptable network lifetime. From intensive experiments, the DPDA scheme could significantly decrease the data collection latency and obtain reasonable network lifetime compared with other approaches.

• International Journal of Computer Science & Network Security
• /
• 제23권3호
• /
• pp.31-48
• /
• 2023

The popularization of smart devices and subsequent optimization of their sensing capacity has resulted in a novel mobile crowdsensing (MCS) pattern, which employs smart devices as sensing nodes by recruiting users to develop a sensing network for multiple-task performance. This technique has garnered much scholarly interest in terms of sensing range, cost, and integration. The MCS is prevalent in various fields, including environmental monitoring, noise monitoring, and road monitoring. A complete MCS life cycle entails task allocation, data collection, and data aggregation. Regardless, specific drawbacks remain unresolved in this study despite extensive research on this life cycle. This article mainly summarizes single-task, multi-task allocation, and space-time multi-task allocation at the task allocation stage. Meanwhile, the quality, safety, and efficiency of data collection are discussed at the data collection stage. Edge computing, which provides a novel development idea to derive data from the MCS system, is also highlighted. Furthermore, data aggregation security and quality are summarized at the data aggregation stage. The novel development of multi-modal data aggregation is also outlined following the diversity of data obtained from MCS. Overall, this article summarizes the three aspects of the MCS life cycle, analyzes the issues underlying this study, and offers developmental directions for future scholars' reference.

• 한국멀티미디어학회논문지
• /
• 제9권12호
• /
• pp.1529-1541
• /
• 2006

Moving objects have been widely employed in traffic and logistic applications. Spatio-temporal aggregations mainly describe the moving object's behavior in the spatial data warehouse. The previous works usually express the object moving in some certain region, but ignore the object often moving along as the trajectory. Other researches focus on aggregation and comparison of trajectories. They divide the spatial region into units which records how many times the trajectories passed in the unit time. It not only makes the storage space quite ineffective, but also can not maintain spatial data property. In this paper, a spatio-temporal aggregation index structure for moving object trajectory in constrained network is proposed. An extended B-tree node contains the information of timestamp and the aggregation values of trajectories with two directions. The network is divided into segments and then the spatial index structure is constructed. There are the leaf node and the non leaf node. The leaf node contains the aggregation values of moving object's trajectory and the pointer to the extended B-tree. And the non leaf node contains the MBR(Minimum Bounding Rectangle), MSAV(Max Segment Aggregation Value) and its segment ID. The proposed technique overcomes previous problems efficiently and makes it practicable finding moving object trajectory in the time interval. It improves the shortcoming of R-tree, and makes some improvement to the spatio-temporal data in query processing and storage.

• ETRI Journal
• /
• 제35권2호
• /
• pp.234-244
• /
• 2013

Internet protocol television (IPTV) service depends on the network quality of service (QoS) and bandwidth of the broadband service provider. IEEE 802.16j mobile multihop relay Worldwide Interoperability for Microwave Access networks have the opportunity to offer high bandwidth capacity by introducing relay stations. However, to actually satisfy QoS requirements for offering IPTV services (HDTV, SDTV, Web TV, and mobile TV) for heterogeneous users' requests, providers must use a video server for each IPTV service type, which increases the network load, especially bandwidth consumption and forwarding time. In this paper, we present a solution for forwarding IPTV video streaming to diverse subscribers via an 802.16j broadband wireless access network. In particular, we propose a new multicast tree construction and aggregation mechanism based on the unique property of prime numbers. Performance evaluation results show that the proposed scheme reduces both bandwidth consumption and forwarding time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권2호
• /
• pp.344-358
• /
• 2011

Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제16권11호
• /
• pp.1071-1075
• /
• 2010

무선 센서 네트워크에 활용되는 센서 노드는 제한된 전력, 메모리 동의 한정된 자원을 지니기 때문에, 제한된 에너지를 효율적으로 관리하기 위한 데이터 집계 기법의 연구가 활발히 진행되어 왔다. 한편, 센서 네트워크는 무선통신을 수행하기 때문에 공격자에게 쉽게 데이터 노출될 수 있다. 따라서, 센서 네트워크에서 데이터 집계를 위한 데이터 보호 기법에 관한 연구가 필수적이다. 그러나, 기존 데이터 집계를 위한 데이터 보호 기법은 네트워크 구성 및 데이터 집계 처리 시, 다수의 연산과 데이터 전송이 발생한다. 이러한 문제점을 해결하기 위하여, 본 논문에서는 데이터 집계를 위한 힐버트 커브(hilbert curve) 기반 데이터 보호 기법을 제안한다. 제안하는 기법은 트리 기반의 라우팅을 구성하여 이웃노드와의 통신을 최소화한다. 또한 seed에 기반한 힐버트 커브 기법을 통해 데이터를 암호화함으로써, 센서 노드간의 통신 시 공격자로부터 데이터를 보호할 수 있다. 마지막으로, 제안하는 기법이 메시지 전송량 및 센서노드 평균 수명 측면에서 기존 연구보다 우수함을 보인다.