Documente Academic
Documente Profesional
Documente Cultură
Abstract - Considering on the insufficiency of using different communication of nodes and the nodes' residual energy, it
routing algorithms for different applications, we proposed reduced the network's energy consumption. On the
an auto-adaptive routing algorithm for wireless sensor applications of object tracking and calamity succouring, it is
networks. It firstly proposed two different routing methods very important to using routing protocol which is based on
using for the sensor node's localization and the for the verypimporta ongTherui pRotocolawhichi asd on
object's localization respectively. When we had obtained the
nodes' positions through some localization algorithms, it
georaphynpositin. GEA (Graph andengy
aware routing) routing[3] and GEM(Graph Embedding)[4]
used an energy aware geography position based routing routing agrh as rethe classical ones between them. Onthe
method for the object's information acquisition. In order to applications such as environment detection where it needs to
satisfy this application, it designed an auto-adaptive routing query the sensor nodes' data, it is good for routing protocol
mechanism facilitate the use of the two or more routing which is based on querying. DD(Directed diffusion) algorithm
methods. It has been shown that the routing algorithm has a is a routing mechanism focused on nodes' data and based on
high performance in getting a shorter path routing or querying. The DD algorithm is deemed to a landmark of
energy balanced routing by adjusting of its parameters. routing algorithm in wireless sensor networks. And many
routing algorithms for wireless sensor networks are proposed
Into-adeptier algorithm
auto-adaptive Wirs s rn on the foundation of it presently [5][6]. The sink node sent
query tasks through the interest message, and transmitted them
I. INTRODUCTION in the wireless sensor network by flooding. In the process of
interest message transmitting, the DD algorithm built a data
transmitting gradient for each sensor node from the data
The wireless sensor network is a burgeoning and high source node to the sink node. And then the data source node
potential network system. It consists of a lot of sensor nodes carried the gathering data to the sink node in the direction of
and wireless communication device. It has a lot of application the data gradient [7].
foreground on the military affairs, environment detection, These routing algorithms for wireless sensor networks
medical treatment, home nursing, and other commercial realm referred above are just fit for some special applications. When
[1]. The network's routing mechanism is on duty of the application demands change, the routing algorithm needs
transmitting information from one sensor node to another to change correspondingly. And in a lot of instances, we must
through the network. It is the foundation to achieve a high change the routing demand of wireless sensor networks to
efficient communication for wireless sensor networks. accomplish a certain task. This makes these routing algorithms
The wireless sensor network is an application interrelated much limited and highly unwieldy for use. Let's takes the
network. Aiming at the different demand on application, some object tracking application in wireless sensor networks for
authors inside and outside of our country have designed many example. At beginning, the sensor nodes need to use
routing algorithms for wireless sensor networks. In order to localization algorithm to obtain each node's position in
use the limited energy of the wireless sensor network wireless sensor networks. In the process of localization, they
effectively, Rahul C. Shah et al. proposed an energy aware need to communication mutually and transmit data for each
routing for low energy ad hoc sensor networks [2]. By the other. At this time it needs a routing algorithm to achieve the
integrative consideration of energy consumption on localization task. By all appearances, it is not feasible to using
*Supposed by Key Program of the National Natural Science Foundation of China under Grant No. 60535010; the National
Natural Science Foundation of China under Grant No. 60475027.
575
If u>4, the sensor nodes are inclined to choose the path
Dist yt)2
(x1Dis- At ) + yi -Yt which have been routed to transmit data.
At beginning, for each node i, it got its neighbours' Else if o<j, the sensor nodes are inclined to choose a path
distance information and calculated the pheromone ,U on which the node's energy is relatively high.
IJ Parameter c assists to changes the probability of each
between the node i and its each neighborj. path. For example, if c= 1, it doesn't select the minimal /,uk (t)
,j(0) =D1i-sjt node for routing and the maximal ,uk (t) node has a larger
(1)
E Diskt probability to be selected.
ke neighbor(i) When it had actually select node j for the next hop, the
Start for routing pheromone ,. between the node i and its each neighbor j
______________________________ would be updated.
Obtain neighbour nodes' (3)
positions, residual energy and Where the Au is the parameter for li 's updating.
lAl>(t) The routing flow ofthe proposed method is in Fig. 1.
Calculate and choose the next C. A New Auto-adaptive Routing Selecting Mechanism
hop The above two routing methods are used for sensor nodes'
localization and then object's localization respectively. But for
increase the /'k object's localization we need to first localize the sensor nodes
(electedrout)ng nofde and then the object. That is, in this application, we need the
both two routing methods. Therefore, we need a new auto-
adaptive routing selecting mechanism to facilitate the use of
the two or more routing methods.
Thenode's enery I
576
power consumption for sending data is 666mw and for When o=O, the algorithm just take the energy into account.
receiving data is 395mw. The initial energy for all nodes is the It will more likely to select the node whose energy is larger for
same, which is OOOJ. The object sends 2 packets per second the next hop. As is shown in Fig 5, the energy of node is
(2p/s). Each packet is same in size, which is 64K bytes. The similar with each other. It will not happen that some nodes is
transmitting rate is 1.6Mb/s.Al=0.2, and c=1. The simulation out of energy prematurely and make the wireless sensor
time is lOOOs. network die unexpectedly.
Because the first routing method (The Restricted
Flooding) is very simple, we don't want to pay more attention 7 -
on its simulation. Assuming we have got the position , -
information for each node after a certain localization - I-
algorithm, we simulate the performance of the routing method / / -
based on Node's Geography Position. ,
Because the sensor nodes just have a limited energy and c 800 , ,/.
may not change battery after been deployed for a certain 600 /1 // I
application, the nodes' energy is very importance for wireless E // /
sensor networks. Therefore, we compare the energy c 400 / / /
consumption with the other routing algorithm such as DD ° 200
algorithm. 0 16 (D
0/
' /0 g/ 100~~~~~~ 0<,X
20
*eor Avrage dissipated energy for DD algorih 5
cD
D
0.16
0.1
Average dissipated energy for our algorithm 100
50 AX
7
a
0.14
~~~~~~~~~~~~~~~~~~~~~~y 0
() 0.06
03) 024 -- i
>0 258-i,
577
[3] Yu Y, Govindan R, Estrin D. Geographical and energy aware routing: A
recursive data dissemination protocol for wireless sensor networks.
UCLA Computer Science Department Technical Report UCLA/CSD-TR-
01-0023, May 2001
[4] Newsome J, Song D. GEM: Graph Embedding for routing and data-
centric storage in sensor networks without geographic information. In:
Proc 1 st ACM Conf on Embedded Networked Sensor Systems, Redwood,
CA. November 2003.
[5] K. Akkaya, M. Younis, A Survey on Routing Protocols for Wireless
Sensor Networks[J].Ad Hoc Networks. 2005, 3(3): 325-349.
[6] Haibin Yu, peng Zheng, Intellegent wireless sensor networks, Sciencep
Press, 2006.1, 124-125
[7] C. Intanagonwiwat, R. Govindan and D. Estrin, Directed diffusion: A
scalable and robust communication paradigm for sensor networks, in the
Proceedings of the 6th Annual ACM/IEEE International Conference on
Mobile Computing and Networking (MobiCom'00), Boston, MA, August
2000. 56-67.
[8] Ying Zhang and Markus Fromherz, Constrained Flooding: A Robust and
Efficient Routing Framework for Wireless Sensor Networks, Proceedings
of the 20th International Conference on Advanced Information
Networking and Applications (AINA'06), 2006
[9] Huai Wu,Zhi Ren and Wei Guo, A MPR-flooding-based On-demand
Routing Algorithm in Wireless Sensor Networks, Proceedings of the 2006
IEEE International Conference on Mechatronics and Automation,
Luoyang, China, June 25 - 28, 2006, p1937-1941
578