Pub Date : 2006-08-07DOI: 10.1109/WOCN.2006.1666530
S. Satapathy, N. Sarma
Limited battery powers of sensor nodes demand routing protocol for sensor network that consume minimum possible amount of energy and hence give longer life to the system. In a sensor network, sensor nodes are the potential source of information and they need to send their sensed/collected information to a remote base station (BS)/Sink. Generally, it needs a fixed amount of energy to receive one bit of information and an additional amount of energy to transmit the same. This additional amount depends on the transmission range. So, if all nodes transmit directly to the BS, then they will quickly deplete their energy. Therefore, a multi-hop routing protocol is needed to give longer life of the network. LEACH (aW. Heinzelman et al., 2000) (aW. Heinzelman et al., 2000) is an elegant energy efficient protocol where clusters are formed to fuse data before transmission to base station. By randomizing the cluster heads chosen to transmit to the base station, LEACH achieves a factor of 8 improvements over direct transmission, as measured in terms of nodes longevity. PEGASIS (aS. Lindsey and C. Raghavendra, 2001, 2002) is a chain based protocol that is an improvement over LEACH. In PEGASIS, each node communicates only with a close neighbor and takes turns in transmitting to the base station, thus reducing the amount of energy spent per round. It performs better than LEACH by about 100 - 300% for different network sizes and topologies. In this paper, we propose TREEPSI (tree based energy efficient protocol for sensor information) which gives up to 30% better performance (in terms of energy efficiency) than PEGASIS
传感器节点有限的电池电量要求传感器网络的路由协议消耗尽可能少的能量，从而延长系统的使用寿命。在传感器网络中，传感器节点是潜在的信息来源，它们需要将其感知/收集的信息发送到远程基站(BS)/接收器。一般来说，接收1比特信息需要固定的能量，传输1比特信息需要额外的能量。这个额外的数量取决于传输范围。因此，如果所有节点都直接传输到BS，那么它们将很快耗尽能量。因此，需要多跳路由协议来延长网络的寿命。利奇(哦。Heinzelman et al.， 2000)。Heinzelman et al.， 2000)是一种优雅的节能协议，在传输到基站之前形成集群以融合数据。通过随机选择传输到基站的簇头，LEACH比直接传输实现了8倍的改进，以节点寿命来衡量。pegasi(如。Lindsey和C. Raghavendra, 2001,2002)是一种基于链的协议，是对LEACH的改进。在PEGASIS中，每个节点只与一个近邻通信，并轮流向基站传输，从而减少了每轮消耗的能量。对于不同的网络大小和拓扑结构，它的性能比LEACH好100 - 300%。在本文中，我们提出了TREEPSI(基于树的传感器信息能效协议)，它的性能(在能效方面)比PEGASIS高出30%
{"title":"TREEPSI: tree based energy efficient protocol for sensor information","authors":"S. Satapathy, N. Sarma","doi":"10.1109/WOCN.2006.1666530","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666530","url":null,"abstract":"Limited battery powers of sensor nodes demand routing protocol for sensor network that consume minimum possible amount of energy and hence give longer life to the system. In a sensor network, sensor nodes are the potential source of information and they need to send their sensed/collected information to a remote base station (BS)/Sink. Generally, it needs a fixed amount of energy to receive one bit of information and an additional amount of energy to transmit the same. This additional amount depends on the transmission range. So, if all nodes transmit directly to the BS, then they will quickly deplete their energy. Therefore, a multi-hop routing protocol is needed to give longer life of the network. LEACH (aW. Heinzelman et al., 2000) (aW. Heinzelman et al., 2000) is an elegant energy efficient protocol where clusters are formed to fuse data before transmission to base station. By randomizing the cluster heads chosen to transmit to the base station, LEACH achieves a factor of 8 improvements over direct transmission, as measured in terms of nodes longevity. PEGASIS (aS. Lindsey and C. Raghavendra, 2001, 2002) is a chain based protocol that is an improvement over LEACH. In PEGASIS, each node communicates only with a close neighbor and takes turns in transmitting to the base station, thus reducing the amount of energy spent per round. It performs better than LEACH by about 100 - 300% for different network sizes and topologies. In this paper, we propose TREEPSI (tree based energy efficient protocol for sensor information) which gives up to 30% better performance (in terms of energy efficiency) than PEGASIS","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116976280","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 : 2006-08-07DOI: 10.1109/WOCN.2006.1666597
I. S. Misra, C. Pani
During the last couple of years, the cellular system becomes one of the popular wireless communication mediums. But in the hot spot region, the use of WLAN is increased due to its high data rate and low installation cost. So there is a requirement for suitable integration technique of 3G/GPRS and WLAN to increase the area of coverage and high data rate. In this paper, we present an integration of GPRS and WLAN in connection with multi protocol label switching (MPLS). The mobility is managed by hierarchical mobile IPv6 (HMIPv6). The aim of this paper is to design seamless mobility with low signaling overhead and provision for optimal quality of service (QoS). Performance analysis of the integrated framework is done for signaling overhead. Simulation result based on ns-2.26 indicates better throughput and faster switching. Thus ensure optimal QoS for the integrated framework
{"title":"An MPLS/HMIPv6 based mobility management framework for GPRS/WLAN integration architecture","authors":"I. S. Misra, C. Pani","doi":"10.1109/WOCN.2006.1666597","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666597","url":null,"abstract":"During the last couple of years, the cellular system becomes one of the popular wireless communication mediums. But in the hot spot region, the use of WLAN is increased due to its high data rate and low installation cost. So there is a requirement for suitable integration technique of 3G/GPRS and WLAN to increase the area of coverage and high data rate. In this paper, we present an integration of GPRS and WLAN in connection with multi protocol label switching (MPLS). The mobility is managed by hierarchical mobile IPv6 (HMIPv6). The aim of this paper is to design seamless mobility with low signaling overhead and provision for optimal quality of service (QoS). Performance analysis of the integrated framework is done for signaling overhead. Simulation result based on ns-2.26 indicates better throughput and faster switching. Thus ensure optimal QoS for the integrated framework","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117272464","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 : 2006-08-07DOI: 10.1109/WOCN.2006.1666603
T. Yamakami
The mobile Internet extends its coverage and opens new research and business opportunities. For example, mobile Internet search engines are still unexplored. In search engine design, it is important to capture the dynamic characteristics of the mobile Web. In order to identify such characteristics, the author designed MARCH-1, a mobile crawling system that regularly fetches and archives the mobile Web content. From the 2-year observation, the author attempts to identify the dynamism in the mobile Web. The author analyzes the stability of the mobile Web, update frequency of the mobile Web, and performance criteria for large-scale mobile Web using top pages, returned HTTP codes and execution timestamps from the observation. The author discusses some of the mobile-specific issues in returned HTTP codes and time-outs. The author presents the current status of mobile Web in a long-term observation perspective
{"title":"Empirical long-term observation on the mobile Web update frequency","authors":"T. Yamakami","doi":"10.1109/WOCN.2006.1666603","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666603","url":null,"abstract":"The mobile Internet extends its coverage and opens new research and business opportunities. For example, mobile Internet search engines are still unexplored. In search engine design, it is important to capture the dynamic characteristics of the mobile Web. In order to identify such characteristics, the author designed MARCH-1, a mobile crawling system that regularly fetches and archives the mobile Web content. From the 2-year observation, the author attempts to identify the dynamism in the mobile Web. The author analyzes the stability of the mobile Web, update frequency of the mobile Web, and performance criteria for large-scale mobile Web using top pages, returned HTTP codes and execution timestamps from the observation. The author discusses some of the mobile-specific issues in returned HTTP codes and time-outs. The author presents the current status of mobile Web in a long-term observation perspective","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124997806","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 : 2006-08-07DOI: 10.1109/WOCN.2006.1666618
N. Kothari, K. Dasgupta
Wireless links have been increasingly used in expanding Internet, making it possible to provide TCP/IP based services even in rural areas. The widely used TCP has been designed to operate efficiently over traditional almost error-free wired links with relatively low delay. Existing TCP suffers from channel delay and errors. No congestion control is needed for losses due to channel problems. In this paper, we propose a technique which allows SACK TCP to take a fair decision of delaying congestion control in case of a loss with the help of selective acknowledgments from receiver. The performance of SACK TCP with proposed modification is compared with original SACK TCP for network with wireless link using simulations. Results indicate considerable performance enhancement in presence of proposed modifications, when only errors cause losses
{"title":"Performance enhancement of SACK TCP protocol for wireless network by delaying fast recovery","authors":"N. Kothari, K. Dasgupta","doi":"10.1109/WOCN.2006.1666618","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666618","url":null,"abstract":"Wireless links have been increasingly used in expanding Internet, making it possible to provide TCP/IP based services even in rural areas. The widely used TCP has been designed to operate efficiently over traditional almost error-free wired links with relatively low delay. Existing TCP suffers from channel delay and errors. No congestion control is needed for losses due to channel problems. In this paper, we propose a technique which allows SACK TCP to take a fair decision of delaying congestion control in case of a loss with the help of selective acknowledgments from receiver. The performance of SACK TCP with proposed modification is compared with original SACK TCP for network with wireless link using simulations. Results indicate considerable performance enhancement in presence of proposed modifications, when only errors cause losses","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129677355","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 : 2006-08-07DOI: 10.1109/WOCN.2006.1666622
Ye Tung, Quazi Shahriar Rahman, Mazen Al-Khatib, Salim Alsharif
In this paper, we address Ad-hoc on demand distance vector (AODV), a versatile routing algorithm for such ad-hoc networks to investigate its Internet connectivity and undertake simulation based performance evaluation. The simulation environments are based on the AODV models. To obtain better understanding of these models, simulations were performed under different load condition. The simulation results verify the performance of different models under different criteria
{"title":"Performance evaluation of ad-hoc on demand distance vector (AODV) in mobile ad-hoc networks","authors":"Ye Tung, Quazi Shahriar Rahman, Mazen Al-Khatib, Salim Alsharif","doi":"10.1109/WOCN.2006.1666622","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666622","url":null,"abstract":"In this paper, we address Ad-hoc on demand distance vector (AODV), a versatile routing algorithm for such ad-hoc networks to investigate its Internet connectivity and undertake simulation based performance evaluation. The simulation environments are based on the AODV models. To obtain better understanding of these models, simulations were performed under different load condition. The simulation results verify the performance of different models under different criteria","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127552278","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 : 2006-08-07DOI: 10.1109/WOCN.2006.1666555
S. Chakraorty, S. Nandi
Finding the location of an object, other than sensor in a sensor network is an important problem. Here a technique is proposed to find the location of objects in a sensor grid. The locations of the sensors are assumed to be known. A sensor can only sense the number of objects present in its neighborhood. This small information injects low traffic in the network. The computations are carried out completely in the base station. In this paper we examine the role of very simple and noisy sensors for the tracking problem. We propose a binary sensor model, where each sensor's value is converted reliably to minimum bit of information
{"title":"Locating objects in a sensor grid","authors":"S. Chakraorty, S. Nandi","doi":"10.1109/WOCN.2006.1666555","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666555","url":null,"abstract":"Finding the location of an object, other than sensor in a sensor network is an important problem. Here a technique is proposed to find the location of objects in a sensor grid. The locations of the sensors are assumed to be known. A sensor can only sense the number of objects present in its neighborhood. This small information injects low traffic in the network. The computations are carried out completely in the base station. In this paper we examine the role of very simple and noisy sensors for the tracking problem. We propose a binary sensor model, where each sensor's value is converted reliably to minimum bit of information","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124544948","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 : 2006-08-07DOI: 10.1109/WOCN.2006.1666581
H. Liang, C. Ke, C. Shieh, W. Hwang, N. Chilamkurti
The QoS support for multimedia on wireless network is one of the most important researches in recent years. IEEE wireless 802.11e is the most hopeful among these methods. However, the performance metrics used in 802.11e experiments are almost network-level measures. They represent the network state and not the perceptual quality of the end user. Besides, the wireless network is error prone and errors are unavoidable. In this paper, we evaluate the effect of random error model and Gillbert-Elliot (GE) error model on the quality of multimedia applications
{"title":"Performance evaluation of 802.11e EDCF in the ad-hoc mode with real audio/video traffic","authors":"H. Liang, C. Ke, C. Shieh, W. Hwang, N. Chilamkurti","doi":"10.1109/WOCN.2006.1666581","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666581","url":null,"abstract":"The QoS support for multimedia on wireless network is one of the most important researches in recent years. IEEE wireless 802.11e is the most hopeful among these methods. However, the performance metrics used in 802.11e experiments are almost network-level measures. They represent the network state and not the perceptual quality of the end user. Besides, the wireless network is error prone and errors are unavoidable. In this paper, we evaluate the effect of random error model and Gillbert-Elliot (GE) error model on the quality of multimedia applications","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"19 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116395039","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 : 2006-08-07DOI: 10.1109/WOCN.2006.1666562
E. Husni, Y. Heryadi, W. Woon, M. S. Arifianto, D. V. Viswacheda, L. Barukang
This paper discusses the design of mobile telemedicine for delivering medical health care services in remote areas under the Tele-emergency Project. The system design uses mobile Internet protocol version 6 (MIPv6) combined with rapidly deployable network based on mobile ad-hoc network (MANET) and IEEE 802.11 wireless LAN (WLAN) technology. The result of our preliminary simulation for the project, which is the simulation of VoIP traffic over MANET, is also presented here. The project's primary objective is to create a prototype of mobile telemedicine system including hardware and software that can be rapidly deployed in remote areas or in disaster situation where telecommunication infrastructures are lacking or destroyed
{"title":"Mobile ad hoc network and mobile IP for future mobile telemedicine system","authors":"E. Husni, Y. Heryadi, W. Woon, M. S. Arifianto, D. V. Viswacheda, L. Barukang","doi":"10.1109/WOCN.2006.1666562","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666562","url":null,"abstract":"This paper discusses the design of mobile telemedicine for delivering medical health care services in remote areas under the Tele-emergency Project. The system design uses mobile Internet protocol version 6 (MIPv6) combined with rapidly deployable network based on mobile ad-hoc network (MANET) and IEEE 802.11 wireless LAN (WLAN) technology. The result of our preliminary simulation for the project, which is the simulation of VoIP traffic over MANET, is also presented here. The project's primary objective is to create a prototype of mobile telemedicine system including hardware and software that can be rapidly deployed in remote areas or in disaster situation where telecommunication infrastructures are lacking or destroyed","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115761650","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 : 2006-08-07DOI: 10.1109/WOCN.2006.1666676
K. Nallaperumal, J. Varghese, S. Saudia, R. Selvakumar, K. Krishnaveni, S. S. Vinsley
In this paper, a new median based filtering algorithm is presented for the removal of impulse noise from digital images. A good analysis of the limitations of the top ranking median filters, the progressive switching median filter, PSMF and the rank-order based adaptive median filter, RAMF is made and are overcome very effectively by the proposed filter which cleans the impulse corruptions of a digital image in two distinct phases of impulse detection and impulse correction. The detection phase identifies the corrupted pixels into a flag image by a spatial rank ordered approach and the correction phase modifies the corrupted pixels identified in the flag image by a more suitable rank ordered value by considering the neighboring features. The filter shows better performance than most other impulse filters, and in particular, that of the top ranking RAMF and PSMF in terms of computational aspect and objectively. The filtering technique gives good results with less patchy effects from images corrupted at higher noise levels and the results are more appealing with good fidelity at lower noise levels
{"title":"Selective switching median filter for the removal of salt & pepper impulse noise","authors":"K. Nallaperumal, J. Varghese, S. Saudia, R. Selvakumar, K. Krishnaveni, S. S. Vinsley","doi":"10.1109/WOCN.2006.1666676","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666676","url":null,"abstract":"In this paper, a new median based filtering algorithm is presented for the removal of impulse noise from digital images. A good analysis of the limitations of the top ranking median filters, the progressive switching median filter, PSMF and the rank-order based adaptive median filter, RAMF is made and are overcome very effectively by the proposed filter which cleans the impulse corruptions of a digital image in two distinct phases of impulse detection and impulse correction. The detection phase identifies the corrupted pixels into a flag image by a spatial rank ordered approach and the correction phase modifies the corrupted pixels identified in the flag image by a more suitable rank ordered value by considering the neighboring features. The filter shows better performance than most other impulse filters, and in particular, that of the top ranking RAMF and PSMF in terms of computational aspect and objectively. The filtering technique gives good results with less patchy effects from images corrupted at higher noise levels and the results are more appealing with good fidelity at lower noise levels","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126532656","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 : 2006-08-07DOI: 10.1109/WOCN.2006.1666617
P. Koutsakis
The provision of acceptable quality-of-service (QoS) for multimedia traffic over a geosynchronous Earth orbit (GEO) satellite network demands the existence of a well-designed medium access control (MAC) protocol. This paper proposes a new dynamic satellite bandwidth allocation technique which is based on accurate videoconference traffic prediction, which is shown via a simulation study to provide very good throughput and delay results
{"title":"On the use of videoconference traffic prediction for an efficient satellite bandwidth allocation scheme","authors":"P. Koutsakis","doi":"10.1109/WOCN.2006.1666617","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666617","url":null,"abstract":"The provision of acceptable quality-of-service (QoS) for multimedia traffic over a geosynchronous Earth orbit (GEO) satellite network demands the existence of a well-designed medium access control (MAC) protocol. This paper proposes a new dynamic satellite bandwidth allocation technique which is based on accurate videoconference traffic prediction, which is shown via a simulation study to provide very good throughput and delay results","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126166917","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
扫码关注我们
求助内容：
应助结果提醒方式：