نتایج جستجو برای: Coverage Radius

تعداد نتایج: 133095  

  The problem of locating distribution centers (DCs) is one of the most important issues in design of supply chain. In previous researches on this problem, each DC could supply products for all of the customers. But in many real word problems, DCs can only supply products for customers who are in a certain distance from the facility, coverage radius. Thus, in this paper a multi-objective intege...

Journal: :journal of optimization in industrial engineering 2015
vahid reza ghezavati

in many practical distribution networks, managers face significant uncertainties in demand, local price of building facilities, transportation cost, and macro and microeconomic parameters. this paper addresses design of distribution networks in a supply chain system which optimizes the performance of distribution networks subject to required service level. this service level, which is considere...

P-hub maximal covering location problem is one of the most commonly used location- allocation problems. In this problem, the goal is to determine the best location for the hubs such that the covered demand is maximized by considering the predefined coverage radius. In classical hub problems, if the distance between the origin and destination is less than this radius, coverage is possible; other...

2006
Congfu Xu Dazhan Rao Shijian Li Yunhe Pan

We consider the coverage and connectivity problem of a sensor network with n unreliable nodes, uniformity arranged over a square region of unit area. We propose a novel triangle-arranged circle division method to obtain the the formula of the relationship of probability of coverage and connectivity, sensing radius, transmission radius, failure probability and the numbers of the nodes using prob...

2007
Xu Li Hannes Frey Nicola Santoro Ivan Stojmenovic

In this paper, we pinpoint a new sensor selfdeployment problem, achieving focused coverage around a Point of Interest (POI), and introduce an evaluation metric, coverage radius, that reflects the significance of distance from the POI to uncovered areas. Then we propose two solution protocols, Greedy Advance (GA) and GreedyRotation-Greedy (GRG), which are to our best knowledge the first sensor s...

2010
Md. Amirul Islam Rushdi Shams Md. Zahirul Islam

The aim of this paper is to minimize the overlapping coverage area in Wireless Sensor Networks with nodes having adjustable radius. We proposed Area-aware Coverage (A2C) that considers the sensing and transmission range of sensor nodes adjustable and uses six phases to detect and minimize overlapping coverage area. We also minimized the presence of redundant nodes and nodes with minimum coverag...

2009
Shijun Zhao Zhaohui Zhang Tao Wang

Monitoring the long-distance pipelines, rivers, roads and boundary lines with wireless sensor networks belongs to one-dimensional region monitoring. This paper primarily studies the coverage problems of the sensor networks in one-dimensional regions. Firstly, the onedimensional random coverage model is processed for the sensor nodes in one-dimensional monitoring region, and a formula is given t...

Journal: :آمایش سرزمین 0
محمدحسن یزدانی استادیار، گروه جغرافیا، دانشگاه محقق اردبیلی، اردبیل، ایران ابراهیم فیروزی مجنده دانشجوی دکتری جغرافیا و برنامه ریزی شهری، دانشگاه محقق اردبیلی، اردبیل، ایران سید میلاد حسینی کارشناس ارشد جغرافیا و برنامه ریزی شهری، دانشگاه محقق اردبیلی، اردبیل، ایران

the purpose of this paper is to analyze the utility operating radius and service on city parks in ardabil neighborhood, local, regional and urban level, to investigate the relationship between the distribution of these parks with water levels in the city of ardabil, including shorabil lake and balyqlv river and reviews for distribution park. the data and information used by documentary. to anal...

2015
Yin Zhouping

Coverage and connectivity are two important problems in wireless sensor network. This paper focuses on the wireless sensor network communication radius in the high density of sensor nodes deployed randomly and two times smaller than the sensing radius; put forward a distributed k coverage multi connected node deployment algorithm based on grid. Simulation results show that the algorithm in this...

1999
Joan Borràs Roy D. Yates

From the idea of using an array of isolated wireless ports called Infostations, we consider the use of existing cellular infrastructure as the location for these Infostations. The coverage area of Infostations, though, will be smaller than the cell area. We determine the worst-case SIR as a function of the coverage-radius-to-cell-radius ratio and the frequency-reuse cluster size. For specific m...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید