Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700290
Till Eisner, Denis Lutke-Wiesmann, B. Scheuermann
WiFi sharing communities are an interesting option for mobile Internet access. Today, however, users need to give up privacy in exchange for connectivity: they are required to expose their identity in order to be granted access. This information can be used to track users and to generate usage and movement profiles. We identify the challenges of providing a maximum level of privacy and anonymity in a WiFi community. From a discussion of privacy properties of existing architectures, we arrive at a privacy-aware WiFi sharing design for fully anonymous usage-without sacrificing any participant's security or legal safety. This system, like some previous designs, relays a mobile user's data via this user's home network; we discuss how and under which circumstances this contributes to privacy and anonymity. In order to enable users to remain fully anonymous in such a system, a means to locate the home network of a user without leaking permanent identifiers is needed. We introduce and evaluate volatile host names, a novel method to generate anonymized, non-persistent host names in standard DNS.
{"title":"Protecting user privacy in WiFi sharing networks","authors":"Till Eisner, Denis Lutke-Wiesmann, B. Scheuermann","doi":"10.1109/GLOCOMW.2010.5700290","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700290","url":null,"abstract":"WiFi sharing communities are an interesting option for mobile Internet access. Today, however, users need to give up privacy in exchange for connectivity: they are required to expose their identity in order to be granted access. This information can be used to track users and to generate usage and movement profiles. We identify the challenges of providing a maximum level of privacy and anonymity in a WiFi community. From a discussion of privacy properties of existing architectures, we arrive at a privacy-aware WiFi sharing design for fully anonymous usage-without sacrificing any participant's security or legal safety. This system, like some previous designs, relays a mobile user's data via this user's home network; we discuss how and under which circumstances this contributes to privacy and anonymity. In order to enable users to remain fully anonymous in such a system, a means to locate the home network of a user without leaking permanent identifiers is needed. We introduce and evaluate volatile host names, a novel method to generate anonymized, non-persistent host names in standard DNS.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"406 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126681895","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700464
Dawei Sun, B. Zheng, Jingwu Cui, Sulan Tang
Future cognitive radio broadband wireless networks are expected to support a variety of communication services with diverse quality-of-service (QoS) requirements. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive and need guaranteed throughput. On the other hand, applications like file transfer and email services are relatively delay tolerant so variable-rate transmission is acceptable. This paper is different from most existing work on adaptive resource allocation. In this paper, we investigate the resource allocation problem in a heterogeneous cognitive multi-user OFDM system with both delay-sensitive (DS) and delay-tolerant (DT) services. To cope with this heterogeneous problem we combine the rate adaptive (RA) and margin adaptive (MA) principle. The purpose is to maximize the total rate of all DT services while maintaining guaranteed throughput of DS services under the constraint of primary user in cognitive radio network (CRN). For DS users a low complexity bit allocation algorithm based on geometric progression is proposed and for DT users a linear water-filling algorithm is used. Numerical results are executed to evaluate the performance of the proposed algorithms in terms of service outage probability, achievable transmission rate for DT users.
{"title":"A research of resource allocation algorithm in multi-media heterogeneous cognitive OFDM system","authors":"Dawei Sun, B. Zheng, Jingwu Cui, Sulan Tang","doi":"10.1109/GLOCOMW.2010.5700464","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700464","url":null,"abstract":"Future cognitive radio broadband wireless networks are expected to support a variety of communication services with diverse quality-of-service (QoS) requirements. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive and need guaranteed throughput. On the other hand, applications like file transfer and email services are relatively delay tolerant so variable-rate transmission is acceptable. This paper is different from most existing work on adaptive resource allocation. In this paper, we investigate the resource allocation problem in a heterogeneous cognitive multi-user OFDM system with both delay-sensitive (DS) and delay-tolerant (DT) services. To cope with this heterogeneous problem we combine the rate adaptive (RA) and margin adaptive (MA) principle. The purpose is to maximize the total rate of all DT services while maintaining guaranteed throughput of DS services under the constraint of primary user in cognitive radio network (CRN). For DS users a low complexity bit allocation algorithm based on geometric progression is proposed and for DT users a linear water-filling algorithm is used. Numerical results are executed to evaluate the performance of the proposed algorithms in terms of service outage probability, achievable transmission rate for DT users.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124142862","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700248
S. Rohde, N. Goddemeier, K. Daniel, C. Wietfeld
The in-depth reconnaissance and surveillance of incidents that are caused by uncontrolled emissions of liquid or gaseous contaminants, e.g. in cases of volcanic eruptions, large fires, industrial incidents or terrorist attacks, is still an emerging challenge. Mounting sensors on unmanned aerial vehicles (UAV) is a feasible approach since recent advances in the area of propulsion, carbon reinforced materials and batteries enable for miniaturization and cost-efficient deployment. Our proposed system makes use of an autonomous, wireless connected swarm of Micro UAVs, that is featured with a lightweight mobile sensor system. For this purpose a mobile ad hoc remote sensing network is set up in the air, that allows for calculation of potential fields like a aerosol propagation maps or 3D geomorphologies. Next to this system-of-systems approach, we uniquely show how to optimize the spatial sensor coverage while maintaining the communication quality. In this paper we analyze the equilibrium between coverage and link quality for a cluster based mobility scheme which is combined with randomized cognitive repelling walks.
{"title":"Link quality dependent mobility strategies for distributed aerial sensor networks","authors":"S. Rohde, N. Goddemeier, K. Daniel, C. Wietfeld","doi":"10.1109/GLOCOMW.2010.5700248","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700248","url":null,"abstract":"The in-depth reconnaissance and surveillance of incidents that are caused by uncontrolled emissions of liquid or gaseous contaminants, e.g. in cases of volcanic eruptions, large fires, industrial incidents or terrorist attacks, is still an emerging challenge. Mounting sensors on unmanned aerial vehicles (UAV) is a feasible approach since recent advances in the area of propulsion, carbon reinforced materials and batteries enable for miniaturization and cost-efficient deployment. Our proposed system makes use of an autonomous, wireless connected swarm of Micro UAVs, that is featured with a lightweight mobile sensor system. For this purpose a mobile ad hoc remote sensing network is set up in the air, that allows for calculation of potential fields like a aerosol propagation maps or 3D geomorphologies. Next to this system-of-systems approach, we uniquely show how to optimize the spatial sensor coverage while maintaining the communication quality. In this paper we analyze the equilibrium between coverage and link quality for a cluster based mobility scheme which is combined with randomized cognitive repelling walks.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124145804","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700307
Xinyu Jin, Pasd Putthapipat, Deng Pan, N. Pissinou, S. Makki
Recent advancements in micro-computing have provided an exponential increase in the capabilities of a wide range of devices and have allowed the implementation of complex mobile wireless sensor networks (mWSNs). Common battery-powered sensor nodes require security techniques that eliminate redundant processing overhead for resource conservation, without compromising the overall network performance. To address this issue, this paper presents USAS: Unpredictable Software-based Attestation Solution, a node compromise detection algorithm in mWSNs. USAS deploys dynamic node attestation chains to decrease checksum computation time by almost 48% for selective attested nodes. By decentralizing the network, the attestation is unpredictable, preventing malicious data injection. The performance of USAS is estimated in terms of node compromise detection rate.
{"title":"Unpredictable Software-based Attestation Solution for node compromise detection in mobile WSN","authors":"Xinyu Jin, Pasd Putthapipat, Deng Pan, N. Pissinou, S. Makki","doi":"10.1109/GLOCOMW.2010.5700307","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700307","url":null,"abstract":"Recent advancements in micro-computing have provided an exponential increase in the capabilities of a wide range of devices and have allowed the implementation of complex mobile wireless sensor networks (mWSNs). Common battery-powered sensor nodes require security techniques that eliminate redundant processing overhead for resource conservation, without compromising the overall network performance. To address this issue, this paper presents USAS: Unpredictable Software-based Attestation Solution, a node compromise detection algorithm in mWSNs. USAS deploys dynamic node attestation chains to decrease checksum computation time by almost 48% for selective attested nodes. By decentralizing the network, the attestation is unpredictable, preventing malicious data injection. The performance of USAS is estimated in terms of node compromise detection rate.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127779557","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700302
H. Setiawan, M. Kurosaki, H. Ochi
This paper discusses about feasibility study on global services recognition system for 3GPP GSM, UMTS, LTE, and IEEE 802.16d/e. we investigate the feasibility of preamble and synchronization signals as agents of services availability. To detect those signals, we propose the architecture consists of symmetric based auto-correlation, cross-correlation, filtering, and decision maker. Based on our estimation, the proposed design has reasonable complexity and has high possibility to develop. Moreover, simulations in ITU pedestrian B channel model give a good result where more than 80% services can be correctly detected for SNR 6 dB or higher.
{"title":"A feasibility study on physical implementation of global wireless communication services recognition system","authors":"H. Setiawan, M. Kurosaki, H. Ochi","doi":"10.1109/GLOCOMW.2010.5700302","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700302","url":null,"abstract":"This paper discusses about feasibility study on global services recognition system for 3GPP GSM, UMTS, LTE, and IEEE 802.16d/e. we investigate the feasibility of preamble and synchronization signals as agents of services availability. To detect those signals, we propose the architecture consists of symmetric based auto-correlation, cross-correlation, filtering, and decision maker. Based on our estimation, the proposed design has reasonable complexity and has high possibility to develop. Moreover, simulations in ITU pedestrian B channel model give a good result where more than 80% services can be correctly detected for SNR 6 dB or higher.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127791824","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700339
T. Miyazawa, H. Furukawa, K. Fujikawa, N. Wada, H. Harai
We are developing an integrated optical packet- and circuit-switched network. In this paper, we feature our own control system of the network and experimentally evaluate its performances. In our experimental setup, both best-effort data and control signals are transferred on colored (i.e. multi-wavelength) optical packet-switched links. We successfully transmit high-definition uncompressed real-time video signals on two lightpaths established by our control system without degradation of video quality, while other packet data are transferred in the same optical fibers. The developed system also has a function of adaptive resource change of packet switching and circuit switching. Time distances for resource change and lightpath setup are negligible, and therefore users do not feel stress for path establishment as the following results prove. Controller PCs can achieve lightpath establishment and automatic resource-allocation within approximately 500ms and 830ms, respectively, at the best possible case in our experimental setup.
{"title":"Experimental performance evaluation of control mechanisms for integrated optical packet- and circuit-switched networks","authors":"T. Miyazawa, H. Furukawa, K. Fujikawa, N. Wada, H. Harai","doi":"10.1109/GLOCOMW.2010.5700339","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700339","url":null,"abstract":"We are developing an integrated optical packet- and circuit-switched network. In this paper, we feature our own control system of the network and experimentally evaluate its performances. In our experimental setup, both best-effort data and control signals are transferred on colored (i.e. multi-wavelength) optical packet-switched links. We successfully transmit high-definition uncompressed real-time video signals on two lightpaths established by our control system without degradation of video quality, while other packet data are transferred in the same optical fibers. The developed system also has a function of adaptive resource change of packet switching and circuit switching. Time distances for resource change and lightpath setup are negligible, and therefore users do not feel stress for path establishment as the following results prove. Controller PCs can achieve lightpath establishment and automatic resource-allocation within approximately 500ms and 830ms, respectively, at the best possible case in our experimental setup.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128943609","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700322
Nejla Essaddi, Mohamed Hamdi, S. Habib, N. Boudriga
Most of the applications deployed over WSNs require strong coverage requirements, especially those related to the detection and tracking of distributed events. Int this paper, we use the Voronoi partition of the monitored zone to formulate and solve an evolutionary optimization problem modeling the activation of the deployed sensors. We adapt the spatial sensor distribution to the local probability of target presence. We show, through the results of our experiments, that our method allows a non-uniform deployment of the sensor nodes, which is better suitable for tracking applications.
{"title":"An evolutionary approach for non-uniform coverage control in wireless sensor networks","authors":"Nejla Essaddi, Mohamed Hamdi, S. Habib, N. Boudriga","doi":"10.1109/GLOCOMW.2010.5700322","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700322","url":null,"abstract":"Most of the applications deployed over WSNs require strong coverage requirements, especially those related to the detection and tracking of distributed events. Int this paper, we use the Voronoi partition of the monitored zone to formulate and solve an evolutionary optimization problem modeling the activation of the deployed sensors. We adapt the spatial sensor distribution to the local probability of target presence. We show, through the results of our experiments, that our method allows a non-uniform deployment of the sensor nodes, which is better suitable for tracking applications.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127403128","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700123
J. Nielsen, T. Madsen, H. Schwefel
Relaying is a well known technique to extend coverage and improve conditions for nodes in the outer coverage region. In this paper we propose a relaying scheme that exploits the spatial separation of relay and destination pairs to improve throughput by allowing simultaneous transmissions. The proposed scheme is a cross-layer optimization for two-hop relaying that uses position information to jointly optimize relay selection and relay transmit power, maximizing Medium Access Control layer throughput. Further, in order to calculate the expected throughput, we apply a probabilistic model that takes into account MAC retransmissions and timing behavior of the IEEE 802.11 Distributed Coordination Function mode. Our results show an increase in throughput of approximately 20% is achievable for the proposed scheme when compared to two-hop relaying in the analyzed scenario.
{"title":"Location-based relay selection and power adaptation enabling simultaneous transmissions","authors":"J. Nielsen, T. Madsen, H. Schwefel","doi":"10.1109/GLOCOMW.2010.5700123","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700123","url":null,"abstract":"Relaying is a well known technique to extend coverage and improve conditions for nodes in the outer coverage region. In this paper we propose a relaying scheme that exploits the spatial separation of relay and destination pairs to improve throughput by allowing simultaneous transmissions. The proposed scheme is a cross-layer optimization for two-hop relaying that uses position information to jointly optimize relay selection and relay transmit power, maximizing Medium Access Control layer throughput. Further, in order to calculate the expected throughput, we apply a probabilistic model that takes into account MAC retransmissions and timing behavior of the IEEE 802.11 Distributed Coordination Function mode. Our results show an increase in throughput of approximately 20% is achievable for the proposed scheme when compared to two-hop relaying in the analyzed scenario.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129142084","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700277
Zhiwei Gao, Yusheng Ji, Fuqiang Liu
The cooperative relay protocol is investigated in heterogeneous wireless networks. To analyze the handover impact of a cooperative relay node on a heterogeneous environment, we propose two typical mobility scenarios to evaluate the performance metrics, such as the capacity, outage probability, and service delay. The difference from a three-node link performance evaluation is that the node speed is considered as a major factor in the heterogeneous network performance models. By conducting a numerical analysis and simulation, we found the optimal relay configuration in a heterogeneous environment, which constrains the performance metrics by both relay number and velocity.
{"title":"Performance analysis of cooperative handover in heterogeneous wireless networks","authors":"Zhiwei Gao, Yusheng Ji, Fuqiang Liu","doi":"10.1109/GLOCOMW.2010.5700277","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700277","url":null,"abstract":"The cooperative relay protocol is investigated in heterogeneous wireless networks. To analyze the handover impact of a cooperative relay node on a heterogeneous environment, we propose two typical mobility scenarios to evaluate the performance metrics, such as the capacity, outage probability, and service delay. The difference from a three-node link performance evaluation is that the node speed is considered as a major factor in the heterogeneous network performance models. By conducting a numerical analysis and simulation, we found the optimal relay configuration in a heterogeneous environment, which constrains the performance metrics by both relay number and velocity.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127330039","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700316
Kun Wang, Lei Wang, Cang Ma, Lei Shu, J. Rodrigues
This paper focuses on studying the performance of TPGF geographic routing algorithm with multi routing metric called McTPGF in random duty-cycled wireless multimedia sensor networks (WMSNs). The multi-metric contains the geographic distance and the time, which is called sleeping-delay in this paper, the forwarding node waits to forward packet to the neighbor node after it wakes up. We recognize the fact that in random duty-cycled WMSNs, geographic routing should not only consider the geographic distance of the neighbor node but also the sleeping-delay of the node at that moment. The significant difference between our work and the TPGF is that our work pays more attentions to the demand of finding a single routing path with low sleeping-delay at a certain time using TPGF while the traditional TPGF algorithm focuses on finding all node-disjoint paths in the given network topology. Simulations are conducted to evaluate that the McTPGF reduces the end-to-end delay with the cost of adding few hop counts compared with the traditional TPGF algorithm in random duty-cycled WMSNs.
{"title":"Geographic routing in random duty-cycled wireless multimedia sensor networks","authors":"Kun Wang, Lei Wang, Cang Ma, Lei Shu, J. Rodrigues","doi":"10.1109/GLOCOMW.2010.5700316","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700316","url":null,"abstract":"This paper focuses on studying the performance of TPGF geographic routing algorithm with multi routing metric called McTPGF in random duty-cycled wireless multimedia sensor networks (WMSNs). The multi-metric contains the geographic distance and the time, which is called sleeping-delay in this paper, the forwarding node waits to forward packet to the neighbor node after it wakes up. We recognize the fact that in random duty-cycled WMSNs, geographic routing should not only consider the geographic distance of the neighbor node but also the sleeping-delay of the node at that moment. The significant difference between our work and the TPGF is that our work pays more attentions to the demand of finding a single routing path with low sleeping-delay at a certain time using TPGF while the traditional TPGF algorithm focuses on finding all node-disjoint paths in the given network topology. Simulations are conducted to evaluate that the McTPGF reduces the end-to-end delay with the cost of adding few hop counts compared with the traditional TPGF algorithm in random duty-cycled WMSNs.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132624536","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
扫码关注我们
求助内容：
应助结果提醒方式：