• Journal of Korea Multimedia Society
• /
• v.16 no.9
• /
• pp.1077-1088
• /
• 2013

As broadcasting is the process that a node sends a packet to all nodes in the network. it is basic process used for discovering of a routes to a node and disseminating of control information message in Mobile Ad hoc NETwork (MANET). In this paper, we propose dynamically adjusted probabilistic mechanism based on distance ratio and node density for broadcasting in MANETs. The distance ratio can be calculated as the ratio of the radio strength length to the distance from sender of a node, and node density can be get from 1-hop nodes of neighbours. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio and node density of itself. Rebroadcast probability will be set as low value to a node which is located in nearby area of sender and has high 1-hop node density, So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.691-693
• /
• 2004

센서 네트워크의 응용 분야 중에서 센서가 밀집되게 분포 되어야 하는 경우 적절한 개수의 노드만 활성화시켜 이 노드들 만으로 전송 경로를 구성하여 센서가 수집한 데이터를 데이터 수집 노드에 전달되도록 한다. 휴지 상태에 있는 노드를 활성화하는 기존의 모델들은 활성 노드의 개수와 전송 손실률을 이용하거나 지리 정보를 이용하여 센서 네트워크 토폴로지를 구성하였다. 이 논문에서는 활성 노드 간의 거리 정보를 이용하여 센서 네트워크 토폴로지를 구성하는 방법을 제안한다 이 방법을 사용한 결과 지역적으로 활성 노드가 균일하게 분포되었으며 센서 밀집도가 높을수록 더 좋은 에너지 효율을 얻을 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.10-12
• /
• 2004

무선 센서네트워크는 센싱 지역에 분산되어 있는 초소형 센서 노드들이 감지/처리한 데이터를 수집노드로 전송하여 원격의 사용자가 센싱 지역의 상황인지를 가능하게 하는 유비쿼터스 컹퓨팅의 기반 네트워크이다. 전력 사용이 극히 제한된 센서 노드를 이용하여 무선 센서 망을 구성, 유지하며 데이터를 수집하기 위해서는 효율적인 망의 형태와 이에 따른 네트워크 배치 전략을 필요로 한다. 클러스터 기반 네트워크의 형태는 밀집도가 높은 센서네트워크에서 데이터병합을 수행하고 노드간 에너지 소비 균형을 이루기 위한 효과적인 구조이다. 본 논문에서는 클러스터 기반의 단일 홉 전송 구조에서 데이터 수집률을 높이고 노드간 에너지 사용의 균형을 이루게 하여 네트워크의 생존시간을 최대화할 수 있는 네트워크 배치 방법을 제안하였다. 클러스터링 기법에 따른 에너지 소비 모델을 분석하고 이를 통해 노드의 적절한 밀집도를 산출하였다. 싱크로부터 멀어질수록, 센서필드의 중앙보다는 외곽에 노드의 배치를 조밀하게 배치하여 네트워크의 생존시간을 늘렸다. 시뮬레이션을 통해 효율적인 네트워크의 배치가 노드간 에너지 소비의 균형을 이루도록 하여 네트워크의 생존시간을 늘일 수 있음을 확인하였다.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.535-542
• /
• 2005

This paper proposes an on-demand ad hoc routing protocol, Node Density Based Routing (NDBR), which enhances the routing performance applying a new method to establish alternate patlis. It is important to reserve alternate paths for the route from source to destination in mobile ad hoc networks that are susceptible to failure due to the movement or the power exhaustion of mobile nodes. NDBR aims to establish a route that contains more alternate paths toward the destination by involving intermediate nodes with relatively more adjacent nodes in a possible route, and introduces a new routing criterion called 'node density.' This approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route re-discoveries at route failures. This paper describes the route setup procedure using node density and the route re-configuration procedures employing alternate path information at the intermediate nodes. We show the performance of our routing schemes through a series of simulations using the Network Simulator 2 (ns-2).

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.101-111
• /
• 2011

