Implementation of energy efficient circuit design using A* algorithm in embedded network

In wireless sensor network, the routing path plays a prominent role in network resource utilization. Since, the nodes in network are open to physical abuse an effective routing protocol is necessary to improve data reliability in network and to overcome node data link disconnection. In this paper, we propose to implement A*EEDDP (Energy Efficient Distributed Diffusion protocol) to improve data reliability and increase network lifetime. The A* algorithm determines the shortest routing path between source node and destination node. In addition, the routing path determine with respect to parameters such as energy consumed for communication, residual energy of nodes and the time over which the nodes can support the routing path. The combined A*EEDDP implement in testbed and performance evaluate interms of network lifetime, throughput, packet delivery ratio, energy efficiency and end to end delay. The A*EEDDP performs better compared to other algorithm and achieves higher packet delivery ratio of 97%.     

基于最小费用最大流的MANET网络路由能量控制模型

MANET是当前无线网络研究的热点领域,作为网络层核心技术的路由协议显得尤为重要。控制节点能量、提高网络生存时间是实现在MANET中传输高效业务的关键。本文借鉴网络最小费用最大流思想,建立网络最大剩余能量最短路数学模型,提出了基于能量控制的网络路由优化模型。并且定义了网络生存时间作为评价指标,进行网络仿真。仿真结果表明,该模型可以有效地延长网络生存时间。     

一种新的基于DSR的移动自组网节能路由策略

移动自组网是由一组带有无线收发装置的移动节点组成的一个支持多跳的临时性的网络自治系统。由于移动自组网的大多数节点是由有限寿命的电池来提供的，因此能量保护策略成为制定路由协议的一个重要依据。该文提出了一种新的基于动态源路由协议的节能路由策略。仿真表明该策略有效地延长了网络的生存时间。并很好地均衡了节约能耗和保护网络传统性能的需求。     

最小路径负载度路由协议的研究

DSR协议是Ad hoc网络中典型的路由协议,DSR协议中路由选择策略是基于最短路径的,并未考虑路径的通信量和节点负载等因素,网络中数据流易集中于某些链路,这些链路上的节点承担相对较大的通信量,从而形成热点区域。热点区域的形成会缩短网络的寿命,并且会增加数据包的平均端到端时延,甚至影响数据包的投递率。为了解决上述问题,提出了基于路径负载度的动态源路由协议（LBDSR）,在路由选择时综合考虑了路径长度和路径繁忙度两个因素,有效地解决了热点区域问题,并减小网络中数据包的平均端到端时延,可以有效提高网络的负载平衡性能,延长网络寿命。     

移动模型对Ad hoc网络路由协议能耗的影响

Ad hoc网络节点能量受限的路由协议的研究是目前的一个热点，IETF的MANET小组提出的几种经典的路由协议，属于最短路由，即最小跳数路由，没有考虑能量因素。由于Ad hoc网络中的节点是由电池供电，整个网络是一个能量受限系统，如何节省节点的能量，尽可能延长网络的可操控时间成为衡量路由协议性能的重要指标。目前针对这几种路由协议基于节点能量约束的评估很少。基于移动模型，该文以能量消耗程度为指标，对Ad hoc 4种典型的路由协议在不同的运动场景下进行了比较系统的仿真研究，得出了一些有益的结论，为进一步研究基于能耗的Ad hoc网络路由协议提供一些参考。     

基于蚁群算法的无线自组网络能量控制路由研究

在深入分析现有路由协议的基础上,提出了一种基于蚁群算法的能量控制路由模型。首先分析网络特性,建立节点移动和能量消耗数学模型;然后,建立基于蚁群算法的能量控制路由模型,通过计算节点剩余能量和节点度等确定数据传输过程中节点被选择的概率;最后选择高概率节点作为中间节点进行数据转发。仿真结果显示:相比典型的DSR路由协议,该算法可以为网络提供能量保障,延长网络生存时间,弥补已有算法的不足。     

A Novel Gradient Boosted Energy Optimization Model (GBEOM) for MANET

