The most advanced solutions that are currently adopted in ports and terminals use technologies based on radio frequency identification (RFID) and the Global Positioning System (GPS) to identify and localize shipping containers in the yard. Nevertheless, because of the limitations of these solutions, the position of containers is still affected by errors, and it cannot be determined in real time. In this paper, a nonconventional approach is presented: Each container is equipped with nodes that use wireless communication to detect neighbor containers and to send proximity information to a base station. At the base station, geometrical constraints and proximity data are combined to determine the positions of containers. Missing information due to faulty nodes is tolerated by modeling geometrical constraints as an integer linear programming problem. Numerical simulations show that most of the containers can be localized, even when the number of nodes that are affected by faults is on the order of 30%.
An Integer Linear Programming Approach for Radio-Based Localization of Shipping Containers in the Presence of Incomplete Proximity Information
AVVENUTI, MARCO;CORSINI, PAOLO;PASSACANTANDO, MAURO;VECCHIO, ALESSIO
2012-01-01
Abstract
The most advanced solutions that are currently adopted in ports and terminals use technologies based on radio frequency identification (RFID) and the Global Positioning System (GPS) to identify and localize shipping containers in the yard. Nevertheless, because of the limitations of these solutions, the position of containers is still affected by errors, and it cannot be determined in real time. In this paper, a nonconventional approach is presented: Each container is equipped with nodes that use wireless communication to detect neighbor containers and to send proximity information to a base station. At the base station, geometrical constraints and proximity data are combined to determine the positions of containers. Missing information due to faulty nodes is tolerated by modeling geometrical constraints as an integer linear programming problem. Numerical simulations show that most of the containers can be localized, even when the number of nodes that are affected by faults is on the order of 30%.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
