检索结果-内蒙古大学图书馆

A new three-dimensional wireless multimedia sensor network simulation environment for connected coverage problems

SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL 2012年第1期88卷 110-122页

作者： Topcuoglu, Haluk Ermis, Murat Bekmezci, Ilker Sifyan, Mesut Marmara Univ Dept Comp Engn TR-34722 Istanbul Turkey Marmara Univ Dept Comp Engn TR-34722 Istanbul Turkey

A wireless multimedia sensor network (WMSN) is a network of wirelessly interconnected sensors that can gather multimedia information, such as sound and vision. One of the most important design issues of a WMSN is to maximize the coverage, while preserving the network connectivity. Although there are many studies about coverage for WMSNs, most of them are based on two-dimensional terrain assumptions. However, particularly for outdoor applications, three-dimensional (3-D) terrain structure affects the performance of the WMSN remarkably. In this paper, a novel 3-D WMSN simulation environment for connected coverage issues is presented. There are four main modules of our simulation environment. The terrain generator (TerGen) generates a synthetic 3-D landscape with different weather conditions (snow, rain, and fog), object occlusions (artificial or natural objects), and toughness levels of terrain (smooth or rough). The scenario editor (SenEd) is used to define various sensor types that have various behavioral and locational attributes. The outputs of TerGen and SenEd are the inputs of the simulator engine (SimEn), which simulates the WMSN and gives the performance results. The Optimization Module (OptMod), which is optional, can be used to determine the location of the sensors optimally, while satisfying a set of predefined constraints. Different scenarios are simulated to show the capabilities of the simulation environment. The performance results show that the 3-D terrain structure affects the coverage performance of the WMSN directly. The object occlusions and weather conditions are also very important for WMSN coverage.

关键词： connected coverage multi-objective optimization simulator wireless multimedia sensor network

来源：评论

学校读者我要写书评

暂无评论

Multi-objective Binary Reinforced Cuckoo Search Algorithm for Solving connected coverage target based WSN with Critical Targets

引用

WIRELESS PERSONAL COMMUNICATIONS 2021年第3期121卷 2301-2325页

作者： Thirugnanasambandam, Kalaipriyan Raghav, R. S. Anguraj, Dinesh Kumar Saravanan, D. Janakiraman, S. VIT Univ Sch Comp Sci & Engn Chennai Campus Chennai Tamil Nadu India SASTRA Deemed Univ Sch Comp Thanjavur Tamil Nadu India Koneru Lakshmaiah Educ Fdn Dept Comp Sci & Engn Guntur Andhra Pradesh India VIT Bhopal Univ Sch Comp Sci & Engn Sehore Madhya Pradesh India Pondicherry Univ Dept Banking Technol Pondicherry India

In the stream of WSN, covering the targets using sensors and communication among the sensors to forward the data packets is a prime challenge due to the sparse target locations. Dedicated sensors lead more installation cost and significant amount of maintenance needs to be charged. coverage of multiple targets by few sensors leads to network failure in case if any sensor runs out of power. Targets in sparse region also should be considered into account while sensing the environment. Hence in this paper, an effective multi-objective connected coverage target based WSN algorithm is proposed namely Multi-Objective Binary Cuckoo Search algorithm. The proposed model also handles the critical targets in the given sensing region. The algorithms hold the potentiality to handle minimized sensor deployment, maximized coverage and connectivity cost simultaneously. The proposed model is compared with the state of art algorithms to prove its significance. Two dedicated simulation region is developed in a large scale to examine the efficiency of the proposed algorithm. The results shows the significance of the proposed model over existing algorithms.

关键词： connected coverage Target based WSN Multi-Objective Reinforced Cuckoo Search Algorithm Critical targets

来源：评论

学校读者我要写书评

暂无评论

Optimal deployment in randomly deployed heterogeneous WSNs: A connected coverage approach

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2014年 46卷 182-197页

