• Title/Summary/Keyword: Geographic Multicasting

Search Result 4, Processing Time 0.024 seconds

Local Update-based Multicasting Scheme for Mobile Sinks in Wireless Sensor Networks (무선 센서 망에서 이동싱크 지원을 위한 지역 수정 기반 멀티캐스팅 기법)

  • Lee, Jeong-Cheol;Park, Ho-Sung;Oh, Seung-Min;Jung, Ju-Hyun;Park, Soo-Chang;Lee, Eui-Sin;Kim, Sang-Ha
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.1
    • /
    • pp.80-84
    • /
    • 2010
  • Data multicasting from a source to multiple sinks in wireless sensor networks is used to achieve both reducing communication costs and energy efficiency. Almost all existing schemes for the multicasting might be effectively performed by optimal construction of a multicasting tree between a source and multiple stationary sinks. However, in practical sensor applications, sinks could move around on the wireless sensor networks for own missions, such as scouting of soldiers and saving lives of victims by firefighters. Unfortunately, the sink mobility causes frequent entire reconstruction of the multicasting tree and thus it leads to exhaustion of battery power of sensors. Hence, we propose an energy-efficient multicast protocol to support multiple mobile sinks by the local multicast tree reconstruction, called Local Update-based geographic Multicasting for Mobile sinks (LUMM) for wireless sensor networks. Our simulation results show that our scheme for mobile sinks is more efficient in terms of energy resource management than other exist works.

Sink-Initiated Geographic Multicasting Protocol for Mobile Sinks in Wireless Sensor Networks (무선 센서 망에서 이동 싱크를 위한 위치기반 멀티캐스팅 프로토콜)

  • Lee, Jeong-Cheol;Park, Ho-Sung;Oh, Seung-Min;Jung, Ju-Hyun;Yim, Yong-Bin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4A
    • /
    • pp.377-385
    • /
    • 2010
  • In this paper, we propose a SInk-initiated geographic Multicast (SIM) protocol to reduce frequent location updates from mobile sinks to a source and to achieve fast multicast tree construction and data delivery. The proposed protocol allows sinks to construct their own data delivery paths to a source node and a multicast tree to be atomically constructed by merging the paths. Then, the source forwards data to the destinations down the multicast tree. This paper also propose a round-based virtual infrastructure with a radial shape for increasing the merging probability of data delivery paths and reducing reconstruction ratio of the multicast tree due to mobility of sinks. Simulation results show that the proposed protocol is superior to previous SOurce-initiated geographic Multicast (SOM) protocols in term of average data delivery delay and average energy consumption.

Geographic and Energy Aware Geocasting in Ad-Hoc Networks (Ad-Hoc 네트워크에서 위치와 에너지를 고려한 지오캐스팅 알고리즘)

  • Lee Ju-Young
    • Journal of Internet Computing and Services
    • /
    • v.5 no.2
    • /
    • pp.75-84
    • /
    • 2004
  • Geocasting, a variant of the conventional multicasting problem, is one of communication type in which the data packets are delivered to a group of all nodes within a specified geographical region (i.e., the geocasting region) and is called location-based multicasting(LBM)(l). An Ad-hoc network is a dynamically reconfigurable and temporary wireless network where all mobile devices using batteries as energy resources cooperatively maintain network connectivity without central administration or the assistance of base stations. Consequently, the technique to efficiently consume the limited amounts of energy resources is an important problem so that the system lifetime is maximized. In this paper, we propose a LBPA(Location-Based Power Aware) geocasting algorithm that selects energy-aware neighbor to route a packet towards the target region In Ad-hoc network environments. The method Is such that the energy consumption is balanced among the nodes in proportion to their energy reserves. Through the simulations, the proposed LBPA algorithm shows better results, that is, as good as 40% on the average over the conventional LBM algorithm in terms of the network lifetime.

  • PDF

Cluster-based Geocasting Protocol in Ad-hoc Networks (애드 혹 네트워크에서 클러스터 기반 지오캐스팅 프로토콜)

  • Lee Jung-Hwan;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5A
    • /
    • pp.407-416
    • /
    • 2005
  • This paper suggests a new geocasting protocol which is used to transfer the geographic packets to the specific region in MANET. Geocasting protocol is basically different from the conventional multicasting protocol that needs group addition and maintenance. A geocasting protocol using the mobile node's position information is the new area of multicasting protocols. The existing geocasting protocols have the following problems; it may be impossible to transfer data to some mobile hosts even if there are alternate routes and they have low adaptability and efficiency when the number of mobile hosts increases. The proposed CBG (Cluster-Based Geocasting) uses the proactive routing strategy and clustering technique with mobile host's location information. The CBG achieves high successful data transmission ratio and low data delivery cost to mobile hosts at specific region.