共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
A Unified Analytic Framework Based on Minimum Scan Statistics for Wireless Ad Hoc and Sensor Networks 总被引:1,自引:0,他引:1
Due to limitations on transmission power of wireless devices, areas with sparse nodes are decisive to some extreme properties of network topology. In this paper, we assume wireless ad hoc and sensor networks are represented by uniform point processes or Poisson point processes. Asymptotic analyses based on minimum scan statistics are given for some crucial network properties, including coverage of wireless sensor networks, connectivity of wireless ad hoc networks, the largest edge length of geometric structures, and local-minimum-free geographic routing protocols. We derive explicit formulas of minimum scan statistics. By taking the transmission radius as a major parameter, our results are applied to various network problems. This work offers a unified approach to solve various problems and reveals the evolution of network topology. In addition, boundary effects are thoroughly handled. 相似文献
3.
Topology control is a fundamental issue in wireless ad hoc and sensor networks. Due to intrinsic characteristic of flatness, hierarchical topology can achieve the scalability and efficiency of a wireless network. To solve this problem, one can construct a virtual backbone network by using a connected dominating (CDS) set of a wireless network. In past few years, efficiently and fast construct a CDS in a wireless network as a virtual backbone has been the main research problem in hierarchical topology control. In this paper, we give a comprehensive survey for CDSs and related problems with various network models and specific applications. To conclude, some open problems and interesting issues in this field are proposed. 相似文献
4.
5.
Baysan Mehmet Sarac Kamil Chandrasekaran Ramaswamy Bereg Sergey 《Parallel and Distributed Systems, IEEE Transactions on》2009,20(7):913-924
Network-wide broadcast (simply broadcast) is a frequently used operation in wireless ad hoc networks (WANETs). One promising practical approach for energy-efficient broadcast is to use localized algorithms to minimize the number of nodes involved in the propagation of the broadcast messages. In this context, the minimum forwarding set problem (MFSP) (also known as multipoint relay (MPR) problem) has received a considerable attention in the research community. Even though the general form of the problem is shown to be NP-complete, the complexity of the problem has not been known under the practical application context of ad hoc networks. In this paper, we present a polynomial time algorithm to solve the MFSP for wireless network under unit disk coverage model. We prove the existence of some geometrical properties for the problem and then propose a polynomial time algorithm to build an optimal solution based on these properties. To the best of our knowledge, our algorithm is the first polynomial time solution to the MFSP under the unit disk coverage model. We believe that the work presented in this paper will have an impact on the design and development of new algorithms for several wireless network applications including energy-efficient multicast, broadcast, and topology control protocols for WANETs and sensor networks. 相似文献
6.
Seung-Wan Han In-Seon Jeong Seung-Ho Kang 《Journal of Network and Computer Applications》2013,36(1):156-166
We propose the minimum Wiener index spanning tree (MWST) as a routing topology that is suitable for sensor networks with multiple mobile base nodes. However, it was proved that finding a spanning tree with the minimum Wiener index from a weighted graph is NP-hard. To address this problem and analyze the effectiveness of the MWST as the routing tree on sensor networks with multiple mobile base nodes, we designed two algorithms: a branch and bound algorithm for small-scale wireless sensor networks and a simulated annealing algorithm for large-scale wireless sensor networks. The simulation results show that MWST outperforms the minimum spanning tree (MST), one of the representative spanning trees used in many routing protocols for sensor networks, in terms of energy efficiency and packet delay. 相似文献
7.
基于ZigBee技术的无线传感网的安全分析 总被引:6,自引:0,他引:6
无线通信技术和电子器件技术的快速发展,促进了由传感器组成的无线传感网(WSN)的应用。在大多数应用环境中,用户对WSN的安全性有很高的要求,因此,安全成为制约WSN进一步广泛应用的关键。然而,新兴的ZigBee技术在组网方面体现其安全性。本文对ZigBee技术在组网方式、安全结构、加密算法等安全方面进行了全面的剖析。 相似文献
8.
基于动态网格划分的移动无线传感器网络定位算法 总被引:2,自引:1,他引:1
定位技术是无线传感器网络中关键的基础支撑技术,目前提出了许多静态网络的节点定位算法,移动无线传感器网络的定位研究相对较少.针对定位节点和参考节点随机运动的网络模型,提出了一个基于动态网格划分的蒙特卡罗定位算法.算法中当接收的参考节点数超过一定阈值时使用最远距离节点选择模型,选出部分参考节点参与定位和信息转发,节约能耗.接着基于选择的或所有接收的参考节点构建采样区域,进行网格划分,使用网格单元数计算最大采样次数,在采样区域内采样并使用误差补偿的运动模型进行过滤,提高了采样效率,减少了计算开销,并保证了较好的定位精度.仿真实验表明算法在定位精度,计算开销、能耗等方面都具有较好的性能. 相似文献
9.
平均度约束的无线传感器网络拓扑控制 总被引:3,自引:0,他引:3
拓扑控制是无线传感器网络中最重要的技术之一.大规模随机部署的无线传感器网络节点,在满足无线传感器网络拓扑连通性的前提下,如何保证网络结构的稀疏性是一个亟待解决的问题,目前已有的研究结果表明当节点密度较大时,得到的网络拓扑复杂,计算路由将严重消耗节点资源.文中提出了一种平均度约束的无线传感器网络拓扑控制,通过增加节点通信半径,约束节点的平均度来解决网络的连通性与网络拓扑的稀疏性之间的矛盾.数值模拟表明:通过平均度约束的无线传感器网络拓扑控制,可减少网络中选出的工作节点数,保证了网络的稀疏性,简化了路由的复杂度,从而延长了网络的生存周期. 相似文献
10.
无线传感器网络是当前研究和应用的热点,拓扑控制是其研究的重要领域。在与其他传统无线网络拓扑控制机制比较的基础上,归纳了无线传感器网络分簇算法应具有的特性,并对近年来针对无线传感器网络提出的有代表性的分簇算法进行了研究,总结了各种分簇算法的特点和适合的应用场合,重点分析了它们的不足之处,最后指出了无线传感器网络分簇算法未来发展的趋势。 相似文献
11.
无线网络拓扑控制中支撑图构造算法 总被引:1,自引:0,他引:1
支撑图(spanner)在无线(自主、传感器)网络拓扑控制中起着重要作用,不但能保证最终的拓扑图链路减少,保持连通性,而且保证任意一对通信节点之间所需费用是最少可能费用的常数因子倍.针对无线网络拓扑控制问题,大量支撑图构造算法被提出,以尽可能高效地满足网络设计需要的各种拓扑特性,如局部性、稀疏性、小权值、有界度及容错性等.对支撑图的研究成果进行了详细讨论,依据支撑图的定义和不同的分类原则给出了支撑图分类,分析了各种支撑图的典型集中式和局部算法、满足某一或多个拓扑特性的算法,并提出了需要进一步研究的问题.与无线网络中新出现、更实用的模型结合,寻找更简单、性能更好的算法将是未来支撑图构造算法的主要研究方向. 相似文献
12.
Exact formulations for the minimum interference problem in k‐connected ad hoc wireless networks
下载免费PDF全文
![点击此处可从《International Transactions in Operational Research》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Renato E. N. Moraes Celso C. Ribeiro Glaydston M. Ribeiro 《International Transactions in Operational Research》2016,23(6):1113-1139
Energy consumption is one of the most critical issues in wireless ad hoc and sensor networks. A considerable amount of energy is dissipated due to radio transmission power and interference (message collisions). A typical topology control technique aims at reducing energy consumption while ensuring specific desired properties to the established wireless network (such as biconnectivity). Energy minimization can be achieved by reducing the transmission power and selecting edges that suffer or cause less interference. We propose four integer programming formulations for the k‐connected minimum wireless ad hoc interference problem, which consists in a topology control technique to find a power assignment to the nodes of an ad hoc wireless network such that the resulting network topology is k‐vertex connected and the radio interference is minimum. Interference is measured by three different models: Boolean, protocol, and physical. We report computational experiments comparing the formulations and interference models. Optimal solutions for moderately sized networks are obtained using a commercial solver. 相似文献
13.
14.
15.
The growing trend in pervasive systems forces traditional wireless sensor networks to deal with new challenges, such as dynamic application requirements and heterogeneous networks. One of the latest paradigms in this area is software defined wireless sensor network. According to the paradigm, the networks take care of managing topological information and forwarding decisions using a bipartite architecture in which a control plane decides the forwarding policies and the data plane (i.e. ordinary sensor nodes) executes them. Unfortunately, in highly dynamic networks, this approach generates an overhead of control packet exchange between the ordinary nodes and the control plane, that leads to additional energy consumptions. This paper proposes a fuzzy logic based solution, called Fuzzy Topology Discovery Protocol (FTDP), to improve the efficiency of software defined wireless sensor networks. This work is designed according to the Software Defined Networking solution for WIreless SEnsor networks (SDN-WISE), which is an open source solution for software defined wireless sensor networks. The proposed work is one of the first attempts to use fuzzy theory in software defined based wireless sensor networks. The simulation results show that our approach can increase the lifetime of the network by 45% and decreases the packet loss ratio by 50% compared to the basic SDN-WISE solution. 相似文献
16.
Wireless sensor networks (WSNs) are a kind of communication networks having independent sensor nodes that form multi-hop ad hoc network to transfer data. In the past few years, various transport control protocols in wireless sensor networks (WSNs) have been developed and proposed in the literature. In this paper, we have analyzed pump slowly, fetch quickly (PSFQ) protocol and presented an improved transport layer protocol for wireless sensor networks. The improved protocol has been analyzed based on various factors such as average latency and average error tolerance and it is found that the proposed protocol is better than PSFQ in terms of these factors. 相似文献
17.
Ma Jian Gao Min Zhang Qian Ni Lionel M. 《Parallel and Distributed Systems, IEEE Transactions on》2007,18(5):711-720
Sensor networks have emerged as a promising technology with various applications, where power efficiency is one of the critical requirements. The recent IEEE 802.15.4 standard offers a promising platform for wireless sensor networks. Since each node can act as a coordinator or a device in the IEEE 802.15.4 standard, 802.15.4-based sensor networks have various possible network topologies. To reduce power consumption, in this paper, we try to construct network topologies with a small number of coordinators while still maintaining network connectivity. By reducing the number of coordinators, the average duty cycle is reduced and the battery life is prolonged. Three topology control algorithms are proposed in this paper. Self-pruning (SP) is the simplest one with O(1) running time and provides the shortest path to the sink node. Ordinal pruning (OP) can significantly improve SP in terms of power saving with O(n) running time. Layered pruning (LP) is a trade off between the first two pruning algorithms with O(radicn) running time and has a slightly higher power consumption than OP. Furthermore, all three algorithms are independent of the physical radio propagation characteristics. Extensive simulations have been performed to verify the effectiveness of the proposed topology control schemes 相似文献
18.
为了适应无线传感器网络的动态拓扑结构特性、提高数据汇聚的可靠性,MHR无线传感器网络的最小跳数梯度场应该实时动态更新。为节省能量,节点可实时监听其梯度化邻居节点信息并据此动态调整其拥有的最小跳数值,以实现MHR无线传感器网络最小跳数梯度场的廉价动态实时更新。理论分析和仿真结果表明该方法在无线传感器网络物理拓扑结构不发生大规模突变的状态下具有良好的效果。 相似文献
19.
在无线传感器网络的拓扑控制问题中,保持节点能耗最低路径和低节点度之间存在一种平衡.最佳的平衡点与具体的应用和网络状态有关.文中提出一种新的拓扑控制算法,使所构造的拓扑能在这两个不一致的目标之间进行调节.该算法所构造的拓扑结构在一极能保持所有能耗最低路径,另一极能使平均节点度逼近理论最小值.仿真结果证实新算法在比已有方案更真实的能量消耗模型下可以保持所有能耗最低路径,同时也显示新算法对节点度有更大的调节范围. 相似文献
20.
无线传感器网络的拓扑控制是一个十分重要的技术问题。干扰对传感器网络应用产生了重要的影响,较大的传输干扰将导致信号的碰撞,增大网络延时间。但是,目前的大多数文献没有把干扰作为传感器网络拓扑控制的设计目标和考虑因素之一。本文研究考虑干扰的拓扑控制机制问题,根据传感器网络通信特点,设计了最优的集中式算法和适合合实际应用的次优分布式算法解决该问题。模拟实验结果表明,提出的算法与传统算法相比能有效减少网络干扰、节省能量消耗和减少网络延时,因此是一种新的高效的拓扑控制机制。 相似文献