TY - GEN
T1 - New formulation for scheduling problem in multi-hop wireless sensor networks
AU - Furuta, Takehiro
AU - Sasaki, Mihiro
AU - Ishizaki, Fumio
AU - Ukai, Takamori
AU - Miyazawa, Hajime
AU - Koo, Wonyong
PY - 2010/8/6
Y1 - 2010/8/6
N2 - In this paper, we consider a multi-hop sensor network, where the network topology is a tree, TDMA is employed as medium access control, and all data generated at sensor nodes are delivered to a sink node located on the root of the tree through the network. It is reported that if a transmission schedule that avoids interference between sensor nodes completely can be computed, TDMA is preferable to CSMA/CA in performance. However, solving the scheduling problem for TDMA is diffcult, especially, in large-scale multi-hop sensor networks. In this paper, to formulate the scheduling problem for TDMA, we propose min-max model and min-sum model. While the min-max model yields the shortest schedule under the constraints, the min-sum model does not guarantee providing the shortest schedule. Numerical examples show that the min-sum model can provide good schedules in a reasonable CPU time, even when the min-max model fails to compute the shortest schedule in a reasonable CPU time.
AB - In this paper, we consider a multi-hop sensor network, where the network topology is a tree, TDMA is employed as medium access control, and all data generated at sensor nodes are delivered to a sink node located on the root of the tree through the network. It is reported that if a transmission schedule that avoids interference between sensor nodes completely can be computed, TDMA is preferable to CSMA/CA in performance. However, solving the scheduling problem for TDMA is diffcult, especially, in large-scale multi-hop sensor networks. In this paper, to formulate the scheduling problem for TDMA, we propose min-max model and min-sum model. While the min-max model yields the shortest schedule under the constraints, the min-sum model does not guarantee providing the shortest schedule. Numerical examples show that the min-sum model can provide good schedules in a reasonable CPU time, even when the min-max model fails to compute the shortest schedule in a reasonable CPU time.
KW - Scheduling
KW - Sensor networks
KW - TDMA
UR - http://www.scopus.com/inward/record.url?scp=77955124912&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77955124912&partnerID=8YFLogxK
U2 - 10.1145/1815396.1815414
DO - 10.1145/1815396.1815414
M3 - Conference contribution
AN - SCOPUS:77955124912
SN - 9781450300629
T3 - IWCMC 2010 - Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
SP - 73
EP - 78
BT - IWCMC 2010 - Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
T2 - 6th International Wireless Communications and Mobile Computing Conference, IWCMC 2010
Y2 - 28 June 2010 through 2 July 2010
ER -