Journal of Northeastern University ›› 2013, Vol. 34 ›› Issue (8): 1082-1085.DOI: -

• Information & Control • Previous Articles     Next Articles

Dynamic Routing Algorithm Based on Multiobjective Programming for WSN

LI Fangfang, LIU Dong, GAO Xianwen, YU Ge   

  1. School of Information Science & Engineering, Northeastern University, Shenyang 110819, China.
  • Received:2013-03-11 Revised:2013-03-11 Online:2013-08-15 Published:2013-03-22
  • Contact: LI Fangfang
  • About author:-
  • Supported by:
    -

Abstract: To balance the energy efficiency and timeliness of query processing in wireless sensor networks, a dynamic routing algorithm called MOPEH was proposed based on the theory of multiobjective programming (MOP). MOPEH combined minimumenergy (ME) and minimumhop (MH) routing strategies and took both energy cost and transmission delay as the designed objects for the routing algorithm using MOP simulation. The set of all the feasible paths between nodes was established using depthfirst searching strategy, from which the paths were chosen which energy consumption were less than the average energy consumption. A network performance function was designed according to the query requirements in order to dynamically adjust the energy efficiency and timeliness. The paths which satisfied the requirements were thus chosen from the set of the feasible paths and optimal solutions were obtained. The experiment results showed that the algorithm processed realtime queries with good energy efficiency.

Key words: wireless sensor network(WSN), energyefficiency, realtime, multiobjective programming(MOP), routing

CLC Number: