In this paper, a novel compact wideband high-rejection LPF using defected ground structure (DGS) is presented. The proposed LPF consists of etched slots in ground metallic plane as defected ground structure (DGS) and of Hi-Lo structure, which corresponding to capacitance and inductance on the top layer. The effect of the DGS slot on the characteristics of the investigated filter is examined. In this work we have proposed a simple method for increasing microstrip line characteristic impedance that is used extensively in microwave filter design. In order to prove the efficiency of the method, a comparison is made between the new DGS LPF and conventional filters, which shows that the proposed filter with simple etched cells is enough to obtain better performance by suppressing ripples and a very large stopband. Measured results are found to be in good agreement with the simulation results.
{"title":"Increase of Characteristic Impedance of Microstrip Line Using a simple Slot in Metallic Ground Plane","authors":"A. Arbabi, A. Boutejdar, M. Mahmoudi, A. Omar","doi":"10.1109/CCE.2006.350873","DOIUrl":"https://doi.org/10.1109/CCE.2006.350873","url":null,"abstract":"In this paper, a novel compact wideband high-rejection LPF using defected ground structure (DGS) is presented. The proposed LPF consists of etched slots in ground metallic plane as defected ground structure (DGS) and of Hi-Lo structure, which corresponding to capacitance and inductance on the top layer. The effect of the DGS slot on the characteristics of the investigated filter is examined. In this work we have proposed a simple method for increasing microstrip line characteristic impedance that is used extensively in microwave filter design. In order to prove the efficiency of the method, a comparison is made between the new DGS LPF and conventional filters, which shows that the proposed filter with simple etched cells is enough to obtain better performance by suppressing ripples and a very large stopband. Measured results are found to be in good agreement with the simulation results.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124529066","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, a double capacitive body biased keeper (DCBBK) for domino logic gate is proposed. By using this technique, the threshold voltage of keeper transistor is adapted to multi operating phase to reduce leakage power consumption and enhance speed compare to other techniques such as standard domino (SD) without body bias, dynamic body biased keeper (DBBK) and single capacitive body biased keeper (SCBBK). All the various body biased circuits are applied to a wide fan in OR domino gate for evaluating delay time, power consumption, power-delay product (PDF) and noise immunity. The simulation results with 0.18 mum Hynix CMOS technology show that DCBBK reduces 44%, 22%, 9% in power compare to SD, DBBK, SCBBK while DBBK, SCBBK, DCBBK all improve 46% in speed than SD gate.
本文提出了一种用于多米诺逻辑门的双电容体偏置保持器(DCBBK)。与无本体偏置的标准多米诺骨牌(SD)、动态本体偏置保持器(DBBK)和单电容本体偏置保持器(SCBBK)等技术相比，该技术使保持器的阈值电压适应多工作相，降低了漏功耗，提高了速度。将各种体偏置电路应用于OR多米诺门宽扇上，以评估延迟时间、功耗、功率延迟积(PDF)和噪声抗扰性。采用0.18 μ m Hynix CMOS技术的仿真结果表明，DCBBK与SD、DBBK、SCBBK相比，功耗分别降低44%、22%、9%，DBBK、SCBBK、DCBBK的速度均比SD栅极提高46%。
{"title":"A Double Capacitive Body Biased Circuit for High Performance Domino Logic with CMOS Keeper","authors":"H. Tung, N. Thang, P.X. Khanh, S.W. Kim","doi":"10.1109/CCE.2006.350790","DOIUrl":"https://doi.org/10.1109/CCE.2006.350790","url":null,"abstract":"In this paper, a double capacitive body biased keeper (DCBBK) for domino logic gate is proposed. By using this technique, the threshold voltage of keeper transistor is adapted to multi operating phase to reduce leakage power consumption and enhance speed compare to other techniques such as standard domino (SD) without body bias, dynamic body biased keeper (DBBK) and single capacitive body biased keeper (SCBBK). All the various body biased circuits are applied to a wide fan in OR domino gate for evaluating delay time, power consumption, power-delay product (PDF) and noise immunity. The simulation results with 0.18 mum Hynix CMOS technology show that DCBBK reduces 44%, 22%, 9% in power compare to SD, DBBK, SCBBK while DBBK, SCBBK, DCBBK all improve 46% in speed than SD gate.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115570963","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 large-scale open systems like Internet, attribute based access control is more appropriate than some other access control mechanisms. A fragment of description logic can be used to represent and reason about policies of attribute-based access control, because with logic descriptions, policies have a clear syntax and semantics. Further more, with the description logic modeling, ABAC policies and subject attributes assertions are easy to be integrated with semantic Web language which is designed to facilitate the machine interpretability and interoperability in distributed environment. The description logic representation is flexible to hold broad scope of information about users and contexts. The temporal properties of access control are also specified in our model.
{"title":"Description Logic Modeling of Temporal Attribute-Based Access Control","authors":"Peng Jin, Yang Fang-chun","doi":"10.1109/CCE.2006.350888","DOIUrl":"https://doi.org/10.1109/CCE.2006.350888","url":null,"abstract":"In large-scale open systems like Internet, attribute based access control is more appropriate than some other access control mechanisms. A fragment of description logic can be used to represent and reason about policies of attribute-based access control, because with logic descriptions, policies have a clear syntax and semantics. Further more, with the description logic modeling, ABAC policies and subject attributes assertions are easy to be integrated with semantic Web language which is designed to facilitate the machine interpretability and interoperability in distributed environment. The description logic representation is flexible to hold broad scope of information about users and contexts. The temporal properties of access control are also specified in our model.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117113553","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}
This paper presents optimum MIMO precoder designs based on transmit and receive correlation matrices to maximize the ergodic channel capacity for both frequency-flat and frequency-selective fading channels. It is shown that the optimum MIMO precoder in a frequency-flat fading channel is an eigen beamformer with beams referred to the eigenmodes of the transmit correlation matrix. By using the multi-path representation of a frequency-selective fading channel, the corresponding optimum precoding structure is derived. For a frequency-selective fading channel that can be represented by L uncorrelated effective paths, the optimum precoding structure consists of P+L parallel eigenbeamformers. Simulation results show that the proposed precoders can improve the ergodic capacity of both frequency-flat and frequency-selective fading channels, especially for channels with high spatial correlation.
{"title":"MIMO Precoding Structures for Frequency-Flat and Frequency-Selective Fading Channels","authors":"H. Bahrami, T. Le-Ngoc","doi":"10.1109/CCE.2006.350820","DOIUrl":"https://doi.org/10.1109/CCE.2006.350820","url":null,"abstract":"This paper presents optimum MIMO precoder designs based on transmit and receive correlation matrices to maximize the ergodic channel capacity for both frequency-flat and frequency-selective fading channels. It is shown that the optimum MIMO precoder in a frequency-flat fading channel is an eigen beamformer with beams referred to the eigenmodes of the transmit correlation matrix. By using the multi-path representation of a frequency-selective fading channel, the corresponding optimum precoding structure is derived. For a frequency-selective fading channel that can be represented by L uncorrelated effective paths, the optimum precoding structure consists of P+L parallel eigenbeamformers. Simulation results show that the proposed precoders can improve the ergodic capacity of both frequency-flat and frequency-selective fading channels, especially for channels with high spatial correlation.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127333224","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}
Hoiyoon Jung, Hyoungsuk Jeon, Jongsub Cha, Hyuckjae Lee
Adaptive modulation in OFDM systems is receiving remarkable attention as a scheme for improving spectral efficiency and error performance simultaneously. A major issue of the system is the necessity of channel information feedback that raises a problem of propagation delays. Linear channel prediction with drawback of biasing effect has been previously proposed to overcome propagation delays. In this paper, to avoid biasing effect, we propose channel prediction based on interpolation. Simulation results show that the proposed scheme has noticeable benefits of not only spectral efficiency but also error performance in OFDM systems using adaptive modulation.
{"title":"Bias Robust Channel Prediction for OFDM based Adaptive Modulation","authors":"Hoiyoon Jung, Hyoungsuk Jeon, Jongsub Cha, Hyuckjae Lee","doi":"10.1109/CCE.2006.350809","DOIUrl":"https://doi.org/10.1109/CCE.2006.350809","url":null,"abstract":"Adaptive modulation in OFDM systems is receiving remarkable attention as a scheme for improving spectral efficiency and error performance simultaneously. A major issue of the system is the necessity of channel information feedback that raises a problem of propagation delays. Linear channel prediction with drawback of biasing effect has been previously proposed to overcome propagation delays. In this paper, to avoid biasing effect, we propose channel prediction based on interpolation. Simulation results show that the proposed scheme has noticeable benefits of not only spectral efficiency but also error performance in OFDM systems using adaptive modulation.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132021344","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}
This paper presents a new method for extracting the frontal surface of a fetus automatically from a three-dimensional (3D) fetal ultrasound volume using support vector machine (SVM) based texture classification. Since a fetus often floats on amniotic fluids in its mother's uterus, the major part of the frontal surface may be extracted removing dark regions corresponding to the amniotic fluid regions. In this method, the removal of dark regions in a VOI of the volume is performed by a Laplacian-of-Gaussian (LoG) followed by zero-crossing detection, which is called coarse segmentation. In the regions segmented coarsely, some are fetus regions, some non-fetus regions such as the uterus, abdomen, and floating matters, and other mixed ones of the two. In order to extract more pure fetus regions, fine segmentation is executed to split the regions into more homogeneous sub-regions. The textureness of each sub-region is then measured by multi-window BDIP and multi-window BVLC moments and classified into fetus and non-fetus ones by a SVM which is known as efficient classification tool. The frontal contours extracted from merging adjacent fetus sub-regions is combined in all the frames of the VOI to generate a fetal surface, which defines a mask volume for 3D visualization of the fetus. Experimental results show that the proposed method is useful for automatic visualization of a fetus without intervention of a user in 3D ultrasound imaging.
{"title":"Surface Extraction Using SVM-Based Texture Classification for 3D Fetal Ultrasound Imaging","authors":"Tien Dung Nguyen, S. H. Kim, N. Kim","doi":"10.1109/CCE.2006.350830","DOIUrl":"https://doi.org/10.1109/CCE.2006.350830","url":null,"abstract":"This paper presents a new method for extracting the frontal surface of a fetus automatically from a three-dimensional (3D) fetal ultrasound volume using support vector machine (SVM) based texture classification. Since a fetus often floats on amniotic fluids in its mother's uterus, the major part of the frontal surface may be extracted removing dark regions corresponding to the amniotic fluid regions. In this method, the removal of dark regions in a VOI of the volume is performed by a Laplacian-of-Gaussian (LoG) followed by zero-crossing detection, which is called coarse segmentation. In the regions segmented coarsely, some are fetus regions, some non-fetus regions such as the uterus, abdomen, and floating matters, and other mixed ones of the two. In order to extract more pure fetus regions, fine segmentation is executed to split the regions into more homogeneous sub-regions. The textureness of each sub-region is then measured by multi-window BDIP and multi-window BVLC moments and classified into fetus and non-fetus ones by a SVM which is known as efficient classification tool. The frontal contours extracted from merging adjacent fetus sub-regions is combined in all the frames of the VOI to generate a fetal surface, which defines a mask volume for 3D visualization of the fetus. Experimental results show that the proposed method is useful for automatic visualization of a fetus without intervention of a user in 3D ultrasound imaging.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124958943","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}
This paper applies a novel optimization method for proportional-integral-differential (PID) controller design with D-stable regions based on integral of time-weighted absolute error (ITAE) performance to active queue management (AQM) routers that permits the designer to control the desired dynamic performance of a closed-loop system. A set of desired D-stable regions in the complex plane is first specified and then a numerical optimization algorithm based on ITAE performance is run to find the controller parameters such that all the roots of the closed-loop system are within the specified regions. This controller for AQM routers can detect and control the congestion effectively and predictively. Compared with the random early detection (RED) and proportional-integral (PI) algorithms via experimental simulations in network simulator version 2 (NS2), the proposed method, called DITAE-PID method, is indeed more efficient and robust in achieving the smaller queuing delay and higher throughput of an AQM router.
{"title":"Optimal Design of AQM Routers with D-Stable Regions Based on ITAE Performance","authors":"Xiuli Wang, Yongji Wang, Hui Zhou","doi":"10.1109/CCE.2006.350851","DOIUrl":"https://doi.org/10.1109/CCE.2006.350851","url":null,"abstract":"This paper applies a novel optimization method for proportional-integral-differential (PID) controller design with D-stable regions based on integral of time-weighted absolute error (ITAE) performance to active queue management (AQM) routers that permits the designer to control the desired dynamic performance of a closed-loop system. A set of desired D-stable regions in the complex plane is first specified and then a numerical optimization algorithm based on ITAE performance is run to find the controller parameters such that all the roots of the closed-loop system are within the specified regions. This controller for AQM routers can detect and control the congestion effectively and predictively. Compared with the random early detection (RED) and proportional-integral (PI) algorithms via experimental simulations in network simulator version 2 (NS2), the proposed method, called DITAE-PID method, is indeed more efficient and robust in achieving the smaller queuing delay and higher throughput of an AQM router.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124247864","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-10-01DOI: 10.1093/ietcom/e91-b.9.2972
Tran Nguyen Trung, Hideo Kamada, K. Kinoshita, N. Yamai, T. Takine, K. Murakami
Mobile agent is an efficient technology that makes it much easier to handle large scale and complex network systems. Especially in information retrieval, agents can search effectively with the ability of migrating autonomously through the networks. To find better results for such applications, it is important for agents to complete their tasks on as many nodes as possible by their deadlines. However, most existing agent systems using processor sharing as scheduling disciplines do not take such time constraints into account. Therefore, agents are likely to miss their deadlines on many nodes. In this paper, we propose an efficient and robust control method of agents with heterogeneous work demand under time constraint. When there are multiple agents running on a node, the mutual influence among them may cause to make the time for each agent to complete its task longer. When each agent has different work demand, the mutual influence among them is also different. The proposed method takes such different mutual influences into account to calculate the estimated value of the number of agents that can complete their tasks before their deadlines, and uses this value to control the dispatching and execution of agents. By using simulation experiments, we have proved that the proposed method can keep the fairness among all the agents and improve the number of nodes where agents can complete their tasks within their deadlines.
{"title":"An Efficient Agent Control Method for Time-constrained Applications with Heterogeneous Work Demand","authors":"Tran Nguyen Trung, Hideo Kamada, K. Kinoshita, N. Yamai, T. Takine, K. Murakami","doi":"10.1093/ietcom/e91-b.9.2972","DOIUrl":"https://doi.org/10.1093/ietcom/e91-b.9.2972","url":null,"abstract":"Mobile agent is an efficient technology that makes it much easier to handle large scale and complex network systems. Especially in information retrieval, agents can search effectively with the ability of migrating autonomously through the networks. To find better results for such applications, it is important for agents to complete their tasks on as many nodes as possible by their deadlines. However, most existing agent systems using processor sharing as scheduling disciplines do not take such time constraints into account. Therefore, agents are likely to miss their deadlines on many nodes. In this paper, we propose an efficient and robust control method of agents with heterogeneous work demand under time constraint. When there are multiple agents running on a node, the mutual influence among them may cause to make the time for each agent to complete its task longer. When each agent has different work demand, the mutual influence among them is also different. The proposed method takes such different mutual influences into account to calculate the estimated value of the number of agents that can complete their tasks before their deadlines, and uses this value to control the dispatching and execution of agents. By using simulation experiments, we have proved that the proposed method can keep the fairness among all the agents and improve the number of nodes where agents can complete their tasks within their deadlines.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123282164","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}
Harmonic series representations are frequently used for calculating electromagnetic fields scattered by a circular conducting cylinder. The harmonic representations are obtained by a method of separating variables in the cylindrical coordinates. Residue series representations are also used for calculating electromagnetic fields scattered by the circular conducting cylinder. The residue series are obtained by Watson's transformation. In this paper, it is shown that the residue series representations can also be obtained from another method of separating variables, and various distinguishing characteristics of the eigenfunction used in this method are made clear. The authors discuss the advantages and the distinctive features of the residue series representations in the comparison with the harmonic series representations.
{"title":"Electromagnetic Field Calculated by a New Method of Spreading Variable","authors":"N. H. Hai, Y. Namihira","doi":"10.1109/CCE.2006.350869","DOIUrl":"https://doi.org/10.1109/CCE.2006.350869","url":null,"abstract":"Harmonic series representations are frequently used for calculating electromagnetic fields scattered by a circular conducting cylinder. The harmonic representations are obtained by a method of separating variables in the cylindrical coordinates. Residue series representations are also used for calculating electromagnetic fields scattered by the circular conducting cylinder. The residue series are obtained by Watson's transformation. In this paper, it is shown that the residue series representations can also be obtained from another method of separating variables, and various distinguishing characteristics of the eigenfunction used in this method are made clear. The authors discuss the advantages and the distinctive features of the residue series representations in the comparison with the harmonic series representations.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116847407","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}
Wireless sensor networks are a challenging research field for the telecommunication engineer. The limited resources of the individual sensor nodes impose a redesign of the traditional wireless network protocols. These new designs aim primarily at reducing energy consumption and increasing scalability. Several gradient based routing protocols have been proposed in literature. They construct a cost field towards the sink to be able to forward data along the steepest gradient. A naive way to set up the cost field is flooding. In this paper we present an alternative approach based on received signal strength measurements and timers. The field is constructed in "consecutive waves" emanating from the initializing sink node. The considered cost is a combined metric which takes into account the minimum hop distance to the sink. A simulation study, using the OMNET++ network simulator environment, shows the feasibility, discusses the strengths and possible weaknesses of the proposed scheme and illustrates its energy efficient operation.
{"title":"Hop count discovery protocol for gradient based routing in wireless sensor networks","authors":"F. Verbist, N. Festjens, K. Steenhaut, A. Nowé","doi":"10.1109/CCE.2006.350842","DOIUrl":"https://doi.org/10.1109/CCE.2006.350842","url":null,"abstract":"Wireless sensor networks are a challenging research field for the telecommunication engineer. The limited resources of the individual sensor nodes impose a redesign of the traditional wireless network protocols. These new designs aim primarily at reducing energy consumption and increasing scalability. Several gradient based routing protocols have been proposed in literature. They construct a cost field towards the sink to be able to forward data along the steepest gradient. A naive way to set up the cost field is flooding. In this paper we present an alternative approach based on received signal strength measurements and timers. The field is constructed in \"consecutive waves\" emanating from the initializing sink node. The considered cost is a combined metric which takes into account the minimum hop distance to the sink. A simulation study, using the OMNET++ network simulator environment, shows the feasibility, discusses the strengths and possible weaknesses of the proposed scheme and illustrates its energy efficient operation.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121452021","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
扫码关注我们
求助内容：
应助结果提醒方式：