TY - GEN
T1 - A comprehensive routing protocol in wireless sensor network based on ant colony algorithm
AU - Guo, Wenjing
AU - Zhang, Wei
AU - Lu, Gang
PY - 2010
Y1 - 2010
N2 - This paper proposes a comprehensive routing protocol (CRP) based on the ant colony algorithm for the applications of Wireless Sensor Network (WSN). It is a protocol taking both the lifetime of network and the arrival rate of data packet into account. In CRP, multiple paths are found between source and destination, and sub-optimal paths are used occasionally referring to the probabilistic forwarding table to provide substantial gains. To ascertain the probability of the candidate node to be chosen as the next forwarding one, these factors such as the remained energy of the node, the square of distance between it and the current node, and the strength of pheromone on this branch are considered to balance the energy consumption between nodes. Moreover, to guarantee the success of message transmission, the reputation of nodes on the routing path is critical. Therefore, the frequency a node acting as a router which represents its reputation is also considered as one of the decision factors. Simulation results have shown that the proposed protocol not only prolongs the network lifetime, but also decreases the packet loss rate.
AB - This paper proposes a comprehensive routing protocol (CRP) based on the ant colony algorithm for the applications of Wireless Sensor Network (WSN). It is a protocol taking both the lifetime of network and the arrival rate of data packet into account. In CRP, multiple paths are found between source and destination, and sub-optimal paths are used occasionally referring to the probabilistic forwarding table to provide substantial gains. To ascertain the probability of the candidate node to be chosen as the next forwarding one, these factors such as the remained energy of the node, the square of distance between it and the current node, and the strength of pheromone on this branch are considered to balance the energy consumption between nodes. Moreover, to guarantee the success of message transmission, the reputation of nodes on the routing path is critical. Therefore, the frequency a node acting as a router which represents its reputation is also considered as one of the decision factors. Simulation results have shown that the proposed protocol not only prolongs the network lifetime, but also decreases the packet loss rate.
KW - Ant colony algorithm
KW - Comprehensive routing protocol (CRP)
KW - Network lifetime
KW - Packet loss rate
KW - Wireless sensor network (WSN)
UR - https://www.scopus.com/pages/publications/77954412404
U2 - 10.1109/NSWCTC.2010.18
DO - 10.1109/NSWCTC.2010.18
M3 - 会议稿件
AN - SCOPUS:77954412404
SN - 9780769540115
T3 - NSWCTC 2010 - The 2nd International Conference on Networks Security, Wireless Communications and Trusted Computing
SP - 41
EP - 44
BT - NSWCTC 2010 - The 2nd International Conference on Networks Security, Wireless Communications and Trusted Computing
T2 - 2nd International Conference on Networks Security, Wireless Communications and Trusted Computing, NSWCTC 2010
Y2 - 24 April 2010 through 25 April 2010
ER -