• 제목/요약/키워드: Power Delivery Networks

검색결과 67건 처리시간 0.026초

무선 센서 네트워크에서의 제한된 쿼리 전달 기법 (Limited Query Delivery Scheme for Wireless Sensor Networks)

  • 손재민;진정우;한기준
    • 전력전자학회:학술대회논문집
    • /
    • 전력전자학회 2005년도 전력전자학술대회 논문집
    • /
    • pp.609-611
    • /
    • 2005
  • 쿼리에 응답하는 데이터 전달방식에서는 일반적으로 쿼리가 네트워크 전체에 뿌려진다. 하지만 쿼리가 특정지역의 정보만을 요구하는 경우 그 쿼리는 네트워크 전체에 뿌려질 필요가 없다. 본 논문에서 우리는 제한된 쿼리 전달 기법을 제안한다. 제안된 기법은 네트워크를 섹터와 레벨단위의 논리적 영역을 만들고 쿼리가 필요로 하는 정보가 속한 최소한의 영역으로만 쿼리를 전달함으로써 불필요한 쿼리 전달을 줄이고자 하는 것이다. 성능평가에서는 제안된 기법을 사용함으로써 센서 노드들의 평균 소비되는 에너지를 줄이고 네트워크의 생존시간을 늘리는 결과를 보였다.

  • PDF

A congestion control scheme estimating global channel busy ratio in VANETs

  • Kim, Tae-won;Jung, Jae-il;Lee, Joo-young
    • 전기전자학회논문지
    • /
    • 제21권2호
    • /
    • pp.115-122
    • /
    • 2017
  • In vehicular safety service, every vehicle broadcasts Basic Safety Message (BSM) periodically to inform neighbor vehicles of host vehicle information. However, this can cause network congestion in a region that is crowded with vehicles resulting in a reduction in the message delivery ratio and an increase in the end-to-end delay. Therefore, it could destabilize the vehicular safety service system. In this paper, in order to improve the congestion control and to consider the hidden node problem, we propose a congestion control scheme using entire network congestion level estimation combined with transmission power control, data rate control and time slot based transmission control algorithm. The performance of this scheme is evaluated using a Qualnet network simulator. The simulation result shows that our scheme mitigates network congestion in heavy traffic cases and enhances network capacity in light traffic cases, so that packet error rate is perfectly within 10% and entire network load level is maintained within 60~70%. Thus, it can be concluded that the proposed congestion control scheme has quite good performance.

Review on Energy Efficient Clustering based Routing Protocol

  • Kanu Patel;Hardik Modi
    • International Journal of Computer Science & Network Security
    • /
    • 제23권10호
    • /
    • pp.169-178
    • /
    • 2023
  • Wireless sensor network is wieldy use for IoT application. The sensor node consider as physical device in IoT architecture. This all sensor node are operated with battery so the power consumption is very high during the data communication and low during the sensing the environment. Without proper planning of data communication the network might be dead very early so primary objective of the cluster based routing protocol is to enhance the battery life and run the application for longer time. In this paper we have comprehensive of twenty research paper related with clustering based routing protocol. We have taken basic information, network simulation parameters and performance parameters for the comparison. In particular, we have taken clustering manner, node deployment, scalability, data aggregation, power consumption and implementation cost many more points for the comparison of all 20 protocol. Along with basic information we also consider the network simulation parameters like number of nodes, simulation time, simulator name, initial energy and communication range as well energy consumption, throughput, network lifetime, packet delivery ration, jitter and fault tolerance parameters about the performance parameters. Finally we have summarize the technical aspect and few common parameter must be fulfill or consider for the design energy efficient cluster based routing protocol.

