【CN109996308A】一种基于能量优化的移动adhoc网络路由方法及装置【专利】

基于能量管理的移动Ad Hoc网络QoS路由协议
杨鹏
【期刊名称】《计算机工程与设计》
【年(卷),期】2008(29)23
【摘要】实现QoS路由是保证在移动Ad Hoc网络中进行高效的多媒体业务传输的关键,然而现有的QoS路由协议很少考虑节能的问题,对此提出了一种基于能量管理的QoS路由协议.其能量管理机制采用跨层设计的思想,通过通信事件和定时器来激发移动节点在节能模式和活跃模式之间切换以达到节约能耗的效果.仿真结果表明,该协议显著地延长了网络生存时间,具有较好的性能.
【总页数】4页(P5989-5992)
【作者】杨鹏
【作者单位】重庆文理学院,数学与计算机科学系,重庆,402160
【正文语种】中文
【中图分类】TP393
【相关文献】
1.AdHoc网络中一种基于能量及带宽的多路径QoS路由协议 [J], 陈飞飞;王小非;夏学知;张毅
2.移动Ad Hoc网络中基于QoS的多路径路由协议研究 [J], 李健;董亚雷;王刚
3.移动Ad Hoc网络中一种基于多路径路由协议的QoS保障算法 [J], 姜海龙
4.移动Ad Hoc网络中基于能量控制的QoS路由协议 [J], 杨鹏;黄彪
5.Ad Hoc网络中基于能量的QoS路由协议的研究 [J], 袁晓;束永安
因版权原因，仅展示原文概要，查看原文内容请购买。

移动Ad hoc网络中一种基于电池量的路由算法
张毅;王小非
【期刊名称】《计算机应用》
【年(卷),期】2006(26)8
【摘要】介绍了一种利用移动Agent来解决Ad hoc网络环境中基于电池量的路由问题的方法.首先通过移动Agent和各节点进行数据交换,了解网络中所有节点的连接信息,形成一个节点信息矩阵表;然后在该矩阵表的基础上,根据各节点电池余量,选择最合适的路径进行数据报文的发送.由于这种方法可以使用很少的Agent获得全局电池量的信息,因此可以减少维持节点信息而产生的开销.实验结果表明这种路由算法可以使各节点电池量的消耗趋于平衡.
【总页数】3页(P1776-1778)
【作者】张毅;王小非
【作者单位】哈尔滨工程大学,计算机科学与技术学院,黑龙江,哈尔滨,150001;武汉数字工程研究所,湖北,武汉,430074;武汉数字工程研究所,湖北,武汉,430074
【正文语种】中文
【中图分类】TP393.03
【相关文献】
1.Ad Hoc网络中一种基于灰色关联算法的路由协议 [J], 何普胜
2.移动Ad Hoc网络中一种基于多路径路由协议的QoS保障算法 [J], 姜海龙
3.移动Ad hoc网络路由协议的研究——一种基于AODV路由协议的改进算法 [J],
陈玲;王华
4.移动Ad Hoc网络中一种多播路由协议算法实现 [J], 朱艳永;李腊元
5.移动Ad Hoc网络中一种多播路由协议算法实现 [J], 朱艳永;李腊元
因版权原因，仅展示原文概要，查看原文内容请购买。

Ad Hoc网络基于能量消耗的动态源路由协议
周杰英;徐国赞;郭长飞;张佳佳
【期刊名称】《计算机应用》
【年(卷),期】2010(030)009
【摘要】为了节省路由能耗,增加网络中节点生存时间,提出一种基于能量消耗的Ad Hoc网络动态源路由协议(ECDSR).该协议以路由剩余能量、路由能耗预测、路由能量延时3个参数作为路径能量评价的参数.其中剩余能量参数反映了节点当前的剩余能量状态,能耗预测参数反映了节点能量的变化情况,能量延时参数能够保护低能量节点,屏蔽能量状况差的路由路径.仿真结果表明该协议相对于动态源路由(DSR)可以在网络时延和协议开销增加不明显的前提下,提高网络的生存时间等网络性能.
【总页数】3页(P2494-2496)
【作者】周杰英;徐国赞;郭长飞;张佳佳
【作者单位】中山人学信息科学与技术学院,广州,510275;中山人学信息科学与技术学院,广州,510275;中山人学信息科学与技术学院,广州,510275;中山人学信息科学与技术学院,广州,510275
【正文语种】中文
【中图分类】TF393.07;TN915.04
【相关文献】
1.Ad Hoc网络中基于距离的动态概率广播协议 [J], 钱舒;张曦煌
2.Ad Hoc网络动态源路由协议仿真研究 [J], 许建;彭曙光
3.用于Ad Hoc网络的改进的动态源路由协议 [J], 陶洋;孙涛;王坚
4.SDSR——Ad hoc网络中安全的动态源路由协议 [J], 于国良;李光松;韩文报
5.基于能量消耗的Ad Hoc网络路由协议的研究 [J], 吕贵金;陈新一;陈文娟
因版权原因，仅展示原文概要，查看原文内容请购买。

