• Title/Summary/Keyword: 최소 스패닝 체인

Search Result 2, Processing Time 0.02 seconds

LECSEN : Link Exchanged Chain in SEnsor Networks (링크 교환을 이용한 무선 센서 네트워크용 체인 토폴로지 : LECSEN)

  • Shin, Ji-Soo;Suh, Chang-Jin
    • The KIPS Transactions:PartC
    • /
    • v.15C no.4
    • /
    • pp.273-280
    • /
    • 2008
  • In WSN(Wireless Sensor Network) many routing algorithms such as LEACH, PEGASIS and PEDEP consisting of sensor nodes with limited energy have been proposed to extend WSN lifetime. Under the assumption of perfect fusion, these algorithms used convergecast that periodically collects sensed data from all sensor nodes to a base station. But because these schemes studied less energy consumption for a convergecast as well as fairly energy consumption altogether, the minimum energy consumption for a convergecast was not focused enough nor how topology influences to energy consumption. This paper deals with routing topology and energy consumption for a single convergecast in the following ways. We chose major WSN topology as MSC(Minimum Spanning Chain)s, MSTs, PEGASIS chains and proposed LECSEN chains. We solved the MSC length by Linear Programming(LP) and propose the LECSEN chain to compete with MST and MSC. As a result of simulation by Monte Carlo method for calculation of the topology length and standard deviation of link length, we learned that LECSEN is competitive with MST in terms of total energy consumption and shows the best with the view of even energy consumption at the sensor nodes. Thus, we concluded LECSEN is a very useful routing topology in WSN.

A-PEGASIS : Advanced Power Efficient GAthering in Sensor Information Systems (개선된 센서 라우팅 방식 : A-PEGASIS)

  • Suh, Chang-Jin;Yang, Jin-Ung
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.6
    • /
    • pp.458-465
    • /
    • 2007
  • Wireless Sensor Network(WSN) is a special network that collects measured data by sensor nodes in the predefined sensor field and forwards them to the base station in a distance using their own routing scheme. WSN requires routing techniques to maximize energy efficiency because sensor nodes have non-rechargeable and thus limited energy. Characteristics of WSN are various according to applications, many of routing algorithms have been proposed. This paper proposes an algorithm called A-PEGASIS that basically bases on PEGASIS and enhances in two aspects - an elegant chain generation algorithm and periodical update of chains. We compare performance of the previous algorithm of LEACH, PEGASIS, PEDAP and PEDAP-PA with ours through simulation. It confirms that the A-PEGASIS is most superior in terms of average WSN lifetime and high probability of node survival rate during WSN life time.