Pub Date : 2005-07-05DOI: 10.1109/ICNSC.2005.1461268
E. Lin, Mianyu Wang, M. Kam
The predictive p-persistent carrier sense multiple access (p-persistent CSMA) algorithm is studied, using analytical models, simulations, and physical experiments. The algorithm is used for managing access of devices to a shared channel in networked control applications such as the local operating networks (LonWorks). The key to its success is an adjustment of a time window during which ready packets are transmitted. A Markov-chain based analytical model for the algorithm is developed, as well as an OPNET-based simulation of the model. Predictions of the analytical model and simulation are compared to experimental data collected from a network of six SMART I/O ADR112-F units connected though TP/FT-10 channel
{"title":"Modeling and performance evaluation of collision resolution algorithms for LonWorks control networks","authors":"E. Lin, Mianyu Wang, M. Kam","doi":"10.1109/ICNSC.2005.1461268","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461268","url":null,"abstract":"The predictive p-persistent carrier sense multiple access (p-persistent CSMA) algorithm is studied, using analytical models, simulations, and physical experiments. The algorithm is used for managing access of devices to a shared channel in networked control applications such as the local operating networks (LonWorks). The key to its success is an adjustment of a time window during which ready packets are transmitted. A Markov-chain based analytical model for the algorithm is developed, as well as an OPNET-based simulation of the model. Predictions of the analytical model and simulation are compared to experimental data collected from a network of six SMART I/O ADR112-F units connected though TP/FT-10 channel","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122570082","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 : 2005-07-05DOI: 10.1109/ICNSC.2005.1461336
Zeng Guanping, Tu Xuyan, Zhang Shumin
The organization management of " SoftMan crowd " is the basic problem of SoftMan consultation, cooperation and coordination. This paper put forward the design and the organization structural model of SMC (SoftMan Community), established SMC management and control strategy, and realized control function and the specific management under management tactful guidance. At the same time, this paper also discussed the interacting control mechanisms of local SMCs and remote SMCs.
{"title":"The organization model research of SM crowd","authors":"Zeng Guanping, Tu Xuyan, Zhang Shumin","doi":"10.1109/ICNSC.2005.1461336","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461336","url":null,"abstract":"The organization management of \" SoftMan crowd \" is the basic problem of SoftMan consultation, cooperation and coordination. This paper put forward the design and the organization structural model of SMC (SoftMan Community), established SMC management and control strategy, and realized control function and the specific management under management tactful guidance. At the same time, this paper also discussed the interacting control mechanisms of local SMCs and remote SMCs.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123356493","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461217
Seung Min Lee, Heung-Ho Lee
This paper describes the development effort of a hybrid electronic radiation detector/dosimeter using a SiC diode and a p-type power MOSFET. To select the best candidate for the dosimeter among commercial devices, we have investigated the radiation performance of the devices in two Co-60 irradiation facilities in Korea. As a result of the investigation, two semiconductor sensors with excellent proportionality to incident radiation were identified. A small hybrid radiation-detection/dosimetry module with the two sensors has been developed. The real-time detector module is also radiation hardened for an ionizing radiation environment with well over 100 krad (SiO2) dose. The developed small and simple semiconductor electronic dosimeter is unique in terms of its extended dose range (/spl sim/100 krad), dose-rate (50 rad/hr /spl sim/ 8 krad/hr) capability, and its level of redundancy/diversity along with its size/weight.
{"title":"Development of an on-line hybrid electronic radiation dosimeter for a mobile robot using pMOSFET and SiC diode","authors":"Seung Min Lee, Heung-Ho Lee","doi":"10.1109/ICNSC.2005.1461217","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461217","url":null,"abstract":"This paper describes the development effort of a hybrid electronic radiation detector/dosimeter using a SiC diode and a p-type power MOSFET. To select the best candidate for the dosimeter among commercial devices, we have investigated the radiation performance of the devices in two Co-60 irradiation facilities in Korea. As a result of the investigation, two semiconductor sensors with excellent proportionality to incident radiation were identified. A small hybrid radiation-detection/dosimetry module with the two sensors has been developed. The real-time detector module is also radiation hardened for an ionizing radiation environment with well over 100 krad (SiO2) dose. The developed small and simple semiconductor electronic dosimeter is unique in terms of its extended dose range (/spl sim/100 krad), dose-rate (50 rad/hr /spl sim/ 8 krad/hr) capability, and its level of redundancy/diversity along with its size/weight.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115622124","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461347
Zhigang Wang, Lichuan Liu, Mengchu Zhou
In wireless ad hoc network, the traditional carrier sensing multiple access/collision avoidance (CSMA/CA) protocol cannot solve the masked node problem, which affect the network performance greatly. Our proposed collision separation technique overcomes the shortcoming of the IEEE 802.11 request-to-send-clear-to-send (RTS-CTS) handshake by combining the space diversity provided by the antenna array and network diversity provided by the media access control (MAC) layer. In this work, the colliding packets caused by masked nodes are not discarded but stored and combined with the selected retransmission packets to separate the data from different nodes. The steady states of the nodes in the network are analyzed via a Markov chain model. The network goodput and delay performance are also investigated. Compared to network assisted diversity multiple access (NDMA), our proposed method, i.e., space and network diversity combination, SNDC for short, can provide higher throughput and lower delay performance.
{"title":"Using space and network diversity combining to solve masked node collision in wireless adhoc network","authors":"Zhigang Wang, Lichuan Liu, Mengchu Zhou","doi":"10.1109/ICNSC.2005.1461347","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461347","url":null,"abstract":"In wireless ad hoc network, the traditional carrier sensing multiple access/collision avoidance (CSMA/CA) protocol cannot solve the masked node problem, which affect the network performance greatly. Our proposed collision separation technique overcomes the shortcoming of the IEEE 802.11 request-to-send-clear-to-send (RTS-CTS) handshake by combining the space diversity provided by the antenna array and network diversity provided by the media access control (MAC) layer. In this work, the colliding packets caused by masked nodes are not discarded but stored and combined with the selected retransmission packets to separate the data from different nodes. The steady states of the nodes in the network are analyzed via a Markov chain model. The network goodput and delay performance are also investigated. Compared to network assisted diversity multiple access (NDMA), our proposed method, i.e., space and network diversity combination, SNDC for short, can provide higher throughput and lower delay performance.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124436730","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461230
Zhiwei Shi, Min Han, Jianhui Xi
Because the chaotic system is initial condition sensitive, it is difficult to decide a proper initial state for a recurrent neural network to model observed one-dimension chaotic time series. In this paper, a recurrent neural network with feedback composed of internal state is introduced to model one-dimension chaotic time series. The neural network output is a nonlinear combination of the internal state variable. To successfully model a chaotic time series, this paper proves that the recurrent neural network with internal state can start from arbitrary initial state. In the simulation, the neural systems perform multi-step ahead prediction, also, the reconstructed neural state space is compared with the original state space, and largest LEs (Lyapunov exponents) of the two systems are calculated and compared to see if the two systems have similar chaotic invariant.
{"title":"Exploring the neural state space learning from one-dimension chaotic time series","authors":"Zhiwei Shi, Min Han, Jianhui Xi","doi":"10.1109/ICNSC.2005.1461230","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461230","url":null,"abstract":"Because the chaotic system is initial condition sensitive, it is difficult to decide a proper initial state for a recurrent neural network to model observed one-dimension chaotic time series. In this paper, a recurrent neural network with feedback composed of internal state is introduced to model one-dimension chaotic time series. The neural network output is a nonlinear combination of the internal state variable. To successfully model a chaotic time series, this paper proves that the recurrent neural network with internal state can start from arbitrary initial state. In the simulation, the neural systems perform multi-step ahead prediction, also, the reconstructed neural state space is compared with the original state space, and largest LEs (Lyapunov exponents) of the two systems are calculated and compared to see if the two systems have similar chaotic invariant.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"96 2-3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116697146","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461156
J. Vrancken
This paper proposes a coordination algorithm for road traffic control measures, which would greatly extend the set of possible control measures that can be applied simultaneously. It is based on experiences with motorway traffic management in the Netherlands. It is also a case study in combining hierarchical control with coordination and cooperation mechanisms. The algorithm deals only with soundness of sets of simultaneously applied control measures, which is a necessary condition for the synergy of the applied measures. The essence of the algorithm is a translation of traffic control measures into so-called atomic effects on lane segments. The paper also describes the implementation strategy for the algorithm.
{"title":"A coordination algorithm for road traffic control measures","authors":"J. Vrancken","doi":"10.1109/ICNSC.2005.1461156","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461156","url":null,"abstract":"This paper proposes a coordination algorithm for road traffic control measures, which would greatly extend the set of possible control measures that can be applied simultaneously. It is based on experiences with motorway traffic management in the Netherlands. It is also a case study in combining hierarchical control with coordination and cooperation mechanisms. The algorithm deals only with soundness of sets of simultaneously applied control measures, which is a necessary condition for the synergy of the applied measures. The essence of the algorithm is a translation of traffic control measures into so-called atomic effects on lane segments. The paper also describes the implementation strategy for the algorithm.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125111822","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461323
Pang Jie, Zhang Wei, Z. Fusheng, Tu Xuyan, Zeng Guangping
In order to improve the present technology of MBC (multi-bases coordination), in this paper, the idea of developing MBC system based on intelligent autonomous decentralized system (IADS) and "Softman" is proposed, and software models applied in decision support system are given.
{"title":"Study on multi-bases coordination technology based on IADS and \"Softman\" in DSS","authors":"Pang Jie, Zhang Wei, Z. Fusheng, Tu Xuyan, Zeng Guangping","doi":"10.1109/ICNSC.2005.1461323","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461323","url":null,"abstract":"In order to improve the present technology of MBC (multi-bases coordination), in this paper, the idea of developing MBC system based on intelligent autonomous decentralized system (IADS) and \"Softman\" is proposed, and software models applied in decision support system are given.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123544875","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461339
Fei Hu, A. Teredesai, Hongyi Wu
Data query in a large-scale wireless sensor network should be based on a low-energy and scalable routing scheme. In this paper, we propose a ripple-tree-zone-based intra-zone/inter-zone routing scheme to significantly lower the communication overhead associated with data queries in wireless sensor networks. We do not separate the design of routing layer and MAC layer as suggested by most of existing WSN stacks. This enables us to greatly extend the sleep/dormant periods of sensor nodes through a parameter exchange between the routing and MAC layers. Thus, we achieve a much longer network lifetime. Another contribution outlined in this paper includes a novel timing control scheme between neighboring levels of sensors in the query tree to achieve a good trade-off between data aggregation accuracy and query delay. We perform extended simulations to verify the low-energy of our query scheme.
{"title":"Timing-controlled, low-energy data query in wireless sensor networks: towards a cross-layer optimization approach","authors":"Fei Hu, A. Teredesai, Hongyi Wu","doi":"10.1109/ICNSC.2005.1461339","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461339","url":null,"abstract":"Data query in a large-scale wireless sensor network should be based on a low-energy and scalable routing scheme. In this paper, we propose a ripple-tree-zone-based intra-zone/inter-zone routing scheme to significantly lower the communication overhead associated with data queries in wireless sensor networks. We do not separate the design of routing layer and MAC layer as suggested by most of existing WSN stacks. This enables us to greatly extend the sleep/dormant periods of sensor nodes through a parameter exchange between the routing and MAC layers. Thus, we achieve a much longer network lifetime. Another contribution outlined in this paper includes a novel timing control scheme between neighboring levels of sensors in the query tree to achieve a good trade-off between data aggregation accuracy and query delay. We perform extended simulations to verify the low-energy of our query scheme.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123775135","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461154
Xiaohua Sun, Fansheng Kong, Song Ye
Collaborative filtering is becoming a popular technique for reducing information overload. Many algorithms have been proposed for collaborative filtering. The performance of a recommended system during the startup stage is crucial to the system. If recommendation is close to what an user really want, the user would be glad to use the system later, else he may never make use of it again. In this paper, we compare the performance results of four collaborative filtering algorithms applied in the startup stage of recommendation. We evaluate these algorithms using three publicly available datasets. Our experiments results show that Pearson and STIN1 methods perform better than latent class model (LCM) and singular value decomposition (SVD) methods during the startup stage. The experimental results confirm that the characteristics of datasets keep being an important factor in the performance of methods.
{"title":"A comparison of several algorithms for collaborative filtering in startup stage","authors":"Xiaohua Sun, Fansheng Kong, Song Ye","doi":"10.1109/ICNSC.2005.1461154","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461154","url":null,"abstract":"Collaborative filtering is becoming a popular technique for reducing information overload. Many algorithms have been proposed for collaborative filtering. The performance of a recommended system during the startup stage is crucial to the system. If recommendation is close to what an user really want, the user would be glad to use the system later, else he may never make use of it again. In this paper, we compare the performance results of four collaborative filtering algorithms applied in the startup stage of recommendation. We evaluate these algorithms using three publicly available datasets. Our experiments results show that Pearson and STIN1 methods perform better than latent class model (LCM) and singular value decomposition (SVD) methods during the startup stage. The experimental results confirm that the characteristics of datasets keep being an important factor in the performance of methods.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125356204","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
扫码关注我们
求助内容：
应助结果提醒方式：