I.J. Intelligent Systems and Applications, 2014, 11, 36-41Published Online October 2014 in MECS (/)DOI: 10.5815/ijisa.2014.11.05Energy Optimized Ad hoc on-Demand Multipath Routing Protocol for Mobile Ad hoc NetworksP.PeriyasamyDepartment of Computer Science and Applications, Sree Saraswathi Thyagaraja College, Pollachi - 642 107, TamilNadu, IndiaEmail: pereee@Dr. E.KarthikeyanDepartment of Computer Science, Government Arts College, Udumalpet - 642 126, Tamil Nadu, IndiaEmail: e_karthi@Abstract—As the wireless nodes are having limited battery life, energy efficiency is the most important design consideration in mobile ad hoc networks. Many multipath routing schemes are possibly exploiting multiple disjoint routes between any pair of source and destination in order to provide aggregated bandwidth, fault-tolerance and load-balancing properties. Hence we propose an optimized energy efficient routing scheme by slightly modifying MMRE-AOMDV route update rules in order to generate more energy efficient routes than MMRE-AOMDV routing protocol, called an Optimized Minimal Maximal nodal Residual Energy AOMDV (OMMRE-AOMDV) protocol. It reduces the energy consumption, average end to end delay, routing overhead and normalized routing overhead. It also improves packet delivery ratio and throughput. Simulation results show that the OMMRE-AOMDV routing protocol has performed better than AOMDV and MMRE-AOMDV routing protocols.Index Terms—Mobile Ad Hoc Networks, Multipath Routing, Energy Efficiency, Average End to End Delay, Routing Overhead, Packet Delivery RatioI.I NTRODUCTIONA Mobile Ad hoc Network (MANET) is an interconnection of autonomous mobile nodes by wireless links forming dynamic topology and providing multi-hop communications without using much physical network infrastructure such as routers, servers, access points or cables or centralized administration. Each mobile node is acting as a router as well as a node. The properties of these networks make them to be more desirable in war zones, disaster recovery, aircraft and marine communications, industrial, home and other scenarios. The issues that are involved in MANET [1,2,3] are: (i) unpredictable link properties that expose packet collision and signal propagation, (ii) node mobility creates dynamic topology, (iii) limited battery life of mobile devices, (iv) hidden and exposed terminal problems occur when signals of two nodes are colliding with each other. (v) route maintenance is very difficult because of changing behavior of the communication medium, and (vi) insecurity.Multipath routing protocols are needed to send communication from source to destination by having backup routes. During end-to-end communication, if a primary route fails, the backup routes are used for efficient delivery of messages at their destination. These protocols [4] are generally classified into (i) proactive, (ii) reactive and (iii) hybrid based on route discovery and maintenance mechanisms. Proactive routing protocols determine the routes to all destinations at start up and maintain using periodic update process. Reactive routing protocols determine routes when they are required by the source using route discovery process. Hybrid routing protocols combine the features of proactive and reactive together as a single protocol. In [5], the proactive routing protocols are more expensive than the reactive routing protocols in terms of energy consumption because of the former incurred large routing overhead.Broadcast is a very important communication primitive in wireless ad hoc networks. Wireless ad hoc networks, due to their ad hoc nature and mobile environment, make frequent use of broadcast primitives to adapt to network changes. Broadcast is also widely used in sensor networks to disseminate information about environmental changes to other nodes in the network. Therefore, it is essential to develop efficient broadcast protocols that are optimizing energy consumption by incorporating information about nodes’ remaining battery levels into routing which helps to avoid route with low energy.In this paper, we investigate and illustrate a multipath routing protocol with minimal nodal residual energy between any source to destination pair in order to reduce energy consumption, routing overhead and average end to end delay. We propose a novel route update rule for AOMDV routing protocol by modifying the route update rule of MMRE-AOMDV routing protocol in order to generate more energy efficient routes than MMRE-AOMDV and to elect the efficient route among multiple routes between any source and destination pair based on minimal residual nodal energy to forward data packets. The rest of the paper is organized as follows: Section II gives a brief description about the related work. Section III presents the proposed routing protocol. The simulation environment and experimental results are discussed in Section IV. Finally, conclusions and future work are given in Section V.II.R ELATED W ORKSA. Ad hoc On-demand Multipath Distance Vector routing (AOMDV)AOMDV [6] is the extension of a well-studied AODV [7] so as to eliminate the occurrence of frequent link failures and route breaks in a highly dynamic ad hoc networks. It adds some extra fields in routing tables and control packets, and follows the two rules during a route discovery phase in order to compute loop-free and link-disjoint multiple routes between a source and destination. The rules are (i) the route update rule establishes and maintains multiple loop-free paths at each node, and (ii) the distributed protocol finds link-disjoint paths. Link failures may occur because of node mobility, node failures, congestion in traffic, packet collisions, and so on. There is no common link among the multiple routes between a source and destination pair in the link-disjoint routes. To achieve loop-freedom, every node maintains a variable called the advertised hop count. The advertised hop count is added in each RREQ (route request) or RREP (route reply) and in addition to the routing table has the usual fields that are used for AODV. The advertised hop count field of a node is set to the length of the longest available path to the destination expressed in terms of the number of hops if it initiates a RREQ or RREP with a particular destination sequence number and it remains unchanged till the associated destination sequence number is changed.The loop-freedom rule says that if a node receives a RREQ (RREP) for a particular destination with a destination sequence number: (i) it should update its routing information with the information obtained from the received RREQ (RREP) if the destination sequence number is higher than the one stored in its routing table; (ii) it can re-send the received RREQ (RREP) when the advertised hop count in the RREQ (RREP) is greater than the corresponding value in its routing table and if the destination sequence number is equal to the one stored in its routing table; and (iii) it can update its routing table with the information available in the received RREQ (RREP) when the advertised hop count in the RREQ (RREP) is less than the corresponding value in its routing table if the destination sequence number is equal to the one stored in its routing table.For link-disjointness, each node maintains a route list in its routing table for a particular destination and its route list contains the next hop, last hop, and hop count information for the destination. The next hop represents a downstream neighbour through which the destination can be reached. The last hop refers to the node immediately preceding the destination. The hop count is used to measure the distance from the node to the destination through the associated next and last hops. The link-disjointness among all the paths can be achieved if a node can ensure that those paths to a destination from itself differ in their next and last hops. Using this observation, AOMDV ensures link-disjointness among multiple routes for the same source and destination pair and also adds a last hop field in each RREQ and RREP.In AOMDV, all copies of an RREQ are examined for the potential alternate reverse paths during route discovery. On receiving an RREQ, an intermediate node creates a reverse path if the RREQ satisfies the rules for loop-freedom and link-disjointness. Moreover, it checks if it has one or more valid next hop entries for the destination. The intermediate node generates an RREP and sends it back to the source along the reverse path if such an entry is found. Otherwise, it rebroadcasts the RREQ. The destination follows the same rules for creating reverse paths if it receives RREQ copies. Unlike the intermediate nodes, it generates an RREP for every copy of RREQ that arrives via a loop-free path, for increasing the possibility of finding more disjoint routes.B. Power Efficient RoutingPower saving during route discovery and power control during data transmission are the two major classification of power saving techniques for wireless ad hoc networks. The total energy consumption is reduced in power saving technique in idle listening mode [8,9,10] by putting the mobile nodes into periodical sleep where as in power control technique [11,12], the total energy consumption is also reduced by adjusting the transmission ranges during data transmission. Broadcast is a very important communication primitive used in wireless ad hoc networks. Several power efficient on-demand routing protocols have been developed. Liu et al.[13] proposed a novel Collision-Constrained Energy Algorithm (ECCA) by defining correlation factor to weigh collision probability while using node-disjoint multipath to transmit data simultaneously. It also calculates an upper limit for correlation factor according to service requirement, and find a minimum energy node-disjoint multipath routing to satisfy the upper limit. Liang et al. [14] designed an energy and mobility aware geographical multipath routing for wireless sensor networks. This algorithm considers the remaining battery capacity, mobility, and distance to the destination node of candidate sensors in the local communication range for next hop relay node selection, and a fuzzy logic system applied for decision making. Simulation results showed that this scheme could extend the network lifetime. In [15], Bergamo et al. proposed a DPC(Distributed Power Control) Energy Efficient routing protocol for ad hoc networks, which acts in combination with the routing layer by means of a mechanism estimating the amount of power which is needed for reliable communications over any link. This power is then used both to transmit a packet over the link, and the link weight is calculated using minimum-weight path search algorithm. In this way, transmit power can be tuned in order to build the desired connectivity diagram and its information is used to privilege lower energy paths while looking a route for packet transmission. Existing routing protocols, such as proactive and reactive protocols, can be modified in order to incorporate this power control feature which tries to minimize the interference in the network and the energy consumption of multihop operation.Yumei Liu et al. [16] have proposed Maximal Minimal nodal Residual Energy (MMRE) approach into theexisting AOMDV, called MMRE-AOMDV routing protocol by finding minimal nodal residual energy of each route in the route discovery phase and sorting multiple routes by descending nodal residual energy and use the route with maximal nodal residual energy to forward data packets. Simulation results showed that this scheme could extend the network lifetime and packet delivery ratio and diminish the number of nodes dying than AOMDV. Our work deals with conserving power by employing power control mechanism for data transmission.III.P ROPOSED R OUTING P ROTOCOL:OMMRE-AOMDV Our multiplath routing protocol is extended by slightly modifying MMRE-AOMDV route update rules in order to generate more energy efficient routes than MMRE-AOMDV routing protocol which reduces energy consumption, routing overhead, normalized routing overhead and average end-to-end delay. It also improves packet delivery ratio and throughput.The following are the general procedures of OMMRE-AOMDV routing protocol:1. Finding minimal nodal residual energy of each route between any source and destination pair in the route discovery process, that is, min_re_energy.2. Sorting the multiple routes by descending nodal residual energy and elect the route with maximal nodal residual energy to forward data packets.A. Finding minimal nodal residual energySeveral changes required in the route discovery phase of AOMDV to find the minimal nodal residual energy of each route between any source and destination pair. Each RREQ and RREP now carries an additional field called min_re_energy in order to have the route’s minimal residual energy. Structure of Routing Table Entries of AOMDV, MMRE-AOMDV and OMMRE-AOMDV routing protocols are illustrated in Fig. 1.Fig.1. Structure of Routing Table Entries of AOMDV, MMRE-AOMDV & OMMRE-AOMDV routing protocolsIn the source node the value of min_re_energy should be assigned as a maximum value such as node’s initial energy. In the intermediate nodes, the route update rule of OMMRE-AOMDV is shown in Fig.4 invoked whenever a node receives the route advertisement. In other words, when an intermediate node receives RREQ if the sequence number of just received packet is greater than this node, it updates its residual energy with the min_re_energy of RREQ of this node if it is less than min_re_energy of RREQ of this node in order to keep the value of min_re_energy lowest among all the nodes in this route. The set up of reverse routes at the destination node of OMMRE-AOMDV routing protocol is just like in AOMDV routing protocol.1.if (seqnum i d< seqnum d j ) then2. seqnum i d:= seqnum d j;3. if (i≠d) then4.advertised_hopcount i d: = ∞;5. else6.advertised _hopcount d i:= 0;7. end if8. route _list i d= NULL;9.insert( j , advertised_hopcount d j +1, min_re_energy d j) into route _list i d ;10.else if (seqnum i d=seqnum d j ) and ((advertised_hopcount i d,i) > (advertised_hopcount j d,j)) then11. insert ( j , advertised_hopcount d j +1, min_re_energy d j) into route _list i d ;12.end ifFig. 2. Route Update Rules of AOMDV Routing Protocol [6]The AOMDV route update rules are illustrated in Fig. 2, when a node i receives a RREQ or RREP, it updates its advertised hop count for a destination d if its sequence number is less than the sequence number of RREQ or RREP of node j.1.if (seqnum i d< seqnum d j ) then2. seqnum i d:= seqnum d j;3. if (i≠d) then4. if (re_energy i< min_re_energy d j ) then5.min_re_energy d j:= re_energy i;6.advertised_hopcount i d:=∞;7. route _list i d= NULL;8.insert( j , advertised_hopcount d j +1, min_re_energy d j) into route _list i d ;9. else10.advertised _hopcount d i:= 0;11. end if12.else if (seqnum i d=seqnum d j ) and ((advertised_hopcount i d,i) > (advertised_hopcount j d,j)) then13. if (re_energy i< min_re_energy d j ) then14. min_re_energy d j:= re_energy i;15. insert ( j , advertised_hopcount d j +1, min_re_energy d j) into route _list i d ;16.end ifFig. 3. Route Update Rules of MMRE-AOMDV Routing Protocol [16] The MMRE-AOMDV route update rules are illustrated in Fig. 3, when a node i receives a RREQ or RREP, it updates its advertised hop count for a destination d if its sequence number is less than the sequence number ofRREQ or RREP of node j as well as it updates its minimal residual energy with the minimal residual energy of RREQ or RREP of node j if minimal residual energy of RREQ or RREP of node i is less than minimal residual energy of RREQ or RREP of node j. Since the MMRE-AOMDV route update rules create fresh route list whenan energy efficient route between any source to destination pair encountered, we propose an Optimized MMRE-AOMDV (OMMRE-AOMDV) route update rules by slightly modifying MMRE-AOMDV route update rules in order to generate more energy efficient routes than MMRE-AOMDV routing protocol illustrated in Fig.4.1.if (seqnum i d< seqnum d j ) then2. seqnum i d:= seqnum d j;3. if (i≠d) then4. if (re_energy i< min_re_energy d j ) then5.min_re_energy d j:= re_energy i;6.advertised_hopcount i d:=∞;7. else8. advertised _hopcount d i:= 0;9. end if10. route _list i d= NULL;11.insert( j , advertised_hopcount d j +1, min_re_energy d j) into route _list i d ;12.else if (seqnum i d=seqnum d j ) and ((advertised_hopcount i d,i) > (advertised_hopcount j d,j)) then13.if (re_energy i< min_re_energy d j ) then14. min_re_energy d j:= re_energy i;15. insert ( j , advertised_hopcount d j +1, min_re_energy d j) into route _list i d ;16.end ifFig. 4. Route Update Rules of OMMRE-AOMDV Routing Protocol B. Sorting multiple routes by descending nodal residualenergy and the route selection processEach node maintains route list as shown in Fig.1. After finding the minimal nodal energy phase, the multiple routes between any source and destination pair are sorted by descending nodal residual energy. We add another field into the route list called min_re_energy. The value of min_re_energy is updated according to the rules as shown in Fig.4.Whenever a node i receives a route advertisement to a destination d from a neighbour j, it invokes OMMRE-AOMDV route update rules in order to setup forward routes as shown in Fig. 4. The variables seqnum i d, advertised_hopcount i d , route _list i d , and min_re_energy d j are sequence number, advertised_hopcount, route_list and minimal nodal residual energy for destination d at node i or node j respectively. The route with maximal nodal residual energy for any source to destination is adopted for forwarding data packets.IV.S IMULATION E NVIRONMENT AND E XPERIMENTALR ESULTSA. Simulation modelWe evaluate the performance of OMMRE-AOMDV,MMRE-AOMDV and AOMDV routing protocols using NS 2.34 [17,18,19,20]. Fig. 5 and Table 1 illustrate the simulation model and the simulation parameters respectively. The result of simulation generated as trace files and the awk & perl scripts prepared for analyzing the trace files into graphs for various performance metrics.Fig. 5 Overview of the simulation modelTable 1. Simulation ParametersB. Experimental results and DiscussionWe evaluate the following six different performance metrics:(i) Average End-to-End delay–the average time of the data packet to be successfully transmitted across a MANET from source to destination. It includes all possible delays such as buffering during the route discovery latency, queuing at the interface queue, retransmission delay at the MAC, the propagation and thetransfer time.(ii) Routing overhead – the total number of control packets or routing packets generated by routing protocol during simulation.(iii) Normalized Routing overhead – the number of routing packets transmitted per data packet towards destination during simulation.(iv) Total Energy consumed – the summation of the energy consumed by all nodes in the simulation environment. i.e., energy consumed by a node = initial energy of that node – residual energy of that node .(v) Throughput – the number of bytes received successfully.(vi) Packet Delivery Ratio – the ratio of data packets delivered to the destination to those generated by thesources.Fig. 6. Average End-to-End Delay (in ms) of AOMDV, MMRE-AOMDV & OMMRE-AOMDVFig. 7. Routing Overhead (in pkts) of AOMDV, MMRE-AOMDV &OMMRE-AOMDVFig. 8. Normalized Routing Overhead (in %) of AOMDV, MMRE-AOMDV & OMMRE-AOMDVFig. 9. Total Energy Consumed (in Joules) of AOMDV, MMRE-AOMDV & OMMRE-AOMDVFig. 10. Throughput (in kbps) of AOMDV, MMRE-AOMDV &OMMRE-AOMDVFig. 11. Packet Delivery Ratio (%) of AOMDV, MMRE-AOMDV &OMMRE-AOMDVFig. 6 represent the Average End-to-End Delay (in ms) of AOMDV, MMRE-AOMDV and OMMRE-AOMDV routing protocols. Our OMMRE-AOMDV routing protocol reduces end to end delay whenever speed of the node increases. It is found that the routing overhead is also reduced by our protocol compared with AOMDV and MMRE-AOMDV routing protocols as shown in Fig. 7. It is found that the normalized routing overhead is also reduced by our protocol compared with AOMDV and MMRE-AOMDV routing protocols as shown in Fig. 8. It is also found that the total energy consumption of our protocol is very less (more efficient) when we compare it with AOMDV and MMRE-AOMDV routing protocols as shown in Fig. 9. OMMRE-AOMDV protocol gives betterthroughput and packet delivery ratio than AOMDV and MMRE-AOMDV protocols as shown in Fig. 10 and Fig.11 respectively.V.C ONCLUSIONS AND F UTURE W ORKWe proposed an OMMRE-AOMDV routing protocol by extending MMRE-AOMDV routing protocol [16] in order to generate more energy efficient routes which reduces the energy consumption, average end to end delay, routing overhead and normalized routing overhead. It also improves the throughput and packet delivery ratio under random way point mobility model. Simulation results show that the OMMRE-AOMDV routing protocol performed better than AOMDV and MMRE-AOMDV routing protocol.In future we will put a greater effort to improve its overall performance considering new metrics associated with network nodes such as networks lifetime and reduction in average number of nodes dying in different mobility models by studying and enhancing recent power efficient strategies. We will also make changes in OMMRE-AOMDV to co-operate with MAC layer’s multi-interface and multi-channel assignment schemes for wireless sensor or vehicular networks.R EFERENCES[1]Elizabeth M. Royer, C-K Toh, A Review of CurrentRouting Protocols for Ad-Hoc Mobile Wireless Networks, IEEE Personal Communications, April 1999, pp.46-55. [2]Mehran Abolhasan, Tadeusz Wysocki, and ErykDutkiewicz , A review of routing protocols for mobile ad hoc networks, Ad Hoc Networks, June 2004, pp.1-22. [3]S. Corson and J. Macker, Mobile Ad hoc Networking(MANET): Routing Protocol Performance Issues and Evaluation Considerations, IETF WG Charter, /html.charters/manet-charter.html,January 1999.[4]Ankita Sharma, Sumit Vashistha, Improving the QOS inMANET by Enhancing the Routing Technique of AOMDV Protocol, ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India- Vol I Advances in Intelligent Systems and Computing Volume 248, 2014, pp 381-392.[5]Brown, T.X, Doshi, S., Zhang, Q., Optimal power awarerouting in a wireless ad hoc network, IEEE LANMAN 2001 Workshop Proceedings, pp. 102–105.[6]M. Marina and S. Das, On-demand Multipath DistanceVector Routing in Ad Hoc Networks, in Proceedings of the International Conference for Network Procotols (ICNP), Riverside, Nov. 2001.[7]S. Das, C. Perkins and E. Royer, Ad Hoc On DemandDistance Vector (AODV) Routing, IETF RFC3561, July 2003.[8] B. Chen, K. Jamieson, H. Balakrishnan and R. Morris,SPAN: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. ACM Wireless Networks Journal 8(5) (2002) 481–494.[9]S. Guha and S. Khuller, Approximation algorithms forconnected dominating sets, in: Proc. IEEE INFOCOM (1996) pp. 179– 193. [10]W. Ye, J. Heidemann and D. Estrin, An energy-efficientmac protocol for wireless sensor networks, in: Proc. IEEE INFOCOM (2002).[11]R. Ramanthan and R. Hain, Topology control of multihopwireless networks using transmit power adjustment, in: Proc. IEEE INFOCOM vol. 2 (2000) pp. 404–413. [12]J.E. Wieselthier, G.D. Nguyen and A. Ephremides, Onconstructing minimum spanning trees in k-dimensional spaces and related problems,in: Proc. IEEE INFOCOM (2000) pp. 585–594.[13]M.Liu, Z.Xu et al, Collision-constrained minimum energynode-disjoint multipath routing in ad hoc network, in Proc.Wireless Communications, Networking and Mobile Computing, 2006, pp.1-5.[14]LIANG Qilan, REN Qingchun. Energy and mobility awaregeographical multipath routing for wireless sensor networks, in Proc.: IEEE Wireless Communications and Networking Conference ,2005:pp.1867-1871.[15]P. Bergamo, A. Giovanardi, et al, Distributed powercontrol for energy efficient routing in ad hoc networks, Kluwer Wireless Networks, vol.10, pp.29-42, 2004. [16]Yumei Liu, Lili Guo, Huizhu Ma, Tao Jiang, Energyefficient on demand multipath routing protocol for multi-hop ad hoc networks, ISSSTA-08, IEEE 10th International symposium on Spread spectrum and applications. Bologna, Italy, August 25-27 2008,pp-592-597.[17]Radhika Ranjan Roy, Handbook of Mobile Ad HocNetworks for Mobility Models, Springer, 2011.[18]“The Network Simulator: ns-2”. [Online]. Available:/nsnam/ns/. [Accessed: 14-Nov-2012] [19]Kevin Fall, K. Varadhan, “The ns Manual”, University ofSouthern California, Information Sciences Institute (ISI).[Online]. Available: /nsnam/ns/ns-documentation.html. [Accessed: 14-Nov-2012][20]“NS-2 with Wireless and Mobility Extensions”. [Online].Available: . [Accessed: 14-Nov-2012]Authors’ ProfilesP.Periyasamy is working as an AssistantProfessor in the Department of MCA, SreeSaraswathi Thyagaraja College, Pollachi,India. He is guiding students towards M.Phil.programme. He has published 5 papers inInternational Journals and also attended manyconferences in both national and international levels and his area of interest is Mobile Ad hoc Networks Routing Protocols Design and Development. He is now pursuing Ph.D. from Bharathiar University, Coimbatore.Dr.E.Karthikeyan born in 1974 atDharapuuram completed PG degree in theyear 1996 and Ph.D from GandhigramUniversity, Dindigul, India in 2008. He isguiding students towards Ph.D. programmeand his area of research is NetworkSecurity and Cryptography and Advanced Networking. He has published 12 papers in International Journals and more than 15 conferences National and International level. He has also published a book entitled “Text Book on C: Fundamentals, Data structures and Programming” by PHI. He delivered lectures and conducted workshops in various colleges. He is a life member of CSI, CRSI, IASCT etc. He is a Editor-in-Chief for an International Journal of AdvancedNetworking and Applications.。

