搜索资源列表
Clustering
- 根据节点分区情况，确定成簇数目是分簇算法设计的重点，这两个算法对成簇数目进行优化，均匀节点能耗，延长网络寿命。-According to the node partition, determine the number of clusters is a clustering algorithm is designed to focus on these two algorithms to optimize the number of clusters, uniform node energy c
presentation
- WSNs being energy constrained systems, one major problem is to employ the sensor nodes in such a manner so as to ensure maximum coverage and connectivity with minimal or optimal number of nodes and furthermore elongate network lifetime with maximum e
newleach
- 针对广泛流行的无线传感网络层次路由协议做了一点改进，算法的效率得到很大的改善，可以用NS2模拟一下-Popular for a wide range of wireless sensor network-level routing protocol to do a little improvement in the efficiency of the algorithm greatly improved, you can use NS2 simulation of what
s02-5
- Power consumption is an important design criterion in the design of wireless sensor networks. Hybrid radio frequency/free space optical wireless sensor networks (RF/FSO WSN) have been proposed to reduce the energy consumption of traditional R
1234
- Extending the Network Lifetime of Wireless Sensor Networks Using Residual Energy Extraction—Hybrid Scheduling Algorithm-Extending the Network Lifetime of Wireless Sensor Networks Using Residual Energy Extraction—Hybrid Scheduling Algorithme
simulat
- 比较了短信息在无标度网络、小世界网络和实际的短信息网络三种网络中的传播过程, 寻找影响短信息传播 的因素. 研究发现, 网络拓扑结构和手机用户的转发短信行为均会影响短信息传播过程. 在无标度网络中短信息传 播速率快于小世界网络和实际的短信息网络, 而无标度网络的短信息寿命较小世界网络和实际的短信息网络短 网络中手机用户的转发短信息行为明显影响短信息的传播过程. 同时还发现短信息寿命与网络直径有关.-Compared the short message in the scale-fr
ant_wsn
- 为了在无线传感器网络中降低能耗和最大化网络生存期,提出一种能量高效的数据收集算法 (energy-efficient data gathering algorithm, EEDGA)。该算法利用移动代理模型在网络中进行数据收集。首先, EEDGA根据监测精度的要求控制活动节点的数量 然后,通过求最小支配集得到具体的工作节点 最后,利用蚁 群算法规划移动代理迁移的最优路线,移动代理以渐进方式收集活动节点的监测数据。仿真结果表明,与典型算 法相比,该算法具有更低的能耗和更长的网络生存
genetic-to-optimize-lifetime-of-wsn
- there is a new approach Using in Wireless sensor network to Clustering, in this approach we use GA algorithm to optimize the lifetime of network.
paiduilun
- 排队论轮询算法的matlab性能仿真，包括简单轮询算法和加权轮询算法，比较10个节点网络的生存时间，自己写的代码~-Queuing theory polling algorithm matlab performance simulation, including a simple algorithm and weighted round robin polling algorithm and compare 10 node network lifetime, write your own cod
pegasis_bo
- 该协议是LEACH的改进，思想是：为了延长网络的生命周期，节点只需要和她们最近的邻居之间进行通信。节点与汇聚点间的通信过程是轮流进行的，当所有节点都与汇聚点通信后，节点间再进行新一回合的轮流进行的。由于这种轮流通信机制使得能量消耗能够统一的分布到每个节点上，因此降低了整个传输所需要消耗的能量。-The agreement is LEACH improvement idea is: To prolong the network lifetime, and between nodes only ne
leachm1
- 无线传感器网络LEACH路由算法Matlab仿真程序，包括簇首选择、成簇、数据传输、计算节点能耗和网络寿命-LEACH wireless sensor network routing algorithm Matlab simulation program, including the cluster head selection, clustering, data transmission, the compute node energy consumption and network life
final-paper
- IMPROVING THE NETWORK LIFETIME OF WSN USING DYNAMIC STABLE LEACH ELECTION PROTOCOL
RRUCR_install-(1)
- A Protocol for clustered heterogeneous for Wireless Sensor Network has been proposed to prolong the network lifetime
LEACH
- 一种低功耗的经典簇类协议，能够有效的延长网络生存周期-A low-power classic cluster class protocol, can effectively extend the network lifetime.
code
- the network lifetime based on a new Energy-Aware Objective Function used to design a Routing Protocol for Low-Power and Lossy Networks. The proposed Objective Function uses the Expected Transmission Count Metric and the Remaining Energy on each senso
M-GEAR
- In this research work, we advise gateway based energy-efficient routing protocol (M-GEAR) for Wireless Sensor Networks (WSNs). We divide the sensor nodes into four logical regions on the basis of their location in the sensing field. We install Base S
OPTI2
- 一种无线传感网络寿命优化算法2，研究无线传感网络非常有用-A wireless sensor network lifetime optimization algorithms in wireless sensor networks are useful
7213211Dijkstra_router
- Abstract—We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing (RMECR) and reliable minimum energy routing (RMER). RMECR addresses three important requirements of ad hoc netwo
63215774routing
- Abstract—We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing (RMECR) and reliable minimum energy routing (RMER). RMECR addresses three important requirements of ad hoc netwo