• Title/Summary/Keyword: traffic aware

Search Result 177, Processing Time 0.025 seconds

A Cross-layer Link Adaptive HD Video Transmission Scheme in WiMedia D-MAC based UWB Systems

  • Joo, Yang-Ick
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.12
    • /
    • pp.1464-1474
    • /
    • 2012
  • In this paper, we propose a QoS (Quality of Service)-aware and cooperative resource reservation scheme using cross-layer link adaptation for wireless high definition video transmission through UWB (Ultra Wide Band) network with D-MAC (Distributed Medium Access Control). A wireless high definition video transmission system usually requires stable high throughput even without line-of-sight, e.g., a destination device in another room separated by a wall. Since the WiMedia D-MAC supporting DRP (Distributed Reservation Protocol) scheme causes lots of DRP resource reservation conflicts due to failure of beacon detection in wireless channel environment, overall performances of the WiMedia D-MAC can be deteriorated. And the current WiMedia MAC standard has not considered QoS provisioning even though QoS parameters such as a range of service rates are provided to each traffic stream. Therefore, we propose Relay DRP protocol with QoS-based relay node selection criterion, which makes a relay path to avoid DRP resource reservation conflicts and guarantee QoS more stably through cross-layer link adaptation of cooperative relay transmission scheme and is compliant with the current WiMedia D-MAC protocol. Simulation results demonstrate performance improvements of the proposed method for throughput and QoS provisioning.

Evaluation of the Effects of a Grouping Algorithm on IEEE 802.15.4 Networks with Hidden Nodes

  • Um, Jin-Yeong;Ahn, Jong-Suk;Lee, Kang-Woo
    • Journal of Communications and Networks
    • /
    • v.16 no.1
    • /
    • pp.81-91
    • /
    • 2014
  • This paper proposes hidden-node aware grouping (HAG) algorithm to enhance the performance of institute of electrical and electronics engineers (IEEE) 802.15.4 networks when they undergo either severe collisions or frequent interferences by hidden nodes. According to the degree of measured collisions and interferences, HAG algorithm dynamically transforms IEEE 802.15.4 protocol between a contention algorithm and a contention-limited one. As a way to reduce the degree of contentions, it organizes nodes into some number of groups and assigns each group an exclusive per-group time slot during which only its member nodes compete to grab the channel. To eliminate harmful disruptions by hidden nodes, especially, it identifies hidden nodes by analyzing the received signal powers that each node reports and then places them into distinct groups. For load balancing, finally it flexibly adapts each per-group time according to the periodic average collision rate of each group. This paper also extends a conventional Markov chain model of IEEE 802.15.4 by including the deferment technique and a traffic source to more accurately evaluate the throughput of HAG algorithm under both saturated and unsaturated environments. This mathematical model and corresponding simulations predict with 6%discrepancy that HAG algorithm can improve the performance of the legacy IEEE 802.15.4 protocol, for example, even by 95% in a network that contains two hidden nodes, resulting in creation of three groups.

Green Life of Apartments Residents in Seoul Metropolitan Area (수도권 아파트 거주자의 그린홈에 대한 인식 및 그린주거생활 실천 실태)

  • Kim, Hwan-June;Lee, Hyun-Jeong
    • Proceeding of Spring/Autumn Annual Conference of KHA
    • /
    • 2011.04a
    • /
    • pp.261-266
    • /
    • 2011
  • The purpose of this study was to identify the perception of residents on green home and their green residential life. For this study, a questionnaire survey was conducted and the items consisted of whether green home was perceived and how well green residential life was maintained in 6 types of environments. A total 118 responses of residents living in apartments of Seoul Metropolitan Area were used for data analysis. Using statistical program SPSS Win 18.0, frequency analysis, t-test, One-way ANOVA, and factor analysis was employed. The major findings were as follows: 1) slightly more than half of the respondents were aware of green home, and the vast majority were in favor of the green home policy; 2) most of the respondents carried out guidelines of green residential life, and in particular, green living on air environment was well done, followed by consumption, waste, energy, traffic and water; 3) the six kinds of environments were subcategorized by using factor analysis, and 3 to 5 factors were included in each category of environment. Also, it was found that age, educational level, employment status of respondents, housing tenure and duration were related to the degree of green residential life. In midst of global movement toward sustainability, environmentally friendly living is not optional but mandatory, so it's important to change each individual's value on the relation between people and environment and to facilitate more environmentally conscious behaviors.

  • PDF

A Scalable Explicit Multicast Protocol for MANETs

  • Gossain Hrishikesh;Anand Kumar;Cordeiro Carlos;Agrawal Dharma P.
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.294-306
    • /
    • 2005
  • Group oriented multicast applications are becoming increasingly popular in mobile ad hoc networks (MANETs). Due to dynamic topology of MANETs, stateless multicast protocols are finding increased acceptance since they do not require maintenance of state information at intermediate nodes. Recently, several multicast schemes have been proposed which scale better' with the number of multicast sessions than traditional multicast strategies. These schemes are also known as explicit multicast (Xcast; explicit list of destinations in the packet header) or small group multicast (SGM). In this paper, we propose a new scheme for small group' multicast in MANETs named extended explicit multicast (E2M), which is implemented on top of Xcast and introduces mechanisms to make it scalable with number of group members for a given multicast session. Unlike other schemes, E2M does not make any assumptions related to network topology or node location. It is based on the novel concept of dynamic selection of Xcast forwarders (XFs) between a source and its potential destinations. The XF selection is based on group membership and the processing overhead involved in supporting the Xcast protocol at a given node. If the number of members in a given session is small, E2M behaves just like the basic Xcast scheme with no intermediate XFs. As group membership increases, nodes may dynamically decide to become an XF. This scheme, which can work with few E2M aware nodes in the network, provides transparency of stateless multicast, reduces header processing overhead, minimizes Xcast control traffic, and makes Xcast scalable with the number of group members.

Social-Aware Resource Allocation Based on Cluster Formation and Matching Theory in D2D Underlaying Cellular Networks

  • Zhuang, Wenqin;Chen, Mingkai;Wei, Xin;Li, Haibo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.5
    • /
    • pp.1984-2002
    • /
    • 2020
  • With the appearance of wireless spectrum crisis in traditional cellular network, device-to-device (D2D) communication has been regarded as a promising solution to ease heavy traffic burden by enabling precise content delivery among mobile users. However, due to the channel sharing, the interference between D2D and cellular users can affect the transmission rate and narrow the throughput in the network. In this paper, we firstly present a weighted interference minimization cluster formation model involving both social attribute and physical closeness. The weighted-interference, which is evaluated under the susceptible-infected(SI) model, is utilized to gather user in social and physical proximity. Then, we address the cluster formation problem via spectrum clustering with iterative operation. Finally, we propose the stable matching theory algorithm in order to maximize rate oriented to accomplish the one-to-one resource allocation. Numerical results show that our proposed scheme acquires quite well clustering effect and increases the accumulative transmission rate compared with the other two advanced schemes.

Energy-efficient Custom Topology Generation for Link-failure-aware Network-on-chip in Voltage-frequency Island Regime

  • Li, Chang-Lin;Yoo, Jae-Chern;Han, Tae Hee
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.6
    • /
    • pp.832-841
    • /
    • 2016
  • The voltage-frequency island (VFI) design paradigm has strong potential for achieving high energy efficiency in communication centric manycore system-on-chip (SoC) design called network-on-chip (NoC). However, because of the diminished scaling of wire-dimension and supply voltage as well as threshold voltage in modern CMOS technology, the vulnerability to link failure in VFI NoC is becoming a crucial challenge. In this paper, we propose an energy-optimized topology generation technique for VFI NoC to cope with permanent link failures. Based on the energy consumption model, we exploit the on-chip communication traffic patterns and characteristics of link failures in the early design stage to accommodate diverse applications and architectures. Experimental results using a number of multimedia application benchmarks show the effectiveness of the proposed three-step custom topology generation method in terms of energy consumption and latency without any degradation in the fault coverage metric.