专利名称：移动Ad Hoc网络的路由方法专利类型：发明专利
发明人：聂志,刘静,徐友云,甘小莺,刘汉春申请号：CN200910052879.3
申请日：20090611
公开号：CN101668311A
公开日：
20100310
专利内容由知识产权出版社提供
摘要：一种网络技术领域的移动Ad Hoc网络的路由方法，包括：网络节点初始化；整理数据报文D_PKT；发送正确到达信号PKT_ACK或更新本地的网格号；对数据报文头部分内容进行更新；将此数据报文以广播的形式转发出去。

本发明减小了相同数据报文传输的个数，降低数据传输过程中网络的开销，增大网络吞吐率，同时减小数据报文传输过程中发生碰撞的可能，提高数据报文传送成功率，适用于节点高密度环境。

申请人：上海交通大学
地址：200240 上海市闵行区东川路800号
国籍：CN
代理机构：上海交达专利事务所
更多信息请下载全文后查看。

基于能量有效的移动Ad Hoc网络路由算法
郭晓曦
【期刊名称】《电脑知识与技术：学术交流》
【年(卷),期】2009(005)009
【摘要】由于移动Adhoc网络中节点通常采用电池供电，一旦电源耗尽，节点就会被迫退出网络，因此降低节点的能量消耗对保证节点间链路稳定至关重要。

