TY - GEN
T1 - Reducing congestion in real-time multi-party-tracking sensor network applications
AU - Jung, Wonwoo
AU - Shin, Sujeong
AU - Choi, Sukwon
AU - Cha, Hojung
PY - 2005
Y1 - 2005
N2 - This paper presents a framework for a congestion reduction mechanism in multiple objects tracking applications. The multiple objects tracking application has a real-time characteristic, through which all packets should be delivered in as timely fashion as possible. The proposed framework consists of sink nodes, backbone nodes, mobile nodes and agent nodes. The location information of the mobile node is delivered to the sink node using both localization and routing techniques, which consider the network congestion. The proposed congestion reduction technique avoids network congestion by decreasing the number of transmitting packets based on the idea that network congestion occurs when the total data in transit is greater than the total channel capacity. The decrement is achieved by both merging and attachment operations, which consolidate several small packets into one large packet in intermediate backbone nodes. The mechanism also considers a time-constrained delivery to assure the user's service request. The simulation is conducted using a TOSSIM simulator, and the result shows that the proposed mechanism improves performance in terms of the successful delivery ratio and the delay time.
AB - This paper presents a framework for a congestion reduction mechanism in multiple objects tracking applications. The multiple objects tracking application has a real-time characteristic, through which all packets should be delivered in as timely fashion as possible. The proposed framework consists of sink nodes, backbone nodes, mobile nodes and agent nodes. The location information of the mobile node is delivered to the sink node using both localization and routing techniques, which consider the network congestion. The proposed congestion reduction technique avoids network congestion by decreasing the number of transmitting packets based on the idea that network congestion occurs when the total data in transit is greater than the total channel capacity. The decrement is achieved by both merging and attachment operations, which consolidate several small packets into one large packet in intermediate backbone nodes. The mechanism also considers a time-constrained delivery to assure the user's service request. The simulation is conducted using a TOSSIM simulator, and the result shows that the proposed mechanism improves performance in terms of the successful delivery ratio and the delay time.
UR - http://www.scopus.com/inward/record.url?scp=33744911642&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33744911642&partnerID=8YFLogxK
U2 - 10.1007/11596042_121
DO - 10.1007/11596042_121
M3 - Conference contribution
AN - SCOPUS:33744911642
SN - 3540308032
SN - 9783540308034
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1191
EP - 1200
BT - Embedded and Ubiquitous Computing - EUC 2005 Workshops
T2 - EUC 2005 Workshops: UISW, NCUS, SecUbiq, USN, and TAUES
Y2 - 6 December 2005 through 9 December 2005
ER -