Mobile Ad Hoc Network (MANET) is an infrastructure-less network that is comprised of a set of nodes that move randomly. In MANET, the overall performance is improved through multipath multicast routing to achieve the quality of service (quality of service). In this, different nodes are involved in the information data collection and transmission to the destination nodes in the network. The different nodes are combined and presented to achieve energy-efficient data transmission and classification of the nodes. The route identification and routing are established based on the data broadcast by the network nodes. In transmitting the data packet, evaluating the data delivery ratio is necessary to achieve optimal data transmission in the network. Furthermore, energy consumption and overhead are considered essential factors for the effective data transmission rate and better data delivery rate. In this paper, a Gradient-Based Energy Optimization model (GBEOM) for the route in MANET is proposed to achieve an improved data delivery rate. Initially, the Weighted Multi-objective Cluster-based Spider Monkey Load Balancing (WMC-SMLB) technique is utilized for obtaining energy efficiency and load balancing routing. The WMC algorithm is applied to perform an efficient node clustering process from the considered mobile nodes in MANET. Load balancing efficiency is improved with a higher data delivery ratio and minimum routing overhead based on the residual energy and bandwidth estimation. Next, the Gradient Boosted Multinomial ID3 Classification algorithm is applied to improve the performance of multipath multicast routing in MANET with minimal energy consumption and higher load balancing efficiency. The proposed GBEOM exhibits ∼4% improved performance in MANET routing.     

移动自组网中能量优化的路由算法研究综述

移动自组网是在没有中心基础设施情况下由一些移动用户自组织形成的多跳无线移动网络,通常为一些特殊环境提供临时通信便利.由于移动自组网中终端设备依赖于电池供电,为了延长节点的工作时间,要求尽量减少节点的能量消耗,从而延长整个网络的使用寿命.本文对当前存在的基于能量优化的单播和组播路由算法进行了分析和比较,阐述了目前亟待解决的主要问题和今后的研究方向.     

Random Walk Routing in WSNs with Regular Topologies

Topology is one of the most important characteristics for any type of networks because it represents the network's inherent properties and has great impact on the performance of the network. For wireless sensor networks (WSN), a well-deployed regular topology can help save more energy than what a random topology can do. WSNs with regular topologies can prolong network lifetime as studied in many previous work. However, little work has been done in developing effective routing algorithms for WSNs with regular topologies, except routing along a shortest path with the knowledge of global location information of sensor nodes. In this paper, a new routing protocol based on random walk is proposed. It does not require global location information. It also achieves load balancing property inherently for WSNs which is difficult to achieve by other routing protocols. In the scenarios where the message required to be sent to the base station is in comparatively small size with the inquiry message among neighboring nodes, it is proved that the random walk routing protocol can guarantee high probability of successful transmission from the source to the base station with the same amount of energy consumption as the shortest path routing. Since in many applications of WSNs, sensor nodes often send only beep-like small messages to the base station to report their status, our proposed random walk routing is thus a viable scheme and can work very efficiently especially in these application scenarios. The random walk routing provides load balancing in the WSN as mentioned, however, the nodes near to the base station are inevitably under heavier burden than those far away from the base station. Therefore, a density-aware deployment scheme is further proposed to guarantee that the heavy-load nodes do not affect the network lifetime even if their energy is exhausted. The main idea is deploying sensors with different densities according to their distance to the base station. It will be shown in this paper that incorporating the random walk routing protocol with the density-aware deployment scheme can effectively prolong the network lifetime.     

一种带有可控阈值参数的分簇路由优化算法

针对传感网中大量冗余数据导致通信频繁中断的问题,提出一种带有可控阈值参数的分簇路由优化算法。引入蚁群算法中的适应度函数和启发式函数,使得下一跳簇首节点的选择更具针对性,实现网络路由树的建立与事件域节点的分布式成簇。利用可控阈值参数和变异系数对网络路由所选最短路径进行优化,保证节点能量消耗较低的同时全网延时最小,并通过全局信息素的更新策略抑制长链路的产生,以均衡全网能量并延长网络生存周期。实验结果表明,该算法与DMOA和MTTA算法在抑制网络能量消耗和延长网络生存周期方面进行对比,其性能指标平均提升了13.72%和12.06%。     