센서 네트워크를 위한 멀티 홉 MAC 프로토콜 (Multi-Hop MAC Protocol for Wireless Sensor Networks)

  • 조경탁;박세웅
    • 한국통신학회논문지
    • /
    • 제34권6A호
    • /
    • pp.506-514
    • /
    • 2009
  • 센서 네트워크를 위한 MAC 프로토콜들은 전력 소모를 최소화하기 위해 낮은 듀티 사이클(Duty Cycle)을 사용한다. 그 중에서 RMAC [4]의 경우 Pioneer(PION) 프레임을 이용하여 한 주기 내에 여러 홉을 전송한다. 본 논문에서는 HE-MAC(Hop-Extended MAC)이라는 홉 연장 프로토콜을 제안한다. HE-MAC의 데이터 전송은 기존 RMAC과는 달리 한 주기 내에 전달될 수 있는 최대 홉 수 정보가 포함된 Explorer(EXP)를 이용하여 이루어진다. EXP의 정보와 Ready-to-Receive(RTR) 상태를 이용하여 RMAC에 비해 2홉을 늘림으로써 평균 전송 지연 시간을 감소시킨다. 또한, 적응적 슬립을 통하여 불필요한 전력 소모를 최소화할 뿐만 아니라 RMAC에서 나타나는 잦은 트래픽(Traffic)으로 인한 패킷 역전 문제를 해결한다. HE-MAC의 패킷 전송 지연시간을 수학적으로 분석하였으며, ns-2를 이용한 모의실험을 통해 성능평가를 하였다. 300개의 노드가 배치된 랜덤 토폴로지에서 HE-MAC은 RMAC에 비해 전력 소모량과 평균 전승 지연 시간을 14%, 20%만큼 감소시킨다.

IEEE 802.11 기반 이동 애드혹 망의 전력 절감 모드에서 플러딩 지연의 개선 (Reducing Flooding Latency in Power Save Mode of IEEE 802.11-based Mobile Ad hoc Networks)

  • 윤현주;서명환;마중수
    • 한국정보과학회논문지:정보통신
    • /
    • 제31권5호
    • /
    • pp.532-543
    • /
    • 2004
  • 이동 애드혹 망을 구성하는 노드들은 일반적으로 배터리 전력을 사용하기 때문에 이들의 에너지 소모량을 줄이는 연구들이 각 계층에 대해 이루어져 왔다. 매체 접근 제어 프로토콜로 많이 이용되는 IEEE 802.11 DCF에서도 전력 절감 모드가 정의되어 있으며, 노드들은 동기화된 상태에서 주기적으로 활동 상태와 휴면 상태를 반복한다. 활동 상태 동안 서로 전송할 메시지가 있는지 여부를 이웃 노드에 공지하고, 전송에 관여하게 될 노드들은 계속해서 활동 상태로 머물러 필요한 송수신을 하는 반면, 그 외의 노드들은 다음 주기까지 휴면 상태에 들게 된다. 대부분의 기존 연구들은 보다 많은 전력 절감을 위해 휴면기간을 최대화, 최적화하는 것에 초점을 맞추었다. 그러나, 이로 인해 메시지들이 한 주기 당 한 홉씩 전달되어 결과적으로 매우 긴 전송지연을 초래할 수 있다는 것은 지금까지 간과되었다. 본 논문에서는 IEEE 802.11 DCF의 전력 절감 모드에서 빠른 속도로 전체 망으로의 플러딩을 수행할 수 있는 개선된 프로토콜을 제안하였다. 고정된 길이의 활동 상태 기간 동안 이웃 노드뿐 아니라 최대한 멀리까지 공지를 전달하게 하고, 동시에 많은 구간의 노드가 깨어 있게 함으로써 그 이후의 데이타 메시지 전달 속도를 높인다 시뮬레이션에 의한 실험 결과, 제안된 알고리즘은 IEEE 802.11 DCF 전력 절감 모드와 비교해 약간의 추가 에너지 소모로 플러딩 전송 지연을 최대 80% 이상 감소시켰으며, 플러딩 트래픽이 있을 경우의 유니 캐스팅 전송 지연 또한 약 50% 만큼 감소시키는 성능을 보였다.