给出了节点剩余能量的计算公式，基于节点剩余能量提出了一种能量有效的移动AdHoc网络路由算法MTMR，该算法能够延长网络的生命周期，并给出了该路由算法的寻径示例。

【总页数】0页(P7122-7124)
【作者】郭晓曦
【作者单位】集美大学计算机工程学院,福建厦门361021
【正文语种】中文
【中图分类】TP311
【相关文献】
1.基于粒子滤波步行长度预测的移动ad hoc网络路由算法 [J], 张玲;聂少华
2.基于稳定链路的移动Ad Hoc网络路由算法 [J], 黄波;张小华
3.基于能量有效的移动Ad Hoc网络路由算法 [J], 郭晓曦
4.基于能量有效的Ad Hoc网络路由协议研究 [J], 范立耘;
5.基于能量有效的Ad Hoc网络路由协议研究 [J], 范立耘
因版权原因，仅展示原文概要，查看原文内容请购买。

基于能量控制的移动Ad hoc网络蚂蚁路由算法研究的开题报告一、研究背景和意义移动 Ad hoc 网络是指无线自组织、自适应的网络，无需任何中央管理机构和网络基础设施支持，节点可以自由移动，组成一个临时的网络。

然而，由于移动 Ad hoc 网络的复杂性，通信质量不稳定，网络拓扑频繁变化，验证和维护对等节点的身份和安全性一直是关键问题之一。

