• Title/Summary/Keyword: Node distance

Search Result 596, Processing Time 0.027 seconds

Experimental Design of AODV Routing Protocol with Maximum Life Time (최대 수명을 갖는 AODV 라우팅 프로토콜 실험 설계)

  • Kim, Yong-Gil;Moon, Kyung-Il
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.3
    • /
    • pp.29-45
    • /
    • 2017
  • Ad hoc sensor network is characterized by decentralized structure and ad hoc deployment. Sensor networks have all basic features of ad hoc network except different degrees such as lower mobility and more stringent energy requirements. Existing protocols provide different tradeoffs among some desirable characteristics such as fault tolerance, distributed computation, robustness, scalability and reliability. wireless protocols suggested so far are very limited, generally focusing on communication to a single base station or on aggregating sensor data. The main reason having such restrictions is due to maximum lifetime to maintain network activities. The network lifetime is an important design metric in ad hoc networks. Since every node does a router role, it is not possible for other nodes to communicate with each other if some nodes do not work due to energy lack. In this paper, we suggest an experimental ad-hoc on-demand distance vector routing protocol to optimize the communication of energy of the network nodes.The load distribution avoids the choice of exhausted nodes at the route selection phase, thus balances the use of energy among nodes and maximizing the network lifetime. In transmission control phase, there is a balance between the choice of a high transmission power that lead to increase in the range of signal transmission thus reducing the number of hops and lower power levels that reduces the interference on the expense of network connectivity.

A STUDY ON AMALGAM CAVITY FRACTURE WITH THREE DIMENSIONAL FINITE ELEMENT METHOD (아말감 와동의 파절에 관한 3차원 유한요소법적 연구)

  • Kim, Han-Wook;Um, Chung-Moon;Lee, Chung-Sik
    • Restorative Dentistry and Endodontics
    • /
    • v.19 no.2
    • /
    • pp.345-371
    • /
    • 1994
  • Restorative procedures can lead to weakening tooth due to reduction and alteraton of tooth structure. It is essential to prevent fractures to conserve tooth. Among the several parameters in cavity designs, cavity isthmus and depth are very important. In this study, MO amalgam cavity was prepared on maxillary first premolar. Three dimensional. finite element models were made by serial photographic method and cavity depth(1.7mm, 2.4mm) and isthmus (11 4, 1/3, 1/2 of intercuspal distance) were varied. linear, eight and six-nodal, isoparametric brick elements were used for the three dimensional finite element model. The periodontal ligament and alveolar bone surrounding the tooth were excluded in these models. Three types model(B, G and R model) were developed. B model was assumed perfect bonding between the restoration and cavity wall. Both compressive and tensile forces were distributed directly to the adjacent regions. G model(Gap Distance: 0.000001mm) was assumed the possibility of play at the interface simulated the lack of real bonding between the amalgam and cavity wall (enamel and dentin). When compression occurred along the interface, the forces were transferred to the adjacent regions. However, tensile forces perpendicular to the interface were excluded. R model was assumed non-connection between the restoration and cavity wall. No force was transferred to the adjacent regions. A load of 500N was applied vertically at the first node from the lingual slope of the buccal cusp tip. This study analysed the displacement, von Mises stress, 1 and 2 direction normal stress and strain with FEM software ABAQUS Version 5.2 and hardware IRIS 4D/310 VGX Work-station. The results were as follows: 1. G model showed stress and strain patterns between Band R model. 2. B model and G model showed the bending phenomenon in the displacement. 3. R model showed the greatest amount of the displacement of the buccal cusp followed by G and B model in descending order. G model showed the greatest amount of the displacement of the lingual cusp followed by B and R model in descending order. 4. B model showed no change of the displacement as increasing depth and width of the cavity. G and R model showed greater displacement of the buccal cusp as increasing depth and width of the cavity, but no change in the displacement of the lingual cusp. 5. As increasing of the width of the cavity, stress and strain were not changed in B model. Stress and strain were increased on the distal marginal ridge and buccopulpal line angle in G and R model. The possibility of the tooth fracture was increased. 6. As increasing of the depth of the cavity, stress and strain were not changed in B and G model. Stress and strain were increased on the distal marginal ridge and buccopulpal line angle in R model. The possibility of the tooth fracture was increased.

  • PDF