作者： Sevgi, Cuneyt Kocyigit, Altan Isik Univ Dept Informat Technol Istanbul Turkey Middle E Tech Univ Inst Informat TR-06531 Ankara Turkey

Wireless sensor networks (WSNs) are resource-scarce networks and the optimization of the resources is challenging. As far as random deployment is concerned, the optimization of these resources becomes even more difficult In this paper, a novel framework is proposed for solving optimal deployment problems for randomly deployed and clustered WSNs. In several existing approaches to solve these problems, either only partial-coverage is considered or only connectivity is analyzed when full-coverage is assured. Through this study, we aim to contribute to the better understanding of partial connected coverage. For this purpose, we introduce cluster size formulations which provide network designers with estimating partial-coverage easily. While the proposed framework facilitates our cluster size formulations for coverage estimations, it also adopts the percolation theory to analyze the degree of connectivity when the targeted degree of partial-coverage is achieved. As the partial connected coverage approach reflects real-life deployment scenarios, the use of percolation theory results in generic solutions of optimal deployment problems, which indeed makes the solution independent from any routing algorithms. Moreover, a practical optimal deployment problem is formulated to find the cheapest WSN application that satisfies the targeted degree of partial connected coverage. Further, in this paper, the cost effectiveness of the node heterogeneity is investigated through comparing the heterogeneous WSNs with their homogeneous counterparts. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： connected coverage Clustering Optimal deployment Cost effectiveness Node heterogeneity

来源：评论

学校读者我要写书评

暂无评论

connected coverage in Wireless Networks with Directional Antennas

引用

ACM TRANSACTIONS ON SENSOR NETWORKS 2014年第3期10卷 51-51页

作者： Yu, Zuoming Teng, Jin Bai, Xiaole Xuan, Dong Jia, Weijia Jiangsu Univ Sci & Technol Sch Zhangjiagang Zhenjiang Jiangsu Peoples R China Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA Dunnhumby USA London England Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China

In this article, we address a new unexplored problem: what are the optimal patterns to achieve connected coverage in wireless networks with directional antennas. As their name implies, directional antennas can focus their transmission energy in a certain direction. This feature leads to lower cross-interference and larger communication distance. It has been shown that, with proper scheduling mechanisms, directional antennas may substantially improve networking performance in wireless networks. In this article, we propose a set of deployment patterns to achieve full coverage and up to 2-connectivity under two different antenna models, namely the sector model and the knob model. These patterns are optimal under most combinations of communication and sensing ranges. We also introduce with detailed analysis several fundamental theorems and conjectures. Finally, we examine a more realistic physical model, where there might be strong interference and both the sensing range and the communication range might be irregular. The results show that our designed patterns work well even in unstable and fickle physical environments.

关键词： Theory Directional antenna wireless networks optimal deployment pattern connected coverage

来源：评论

学校读者我要写书评

暂无评论

An energy efficient connected coverage protocol in wireless sensor networks

An energy efficient connected coverage protocol in wireless ...

引用

9th Asia-Pacific Web Conference/8th International Conference on Web-Age Information Management (APWeb/WAIM 2007)

作者： Mao, Yingchi Xu, Zhuoming Liang, Yi Hohai Univ Coll Comp & Informat Engn Nanjing 210098 Peoples R China State Power Corp China Automat Res Inst Nanjing 210009 Peoples R China

ISBN: (纸本)9783540724834

The connected coverage is one of the most important problems in Wireless Sensor Networks. However, most existing approaches to connected coverage require knowledge of accurate location information. This paper solves a challenging problem: without accurate location information, how to schedule sensor nodes to save energy and meet both constraints of sensing area coverage and network connectivity. Our solution is based on the theoretical analysis of the sensing area coverage property of minimal dominating set. We establish the relationship between point coverage and area coverage, and derive the upper and lower bound that point coverage is equivalent to area coverage in random geometric graphs. Based on the analytical results and the existing algorithms which construct the connected dominating set, an Energy Efficient connected coverage Protocol (EECCP) is proposed. Extensive simulation studies show that the proposed connected coverage protocol can effectively maintain both high quality sensing coverage and connectivity for a long time.