为了解决这些问题，许多学者提出了基于蚁群算法的移动 Ad hoc 网络路由算法。

蚁群算法是一种仿生学算法，源于大自然中蚂蚁在寻找食物时的觅食行为。

该算法从全局最优解的角度来考虑问题，在路由问题上已经得到了广泛应用。

然而，现有的蚂蚁路由算法主要关注路线选择问题，忽略了每个节点剩余能量的影响。

在移动 Ad hoc 网络中，能量管理一直是一个重要问题。

因此，本研究将从能量控制的角度入手，提出一种新的蚂蚁路由算法。

二、研究内容和方法本研究将提出一种基于能量控制的移动 Ad hoc 网络蚂蚁路由算法。

该算法将考虑到每个节点的能量剩余情况，在路由选择时优先选择节点能量剩余较多的路径，以实现能量均衡，延长网络寿命。

具体实现方法如下：1. 通过模拟退火等算法计算每个节点的能量剩余量。

2. 接收到新的数据包时，随机选取若干只蚂蚁，分别从源节点出发，寻找到达目标节点的路径，并同时更新每个节点的能量剩余量。

3. 在完成路径选择后，根据各个路径的能量剩余情况，选择最佳路径并发送数据包。

4. 重复上述过程，直到目标节点接收到数据包为止。

