• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.933-937
• /
• 2009

This paper proposes a dynamic timeout scheduling for energy efficient and accurate aggregation by analyzing the single hop delay in wireless sensor networks based on IEEE 802.15.4. The proposed scheme dynamically configures the timeout value depending on both the number of nodes sharing a channel and the type of wireless media, with considering the results of delay analysis of the single hop delay. The timeout of proposed scheme is much smaller than the maximum single hop delay which is used as the timeout of traditional data aggregation schemes. Therefore the proposed scheme considerably reduces the energy consumption of idle monitoring for waiting messages. Also, the proposed scheme maintains the data accuracy by guaranteeing the reception ratio required by the sensor network applications. Extensive simulation has revealed that proposed scheme enhances energy consumption by 30% with maintaining data accuracy, as compared with the TAG data aggregation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.650-652
• /
• 2013

As VANET(Vehicular Ad-hoc NETwork) improves road safety, efficiency, and comfort, and provides a value-added service such as commerce information or internet access. it is the most important technology in ITS(Intelligent Transportation System). But, In VANETs, better communication efficiency can be achieved by sacrificing security and vice versa. VANETs cannot get started without either of them. Therefore, to solve these problems simultaneously, this paper proposes MAC(Message Authentication Code) based SDAP(Secure Data Aggregation Protocol) which removes redundant data or abnormal data between vehicles and verifies the integrity of message. The MAC based SDAP not only improves the efficiency of data delivery but also enhances the security by detecting malicious attacks such as propagation jamming attack, forgery attack, and disguised attack.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.6
• /
• pp.689-694
• /
• 2014

DDoS attacks on MANET makes disable any node which support network function, cause critical results as a stopping of entire network service or separation to some parts. Packet aggregation, which gather some pieces of short length into a certain length of data, improves transmission performances on MANETs. In this paper, some effects on transmission performance of packet aggregation transmission be caused by DDoS Attacks are measured and analyzed in point of end-to-end level. MANET simulator, based on NS-2, is used for measurement end-to-end performances. MOS, connection rate, delay and packet loss rate is used as performance parameters. VoIP traffic is used for object service measurement. Finally, it is suggested that number of packet aggregation is more then 4 for keeping the transmission quality over MANETs under DDoS attacks.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.171-173
• /
• 2000

본 논문에서는 ATM PNNI(Private Network-Network Interface) 망에서 경로 배정을 위해 필요로 하는 링크 상태 정보(link state information)를 효율적으로 집단화(aggregation)하는 두 가지 방법을 제시한다. 이 방법들은 집단화할 동료 집단(peer group)의 경계노드(border node)들을 셔플넷(shufflenet)이나 de Bruijn 그래프의 노드들로 사상시킴으로써 표현해야 할 링크의 수를 완전 그물망 방법(full-mesh approach)의 N2에서 aN(a는 정수, N은 경계노드 수)으로 줄인다. 이는 공간 복잡도가 0(N)인 신장 트리(apanning tree) 방법에서 필요로 하는 링크의 수와 비슷하지만, 신장 트리 방법과는 달리 비대칭망(asymmetric network)에서 사용할 수 있다는 것이 큰 장점이다. 모의 실험 결과 셔플넷 방법은 aN개의 링크만을 표현하면서도 상태 정보의 정확성은 완전 그물망 방법에 근접함을 알 수 있었고, de Bruijn 방법은 정보의 정확성에서는 셔플넷 방법에 못 미치지만 가장 널리 사용되고 있는 별모양 방법(star approach) 방법보다는 훨씬 정확하며, 계산 복잡도 면에서 셔플넷 방법보다 효율적이었다.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.99-110
• /
• 2009

Currently, there are many applications being developed based on sensor network technology. A tracking method for moving objects in sensor network is one of the main issue of this field. There is a little research on this issue, but most of the existing work has two problems. The first problem is a communication overhead for visiting sensor nodes many times to track a moving object. The second problem is an disability for dealing with many moving objects at a time. To resolve the problems, we, in this paper, propose a signature-based tracking method using efficient data aggregation for moving objects, called SigMO-TRK. For this, we first design a local routing hierarchy tree to aggregate moving objects' trajectories efficiently by using a space filtering technique. Secondly, we do the tracking of all trajectories of moving objects by using signature in a efficient way, our approach generates signatures to method. In addition, by extending the SigMO-TRK, we can retrieve the similar trajectories of moving objects for given a query. Finally, by using the TOSSIM simulator, we show that our signature-based tracking method outperforms the existing tracking method in terms of energy efficiency.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.33-41
• /
• 2007