概率转发的移动自组织网络路由协议

Ad Hoc网络节点能量受限的路由协议的研究是目前的一个热点,IETF的MANET小组提出的几种经典的路由协议,属于最短路由,即最小跳数路由,没有考虑能量因素。由于Ad Hoc网络中的节点是由电池供电,整个网络是一个能量受限系统,如何节省节点的能量,尽可能延长网络的可操控时间逐渐成为衡量路由协议性能的重要指标。基于移动节点的能量级别,采取不同的转发概率,提出了一种Ad Hoc网络基于概率的路由协议——PBR,并与AODV协议进行了性能比较,仿真结果显示,PBR明显改善了系统的能量消耗,延长了网络的存活时间,并且具有较优的可扩展性。     

基于能量水平的多Sink节点传感器网络路由算法

单Sink节点传感器网络存在着部分关键路径上节点能量消耗过快、路由选择算法单一以及Sink节点失效等问题.首先提出了多Sink节点传感器网络数据收集的系统框架;给出了拓扑发现和维护策略;然后提出了基于最小能量消耗路由算法.在分析了该算法的不足后提出了基于能量水平的路由算法,按照计算得到的能量水平选择最优的路径进行数据传送.实验证明,基于能量水平的路由算法比基于最小能量消耗路由算法能更有效提高传感器网络的使用寿命.     

Improvement of battery lifetime in software-defined network using particle swarm optimization based cluster-head gateway switch routing protocol with fuzzy rules

The software-defined network (SDN) is one of the network architectures, in which the data plane and control plane is divided from each other, and the network can be handled using a sensibly centralized controller and this method is adopted to reconfigure the wireless sensor network automatically. In this article, to implement the SDN in MANET, in which control nodes can be chosen in SDN dynamically for the activation of MANET function to allocate the works to other mobile nodes to the base station. However, in the field of mobile ad hoc networks, the network lifetime, and battery lifetime is one of the major problems and the energy consumption can play a significant rule for the transmission of data in the SDN. Therefore, in this article, particle swarm optimization (PSO) based CGSR (cluster-head gateway switch routing protocol) algorithm with fuzzy rules is proposed to increase the network lifetime of battery powered mobile nodes by reducing the energy consumptions of each node in software-defined MANET. In this proposed method, a routing method that can permit various mobile nodes with low battery power to transmits the data from source node to base station. We design a PSO based CGSR routing protocol by selecting the routing mobile nodes using fuzzy rules for packet transmission. In CGSR process, the formation of cluster and selection of cluster head is executed depending on the particle swarm optimization method. This proposed routing protocol can be used to enhance the battery lifetime by extension of the network lifetime with numerical analysis for efficient route node selection.     

Ad Hoc网络链路质量QoS多路径按需路由协议

传统的MANET路由协议是基于最小跳数的路由,没有考虑链路质量,不能适应网络拓扑的动态变化。针对这一问题,提出了一种Ad Hoc网络链路质量QoS多路径按需路由协议（QMORP）。QMORP采用移动预测来计算链路的生存时间,应用能量模型获得链路的剩余能量,综合链路生存时间和剩余能量两种因素来计算链路质量。选择链路质量大的路径转发分组。仿真实验表明,相比AOMDV协议,QMORP协议提高了网络的生命周期,降低了网络的平均端对端延迟、提高了网络的发包率和吞吐率。     

基于最短路径树的优化生存时间路由算法

为提高无线传感网的生存时间,提出基于最短路径树的优化生存时间路由算法(LORA_SPT).该算法引入节点分类概念,构造基于链路能耗因子、自身节点剩余能量因子、邻居节点剩余能量因子和类型权重因子等多个因子的权值函数.针对不同类型的节点采用不同的权重因子,最后利用dijkstra算法完成最短路径树,所有节点沿着最短路径树将...     

Centroid virtual coordinates – A novel near-shortest path routing paradigm