三、研究预期成果本研究的预期成果是一个基于能量控制的移动 Ad hoc 网络蚂蚁路由算法。

通过在仿真环境中对比该算法和其他常用的移动 Ad hoc 网络蚂蚁路由算法的性能，可得到以下结果：1. 证明本算法能够有效延长网络寿命，降低能量消耗。

2. 分析本算法的路由选择性能和数据包传输延迟，并与其他算法进行对比。

3. 证明本算法的可行性，为实际应用提供参考和指导。

基于能量优化的Ad hoc认知无线电网络组播路由启发式算
法研究
苗许娜;周贤伟;吴华怡;刘臻臻
【期刊名称】《计算机应用研究》
【年(卷),期】2010(027)001
【摘要】提出了两个Ad hoc认知无线电网络中基于能量优化的组播路由启发式算法.一个是基于经典的最短路径树的组播算法(shortest path tree algorithm,SPTA),另一个是基于能量函数的组播启发式算法(energy function based heuristic algorithm,EFHA).这两个算法都在考虑了认知无线电网络特性的基础上建立能量优化的组播树,从应用例子可以看出, EFHA算法明显优于SPTA算法,并且复杂度较低.
【总页数】4页(P284-287)
【作者】苗许娜;周贤伟;吴华怡;刘臻臻
【作者单位】北京科技大学,信息工程学院,通信工程系,北京,100083;北京科技大学,信息工程学院,通信工程系,北京,100083;北京科技大学,信息工程学院,通信工程系,北京,100083;北京科技大学,信息工程学院,通信工程系,北京,100083
【正文语种】中文
【中图分类】TP393
【相关文献】
1.移动Ad Hoc网络中基于能量优化的多路径速率分配算法研究 [J], 任增霞;战松涛;胡铮
2.基于能量优化的认知无线电网络组播路由协议 [J], 王超;张羲;周贤伟;苗许娜
3.基于GPS的启发式Ad hoc路由算法研究 [J], 王安保;胡小明
4.Ad Hoc网络中改进AODV QoS路由能量优化算法研究 [J], 严正香;董晶;
5.Ad Hoc网络中改进AODV QoS路由能量优化算法研究 [J], 严正香;董晶
因版权原因，仅展示原文概要，查看原文内容请购买。

