We propose a topology discovery service, which is a network service that promotes the concept of cross-layer design. The topology service, which is the fundamental of any self-organized and self-healing WSN, maintains several topology parameters that describe the sensor field and how the nodes are distributed in the field. To demonstrate the benefits of our service, we design a density-aware GPSR routing protocol (DA-GPSR) to take advantage of the parameters provided by our service and improve the performance of the original GPSR protocol. DA-GPSR uses node density to route around areas with high node density (i.e., crowded areas) and improves end-to-end performance of GPSR. We use TinyOS and TOSSIM for the implementation and simulation, respectively.
{"title":"A Novel Topology Discovery Service for Self-Organized WSNs","authors":"S. Al-Omari, Weisong Shi","doi":"10.1109/WASA.2007.138","DOIUrl":"https://doi.org/10.1109/WASA.2007.138","url":null,"abstract":"We propose a topology discovery service, which is a network service that promotes the concept of cross-layer design. The topology service, which is the fundamental of any self-organized and self-healing WSN, maintains several topology parameters that describe the sensor field and how the nodes are distributed in the field. To demonstrate the benefits of our service, we design a density-aware GPSR routing protocol (DA-GPSR) to take advantage of the parameters provided by our service and improve the performance of the original GPSR protocol. DA-GPSR uses node density to route around areas with high node density (i.e., crowded areas) and improves end-to-end performance of GPSR. We use TinyOS and TOSSIM for the implementation and simulation, respectively.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122745829","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}
Frequency hopping systems have been widely used in military communications to prevent hostile jamming, interception and detection. In traditional frequency hopping (FH) systems, the transmitter hops in a pseudo-random manner among available frequencies according to a pre- specified algorithm, and the receiver operates accordingly in exact synchronization with the transmitter's hopping pattern. In multiple access systems, a collision may happen when more than one users transmit in the same frequency band simultaneously. Two major limitations with the conventional frequency hopping systems are: strict requirement on frequency acquisition/synchronization, and very low spectral efficiency due to inefficient utilization of the available bandwidth. In this paper, we introduce a new concept collision-free frequency hopping (CFFH). Based on the OFDM framework and the secure subcarrier assignment algorithm, the proposed CFFH system can achieve high information capacity through collision-free multiple access, and can successfully resolve the strict synchronization limitation. At the same time, as each user still transmits through a pseudo-random frequency hopping scheme, CFFH can maintain the inherent anti-jamming, anti-interception security features of the conventional FH system. The proposed CFFH scheme can be used for both civilian and military applications where secure high speed information transmission is needed.
{"title":"Spectrally Efficient Frequency Hopping System Design forWireless Networks","authors":"Tongtong Li, Qi Ling, Jian Ren","doi":"10.1109/WASA.2007.85","DOIUrl":"https://doi.org/10.1109/WASA.2007.85","url":null,"abstract":"Frequency hopping systems have been widely used in military communications to prevent hostile jamming, interception and detection. In traditional frequency hopping (FH) systems, the transmitter hops in a pseudo-random manner among available frequencies according to a pre- specified algorithm, and the receiver operates accordingly in exact synchronization with the transmitter's hopping pattern. In multiple access systems, a collision may happen when more than one users transmit in the same frequency band simultaneously. Two major limitations with the conventional frequency hopping systems are: strict requirement on frequency acquisition/synchronization, and very low spectral efficiency due to inefficient utilization of the available bandwidth. In this paper, we introduce a new concept collision-free frequency hopping (CFFH). Based on the OFDM framework and the secure subcarrier assignment algorithm, the proposed CFFH system can achieve high information capacity through collision-free multiple access, and can successfully resolve the strict synchronization limitation. At the same time, as each user still transmits through a pseudo-random frequency hopping scheme, CFFH can maintain the inherent anti-jamming, anti-interception security features of the conventional FH system. The proposed CFFH scheme can be used for both civilian and military applications where secure high speed information transmission is needed.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130932428","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}
To support a wide variety of applications ranging from military surveillance to health care clinic monitoring, a wireless sensor network must obtain accurate location for each sensor. A number of localization schemes have been developed to allow each sensor node to acquire its location. However, most of these techniques assume benign environments, and thus cannot survive malicious attacks in hostile environments where external and/or compromised nodes may launch attacks. This paper proposes a new computationally efficient and resilient localization scheme based on the clustering of benign location reference anchors. Moreover, this paper reports both simulation and field experiments using a test-bed of MICAz motes performed to compare the proposed approach with several recent secure localization schemes. The experimental results demonstrate that the proposed scheme has the fastest execution time among all resilient localization schemes that can be used for the current generation of sensor platforms (e.g., MICA series of motes).
{"title":"Cluster-Based Minimum Mean Square Estimation for Secure and Resilient Localization in Wireless Sensor Networks","authors":"Cliff X. Wang, An Liu, P. Ning","doi":"10.1109/WASA.2007.146","DOIUrl":"https://doi.org/10.1109/WASA.2007.146","url":null,"abstract":"To support a wide variety of applications ranging from military surveillance to health care clinic monitoring, a wireless sensor network must obtain accurate location for each sensor. A number of localization schemes have been developed to allow each sensor node to acquire its location. However, most of these techniques assume benign environments, and thus cannot survive malicious attacks in hostile environments where external and/or compromised nodes may launch attacks. This paper proposes a new computationally efficient and resilient localization scheme based on the clustering of benign location reference anchors. Moreover, this paper reports both simulation and field experiments using a test-bed of MICAz motes performed to compare the proposed approach with several recent secure localization schemes. The experimental results demonstrate that the proposed scheme has the fastest execution time among all resilient localization schemes that can be used for the current generation of sensor platforms (e.g., MICA series of motes).","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114637150","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}
A distributed search based data fusion algorithm is presented for target detections in large heterogeneous sensor networks. A score function is introduced as the objection function during the optimal search. The network state is determined when the score is the highest. A close to optimal solution can be obtained before the arrival of the next sensor data thus enabling real time target tracking. The algorithm is evaluated with a series of real-time simulations on networks of variable sensor compositions with a commodity Linux cluster.
{"title":"A Data Fusion Algorithm for Large Heterogeneous Sensor Networks","authors":"Hong Lin, J. Rushing, S. Graves, E. Criswell","doi":"10.1109/WASA.2007.134","DOIUrl":"https://doi.org/10.1109/WASA.2007.134","url":null,"abstract":"A distributed search based data fusion algorithm is presented for target detections in large heterogeneous sensor networks. A score function is introduced as the objection function during the optimal search. The network state is determined when the score is the highest. A close to optimal solution can be obtained before the arrival of the next sensor data thus enabling real time target tracking. The algorithm is evaluated with a series of real-time simulations on networks of variable sensor compositions with a commodity Linux cluster.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"705 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123833314","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}
In this paper, we study the performance of location-centric storage (LCS) theoretically. Our results indicate that LCS utilizes network resource efficiently. In particular, the storage load of sensors is independent of the network size, and is evenly distributed across the network. Moreover, the communication distance for getting event information is small. Therefore, the protocol has great scalability. In addition, we also propose algorithms for data retrieval in LCS. Our analysis shows that both the number of queries and the response cost involved in the algorithms could approach to the theoretical lower bound.
{"title":"On the Performance of Location-Centric Storage in Sensor Networks","authors":"Kai Xing, Xiuzhen Cheng, Jiang Li","doi":"10.1109/WASA.2007.34","DOIUrl":"https://doi.org/10.1109/WASA.2007.34","url":null,"abstract":"In this paper, we study the performance of location-centric storage (LCS) theoretically. Our results indicate that LCS utilizes network resource efficiently. In particular, the storage load of sensors is independent of the network size, and is evenly distributed across the network. Moreover, the communication distance for getting event information is small. Therefore, the protocol has great scalability. In addition, we also propose algorithms for data retrieval in LCS. Our analysis shows that both the number of queries and the response cost involved in the algorithms could approach to the theoretical lower bound.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124424973","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}
To avoid collisions in wireless networks, medium access control (MAC) protocols, such as distributed coordination function (DCF), have been developed to assist each node to decide when and how to access the communication channel. Although DCF is widely used in 802.11 based wireless local area networks, its performance is limited because DCF does not take into account the traffic intensity and node density. In other word, DCF only knows collision occurs but does not know how severe of the collision. In this paper, we develop a novel traffic adaptive backoff (TAB) protocol. We use network allocation vector count to approximate the intensity of surrounding traffic and the density of the nodes. TAB protocol then chooses a random backoff time uniformly between a lower threshold and an upper threshold. Simulations results suggest that the TAB protocol improves network performance by achieving a better channel utilization and reducing the number of dropped packets.
{"title":"An Efficient Traffic Adaptive Backoff Protocol for Wireless MAC Layer","authors":"Jun Wang, Min Song","doi":"10.1109/WASA.2007.142","DOIUrl":"https://doi.org/10.1109/WASA.2007.142","url":null,"abstract":"To avoid collisions in wireless networks, medium access control (MAC) protocols, such as distributed coordination function (DCF), have been developed to assist each node to decide when and how to access the communication channel. Although DCF is widely used in 802.11 based wireless local area networks, its performance is limited because DCF does not take into account the traffic intensity and node density. In other word, DCF only knows collision occurs but does not know how severe of the collision. In this paper, we develop a novel traffic adaptive backoff (TAB) protocol. We use network allocation vector count to approximate the intensity of surrounding traffic and the density of the nodes. TAB protocol then chooses a random backoff time uniformly between a lower threshold and an upper threshold. Simulations results suggest that the TAB protocol improves network performance by achieving a better channel utilization and reducing the number of dropped packets.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"1932 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128845809","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}
Anonymity is increasingly important for network communications concerning about censorship and privacy. Early research on source anonymous communication protocols generally stems from mixnet and DC-net. They either cannot provide provable anonymity or suffer from transmission collision. To solve this problem, a k-anonymous protocol based on hierarchical ring structure and mix technique was proposed. This proposed protocol is collision free and provides provable k-anonymity for both the sender and the recipient. However, this protocol requires the trustworthiness of k honest nodes, therefore, anonymity is only conditional. Alternatively, in this paper, we propose a provably secure anonymous communication (PSAC) scheme without relying on any trusted third parties. While ensuring the message sender anonymity, it can also provide message content authenticity. The proposed PSAC scheme can prevent tracing the senders of messages and limits the disruption that can be caused by participants.
{"title":"A Novel Provably Secure Anonymous Communication (PSAC) Scheme","authors":"Jian Ren, L. Harn, Tongtong Li","doi":"10.1109/WASA.2007.137","DOIUrl":"https://doi.org/10.1109/WASA.2007.137","url":null,"abstract":"Anonymity is increasingly important for network communications concerning about censorship and privacy. Early research on source anonymous communication protocols generally stems from mixnet and DC-net. They either cannot provide provable anonymity or suffer from transmission collision. To solve this problem, a k-anonymous protocol based on hierarchical ring structure and mix technique was proposed. This proposed protocol is collision free and provides provable k-anonymity for both the sender and the recipient. However, this protocol requires the trustworthiness of k honest nodes, therefore, anonymity is only conditional. Alternatively, in this paper, we propose a provably secure anonymous communication (PSAC) scheme without relying on any trusted third parties. While ensuring the message sender anonymity, it can also provide message content authenticity. The proposed PSAC scheme can prevent tracing the senders of messages and limits the disruption that can be caused by participants.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121189608","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}
Underwater sensor networks are significantly different from terrestrial sensor networks in that sound is mainly used as the communication medium. The long propagation delay and limited bandwidth of acoustic channels make the existing MAC protocols designed for radio networks either unpractical or not energy efficient for underwater sensor networks. In this paper, we propose a reservation-based MAC protocol, called R-MAC. The major design goals of R-MAC are energy efficiency and fairness. R-MAC schedules the transmissions of control packets and data packets to avoid data packet collision completely. The scheduling algorithms not only save energy but also solve the exposed terminal problem inherited in RTS/CTS-based protocols. Furthermore, the scheduling algorithms allow nodes in the network to select their own schedules, thus loosening the synchronization requirement the protocol. Additionally, R-MAC supports fairness. By simulations, we show that R-MAC is an energy efficient and fair MAC solution for underwater sensor networks.
{"title":"R-MAC: An Energy-Efficient MAC Protocol for Underwater Sensor Networks","authors":"P. Xie, Jun-hong Cui","doi":"10.1109/WASA.2007.82","DOIUrl":"https://doi.org/10.1109/WASA.2007.82","url":null,"abstract":"Underwater sensor networks are significantly different from terrestrial sensor networks in that sound is mainly used as the communication medium. The long propagation delay and limited bandwidth of acoustic channels make the existing MAC protocols designed for radio networks either unpractical or not energy efficient for underwater sensor networks. In this paper, we propose a reservation-based MAC protocol, called R-MAC. The major design goals of R-MAC are energy efficiency and fairness. R-MAC schedules the transmissions of control packets and data packets to avoid data packet collision completely. The scheduling algorithms not only save energy but also solve the exposed terminal problem inherited in RTS/CTS-based protocols. Furthermore, the scheduling algorithms allow nodes in the network to select their own schedules, thus loosening the synchronization requirement the protocol. Additionally, R-MAC supports fairness. By simulations, we show that R-MAC is an energy efficient and fair MAC solution for underwater sensor networks.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115611444","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}
In this paper, we present a silent positioning scheme termed as UPS for underwater acoustic sensor networks. UPS relies on the time-difference of arrivals measured locally at a sensor to detect range differences from the sensor to four anchor nodes. These range differences are averaged over multiple beacon intervals before they are combined to estimate the 3D sensor location through trilateration. UPS requires no time-synchronization and provides location privacy at underwater vehicles/sensors whose locations need to be determined. Simulation study on the position error of UPS under acoustic fading channels indicates that UPS is an effective scheme for underwater vehicle/sensor self- positioning.
{"title":"A Range-Difference Based Self-Positioning Scheme for Underwater Acoustic Sensor Networks","authors":"Xiuzhen Cheng, Haining Shu, Q. Liang","doi":"10.1109/WASA.2007.139","DOIUrl":"https://doi.org/10.1109/WASA.2007.139","url":null,"abstract":"In this paper, we present a silent positioning scheme termed as UPS for underwater acoustic sensor networks. UPS relies on the time-difference of arrivals measured locally at a sensor to detect range differences from the sensor to four anchor nodes. These range differences are averaged over multiple beacon intervals before they are combined to estimate the 3D sensor location through trilateration. UPS requires no time-synchronization and provides location privacy at underwater vehicles/sensors whose locations need to be determined. Simulation study on the position error of UPS under acoustic fading channels indicates that UPS is an effective scheme for underwater vehicle/sensor self- positioning.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123165847","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}
We propose a localization scheme for underwater acoustic sensor networks (UWSN) that does not require a priori infra-structure or synchronization between nodes. An autonomous underwater vehicle (AUV) aids in localizing the sensor nodes while roaming across the underwater sensor field. The objectives of this paper are to describe how to localize nodes using AUV and to describe the tradeoffs involved, i.e. ratio of localized nodes and localization accuracy. We show that localization success improves as the duration of the AUV localization process increases. In addition, we investigated localization using two methods, bounding-box and triangulation. The former achieves a higher localization ratio but with a higher error. In certain scenarios, we achieved 100% nodes localized with 3% error.
{"title":"AUV-Aided Localization for Underwater Sensor Networks","authors":"M. Erol, L. Vieira, M. Gerla","doi":"10.1109/WASA.2007.143","DOIUrl":"https://doi.org/10.1109/WASA.2007.143","url":null,"abstract":"We propose a localization scheme for underwater acoustic sensor networks (UWSN) that does not require a priori infra-structure or synchronization between nodes. An autonomous underwater vehicle (AUV) aids in localizing the sensor nodes while roaming across the underwater sensor field. The objectives of this paper are to describe how to localize nodes using AUV and to describe the tradeoffs involved, i.e. ratio of localized nodes and localization accuracy. We show that localization success improves as the duration of the AUV localization process increases. In addition, we investigated localization using two methods, bounding-box and triangulation. The former achieves a higher localization ratio but with a higher error. In certain scenarios, we achieved 100% nodes localized with 3% error.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"433 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123821873","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
扫码关注我们
求助内容：
应助结果提醒方式：