پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 161 |
| تعداد شماره‌ها | 6,532 |
| تعداد مقالات | 70,502 |
| تعداد مشاهده مقاله | 124,117,009 |
| تعداد دریافت فایل اصل مقاله | 97,221,836 |
پیاده‌سازی یک الگوریتم محیط آگاه در جانمایی شبکۀ حسگرها به‌منظور بهینه‌سازی پوشش در یک محیط شهر هوشمند | ||
| پژوهشهای جغرافیای انسانی | ||
| مقاله 15، دوره 49، شماره 4، دی 1396، صفحه 951-960 اصل مقاله (763.4 K) | ||
| نوع مقاله: مقاله علمی پژوهشی | ||
| شناسه دیجیتال (DOI): 10.22059/jhgr.2017.239408.1007521 | ||
| نویسنده | ||
| میثم ارگانی* | ||
| استادیار گروه سنجش‌ازدور و GIS، دانشکدۀ جغرافیا، دانشگاه تهران | ||
| چکیده | ||
| در سال‌های اخیر، شبکه‌های حسگر بی‌سیم در کاربردهای متعددی مورد مطالعه قرار گرفته‌اند. یکی از مسائل مهم مورد مطالعه در این شبکه‌ها، جایابی بهینۀ حسگرها به‌منظور دستیابی به بیشینۀ مقدار پوشش شبکه در ارتباط با کاربرد تعریف‌شدۀ شبکۀ حسگر در شهرهای هوشمند است. اطلاعات متنی (CI) حسگرها از جمله مشخصات و وضعیت حسگر در شبکه، نحوۀ ارتباط بین حسگرها، اطلاعات محیط پیرامونی آن‌ها در جانمایی و انجام مأموریت حسگر و نیز پدیده‌های فیزیکی مرتبط با شبکۀ حسگر در شهرهای هوشمند که می‌توانند موجب اختلال در انجام مأموریت محول شده به شبکۀ حسگرها شوند، به همراه ارتباطات بین آن‌ها، از عواملی هستند که مطالعۀ آن‌ها به جایابی بهینۀ شبکه‌های حسگر منجر می‌شود. پیچیدگی محیط مورد سنجش توسط حسگرها، با وجود موانع گوناگون، ممکن است به عدم پوشش مناطق مختلف در شبکه‌های حسگر منجر شود. از این‌رو، یک مسئلۀ اساسی در یک شبکۀ حسگر، بهینه‌سازی پوشش مکانی آن است. در گذشته، چندین الگوریتم بهینه‌سازی محلی و سراسری توسعه‌یافته در این رابطه، بهکار گرفته میشدند. در این مقاله، برای بهینه‌سازی جانمایی شبکۀ حسگرها از یک الگوریتم محیط آگاه با مزیت درنظرگرفتن انواع مختلف اطلاعات متنی یا محیطی و براساس کاربردهای خاص شبکه، به‌صورت مستقل از هر CI، استفاده شده است. درنهایت، نتایج به‌دست‌آمده در آزمایش انواع مختلف CI، بیانگر کارآمدی الگوریتم پیشنهادی در جانمایی بهینۀ سنسورها با استفاده از جنبه‌های مختلف اطلاعات متنی است. | ||
| کلیدواژه‌ها | ||
| اطلاعات متنی؛ الگوریتم محیط آگاه؛ بهینه‌سازی؛ جایابی حسگر؛ محیط شهری | ||
| عنوان مقاله [English] | ||
| Development of a Context-Aware Sensor Network Algorithm to Optimize Sensor Coverage in a Smart City | ||
| نویسندگان [English] | ||
| Meysam Argany | ||
| Assistant Professor of RS and GIS, Faculty of Geography, University of Tehran, Tehran, Iran | ||
| چکیده [English] | ||
| Introduction A sensor network usually consists of numerous wireless devices deployed in a region of interest in a city. Despite the advances in sensor network technology, the efficiency and performance of a sensor network for collection and communication of the information in the cities may be constrained by the limitations of sensors deployed in the network nodes in urban areas. These restrictions may include sensing range, battery power, connection ability, memory, and limited computation capabilities. These limitations create challenging problems for the users of the sensor networks and decision makers, which has pushed researchers from different disciplines in recent years to study various problems related to the design and deployments of efficient sensor networks regarding characteristics and requirements of the smart cities. However, sensor networks deployment has some limitations when it comes to the modeling, monitoring, and detecting environmental processes. Urban environmental elements are also important to be considered in a realistic sensor networks deployment. Other examples of such elements include contextual information of the sensors environment and urban physical phenomena in distributed area of the network. Using such information in context of urban applications is necessary to perform an appropriate and efficient sensor network deployment. For this purpose, one needs to introduce relevant models of the type of urban phenomena, the accessibility or inaccessibility of the observation area in the city, urban environmental conditions, spatial relations between the objects as well as sensors, and different level of information availability. The complexity of the urban area as the sensing environment of sensor networks may result in several uncovered areas. Consequently, performing an optimized sensor placement affects how well an urban region is covered as well as the cost for constructing the network and connecting the networks elements. Hence, a fundamental issue in a sensor network in an urban area is the optimization of its spatial coverage. Based on previous studies, several optimization algorithms were developed and applied in recent years to meet this criterion. Most of these algorithms often rely on oversimplified sensors, their characteristics, and network models as well as simulation of the efficient urban model and its relevant elements. Methodology Based on mentioned issues, this paper presents an approach to improve sensor deployment processes by integrating urban contextual information with optimization algorithms. To achieve this objective, the following approach containing three specific parts is defined. First, a conceptual framework is proposed to integrate contextual information (CI) in sensor network deployment processes. CI defines the spatial dependencies between spatially adjacent nodes, nodes and obstacles, and obstacles themselves as well as the temporal dependencies between historical movements of nodes in the deployment process. The so-called CI is used in the proposed framework to find good alternative positions of sensor nodes to fill uncovered areas, and decide about the sensor’s adequate actions in order to guide sensor network deployment. Then, a local context-aware optimization algorithm is developed based on the proposed framework. The proposed method is a generic local algorithm, which accepts spatial, temporal, and thematic urban contextual information in different situations. In the proposed algorithm, sensors are ordered in a priority queue, in order to be sorted based on their coverage gain obtained by considering different CI, and following related moves in the network. Then, the sensor with the maximum gain is selected, and stands at the top of the queue. The movement types of sensors are related to the local CI as well as sensor network mission. By changing the position of the topmost sensor of the queue, the network configuration is updated. Then, the coverage gains of the adjacent sensors of moved sensor is recalculated and their ordering in the priority queue is updated. This optimization process is conducted iteratively until one of the predefined stopping criteria is reached. Next, the accuracy assessment and error propagation analysis is conducted to determine the impact of the accuracy of contextual information on the proposed sensor network optimization method. Results and discussion The first category of CI is the terrain model and information on the network. The information can provide the elevation of the objects in study area and as a result the obstacles can also restrict the sensing field of the sensors. Thematic information is the next category of CI used in sensor network optimization. For example, several locations may be legally forbidden for the deployment of sensors. Given the restricted areas in context-aware optimization, sensor action is changed and new moves are defined. Desirability of coverage is another type of thematic information that can be considered in the optimization process. Suppose that there are some places in the study area, where sensors cannot be set up, but there is a high interest on those regions to be covered. Sensor placement in an environment with a critical asset is the next thematic CI side of the context-aware algorithm. Let assume a critical asset to be monitored for preventing any undesired access with a slight activity in its environment, which is located beside a street with high level of activities. Thus, there is an interest to monitor any intrusions within the fenced area, but not having the sensor always activated due to the traffic or other activity on the street. Conclusion The purpose of this paper is to prevent to overcomplicate the optimization process, but rather to find a flexible methodology that can locally accommodate all relevant information that would have an impact on sensor placement. To do so, a local optimization framework was introduced. The extended optimization algorithm can come up with different sensor placement configuration according to the various circumstances, environmental information, and/or sensor parameters encountered. Consequently, if there are any changes in sensor parameters or environment, the context-aware algorithm can simply take new contextual inputs and regenerate a new sensor placement design adapted to the new situation. The outstanding advantage of the proposed context-aware algorithm was that it was designed independent of any specific CI. Thus, it is able to take into consideration different types of information based on specific network applications at hand. | ||
| کلیدواژه‌ها [English] | ||
| : Sensor Deployment, Urban area, Contextual Information, Optimization, Context-Aware Algorithm | ||
| مراجع | ||
|
1. Ahmed, N., Kanhere, S. and Jha, S., 2005, The Holes Problem in Wireless Sensor Networks: A Survey, ACM SIGMOBILE Mob, Comput. Commun, Rev, No. 1, PP. 1- 14.
2. Akbarzadeh, A. et al, 2012, Probabilistic Sensing Model for Sensor Placement Optimization Based on Line-of-Sight Coverage, IEEE transactions on instrumentation and measurement, Vol. 99, PP. 1- 11. (In Persian)
3. Argany, M. et al, 2012, I Mpact Of The Quality Of Spatial 3d City Models On Sensor Networks, Geomatica,Vol. 66, No. 4, PP. 291- 305.
4. Argany, M. et al, 2001, A GIS Based Wireless Sensor Network Coverage Estimation and Optimization: A Voronoi Approach,Trans. Comput, Sci. XIV, Vol. 6970, PP. 151- 172.
5. Aziz, N., Aziz, K. and Ismail, W., 2009, Coverage Strategies for Wireless Sensor Networks, World Acad. Sci. Eng. Technol, Vol. 50, PP. 145- 150. (In Persian)
6. Chen, J. and Koutsoukos, X., 2007, Survey on Coverage Problems in Wireless ad Hoc Sensor Networks, in IEEE SouthEastCon.
7. Ghosh, A., Das, S. K., 2008, Coverage and Connectivity Issues in Wireless Sensor Networks: A Survey, Pervasive Mob, Comput, Vol. 4, PP. 303- 334.
8. Huang, C., Tseng, Y., 2005, A Survey of Solutions to the Coverage Problems in Wireless Sensor Networks, J. Internet Technol, No. 1, PP. 1- 9.
9. Karimipour, F., Argany, M. and Mostafavi, M. A., 2014, Spatial Coverage Estimation and Optimization in GeoSensor Networks Deployment., In: Ibrahiem M, El Emary M, Ramakrishnan S. (ed(s)), Wireless Sensor Networks: Theory and Application, PP. 59- 84. (In Persian)
10. Lewis, F. L., 2004, Wireless Sensor Networks, Smart Environ. Technol, Protoc, Appl, PP. 1- 18.
11. Loscrí, V. et al, 2014, Efficient coverage for grid-based mobile wireless sensor networks. In Proceedings of the 11th ACM Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN’14), Montreal, QC, Canada.
12. Megerian, S., Koushanfar, F. and Potkonjak, M., 2005, Srivastava, M.B. Worst and best-case coverage in sensor networks, IEEE Trans. Mob. Comput., Vol. 4, PP. 84- 92.
13. Meguerdichian, S., Koushanfar, F. and Potkonjak, M., 2001, Srivastava, M.B. Coverage Problems in Wireless ad-hoc Sensor Networks, In Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (IEEE INFOCOM 2001), Anchorage, AK, USA, 22–26 April 2001, Vol. 3, PP. 1380- 1387.
14. Nittel, S., 2009, A Survey of Geosensor Networks: Advances in Dynamic Environmental Monitoring, Sensors (Basel), Vol. 9, No. 7, PP. 78- 5664.
15. Romoozi, M., Ebrahimpour-komleh, H., 2012, A Positioning Method in Wireless Sensor Networks Using Genetic Algorithms, In Proceedings of 2012 International Conference on Medical Physics and Biomedical Engineering (ICMPBE2012), Singapore, PP. 174- 179. (In Persian)
16. Thai, M.T. et al, 2008, Coverage problems in Wireless Sensor Networks: Designs and Analysis, Int. J. Sens. Netw, No. 3, PP. 191- 203.
17. Urrutia, J., 2000, Art Galleries and Illumination Problems, In Handbook on Computational Geometry; Elsevier Sciences Publisher; New York, NY, USA, Chapter 22, PP. 973- 1026.
18. Wang, G., Cao, G. and la Porta, T., 2006, Movement-assisted Sensor Deployment, IEEE Trans, Mob. Comput, No. 5, PP. 640- 652. | ||
|
آمار تعداد مشاهده مقاله: 762 تعداد دریافت فایل اصل مقاله: 384 |
||