oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Routing protocol for wireless sensor networks based on Anycast
利用Anycast技术实现无线传感器网络的路由协议*

WANG Xiao-nan,QIAN Huan-yan,TANG Zhen-min,
王晓喃
,钱焕延,唐振民

计算机应用研究 , 2009,
Abstract: This paper proposed a routing protocol for wireless sensor networks based on Anycast.The protocol created a routing scheme based on Anycast tree and it had the characteristics of simplicity,scalability and robustness.It discussed and analyzed the protocol in detail and implemented the protocol in a network simulation environment. The performances of the protocol,compared and analyzed AODV and DSR.Experimental data demonstrates that the performance of the protocol is better than the ones of AODV and DSR,whic...
Anycast Routing Protocol in Wireless Sensor Networks Based on Link Quality
基于链路质量的无线传感器网络任播路由协议

XU Xin,GU Yun-li,QIAN Huan-yan,
徐昕
,顾云丽,钱焕延

计算机科学 , 2010,
Abstract: In Wireless Sensor Networks(WSN),there is the probability of transmission failure and energy waste for retransmission because of link quality problem.Routing criteria of conventional anycast routing protocols are based only on routing distance but not in consideration of link quality problem,it will lead to unreasonable routing weight setting if we apply those protocols in WSN.A WSN anycast routing protocol based on link quality was proposed.Calculation of link quality was discussed.The routing criterion of...
k-Anycast Routing Protocol for Wireless Sensor Networks
无线传感器网络k-Anycast通信模型研究

GAO De-min,QIAN Huan-yan,YAN Xiao-yong,WANG Xiao-nan,
高德民
,钱焕延,严筱永,王晓楠

计算机科学 , 2011,
Abstract: For the problem of multiple base stations in wireless sensor networks, k-Anycast technology based on routing protocols was suggested, the maximum life of wireless network based on multiple base stations was researched. First,based on all energy consumption and data traffic conservation, a combination of the nonlinear planning model was established. I3acause the mathematical models are the NP-hard problem,they were further changed into mixed integer nonlinear programming model to solve all the base links to link the propitiation for the routing paths. According to the link life, assigned data flow to reach balance energy consumption purposes and to maximize the life span. I}he simulation models indicate that the communication could prolong the life cycle.
A Self-adapted Anycast Routing Algorithm Based on Mobile Agent in Wireless Sensor Network  [cached]
Nan Zhang,Jianhua Zhang
Journal of Networks , 2011, DOI: 10.4304/jnw.6.2.206-213
Abstract: To reduce the transmissions among sensor nodes and prolong the lifecycle of the wireless sensor network, the immune theory and anycast technique were brought into the mobile agent routing mechanism, and an immune-based MA anycast routing algorithm was put forward. In this algorithm, the diversity and self-adaptation characters of artificial immune system were used to find out the optimal data source searching order, and then the anycast strategy was used to select a node in multiple sensing nodes of a data source. MA migrated in the nodes which was satisfied the energy conditions.
Anycast Routing Protocol Based on Density and Distance
基于密度和距离的任播路由协议

XU Xin,GU Yun-li,DU Jie,QIAN Huan-yan,
徐听
,顾云丽,杜杰,钱焕延

计算机科学 , 2009,
Abstract: Aiming at bad performance of robustness of shortest path anycast routing algorithm in highly dynamic networks as an example of wireless Ad hoc network,an anycast routing protocol based on density and distance was proposed.In the protocol,routing target selection was determined by both the distance factor and anycast members surroundings(i.e.density)of the target.Routing towards a dense anycast member population increased the probability that a packet eventually reaches any anycast member because packets cou...
Study and Design an Anycast Routing Protocol for Wireless Sensor Networks  [cached]
Demin Gao,Huanyan Qian,Zheng Wang,Jiguang Chen
Journal of Networks , 2011, DOI: 10.4304/jnw.6.12.1726-1733
Abstract: In wireless sensor networks, there is usually a sink which gathers data from the battery-powered sensor nodes. As sensor nodes around the sink consume their energy faster than the other nodes, several sinks have to be deployed to increase the network lifetime. Anycast is a mechanism that the source node sends the data to the nearest sink node. The paper study and design an anycast service for deploying several sinks in wireless sensor network. A novel anycast tree-based is proposed approach to minimize the path cost. Here the nodes form a tree with a sink node as the root, while the height of the tree integrates multiple metrics to calculate path cost based on diverse selection criteria. This paper discusses and analyzes the model deeply. The experimental data proves its validity and efficiency. Computer simulation shows that the proposed scheme reduces and balances the energy consumption among the nodes effectively, so it significantly extends the network lifetime compared to the existing schemes.
Zone Routing Protocol Using Anycast Addressing For Ad-Hoc Network  [PDF]
Tapaswini Dash,Bharati Mishra
International Journal on Computer Science and Engineering , 2012,
Abstract: Zone Routing Protocol (ZRP) is a hybrid protocol that combines the advantages of both the proactive and reactive protocols. It is classified as: Intra Zone Routing, which uses hop count of the Nneighbors using proactive techniques and Inter Zone Routing, which includes the rest of the network excluding the N-neighbors using reactive techniques. In anycast routing, the packets are routed to themost nearest anycast group member. In this paper, the concept of anycast is used in Zone Routing Protocol assuming the destination as a member of anycast address, hence the packet can be sent to anyof the other member of the anycast group which is located nearer to the the source node. In this paper a comparative study is also done among hybrid protocol (Zone Routing Protocol), and the proposed idea of using anycast addressing with Zone Routing Protocol where the proposed idea performs more efficiently.
A Hybrid Approach of Using Anycast Addressing With Zone Routing Protocol  [PDF]
Tapaswini Dash,Bharati Mishra
International Journal of Computer Science Issues , 2012,
Abstract: Zone Routing Protocol (ZRP) is a hybrid protocol that combines the advantages of both the proactive and reactive protocols. It is classified as: Intra Zone Routing, which uses hop count of the N-neighbors using proactive techniques and Inter Zone Routing, which includes the rest of the network excluding the N-neighbors using reactive techniques. In anycast routing, the packets are routed to the most nearest anycast group member. In this paper, a literature review about Zone Routing Protocol and Anycast addressing is presented along with the concept where we propose to use Anycast addressing in Zone Routing Protocol assuming that the destination as a member of anycast address, is proposed. This idea is proposed for the consistent improvement of performance of Zone Routing Protocol.
AAPP: An Anycast Based AODV Routing Protocol for Peer to Peer Services in MANET  [PDF]
Meng Qi,Ji Hong
International Journal of Distributed Sensor Networks , 2009, DOI: 10.1080/15501320802540140
Abstract: The study of Peer-to-Peer (P2P) network and Mobile Ad hoc Network (MANET) are currently two hotspots in distributed domain. We propose a novel anycast based AODV routing protocol which is a simple and efficient routing protocol designed especially for MANET for P2P applications called AAPP (an Anycast based AODV routing protocol for Peer to Peer services in MANET).
ANYCAST ROUTING IN WIRELESS SENSOR NETWORKS
V.Nagarajan
International Journal of Engineering Science and Technology , 2010,
Abstract: Anycast is a mechanism that it sends the data groups to the nearest interface during which they have the same anycast address. Ant colony system, a population-based algorithm, provides natural and intrinsic way of exploration of search space in optimization settings in determining optimal anycast tree. In this paper, we propose a sink selection heuristic algorithm called Minimum Ant-based Data Fusion Tree (MADFT) for energy constraint wireless sensor networks. Different from existing schemes, MADFT not only optimizes over the data transmission cost, but also incorporates the cost for data fusion which can be significant for emerging sensor networks with vectorial data and/or security requirements. Via simulation, it is shown that this algorithm has excellent performance behavior and provides a near-optimal solution.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.