Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258328
J. McDougall, Scott L. Miller
In this paper, we investigate the appropriateness of wireless network simulations that employ a two-state Markov model to approximate a flat Rayleigh fading channel. Our approach first analyzes the statistical similarities and differences between block error processes generated by 1) an 802.11b defined communication scheme in the presence of flat Rayleigh fading and 2) a representative two-state Markov model. It is shown that, at low SNR, the Markov model does not generate an adequate frame error process. Furthermore, we quantify the effects of said statistical deviations through ns2 network simulations. This work further advances the understanding of the appropriate, and inappropriate, environments under which the two-state Markov model is a suitable approximation of a fading channel.
{"title":"Sensitivity of wireless network simulations to a two-state Markov model channel approximation","authors":"J. McDougall, Scott L. Miller","doi":"10.1109/GLOCOM.2003.1258328","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258328","url":null,"abstract":"In this paper, we investigate the appropriateness of wireless network simulations that employ a two-state Markov model to approximate a flat Rayleigh fading channel. Our approach first analyzes the statistical similarities and differences between block error processes generated by 1) an 802.11b defined communication scheme in the presence of flat Rayleigh fading and 2) a representative two-state Markov model. It is shown that, at low SNR, the Markov model does not generate an adequate frame error process. Furthermore, we quantify the effects of said statistical deviations through ns2 network simulations. This work further advances the understanding of the appropriate, and inappropriate, environments under which the two-state Markov model is a suitable approximation of a fading channel.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128234904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258464
F. Zhao, Yongjoo Shin, S. F. Wu, H. Johnson, A. Nilsson
Given the wide and rapid deployment of "visitor networks" (Dory Leifer 2002), how to authenticate the user and account the usage on the per-packet basis securely and yet efficiently is still a challenging problem. In this paper, we explore the tradeoff between performance and security, and propose a per-data-packet authentication and access control protocol called RBWA (random-bit window-based authentication). Deployed in the IP layer, RBWA can work with various underlying linker layer specific mechanisms and network topologies. And compared with IPSec, it dramatically reduces the overhead and power consumption by adding only a few bits to each data packet. Furthermore, RBWA is strong against a suite of attacks such as replay attack, denial-of-service attack and spoofing etc. In particular, a robust antireplay window scheme is developed to counter the severe packet reordering. The performance of RBWA is evaluated via the simulation.
{"title":"RBWA: an efficient random-bit window-based authentication protocol","authors":"F. Zhao, Yongjoo Shin, S. F. Wu, H. Johnson, A. Nilsson","doi":"10.1109/GLOCOM.2003.1258464","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258464","url":null,"abstract":"Given the wide and rapid deployment of \"visitor networks\" (Dory Leifer 2002), how to authenticate the user and account the usage on the per-packet basis securely and yet efficiently is still a challenging problem. In this paper, we explore the tradeoff between performance and security, and propose a per-data-packet authentication and access control protocol called RBWA (random-bit window-based authentication). Deployed in the IP layer, RBWA can work with various underlying linker layer specific mechanisms and network topologies. And compared with IPSec, it dramatically reduces the overhead and power consumption by adding only a few bits to each data packet. Furthermore, RBWA is strong against a suite of attacks such as replay attack, denial-of-service attack and spoofing etc. In particular, a robust antireplay window scheme is developed to counter the severe packet reordering. The performance of RBWA is evaluated via the simulation.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128300887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258430
R. Yao, G. Gao, Zheng Chen, Wenwu Zhu
In this paper, we develop a deterministic UWB multipath channel model based on time-domain uniform geometrical theory of diffraction (TD-UTD) technique. The solution includes the three basic ray mechanisms of geometrical optics (GO) and UTD, i.e., directed ray, multireflected rays from lossy surfaces, and diffracted ray from lossy edge. Since the analysis is conducted in time-domain electromagnetic field, unlike statistical model, the approach for UWB channel model can determine not only signal attenuation, but also waveform distortion in terms of pulse shape and pulse duration when the UWB signal propagates in multipath environments. Here, a generic impulse response model by taking into account channel impulse response as well as transmitter and receiver antenna impulse responses is given. Then, the analytical description of time-domain single reflected ray and reflection coefficients of horizontal polarization and vertical polarization is provided. The time-domain multiple reflected rays are expressed by the convolution of individual reflection coefficient from lossy surfaces with different electromagnetic properties. The time-domain diffraction ray is described as time-domain diffraction coefficients and reflection coefficient. Finally, the simulation results in a typical office room are presented.
{"title":"UWB multipath channel model based on time-domain UTD technique","authors":"R. Yao, G. Gao, Zheng Chen, Wenwu Zhu","doi":"10.1109/GLOCOM.2003.1258430","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258430","url":null,"abstract":"In this paper, we develop a deterministic UWB multipath channel model based on time-domain uniform geometrical theory of diffraction (TD-UTD) technique. The solution includes the three basic ray mechanisms of geometrical optics (GO) and UTD, i.e., directed ray, multireflected rays from lossy surfaces, and diffracted ray from lossy edge. Since the analysis is conducted in time-domain electromagnetic field, unlike statistical model, the approach for UWB channel model can determine not only signal attenuation, but also waveform distortion in terms of pulse shape and pulse duration when the UWB signal propagates in multipath environments. Here, a generic impulse response model by taking into account channel impulse response as well as transmitter and receiver antenna impulse responses is given. Then, the analytical description of time-domain single reflected ray and reflection coefficients of horizontal polarization and vertical polarization is provided. The time-domain multiple reflected rays are expressed by the convolution of individual reflection coefficient from lossy surfaces with different electromagnetic properties. The time-domain diffraction ray is described as time-domain diffraction coefficients and reflection coefficient. Finally, the simulation results in a typical office room are presented.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128644046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258840
S. Jivkova, M. Kavehrad
In this paper, we investigate vulnerability of a so called "cellular" and that of a multi-spot diffusing (MSD) multi-input-multi-output (MIMO) architecture to shadowing and its effect on communications cell size and the required transmit power. Because signal path obstruction by furniture is easier to predict and avoid, we are mainly concerned with shadowing and blockage caused by people either sitting or standing. To avoid blockage of communication link by a user of portable units, maximum radiation angle at the transmitter in both configurations must not exceed 45/spl deg/. This restricts communication cell size. We show the probability of blockage of a cellular link depends almost linearly on the distance of the portable unit from the communication cell center. Unlike cellular links, MSD-MIMO links can be designed to be robust against blockage, though still vulnerable to shadowing. In a typical office having a height of 3 m, probability of shadowing is less than 2% and in majority of cases shadowing causes less than 50% reduction in the received signal power. Power penalty due to shadowing is insignificant (less than 0.1 dB) with a 1% outage.
{"title":"Shadowing and blockage in indoor optical wireless communications","authors":"S. Jivkova, M. Kavehrad","doi":"10.1109/GLOCOM.2003.1258840","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258840","url":null,"abstract":"In this paper, we investigate vulnerability of a so called \"cellular\" and that of a multi-spot diffusing (MSD) multi-input-multi-output (MIMO) architecture to shadowing and its effect on communications cell size and the required transmit power. Because signal path obstruction by furniture is easier to predict and avoid, we are mainly concerned with shadowing and blockage caused by people either sitting or standing. To avoid blockage of communication link by a user of portable units, maximum radiation angle at the transmitter in both configurations must not exceed 45/spl deg/. This restricts communication cell size. We show the probability of blockage of a cellular link depends almost linearly on the distance of the portable unit from the communication cell center. Unlike cellular links, MSD-MIMO links can be designed to be robust against blockage, though still vulnerable to shadowing. In a typical office having a height of 3 m, probability of shadowing is less than 2% and in majority of cases shadowing causes less than 50% reduction in the received signal power. Power penalty due to shadowing is insignificant (less than 0.1 dB) with a 1% outage.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129260437","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258466
M. Matsumoto, Yasushi Takagi
This paper proposes a mutual authentication method to achieve high scalability using a simple mechanism. Communication records with a corresponding node are used as a seed to generate the secret key, so mutual authentication is executed using this generated secret key. This will reduce the number of authentication keys required for mutual authentication and processing loads per user in the entire communication network. We show the validity of this proposed method by applying an assumed ubiquitous network model.
{"title":"Mutual authentication method for ubiquitous service environments","authors":"M. Matsumoto, Yasushi Takagi","doi":"10.1109/GLOCOM.2003.1258466","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258466","url":null,"abstract":"This paper proposes a mutual authentication method to achieve high scalability using a simple mechanism. Communication records with a corresponding node are used as a seed to generate the secret key, so mutual authentication is executed using this generated secret key. This will reduce the number of authentication keys required for mutual authentication and processing loads per user in the entire communication network. We show the validity of this proposed method by applying an assumed ubiquitous network model.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"210 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124709079","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258857
M. Rossi, L. Badia, M. Zorzi
In this paper the packet delay statistics of a fully reliable selective-repeat ARQ scheme is investigated. It is assumed that the sender continuously transmits packets whose error process is characterized by means of a two-state discrete time Markov channel. At the receiver these packets are checked for errors and ACK/NACK messages (assumed error-free) are sent back to the sender accordingly. The feedback message is known at the transmitter m channel slots (round-trip delay) after the packet transmission started. An appropriate Markov model has been developed in order to find the exact statistics of the delays experienced by ARQ packets after their first transmission.
{"title":"Exact statistics of ARQ packet delivery delay over Markov channels with finite round-trip delay","authors":"M. Rossi, L. Badia, M. Zorzi","doi":"10.1109/GLOCOM.2003.1258857","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258857","url":null,"abstract":"In this paper the packet delay statistics of a fully reliable selective-repeat ARQ scheme is investigated. It is assumed that the sender continuously transmits packets whose error process is characterized by means of a two-state discrete time Markov channel. At the receiver these packets are checked for errors and ACK/NACK messages (assumed error-free) are sent back to the sender accordingly. The feedback message is known at the transmitter m channel slots (round-trip delay) after the packet transmission started. An appropriate Markov model has been developed in order to find the exact statistics of the delays experienced by ARQ packets after their first transmission.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129469271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258421
Bong-Ju Lee, Young-Chon Kim
This paper proposes a new call admission control scheme considering the call dropping probability of ongoing calls in LEO satellite networks. Quality of service (QoS) provisioning of low handover failure probability is used in the proposed call admission control (CAC) scheme to guarantee predefined acceptable call dropping probability for each call. To ensure the call dropping probability the handover failure probability has been formulated using the classification of the local traffic conditions and the derivation of generation probability for the equivalent case of handover failure event. The performance of the proposed scheme has been evaluated in terms of call dropping probability and handover failure probability. The performance evaluation results have clearly shown that the proposed CAC scheme guarantees the continuity of call connections with predefined QoS levels.
{"title":"Call admission method for call dropping probability guarantee in LEO satellite networks","authors":"Bong-Ju Lee, Young-Chon Kim","doi":"10.1109/GLOCOM.2003.1258421","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258421","url":null,"abstract":"This paper proposes a new call admission control scheme considering the call dropping probability of ongoing calls in LEO satellite networks. Quality of service (QoS) provisioning of low handover failure probability is used in the proposed call admission control (CAC) scheme to guarantee predefined acceptable call dropping probability for each call. To ensure the call dropping probability the handover failure probability has been formulated using the classification of the local traffic conditions and the derivation of generation probability for the equivalent case of handover failure event. The performance of the proposed scheme has been evaluated in terms of call dropping probability and handover failure probability. The performance evaluation results have clearly shown that the proposed CAC scheme guarantees the continuity of call connections with predefined QoS levels.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126701819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258772
Martin Roth, S. Wicker
A biologically inspired algorithm is presented to route messages in mobile wireless ad-hoc networks. The principles of swarm intelligence are used to define a probabilistic algorithm for which routing through paths of maximum throughput is an emergent property. This adaptive algorithm, dubbed termite, uses stigmergy to reduce the amount of control traffic needed to maintain a high data goodput. Stigmergy is a process by which information is indirectly communicated between individuals through their environment The termite environment is the contents of all routing tables. The movement of packets is influenced at each node, and communicating nodes observe this influence to update their own tables. Strong routing robustness is achieved through the use of multiple paths; each packet is routed randomly and independently.
{"title":"Termite: ad-hoc networking with stigmergy","authors":"Martin Roth, S. Wicker","doi":"10.1109/GLOCOM.2003.1258772","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258772","url":null,"abstract":"A biologically inspired algorithm is presented to route messages in mobile wireless ad-hoc networks. The principles of swarm intelligence are used to define a probabilistic algorithm for which routing through paths of maximum throughput is an emergent property. This adaptive algorithm, dubbed termite, uses stigmergy to reduce the amount of control traffic needed to maintain a high data goodput. Stigmergy is a process by which information is indirectly communicated between individuals through their environment The termite environment is the contents of all routing tables. The movement of packets is influenced at each node, and communicating nodes observe this influence to update their own tables. Strong routing robustness is achieved through the use of multiple paths; each packet is routed randomly and independently.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126900316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258474
Fei Hu, J. Tillett, J. Ziobro, N. Sharma
Large-scale ad hoc sensor networks (ASN), when deployed among mobile patients, can provide a dynamic data query architecture to allow the medical specialists to monitor patients at any place. We propose a low-energy, distributed, concentric-zone-based data query mechanism that has the advantages of both proactive and reactive ad hoc routing algorithms to collect medical results from large-scale mobile patients for medical specialists. In order to secure that tree-zone-based ASN, we suggest the using of key-chain to predistribute keys in each sensor. Then we further secure data fusion based on our telemedicine hierarchical architecture. We also propose a scalable global session-key generation mechanism in our tree-zone-based sensor networks.
{"title":"An energy-efficient approach to securing tree-zone-based sensor networks","authors":"Fei Hu, J. Tillett, J. Ziobro, N. Sharma","doi":"10.1109/GLOCOM.2003.1258474","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258474","url":null,"abstract":"Large-scale ad hoc sensor networks (ASN), when deployed among mobile patients, can provide a dynamic data query architecture to allow the medical specialists to monitor patients at any place. We propose a low-energy, distributed, concentric-zone-based data query mechanism that has the advantages of both proactive and reactive ad hoc routing algorithms to collect medical results from large-scale mobile patients for medical specialists. In order to secure that tree-zone-based ASN, we suggest the using of key-chain to predistribute keys in each sensor. Then we further secure data fusion based on our telemedicine hierarchical architecture. We also propose a scalable global session-key generation mechanism in our tree-zone-based sensor networks.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129179610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258775
S. Phoha, N. Jacobson, D. Friedlander, R. Brooks
The severe power, time and processing constraints on ad hoc wireless sensor networks for area surveillance require in-situ adaptations to conserve resources and optimize performance. In particular, it may be necessary to make dynamic tradeoffs between centralized processing algorithms, like beamforming, and knowledge based distributed processing algorithms like dynamic space-time clustering (DSTC) that rely on local processing of raw sensor data. Beamforming methods can achieve high levels of accuracy in estimating direction of arrival with a sound wave even when the source is in the far field. Hence accurate localization can be achieved with a relatively sparse sensor network. However, beamforming has severe limitations when the number of nodes increases. It requires orders of magnitude higher energy for transporting the entire time series over the network. DSTC methods, on the other hand, work well when the number of nodes is large because clusters can be formed within a smaller space-time window. This work examines the operational domains of the two centralized and distributed algorithms by analyzing sources of error, dependence on sensor density, sensor geometries, energy usage, control logic for data processing and the effects of network topology on the two algorithms. Based on this analysis, we develop hybrid algorithms that take advantage of the operational characteristics of each one in designing a high performance sensor network.
{"title":"Sensor network based localization and target tracking through hybridization in the operational domains of beamforming and dynamic space-time clustering","authors":"S. Phoha, N. Jacobson, D. Friedlander, R. Brooks","doi":"10.1109/GLOCOM.2003.1258775","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258775","url":null,"abstract":"The severe power, time and processing constraints on ad hoc wireless sensor networks for area surveillance require in-situ adaptations to conserve resources and optimize performance. In particular, it may be necessary to make dynamic tradeoffs between centralized processing algorithms, like beamforming, and knowledge based distributed processing algorithms like dynamic space-time clustering (DSTC) that rely on local processing of raw sensor data. Beamforming methods can achieve high levels of accuracy in estimating direction of arrival with a sound wave even when the source is in the far field. Hence accurate localization can be achieved with a relatively sparse sensor network. However, beamforming has severe limitations when the number of nodes increases. It requires orders of magnitude higher energy for transporting the entire time series over the network. DSTC methods, on the other hand, work well when the number of nodes is large because clusters can be formed within a smaller space-time window. This work examines the operational domains of the two centralized and distributed algorithms by analyzing sources of error, dependence on sensor density, sensor geometries, energy usage, control logic for data processing and the effects of network topology on the two algorithms. Based on this analysis, we develop hybrid algorithms that take advantage of the operational characteristics of each one in designing a high performance sensor network.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129192741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：