상세정보
학술지
Multiple Sink Positioning and Routing to Maximize the Lifetime of Sensor Networks
- 발행일
- 200811
- 출처
- IEICE Transactions on Communications, v.E91-B no.11, pp.1-8
- ISSN
- 0916-8516
- 출판사
- 일본, 전자정보통신학회 (IEICE)
- 협약과제
- 08MW1200, 자동차 센서노드용 초소형 운영체제 개발, 마평수
- 초록
- In wireless sensor networks, the sensor nodes collect data, which are routed to a sink node. Most of the existing proposals address the routing problem to maximize network lifetime in the case of a single sink node. In this paper, we extend this problem into the case of multiple sink nodes. To maximize network lifetime, we consider the two problems: (i) how to position multiple sink nodes in the area, and (ii) how to route traffic flows from sensor nodes to sink nodes. In this paper, the solutions to these problems are formulated into a Mixed Integer Linear Programming (MILP) model. However, it is computationally difficult to solve the MILP formulation as the size of sensor network grows because MILP is NP-hard. Thus, we propose a heuristic algorithm, which produces a solution in polynomial time. From our experiments, we found out that the proposed heuristic algorithm provides a near-optimal solution for maximizing network lifetime in dense sensor networks. Copyright © 2008 The Institute of Electronics, Information and Communication Engineers.
- 키워드
- Lifetime, Multiple sinks, Sensor network
- KSP 제안 키워드
- Dense sensor networks, Heuristic algorithm, Information and communication, Integer linear programming(ILP), MILP formulation, Mixed-Integer Linear Programming(MILP), Multiple sink nodes, NP-hard, Optimal Solution, Polynomial time, Routing Problem