Role and Function of the Information Public Law

  • Kim, Il Hwan;Lee, KyungLyul;Kim, Jaehyoun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권1호
    • /
    • pp.596-610
    • /
    • 2017
  • As a 'network of networks,' the Internet globally connects a huge number of regional and individual networks and provides us with new hopes and possibilities. However, a nation-state as well as the legal order of the 'state'(constitution) has limitations that are all too clear in order to regulate this new world formed by the Internet. It will soon be impossible for a single state to control these global information networks, and they will not be consistently and vertically operated and managed by anyone. As a result, ideologies or jurisdictions that support the legal order of a nation-state are no longer sufficient to control information delivery beyond borders. Furthermore, the development of the Internet and emergence of cyber space in the information society has led to the idea of 'extinction' of nation-states. Nevertheless, the conclusion that the state will be extinct due to the development of the information society is still nothing more than a hasty assumption. In other words, the information society does not indicate the end of the state. Rather, we must now clearly perceive that the object of our research and discussions must be the role and function of the nation-state in the newly emerged information society in the global aspect and international aspect, as well as in relationships with individuals or organizations that now have unimaginably strong information power. It is clear at this point that nation-states will lose the function and authority they have enjoyed or exercised to a certain degree, but this certainly does not indicate that nation-states are, and will be, unnecessary or useless. Rather, it is necessary to focus on the list of tasks that must be accepted by nation-states in the changed information society, as well as responsibilities and means to perform those tasks.

Smart Grid Cooperative Communication with Smart Relay

  • Ahmed, Mohammad Helal Uddin;Alam, Md. Golam Rabiul;Kamal, Rossi;Hong, Choong Seon;Lee, Sungwon
    • Journal of Communications and Networks
    • /
    • 제14권6호
    • /
    • pp.640-652
    • /
    • 2012
  • Many studies have investigated the smart grid architecture and communication models in the past few years. However, the communication model and architecture for a smart grid still remain unclear. Today's electric power distribution is very complex and maladapted because of the lack of efficient and cost-effective energy generation, distribution, and consumption management systems. A wireless smart grid communication system can play an important role in achieving these goals. In this paper, we describe a smart grid communication architecture in which we merge customers and distributors into a single domain. In the proposed architecture, all the home area networks, neighborhood area networks, and local electrical equipment form a local wireless mesh network (LWMN). Each device or meter can act as a source, router, or relay. The data generated in any node (device/meter) reaches the data collector via other nodes. The data collector transmits this data via the access point of a wide area network (WAN). Finally, data is transferred to the service provider or to the control center of the smart grid. We propose a wireless cooperative communication model for the LWMN.We deploy a limited number of smart relays to improve the performance of the network. A novel relay selection mechanism is also proposed to reduce the relay selection overhead. Simulation results show that our cooperative smart grid (coopSG) communication model improves the end-to-end packet delivery latency, throughput, and energy efficiency over both the Wang et al. and Niyato et al. models.

모바일 기기의 전원 무결성을 위한 설계 연구 (Design Study for Power Integrity in Mobile Devices)

  • 사기동;임영석
    • 한국전자통신학회논문지
    • /
    • 제14권5호
    • /
    • pp.927-934
    • /
    • 2019
  • 최근 모바일 기기는 사용자 요구에 따라 다양한 기능이 있는 소형 컴퓨터의 형태로 발전하였다. 모바일 기기의 다양한 기능을 구현하기 위해 실장되는 AP(: Application processor)와 무선통신용 모뎀 및 고성능 카메라 외 다양한 인터페이스를 위한 IC 들의 안정적인 동작을 위해서는 전원 공급 네트워크 설계에 주의가 필요하다. 본 논문에서는 실장 밀도 제한으로 인해 배선형으로 설계해야하는 모바일 기기의 전원 공급 네트워크의 안정성 확보를 위해 드라이버 IC 칩에서 요구하는 목표 임피던스를 만족하도록 디커플링 캐패시터의 위치, 용량, 개수 등의 설계 파라메터를 최적화하는 방법에 대해 분석하고 시뮬레이션을 통해 검증하였다. 본 논문을 통해 제안된 배선형 전원 공급 네트워크 설계 방법은 모바일 어플리케이션 외 고속신호 전송선로가 포함되는 다양한 응용분야에 확대 적용될 수 있을 것으로 판단된다.