Localization Scheme with Mobile Beacons in Ocean Sensor Networks (모바일 비콘을 이용한 해양 센서 네트워크의 위치 파악 기법)

  • Lee, Sang-Ho;Kim, Eun-Chan;Kim, Chung-San;Kim, Ki-Seon;Choi, Yeong-Yoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.5
    • /
    • pp.1128-1134
    • /
    • 2007
  • Recently, sensor network technology is a highly concerned area due to the expectation of many applications in various fields. The application of sensor network technology to the marine and ocean surveillance and investigation makes the marine environmental research easier since intelligent sensor nodes substitute the human labor work. In ocean sensor network, the localization scheme for the sensor nodes is most essential because all the information without from sensor nodes might be useless unless the positional information of each sensor nodes is provided. In this paper, the localization scheme with mobile beacons in ocean sensor networks is suggested and showed it could be effective for applying to marine circumstances. Even though the previous localization scheme(Ssu's) has advantages that additional hardware is not required for obtaining the information of distance and angle and shows the high accuracy of location and energy efficiency and easy expandability as well, it has also demerits the location error increases as the minimum distance between the absolute positional information become closer. In our works, the improved localization scheme with the presumed area of sensor node using geometric constraints is suggested.

  • PDF

Simulation to Evaluate CCTV Positioning in Use of Ray-Tracing Algorithm (Ray-Tracing 알고리즘을 이용한 CCTV배치 평가시뮬레이션)

  • Kim, Suk-Tae;Ahn, Sang-Ook
    • Korean Institute of Interior Design Journal
    • /
    • v.22 no.6
    • /
    • pp.40-48
    • /
    • 2013
  • Utilization of CCTV in crime prevention for public safety is accepted as the most effective measure in terms of crime prevention and control. Also, it is frequently used as a device that shows evidence of an unexpected situation or record on public social relationship. However, it is rare to find a study that qualitatively accessed the monitoring performance of a certain space depending on the choice and positioning of CCTVs. Thus, this study suggested a technology that can quantitatively compare and assess the monitoring performance of CCTVs depending on view angle and effective sight range of cameras as well as the monitoring performance depending on positioning measures. For the analysis, the concept of 3-dimensional surveillance field in the form of a frustum was suggested while deriving 3-dimensional range of sight and quantitative monitoring performance by applying Isovist theory. For the analysis technology, space of analysis subject, point of view (camera), and target point (measurement node) were installed at a 3-dimensional space and in use of ray-tracing algorithm, the line segment that was visually connected between the point of view and target point was extracted and accumulated. For such verification, analysis application was constructed and then applied to four alternative models on view angle and distance as well as four alternatives on positioning in order to verify its efficacy. Through the experiment, it was possible to compare and assess visibility depending on alternatives while quantifying the results by understanding the shadow areas beyond the monitoring range.

A Study on QoS Improvement for Overlay Multicast Using Modified Dijkstra Algorithm (변형된 Dijkstra 알고리즘을 활용한 오버레이 멀티캐스트 QoS 향상 기법 연구)

  • Lee, Hyung-Ok;Nam, Ji-Seung;Park, Jun-Seok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.7
    • /
    • pp.3468-3473
    • /
    • 2013
  • Conditions that overlay multicast tree must satisfy for the real-time application system of a video-conference, an internet broadcasting is two things. First, the degree of nodes in a tree must be proper value. Second, the diameter of the multicast tree, distance between longest two users should be short. If the path between two users in the tree is long, the delay time in data transmission between two users great. So, it is not suitable to the application system such as video-conferences. In this paper, the cost of the dijkstra algorithm calculate with proposed score-function through checking the extra bandwidth, the delay and the requested bandwidth. It is composed the tree through the dijkstra algorithm.

A Study on Improvement of AODV for Hybrid Wireless Mesh Networks (혼합형 무선 메시 네트워크를 위한 AODV 개선 연구)

  • Kim, Ho-Cheal
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.8
    • /
    • pp.943-953
    • /
    • 2013
  • By the enormous increase in mobile nodes and diverse service requests on wireless networks, wireless mesh network(WMN) takes an interest as the solution for such requests. However, lots of issues which should be solved to deploy WMN are still remained. In the network layer, the performance improvement of routing protocols is the major issue of nowadays researches. WMN can be easily deployed by use of protocols for mobile ad-hoc networks(MANET) because it is much similar with MANET in multi-hop wireless routing and which node plays as host and router concurrently. Unfortunately, most routing protocols for MANET have drawbacks such as large traffic overhead and long delay time for route discovery due to the network extension. They are major factors of performance degradation of WMN and most researches are focused on them. In this paper, domain-based AODV which is amended AODV to be applied in hybrid WMN is proposed. The proposed scheme divides a hybrid WMN as several domains and performs route discovery by header layer domain. Therefore it can reduce the distance for route discovery as much as average hop count between domain header and member nodes. From the simulation, domain-based AODV was showed slowly increasing delay time due to the network extension.

An Energy Efficient Clustering Scheme for WSNs (WSN에서 에너지 효율적인 클러스터링 기법)

  • Chung, Kil-Soo;Lee, Won-Seok;Song, ChangYoung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.4
    • /
    • pp.252-258
    • /
    • 2013
  • As WSN is energy constraint so energy efficiency of nodes is important. Because avoiding long distance communication, clustering operating in rounds is an efficient algorithm for prolonging the lifetime of WSN and its performance depends on duration of a round. A short round time leads to frequent re-clustering while a long round time increases energy consume of cluster heads more. So existing clustering schemes determine proper round time, based on the parameters of initial WSN. But it is not appropriate to apply the round time according to initial value throughout the whole network time because WSN is very dynamic networks nodes can be added or vanished. In this paper we propose a new algorithm which calculates the round time relying on the alive node number to adapt the dynamic WSN. Simulation results validate the proposed algorithm has better performance in terms of energy consumption of nodes and loss rate of data.

An Energy-Efficient Algorithm for Solving Coverage Problem and Sensing Big Data in Sparse MANET Environments (희소 모바일 애드 혹 네트워크 환경에서 빅데이터 센싱을 위한 에너지 효율적인 센서 커버리지 알고리즘)

  • Gil, Joon-Min
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.11
    • /
    • pp.463-468
    • /
    • 2017
  • To sense a wide area with mobile nodes, the uniformity of node deployment is a very important issue. In this paper, we consider the coverage problem to sense big data in sparse mobile ad hoc networks. In most existing works on the coverage problem, it has been assumed that the number of nodes is large enough to cover the area in the network. However, the coverage problem in sparse mobile ad hoc networks differs in the sense that a long-distance between nodes should be formed to avoid the overlapping coverage areas. We formulate the sensor coverage problem in sparse mobile ad hoc networks and provide the solution to the problem by a self-organized approach without a central authority. The experimental results show that our approach is more efficient than the existing ones, subject to both of coverage areas and energy consumption.

Spectrum Sharing Method for Cognitive Radio in TV White Spaces: Enhancing Spectrum Sensing and Geolocation Database

  • Hassan, Walid A.;Jo, Han-Shin;Nekovee, Maziar;Leow, Chee Yen;Rahman, Tharek Abd
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.8
    • /
    • pp.1894-1912
    • /
    • 2012
  • This paper proposes a system called Wireless Link based on Global Communication Channel (WLGCC) to enhance the spectrum sharing between digital broadcasting (DB) services and the cognitive radio (CR) system in the licensed band of 470-790 MHz. The WLGCC aims to enhance the spectrum sensing and geolocation database (GLD) spectrum sharing methods in the CR system. Spectrum sensing can be enhanced by receiving the status of the used frequencies from the WLGCC, thereby eliminating the need for a low detection threshold (i.e., avoiding the hidden node problem). In addition, the GLD can be enhanced by providing a reliable communication link between the database and the CR device in the form of an unused TV white space that is reserved as the proposed Global Communication Channel (GCC). This paper analyzes the coexistence of the new WLGCC system and the DB service in terms of avoiding additional interference. Specifically, we mathematically determine the WLGCC parameters, such as the in-band and out-of-band power levels, and operation coverage, and verify them using Monte Carlo simulation. The results show that WLGCC does not degrade the existing DB service and reliably transmits information of the vacant (or used) frequency bands to the CR.

An Optimal Path Search Method based on Traffic Information for Telematics Terminals (텔레매틱스 단말기를 위한 교통 정보를 활용한 최적 경로 탐색 기법)

  • Kim, Jin-Deog
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.12
    • /
    • pp.2221-2229
    • /
    • 2006
  • Optimal path search algorithm which is a killer application of mobile device to utilize location information should consider traffic flows of the roads as well as the distance between a departure and destination. The existing path search algorithms, however, are net able to cope efficiently with the change of the traffic flows. In this paper, we propose a new optimal path search algorithm. The algorithm takes the current flows into consideration in order to reduce the cost to get destination. It decomposes the road network into Fixed Grid to get variable heuristics. We also carry out the experiments with Dijkstra and Ar algorithm in terms of the execution time, the number of node accesses and the accuracy of path. The results obtained from the experimental tests show the proposed algorithm outperforms the others. The algorithm is highly expected to be useful in a advanced telematics systems.