专利名称：移动Ad hoc网络可靠路由方法专利类型：发明专利
发明人：白跃彬,巩磊,张会永,高金梁
申请号：CN200910081772.1
申请日：20090410
公开号：CN101534520A
公开日：
20090916
专利内容由知识产权出版社提供
摘要：一种移动Ad Hoc网络环境下可靠路由的方法。

以提高数据传输有效性为目标，以结合链路稳定性和路由选路为核心思想，解决移动Ad Hoc网络环境下的可靠路由问题。

数据链路层设计与网络层设计紧密结合，数据链路层根据链路稳定性模型为每个节点产生最新的链路稳定性信息，网络层根据该信息构造链路稳定性表。

当节点有数据要发送时，节点按需建立路由。

网络层以链路稳定性表为依据，以链路稳定性为衡量选路的标准，建立源节点到目标节点之间的可靠路由。

通过为路由路径中不稳定的链路建立冗余链路，来进一步提高路由的可靠性。

结合了主动路由协议和按需路由协议的优点，链路稳定性表需要及时更新，保证了路由的可靠性。

路由表中的路由信息只在传输开始的时候才更新，减少了控制信息的额外开销。

申请人：北京航空航天大学
地址：100191 北京市海淀区学院路37号
国籍：CN
更多信息请下载全文后查看。