Geographic routing has received increasing attention in the context of Wireless Sensor Networks since it frees the network from the energy-demanding task of building and maintaining a structure. It requires however each node to know its position, which may be a prohibitive assumption for many applications. To this end, some prior work has focused on inferring a node’s location from a set of location-aware anchor nodes.In this work, we free ourselves from positioning techniques and anchor nodes altogether, and introduce and analyze the concept of virtual coordinates. These coordinates are chosen randomly when a node is switched on, and are updated each time the node relays a packet. As this process goes on, the virtual coordinates of the nodes converge to a near-optimal state. When using a greedy geographic approach on top of these coordinates, we show that the number of hops to reach the destination exceeds the shortest path by a few percent only. Moreover, our approach guarantees delivery even when nodes appear/disappear in the network, and under realistic transmission models.We analytically prove the correctness of our protocol. Moreover, extensive simulations are used to show that our position-free solution outperforms existing geographic protocols – such as Greedy-Face-Greedy (GFG) or Greedy Perimeter Stateless Routing (GPSR) – in terms of energy-efficiency, path length and robustness.     

权衡能耗与延迟的数据融合算法研究

在无线传感器网络的路由协议中考虑数据融合能极大地提高网络生存期性能,但随之会带来网络可靠性下降、数据传输延迟增加等问题。设计一种新的可权衡能耗与延迟的数据融合算法ECLT,通过二级模糊综合评判的方式来调整原有的路由信息,增加数据传输路径间的交叠,以提高数据融合度、延长网络生存期;同时,传感节点在转发数据的过程中还可根据本身状态来动态调整进行数据融合的等待时间,从而在均衡网络中各节点能耗的同时减少了数据传输延迟。经仿真验证,该算法能在极大的延长无线传感器网络使用寿命的同时降低数据的平均传输延迟。     

无线传感器网络中基于能量效率的多路径路由算法

针对无线传感器网络节点能量受限的特点,本文提出了一种能量有效、负载均衡的多路径路由算法(EMR)。该算法在按需路由协议AODV基础上,不单纯以最小跳数或者最小时延作为路由选择依据,充分考虑到了路由的能量消耗最小化,避开剩余能量过低的节点,数据沿着最小跳数或路径关键能量比较高的路径传输,降低了网络的能量消耗,也避免关键节点的过量负载。分析与仿真结果表明,与AODV协议相比较,EMR具有更好的分组投递率、端到端时延,推迟了网络中出现死亡节点的时间,从而延长了网络生命周期。     

Joint range assignment and routing to conserve energy in wireless ad hoc networks

In wireless ad hoc networks, energy utilization is perhaps the most important issue, since it corresponds directly to the operational network lifetime. Topology Control (TC) is a well-known energy saving technique which tries to assign transmission ranges of nodes to optimize their energy utilization while keeping the network connected. In current TC schemes, the transmission range of each node is mostly accounted as the exclusive estimator for its energy consumption, while ignoring the amount of data it forwards. Especially when such schemes are coupled with the popular shortest path routing, they usually create a highly-loaded area at the center of the network in which nodes deplete their battery very quickly. In this paper, we introduce efficient strategies that take both load and range into account to handle this problem. We first consider the simple strategy in which a proper transmission range is computed for all nodes of the network to optimize their energy utilization under the presence of the shortest path routing. Inspiring from the results of this strategy, we then propose our combined strategy and argue that a combination of circular paths and shortest paths could result in a much better solution. We also provide detailed analytical models to measure the forwarding load and interference of nodes and then corroborate them with simulation results. Using the combined strategy, the achieved improvement in terms of traffic load, interference, and maximum energy consumption is about 50%, as compared with the simple strategy.     

一种基于网格的无线传感器网络分簇路由协议

为延长网络生存时间,提出了一种基于网格的无线传感器网络分簇路由协议.整个网络分成若干个虚拟网格,每个虚拟网格形成一个簇,采用唯一簇头选举法产生簇头,且簇内成员可以根据局部的信息调整簇的大小,达到节省能量的目的.仿真实验和分析表明:该协议能均衡网络能量,延长网络的生存时间.