Dynamic Control of Random Constant Spreading Worm using Depth Distribution Characteristics

  • No, Byung-Gyu;Park, Doo-Soon;Hong, Min;Lee, Hwa-Min;Park, Yoon-Sok
    • Journal of Information Processing Systems
    • /
    • 제5권1호
    • /
    • pp.33-40
    • /
    • 2009
  • Ever since the network-based malicious code commonly known as a 'worm' surfaced in the early part of the 1980's, its prevalence has grown more and more. The RCS (Random Constant Spreading) worm has become a dominant, malicious virus in recent computer networking circles. The worm retards the availability of an overall network by exhausting resources such as CPU capacity, network peripherals and transfer bandwidth, causing damage to an uninfected system as well as an infected system. The generation and spreading cycle of these worms progress rapidly. The existing studies to counter malicious code have studied the Microscopic Model for detecting worm generation based on some specific pattern or sign of attack, thus preventing its spread by countering the worm directly on detection. However, due to zero-day threat actualization, rapid spreading of the RCS worm and reduction of survival time, securing a security model to ensure the survivability of the network became an urgent problem that the existing solution-oriented security measures did not address. This paper analyzes the recently studied efficient dynamic network. Essentially, this paper suggests a model that dynamically controls the RCS worm using the characteristics of Power-Law and depth distribution of the delivery node, which is commonly seen in preferential growth networks. Moreover, we suggest a model that dynamically controls the spread of the worm using information about the depth distribution of delivery. We also verified via simulation that the load for each node was minimized at an optimal depth to effectively restrain the spread of the worm.

ACCB- Adaptive Congestion Control with backoff Algorithm for CoAP

  • Deshmukh, Sneha;Raisinghani, Vijay T.
    • International Journal of Computer Science & Network Security
    • /
    • 제22권10호
    • /
    • pp.191-200
    • /
    • 2022
  • Constrained Application Protocol (CoAP) is a standardized protocol by the Internet Engineering Task Force (IETF) for the Internet of things (IoT). IoT devices have limited computation power, memory, and connectivity capabilities. One of the significant problems in IoT networks is congestion control. The CoAP standard has an exponential backoff congestion control mechanism, which may not be adequate for all IoT applications. Each IoT application would have different characteristics, requiring a novel algorithm to handle congestion in the IoT network. Unnecessary retransmissions, and packet collisions, caused due to lossy links and higher packet error rates, lead to congestion in the IoT network. This paper presents an adaptive congestion control protocol for CoAP, Adaptive Congestion Control with a Backoff algorithm (ACCB). AACB is an extension to our earlier protocol AdCoCoA. The proposed algorithm estimates RTT, RTTVAR, and RTO using dynamic factors instead of fixed values. Also, the backoff mechanism has dynamic factors to estimate the RTO value on retransmissions. This dynamic adaptation helps to improve CoAP performance and reduce retransmissions. The results show ACCB has significantly higher goodput (49.5%, 436.5%, 312.7%), packet delivery ratio (10.1%, 56%, 23.3%), and transmission rate (37.7%, 265%, 175.3%); compare to CoAP, CoCoA+ and AdCoCoA respectively in linear scenario. The results show ACCB has significantly higher goodput (60.5%, 482%,202.1%), packet delivery ratio (7.6%, 60.6%, 26%), and transmission rate (40.9%, 284%, 146.45%); compare to CoAP, CoCoA+ and AdCoCoA respectively in random walk scenario. ACCB has similar retransmission index compare to CoAp, CoCoA+ and AdCoCoA respectively in both the scenarios.