The IEEE 802.11 DCF channel access function allows single transmission inside two-hop network in order to avoid collisions and eliminate the hidden and exposed terminal problems. Singular transmission capability causes data frames waiting for the entire roundtrip time in the transmitter neighborhood, and results in increased frame latency and lower network throughput. Real-time and pervasive applications are severely affected for the lower medium utilization; especially with high network traffic. This work proposes a new scheme with the help of Frame Aggregation technique in IEEE802.11n and overcomes the single transmission barrier maintaining the basic DCF functionality. Proposed scheme allows parallel transmissions in non-interfering synchronized slots. Parallel transmissions bypass the conventional physical carrier sense and random Backoff time for several cases and reduce the frame latency and increase the medium utilization and network capacity.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.1
• /
• pp.71-76
• /
• 2013

In this paper, end-to-end performances for some VoIP traffics are measured and analyzed over MANET(Mobile Ad-hoc Networks) with packet aggregation transmission under blackhole attacks. A VoIP simulator based on NS-2 is used for performance measure. In the simulation, MOS, call connection ratio, network delay and packet loss rate are measured for end-to-end transmission performance. With analysis of measured data, characteristics of each traffics for performance parameters of packet aggregation transmission is showed on MANET under blackhole attack, As a results of this paper, some considerations be required for packet aggregation transmission are suggested to implement VoIP services on MANET under blackhole attacks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.620-629
• /
• 2012

This paper proposes packet aggregation scheme for considering energy consumption of mobile devices on guaranteeing quality of voice. To our purpose, we analyze VoIP service on wireless multi-hop channel in terms of delay, packet loss and energy consumption when packet aggregation scheme is applied to VoIP service. Moreover, we induce a cost function with considering of tradeoff relation between quality of voice and energy consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4717-4737
• /
• 2017

Today, smart grids, smart homes, smart water networks, and intelligent transportation, are infrastructure systems that connect our world more than we ever thought possible and are associated with a single concept, the Internet of Things (IoT). The number of devices connected to the IoT and hence the number of traffic flow increases continuously, as well as the emergence of new applications. Although cutting-edge hardware technology can be employed to achieve a fast implementation to handle this huge data streams, there will always be a limit on size of traffic supported by a given architecture. However, recent cloud-based big data technologies fortunately offer an ideal environment to handle this issue. Moreover, the ever-increasing high volume of traffic created on demand presents great challenges for flow management. As a solution, flow aggregation decreases the number of flows needed to be processed by the network. The previous works in the literature prove that most of aggregation strategies designed for smart grids aim at optimizing system operation performance. They consider a common identifier to aggregate traffic on each device, having its independent static aggregation policy. In this paper, we propose a dynamic approach to aggregate flows based on traffic characteristics and device preferences. Our algorithm runs on a big data platform to provide an end-to-end network visibility of flows, which performs high-speed and high-volume computations to identify the clusters of similar flows and aggregate massive number of mice flows into a few meta-flows. Compared with existing solutions, our approach dynamically aggregates large number of such small flows into fewer flows, based on traffic characteristics and access node preferences. Using this approach, we alleviate the problem of processing a large amount of micro flows, and also significantly improve the accuracy of meeting the access node QoS demands. We conducted experiments, using a dataset of up to 100,000 flows, and studied the performance of our algorithm analytically. The experimental results are presented to show the promising effectiveness and scalability of our proposed approach.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.411-414
• /
• 2006

Topology information can be aggregated in the network constructed hierarchically and aggregating topology information is known as TA(Topology Aggregation) and TA is very important for scalability in networks. It is a very important elements to extend networks and routing in networks. In paticular, routing and TA algorithm are much influence on networks performance in PNNI. Therefore, in this paper, we design and implement routing simulator for TA in PNNI.