Impact of Duty Cycle in Wireless Sensor Networks (무선 센서 네트워크에서 Duty Cycle의 영향)

  • Sthapit, Pranesh;Pyun, Jae-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.854-857
    • /
    • 2008
  • Wireless sensor consists of an internal power source which has limited life time. Several MAC protocols have exploited scheduled sleep/listen cycles to conserve energy in sensor networks. Duty cycle is a user-adjustable parameter in low duty cycle MAC protocols, which determines the length of the sleep period in a frame. The sire of duty cycle has direct effect on the Performance of MAC Protocols. In this Paper, we simulated TEEM (A Traffic Aware, Energy Efficient MAC) and S-MAC in NS-2 with different duty cycle values and analyze how duty-cycle effects on the performance and energy consumption of both the protocols.

  • PDF

A Digital Forensic Procedure and Service of Ship with VTS and Navigation Device (VTS 및 소형선박 항해장비의 항적추출을 통한 디지털 포렌식 절차 및 모델서비스)

  • Lee, Byung-Gil;Choi, Byeong-Chel
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2019.11a
    • /
    • pp.243-245
    • /
    • 2019
  • In the VTS, the predictions of vessel mobility and situation awareness of maritime environment are basic function. In recent years, pilotage information is an essential aware element of VTS personnel for vessel traffic management. So, we designed the structure of pilotage information service with VTS and tested in real environment. In the future, similar pilotage information can be used as a useful VTS service.

  • PDF

WORM-HUNTER: A Worm Guard System using Software-defined Networking

  • Hu, Yixun;Zheng, Kangfeng;Wang, Xu;Yang, Yixian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.484-510
    • /
    • 2017
  • Network security is rapidly developing, but so are attack methods. Network worms are one of the most widely used attack methods and have are able to propagate quickly. As an active defense approach to network worms, the honeynet technique has long been limited by the closed architecture of traditional network devices. In this paper, we propose a closed loop defense system of worms based on a Software-Defined Networking (SDN) technology, called Worm-Hunter. The flexibility of SDN in network building is introduced to structure the network infrastructures of Worm-Hunter. By using well-designed flow tables, Worm-Hunter is able to easily deploy different honeynet systems with different network structures and dynamically. When anomalous traffic is detected by the analyzer in Worm-Hunter, it can be redirected into the honeynet and then safely analyzed. Throughout the process, attackers will not be aware that they are caught, and all of the attack behavior is recorded in the system for further analysis. Finally, we verify the system via experiments. The experiments show that Worm-Hunter is able to build multiple honeynet systems on one physical platform. Meanwhile, all of the honeynet systems with the same topology operate without interference.

Policy-Based QoS Management for SLA-Driven Adaptive Routing

  • Katsikogiannis, George;Mitropoulos, Sarandis;Douligeris, Christos
    • Journal of Communications and Networks
    • /
    • v.15 no.3
    • /
    • pp.301-311
    • /
    • 2013
  • This paper proposes a policy-based quality of service (QoS) management framework for adaptive routing decisions. We present an approach considering interior gateway protocol (IGP) for path discovery mechanisms and QoS-aware policies for configuring the network elements. The integration of the aforementioned modules into this policy-based network management (PBNM) system is demonstrated by conducting experiments in a real environment, the hellenic public administration network SYZEFXIS. These experiments combine different traffic conditioning mechanisms through event detectors, consider IP service level agreement mechanisms that interoperate with the PBNM system and analyze the enforcement of IGP and QoS policies. Finally, validation and measurement tools are used to prove the efficiency of this framework. It is shown that this architecture offers significantly increased performance and learning capabilities, while the PBNM system achieves adaptive QoS routing through automated configuration considering the avoidance of suboptimal routing issues or under-performance conditions of the network entities.