A new MAC protocol, MT-MAC(Multi-Tier Medium Access Control) by name, is proposed for dense sensor networks. Depending on the density of nodes in a virtual cluster, the cluster header performs the splitting to several tiers in nodes of virtual cluster. MT-MAC split the tiers to use modfied-SYNC message after receiving the beacon message from the cluster header. Because only the sensor nodes in the same tier communicate each other, less power is consumed and longer network life time is guaranteed. By a simulation method with NS-2, we evaluated our protocol. In dense nodes environments, MT-MAC protocol shows better results than S-MAC in terms of packet delivery rates throughput and energy consumption.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.9 s.339
• /
• pp.11-18
• /
• 2005

In ad hoc networks, many applications use the broadcast service that is elementary operation to support various important functions such as route discovery procedure. This paper presents several adaptive probabilistic broadcast schemes base on local information to alleviate the broadcast storm problem for wireless ad hoc network. Our schemes dynamically determine the rebroadcast probability at each node based on the neighbor information within two-hop span. Simulation results are presented, which show our schemes have a better performance over the deterministic flooding approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.11
• /
• pp.2196-2204
• /
• 2015

Location-based density information of mobile node could be used well in various, new and expanding areas such as location-based services, internet of things, smart grid technologies, and intelligent building. In general, receiving mobile nodes of a wireless mobile node depend on the maximum communication range of transmitting mobile node. In this paper, efficient computing method for mobile node using Delaunay triangulation is proposed, which is irrespective of mobile node's maximum communication range and reflect relative location in a given situation. Proposed method may be good used to find out the density of network constructed by various max communication range devices as Internet of Things. This method suggested in this paper could work well for location-based services, internet of things, smart grid technologies, and intelligent building.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.46-48
• /
• 2016

이 논문에서는 무선 센터 네트워크 환경과 이동성을 지원하는 MANET이 결합된 환경에서 센서 커버리지 최대화 문제를 해결하기 위한 방안을 제시한다. 이 문제를 해결하기 위한 기존 연구들의 가정사항은 센서 노드의 밀집도가 높다는 것이다. 따라서 센서 노드들의 sleep, wake-up 등의 스케줄링 방안들이 제시되어 왔다. 하지만 센서 노드들의 밀집도가 낮은 환경에서 센서 커버리지 최대화 문제를 해결하기 위한 연구는 미비한 상태이다. 제안하는 방식은 단일 실패점이 있는 중앙집중형 방식이 아닌 분산형 방식과 자가 조직 방식을 취하고 있어 메시지 복잡도가 낮으며 노드의 수에 확장적이다. 또한 각 노드가 전체 노드 정보를 알고 있다는 가정을 배제하고 있어 동적인 환경에 적합하다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1306-1312
• /
• 2017

The route request (RREQ) packet is selectively re-broadcasted in the routing protocols that improve the broadcast storm problem of the ad-hoc on-demand routing protocol (AODV). However, in a low node density scenario, the connectivity of these selective rebroadcast schemes becomes less than that of the AODV. In order to clarify the requirements of these selective re-broadcast routing protocols, it is necessary to investigate the relationship between the node density and the connectivity. In this paper, we drive a probability to preserve the connectivity of the GAODV at an intermediate rebroadcast node. In addition, we present an intuitive method to approximate the end-to-end connectivity of the GAODV. We draw the required node density to guarantee the connectivity of 0.9 and 0.99 through computer simulations, and verify the validity of the derived theoritical connectivity by comparing with the simulation results.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.7
• /
• pp.17-24
• /
• 2012

As the resources and power on Ad-hoc networks are limited, new data aggregation techniques are required for energy efficiency. The current research on data aggregation techniques is actively in progress, but existing studies don't consider the density of nodes. If nodes are densely placed in a particular area, the information which the sensor nodes placed on those areas detect can be judged as very strong association. But, the energy spent transmitting this information is a waste of energy. In this paper the densely-concentrated node area is designated as Hotspot_Zone in the multi-hop clustering environment using the AMC and a key node is selected in the area. If the request message of data aggregation is transmitted, the key node among the neighboring nodes sends its environmental information to a manager to avoid duplicate sensing information. Therefore, the life of networks can be prolonged due to this.