一种基于移动代理的Ad hoc无线网络路由方法
李峰;沈海红;杨震
【期刊名称】《南京邮电大学学报（自然科学版）》
【年(卷),期】2005(025)003
【摘要】Ad hoc无线网络是一组具有路由和转发功能的移动节点组成的一个多跳的临时性自治系统,是一种无中心的无线网络.现有的主动路由协议或者按需路由协议都不能很好的满足Ad hoc网络的需要.文中首先介绍了Ad hoc无线移动网络和移动代理技术,接着在分析两种按需路由协议中加入移动代理的技术的基础上,作者提出了综合两种技术的新方法,即基于移动代理的路由方案,以达到既节省网络路由建立所耗费的资源,又缩短路由建立时间的目的.最后给出了仿真的结果和下一步的工作.
【总页数】5页(P8-12)
【作者】李峰;沈海红;杨震
【作者单位】南京邮电大学,信息工程系,江苏南京,210003;南京邮电大学,信息工程系,江苏南京,210003;南京邮电大学,信息工程系,江苏南京,210003
【正文语种】中文
【中图分类】TN915.04
【相关文献】
1.基于NS2的无线Ad-Hoc网络路由协议研究 [J], 王琼佩;
2.基于NS2的无线Ad-Hoc网络路由协议研究 [J], 王琼佩
3.基于移动代理的无线Ad Hoc网络IDS研究 [J], 张念丽
4.基于Wardrop均衡的无线Ad Hoc网络路由研究 [J], 郭敏;郑明春
5.一种基于移动代理的Ad Hoc网络入侵检测方法 [J], 宋辛科
因版权原因，仅展示原文概要，查看原文内容请购买。