Welcome![Sign In][Sign Up]
Location:
Search - sensor nodes matlab

Search list

[SCMmib_beacon_coordinator_save

Description: 无线传感器星型网络的节点的基站程序,采用802.15.4协议-Star-shaped network of wireless sensor nodes of the base station procedures, using 802.15.4
Platform: | Size: 534528 | Author: chenling | Hits:

[3G developwireless_network

Description: 无线传感器网络节点寿命,网关数,网络瓶颈、网关数仿真-Wireless sensor network nodes life expectancy, the number of gateways, network bottlenecks, Gateway few simulation
Platform: | Size: 8192 | Author: yanshulei | Hits:

[OthertheImplementationofWirelessSensorNetworkNode

Description: 本论文研究的主要内容是设计基于CC2420的Zigbee无线传感器硬件节点,通过对Zigbee协议的理解与分析设计并完成一个通信节点。本文中选择的射频芯片CC2420,是挪威Chipcon公司推出的一款符合IEEE 802.15.4标准的收发芯片,只需很少的外围元件就可以与单片机构成一个无线通信系统 微处理器是ATMEL公司生产的RISC结构的8位单片机ATmega128。-This paper studies the design of the main contents of the CC2420-based hardware Zigbee wireless sensor nodes, through the Zigbee protocol understanding and analysis of the design and completion of a communication node. In this paper, select the radio frequency chip CC2420, is a Norwegian company Chipcon launched a line with the standard IEEE 802.15.4 transceiver chips, only very few external components can be and constitute a single-chip wireless communication system is a microprocessor ATMEL Corporation production RISC architecture 8-bit MCU ATmega128.
Platform: | Size: 1477632 | Author: 刘炜 | Hits:

[Communicationdiffusion

Description: 定向扩散(Directed Diffusion, DD)协议在omnet++模拟器上的实现。原理:Sink 向所有传感器节点发送兴趣(兴趣是通过分配不同的属性值来表示不同任务的描述符) , 每个传感器节点在收到兴趣后将其保存在各自的 CACHE 中。每个兴趣项包含一个时间标签域和若干个梯度域。当一个兴趣传遍整个网络后, 从 Source 到 Sink 之间的梯度就建立起来了,梯度反映了网络中节点对匹配请求条件的数据源的近似判断。一旦Source 采集到兴趣所需的数据, 那么它将沿着该兴趣的梯度路径传输数据到汇集点或基站。-Directional proliferation (Directed Diffusion, DD) agreement omnet++ Realize simulator. Principle: Sink to all sensor nodes send interest (interest is through the distribution of different attribute values to express a different mission descriptors), each sensor node after the receipt of interest in the preservation of their respective CACHE. Interest of each tag contains a time domain and a number of gradient domain. When an interest throughout the network, from the Source to Sink gradient between the built up, the gradient reflects the network node on the request of the conditions of matching the data source to determine approximate. Once the Source of interest collected the required data, it would be interested in the gradient along the path to transmit data to the focal point or base station.
Platform: | Size: 657408 | Author: xiaomeihua | Hits:

[matlab87361032particle-filter-mcmc

Description: 针对无线传感器网络的节点的追踪算法matlab仿真。-For wireless sensor network nodes tracking algorithm matlab simulation.
Platform: | Size: 14336 | Author: 王东 | Hits:

[OtherMAC

Description: 无线传感器网络的传感器节点多布置在环境恶劣的区域,人们往往无法到达,更换电池变为一种不可能,因此极其需要一种能够节省能量的MAC层协议-Wireless sensor networks sensor nodes arranged in more environmentally degraded areas, people often can not reach, the replacement of the battery into an impossible, therefore a great need to save energy, MAC layer protocol
Platform: | Size: 24576 | Author: 乐峰 | Hits:

[Otherheed

Description: 此代码解决了HEED协议下关于无线传感器网络路由节点优化问题的研究和选择-This code under the agreement to resolve the HEED on wireless sensor nodes to optimize network routing and choice of study
Platform: | Size: 3072 | Author: 张萌 | Hits:

[matlabSensor_air

Description: Matlab based wireless sensor network code for hetrogeneous application in Airports. This is based on clustering of nodes.
Platform: | Size: 2048 | Author: wireless | Hits:

[Communication-Mobilecompose_all

Description: 无线传感器网络的所有锚节点的能量分布的一个仿真,有详细的程序分析和解释。-Wireless sensor networks for all of the energy distribution of anchor nodes in a simulation, there is a detailed program analysis and interpretation.
Platform: | Size: 2048 | Author: Helen | Hits:

[Otherpegasis

Description: 无线传感器网,PEGASIS算法组网程序。在1*1范围内的以node_number个节点,以PEGASIS算法成网。-Wireless sensor networks, PEGASIS algorithm networking program. 1* 1 to node_number within the nodes in order to PEGASIS algorithms into a network.
Platform: | Size: 1024 | Author: dawn | Hits:

[matlabCAB

Description: 无线传感器网络 CAB定位仿真程序 这是无线传感器节点定位CAB算法的仿真程序,由matlab完成-Wireless sensor network simulation program CAB positioning is CAB localization algorithm for wireless sensor nodes in the simulation program, completed by the matlab
Platform: | Size: 1024 | Author: 范玉红 | Hits:

[matlabLQ

Description: Estimating the positions of sensor nodes is a fundamental and crucial problem in ad hoc wireless sensor networks (WSNs). In this paper, an accurate node localization method for WSNs is devised based on the weighted least squares technique with the use of time-of-arrival measurements. Computer simulations are included to evaluate the performance of the proposed approach by comparing with the classical multidimensional scaling method and Cram´ er-Rao lower bound.
Platform: | Size: 518144 | Author: pravin jadhav | Hits:

[matlabDV-hop

Description: 在matlab软件下实现传感器节点的拓扑设置以及DV_hop算法,得到未知节点的坐标-Matlab software in the topology of sensor nodes to achieve DV_hop algorithm settings and to get the coordinates of the unknown node
Platform: | Size: 1024 | Author: huyan | Hits:

[matlabDRSSI

Description: 针对煤矿井下巷道狭长,信号多径效应明显,接收信号强度(RSSI)测距算法受井下环境影响大,定位精度低的情况,提出了一种信标节点链式部署结构下的动态RSSI测距算法,该算法以信标节点间的距离和它们间测量到的RSSI值为参考,计算巷道内实际环境下的路径衰落指数,以提高RSSI测距算法对环境的适应性。-A dynamic RSSI location algorithm is proposed based on the beacon nodes chain deployment of tunnel Wireless Sensor Networks and the algorithm takes the distance and the corresponding RSSI between the adjacent beacon nodes into account to calculate the actual path loss parameter in the tunnel, thus improving the environmental adaptation of the location algorithm.
Platform: | Size: 144384 | Author: qiaogz | Hits:

[Windows Mobilewsn-simulation-in-matlab

Description: Wireless Sensor Networks (WSN) is different than the Cellular Networks as I mentioned earlier. A WSN is composed of a large number of sensor nodes that communicate using a wireless medium (air). The sensor nodes are deployed randomly in the environment to be monitored. The sensor nodes distributed in ad hoc structure. In WSN there is no base station and not all nodes hear each other. The WSN is a multi-hop network. Basic part of my code is to randomly place the sensor nodes in the given space then connecting each two nodes if the distance between them less than or equal to the communication radius.
Platform: | Size: 41984 | Author: khala | Hits:

[GUI DevelopAO(Matlab)min_routing1234

Description: 在无线传感网络中,求解路由算法最短路径,节省传感节点的能量-Energy in wireless sensor networks, routing algorithm for solving the shortest path, saving sensor nodes
Platform: | Size: 1024 | Author: 王蓉 | Hits:

[OtherOne_Point

Description: 传感器节点在链状拓扑结构中的传输仿真,可控制跳距,跳数,节点间距离(The transmission simulation of sensor nodes in chain topology can control hop distance, hop count and distance between nodes)
Platform: | Size: 6144 | Author: 萝卜大帅 | Hits:

[matlabSPAN (1)

Description: numbers of nodes for wireless sensor nodes
Platform: | Size: 3072 | Author: samna | Hits:

[OtherBeamforming

Description: 在圆内随机分布的传感器节点利用波束成形与卫星直接通信。(Distributed sensor nodes that is randomly distributed in the circle can create a direct communication with satellite using Beamforming.)
Platform: | Size: 1024 | Author: 朱圣祥 | Hits:

[Data structsnew-DV-Hop-code

Description: 改进DV-Hop定位算法 首先设置初始量,布置了一个范围为100×100m2的区域,其上随机分布100个传感器节点,其中有10个信标节点,节点的通信半径为30m。 第二步在正方形区域内产生均匀分布的随机拓扑,随机产生节点坐标并将其中十个选定为信标节点,其余九十个设为未知节点,然后画出节点分布图。 第三步通过最短路径法计算未知节点与每个信标节点的最小跳数。 第四步根据前面记录的其他信标节点的位置信息和相距跳数估算平均每跳的实际距离,用跳数估计距离的方法得出未知节点到信标节点的距离。 第五步用极大似然估计法求未知节点坐标 (Improved DV-Hop localization algorithm first set the initial amount, layout 100100m2 the area of ​ ​ a range of 100 sensor nodes randomly distributed on the 10 beacon node, the node communication radius of 30m. The second step in the square area to generate uniformly distributed random topology, random coordinates of the nodes and ten of the selected beacon node, the remaining 90 is set to unknown node, and then draw the node distribution diagram. The third step is to calculate the minimum number of hops of the unknown node and each beacon node through the shortest path method. The fourth step according to the location information of the other beacon nodes in the previous record and away from hops to estimate the average hop distance and hop count to estimate the distance to come to the distance of the unknown node to beacon nodes. The fifth step maximum likelihood estimation method and the unknown coordinates of the nodes)
Platform: | Size: 1024 | Author: robinkk4 | Hits:
« 12 3 »

CodeBus www.codebus.net