关键词： wireless sensor networks connected coverage dominating set

来源：评论

学校读者我要写书评

暂无评论

Clifford Sensor Network connected coverage energy analysis

Clifford Sensor Network connected coverage energy analysis

引用

International Conference on Industry, Information System and Material Engineering

作者： Pu, LiJuan Cao, WenMing Liang, XaoJiang Xidian Univ Sch Elect Engn Xian 710071 Shanxi Peoples R China Shenzhen Univ Intelligent Informat Inst Shenzhen 518060 Guangdong Peoples R China Shenzhen Chao Yue Wu Xian technol CO Ltd Shenzhen 518060 Guangdong Peoples R China

ISBN: (纸本)9783037850275

IN a Clifford Wireless Sensor Network, We aimed to extend network lifetime while maintaining a high quality of service. In this paper we researched the Geometric algebra capacity theorem of the connection map of the 3-D Clifford sensor network model on the basis of ref [1]. Then we proposed Clifford Sensor Network Connectivity-coverage Energy Consumption Algorithm (CSNCCECA) under the principle of nearest direction. This algorithm can efficiently utilize energy by building an efficient connection map of the WSN. Finally we tested and verified the rationality of the algorithm. The experiment results show that SDECA based on Shortest-Distance is exceeded by CSNCCECA as demonstrated in fig. 4.

关键词： Clifford Algebra connected coverage energy analysis

来源：评论

学校读者我要写书评

暂无评论

Efficient Movement Control Actor Relocation for Honing connected coverage in Wireless Sensor and Actor Networks

Efficient Movement Control Actor Relocation for Honing Conne...

引用

37th Annual IEEE Conference on Local Computer Networks (LCN)

作者： Imran, Muhammad Haider, Noman Alnuem, Mohammed King Saud Univ Coll Comp & Informat Sci Riyadh 11451 Saudi Arabia Univ Teknol PETRONAS Dept Elect & Elect Engn Seri Iskand Malaysia

ISBN: (纸本)9781467321303;9781467321280

Recently, Wireless sensor and actor networks (WSANs) are getting growing interest from research community because of their potential for enormous range of applications. Actors in WSANs are capable to perform application-oriented actions in response to sensor detected events such as extinguish fire and rescue survivors. To perform such actions, efficient actor placement is extremely crucial for the actors to cover the area of interest. Moreover, maintaining strong inter-actor connectivity is extremely desirable for the actors to interact with each other and synchronize their operation. However, most application environments of WSANs are inaccessible due to harsh terrain;therefore random deployment of nodes becomes an inherent choice. Random placement of actors often strangles coverage and leads to high concentration deployment. Therefore, it becomes imperative to pursue autonomous dispersion. The prime objective of this work is to improve the connected coverage while minimizing the movement overhead. This paper presents a localized and distributed Movement Control Actor Relocation (MCAR) algorithm. The MCAR pursues post-deployment actor repositioning in such a way that actors repel each other for better coverage while staying connected. Simulation results validate the performance of the proposed scheme in terms of connected coverage and resource efficiency. The results show that MCAR can reduce distance movement up to 32% while improving coverage up to 29% compared to contemporary schemes.

关键词： Wireless sensor and actor networks Movement control connected coverage Actor relocation

来源：评论

学校读者我要写书评

暂无评论

Achieving Guaranteed connected coverage by Using Virtual Hexagonal Partition in Wireless Sensor Networks

Achieving Guaranteed Connected Coverage by Using Virtual Hex...

引用

13th Annual Wireless Telecommunications Symposium (WTS)

作者： Adulyasas, Attapol Sun, Zhili Wang, Ning Univ Surrey Ctr Commun Syst Res Guildford GU2 5XH Surrey England

ISBN: (纸本)9781479912971

Node provisioning in wireless sensor networks is very high density and is a cause of data duplication. Therefore, sensors' duty-cycling is a significant process in order to reduce data load and prolong network lifetime, where certain sensors are selected to be active, while some others are pushed into sleep mode. However, quality of service in terms of network connectivity and sensing coverage must be guaranteed. This paper proposes a sensor selection method to guarantee connected coverage by using hexagonal tessellation as a virtual partition which consists of many hexagonal cells across the network. Six pieces of equilateral triangles in each hexagonal cell are target areas in which k sensors are selected to operate. Performance of the method is evaluated in terms of quality of connected coverage, number of active nodes, efficient coverage area and chance of node selection.

关键词： Wireless sensor network connected coverage hexagonal tessellation sensing disk communication disk

来源：评论

学校读者我要写书评

暂无评论

connected coverage for RFID and Wireless Sensor Networks

引用

Procedia Computer Science 2012年 10卷 1046-1051页

作者： Ahmed Jedda Mazen Khair Hussein T. Mouftah University of Ottawa School of Electrical Engineering and Computer Science Ottawa K1N 6N5 Canada

We introduce a localized distributed algorithm for the connected RFID coverage problem which we name LCTC (Local Connect Then Cover). Given a set of RFID readers V and tags T , the problem is to find the minimum number of readers Va such that they form, with a gateway node vg , a connected network. That is the induced graph of { Va ∪ vg } is connected where any two readers are connected if they are in proximity of each other. Algorithm LCTC which builds a connected dominating set and add to it more nodes to cover every tag in the network. Algorithm LCTC was shown through simulation experiments to give excellent results in terms of the number of non-redundant readers generated and execution time. Algorithm LCTC can be applied to the targets connected coverage problem found in the field of wireless sensor networks and RFID/Sensors networks.

关键词： RFID Wireless Sensor Networks connected coverage

来源：评论

学校读者我要写书评

暂无评论

CoRMAC: A connected Random Topology Formation With Maximal Area coverage in Wireless Ad-Hoc Networks

引用

IEEE INTERNET OF THINGS JOURNAL 2023年第14期10卷 12379-12392页

作者： Tosun, Mustafa Cabuk, Umut Can Haytaoglu, Elif Dagdeviren, Orhan Ozturk, Yusuf San Diego State Univ Dept Elect & Comp Engn San Diego CA 92182 USA Pamukkale Univ Dept Comp Engn TR-20160 Denizli Turkiye Ege Univ Int Comp Inst TR-35040 Izmir Turkiye Ege Univ Dept Comp Engn TR-35040 Izmir Turkiye

Random geometric graphs can be used in constructing topology formations for wireless ad-hoc networks (WANETs), including wireless sensor networks, flying ad-hoc networks, and others. They are useful for energy-saving schemes where a randomly alternating subset of deployed nodes is turned off temporarily (without compromising the network connectivity). This also improves network security by periodically rerouting the data flow, which makes it harder for third parties to run a traffic analysis. In the area and target coverage scenarios, a WANET deployment is desired to have maximal area coverage efficiency, which implies covering the largest possible area using the fewest number of nodes by maintaining the connectivity as well. Although deterministic topology formations offering optimal area coverage are known, a random node deployment method that grants connectivity and area coverage maximality has not been presented, to the best of our knowledge. This study introduces a novel topology formation method, called CoRMAC, that consistently yields tree-formed random geometric graphs that are guaranteed to be connected and offer maximal area coverage for any given area size and node cardinality. The area coverage maximality of CoRMAC is formally proven. Extensive theoretical and computational analyses have been provided to demonstrate its graph-theoretic, Euclidean, and networking features. Moreover, comparisons were made with other approaches to show the effectiveness of the proposed method.

关键词： Area coverage connected coverage connected random topology random geometric graph wireless ad-hoc networks (WANETs)

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：