Pub Date : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.32
Sofiene Jelassi, H. Youssef
This paper describes an on-line, end-to-end and non- intrusive approach to estimate the vocal transmission quality over wireless ad-hoc networks. The proposed assessment algorithm, denoted PEVOM (perceptual evaluation of voice over MANETs), is based on the fact that the observed quality of packet based voice conversations is time varying and that mobile users may tolerate degradation of perceptual quality and even the interruption of service. The evaluation of transmission quality adopted by PEVOM is relying on e-model paradigm. PEVOM includes an original extension to e-model to adequately rate the distortion effect due to the intermittent nature of established connection incurred by mobile users over a MANET. Specifically, PEVOM checks passively the connectivity between communicating parties by monitoring periodically the ratio of active to total time. When mobile users are connected, PEVOM calculates the perceptual quality using the conventional e-model. However, when mobile nodes are disconnected, PEVOM calculates the perceptual quality according to an expected recency effect. At the end of each connected/disconnected period, PEVOM estimates the perceptual quality of each interval using a weighted average over time. At the end of a vocal session, PEVOM rates the overall conversational quality using a weighted average over time of the produced rating factor of each connected/disconnected interval. The rating behavior of PEVOM is verified through a study of the vocal transmission quality over an intermittent multi-hop wireless connection.
{"title":"Connectivity Aware Instrumental Approach for Measuring Vocal Transmission Quality Over a Wireless Ad-Hoc Network","authors":"Sofiene Jelassi, H. Youssef","doi":"10.1109/NTMS.2008.ECP.32","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.32","url":null,"abstract":"This paper describes an on-line, end-to-end and non- intrusive approach to estimate the vocal transmission quality over wireless ad-hoc networks. The proposed assessment algorithm, denoted PEVOM (perceptual evaluation of voice over MANETs), is based on the fact that the observed quality of packet based voice conversations is time varying and that mobile users may tolerate degradation of perceptual quality and even the interruption of service. The evaluation of transmission quality adopted by PEVOM is relying on e-model paradigm. PEVOM includes an original extension to e-model to adequately rate the distortion effect due to the intermittent nature of established connection incurred by mobile users over a MANET. Specifically, PEVOM checks passively the connectivity between communicating parties by monitoring periodically the ratio of active to total time. When mobile users are connected, PEVOM calculates the perceptual quality using the conventional e-model. However, when mobile nodes are disconnected, PEVOM calculates the perceptual quality according to an expected recency effect. At the end of each connected/disconnected period, PEVOM estimates the perceptual quality of each interval using a weighted average over time. At the end of a vocal session, PEVOM rates the overall conversational quality using a weighted average over time of the produced rating factor of each connected/disconnected interval. The rating behavior of PEVOM is verified through a study of the vocal transmission quality over an intermittent multi-hop wireless connection.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122050245","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.69
Thomas Guillet, A. Serhrouchni, M. Badra
The session initiation protocol (SIP) is rapidly becoming the dominant signalling protocol for calls over the Internet. It has quickly made large inroads into the voice over IP (VoIP) market. SIP is an application-layer control operating on top of a transport protocol and allows to create, modify, and terminate sessions with one or more participants. With security considerations, these operations require authentication from participating end-points, confidentiality, data integrity, and protection against internal and external attacks. For authentication, SIP relies on HTTP Digest by default; the client is authenticated to the SIP proxy server. In order to have mutual authentication between client and server, SIP could be implemented over TLS (transport layer security) when TCP is supported by SIP architecture network. In this paper, we propose a mutual authentication mechanism within HTTP Digest since this later is implemented by default in all SIP environments. It consists in providing meaning and semantic to some of the parameters' values generated by the participating end-points during SIP session establishment, especially to the "nonce" values. Our solution is backward-compatible with today implementations. Without being in opposition to security protocols like TLS, this approach helps in reducing DoS (denial of service) attacks, detects server identity spoofing and ensures basic mutual authentication with comparison to HTTP digest.
{"title":"Mutual Authentication for SIP: A Semantic Meaning for the SIP Opaque Values","authors":"Thomas Guillet, A. Serhrouchni, M. Badra","doi":"10.1109/NTMS.2008.ECP.69","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.69","url":null,"abstract":"The session initiation protocol (SIP) is rapidly becoming the dominant signalling protocol for calls over the Internet. It has quickly made large inroads into the voice over IP (VoIP) market. SIP is an application-layer control operating on top of a transport protocol and allows to create, modify, and terminate sessions with one or more participants. With security considerations, these operations require authentication from participating end-points, confidentiality, data integrity, and protection against internal and external attacks. For authentication, SIP relies on HTTP Digest by default; the client is authenticated to the SIP proxy server. In order to have mutual authentication between client and server, SIP could be implemented over TLS (transport layer security) when TCP is supported by SIP architecture network. In this paper, we propose a mutual authentication mechanism within HTTP Digest since this later is implemented by default in all SIP environments. It consists in providing meaning and semantic to some of the parameters' values generated by the participating end-points during SIP session establishment, especially to the \"nonce\" values. Our solution is backward-compatible with today implementations. Without being in opposition to security protocols like TLS, this approach helps in reducing DoS (denial of service) attacks, detects server identity spoofing and ensures basic mutual authentication with comparison to HTTP digest.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123193066","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.42
L. F. Ibrahim, M. A. Harbi
Network planning is of key importance during the construction of new communities and cities, in which telephone and data services have to be introduced as a component of the overall master plan of the city. With the rapid development in mobile network we need effective network planning tool to satisfy the need of customers. However, deciding upon the optimum placement for the base stations (BS's) to achieve best services while reducing the cost is a complex task requiring vast computational resource. This paper addresses antenna placement problem or the cell planning problem, involves locating and configuring infrastructure for mobile networks by modified the original partitioning around medoids PAM algorithm. The PAM original algorithm has been modified and a new algorithm M- PAM (modified-partitioning around medoids) has been proposed by the authors in a recent work (L.F Ibrahin and M.H. Al Harbi, 2008). This paper presents CWN-PAM (clustering with weighted node-partitioning around medoids) algorithm and compare it with M-PAM algorithm. Implementation of this algorithm to a real case study is presented. Results demonstrate the effectiveness and flexibility of the modifying algorithm in tackling the important problem of mobile network planning.
网络规划在建设新社区和新城市期间具有关键的重要性，其中电话和数据服务必须作为城市总体总体规划的一个组成部分加以引进。随着移动网络的快速发展，需要有效的网络规划工具来满足用户的需求。然而，决定基站的最佳位置以实现最佳服务，同时降低成本是一项复杂的任务，需要大量的计算资源。本文通过改进原有的围绕媒质的PAM算法进行划分，解决了天线放置问题或小区规划问题，涉及到移动网络基础设施的定位和配置。作者在最近的工作(L.F ibrahim and M.H. Al Harbi, 2008)中对PAM原始算法进行了改进，提出了一种新的算法M- PAM (modified-partitioning around mediids)。提出了CWN-PAM算法，并与M-PAM算法进行了比较。最后给出了该算法在实际应用中的具体实现。结果表明，该修正算法在解决移动网络规划这一重要问题上具有有效性和灵活性。
{"title":"Employing Clustering Techniques in Mobile Network Planning","authors":"L. F. Ibrahim, M. A. Harbi","doi":"10.1109/NTMS.2008.ECP.42","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.42","url":null,"abstract":"Network planning is of key importance during the construction of new communities and cities, in which telephone and data services have to be introduced as a component of the overall master plan of the city. With the rapid development in mobile network we need effective network planning tool to satisfy the need of customers. However, deciding upon the optimum placement for the base stations (BS's) to achieve best services while reducing the cost is a complex task requiring vast computational resource. This paper addresses antenna placement problem or the cell planning problem, involves locating and configuring infrastructure for mobile networks by modified the original partitioning around medoids PAM algorithm. The PAM original algorithm has been modified and a new algorithm M- PAM (modified-partitioning around medoids) has been proposed by the authors in a recent work (L.F Ibrahin and M.H. Al Harbi, 2008). This paper presents CWN-PAM (clustering with weighted node-partitioning around medoids) algorithm and compare it with M-PAM algorithm. Implementation of this algorithm to a real case study is presented. Results demonstrate the effectiveness and flexibility of the modifying algorithm in tackling the important problem of mobile network planning.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134500708","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.97
N. Malik, M. Javed, U. Mahmud
This paper presents the threat modeling approach for pervasive environment's security. In pervasive computing, a user might be part of various security domains at any particular instant of time having various authentication mechanisms and different privileges in different security domains. A number of threat modeling approaches and methods have been defined in literature and are in use. However, because of the nature of the pervasive computing and ubiquitous networks, these approaches do not handle the inherent security problems and perspective of pervasive computing. The paper examines in detail the threat modeling and analysis approaches being developed at Microsoft and other methods used for threat modeling. The paper present a novel approach for addressing the threat modeling in pervasive computing and presents the model for threat modeling and risk analysis in pervasive environment.
{"title":"Threat Modeling in Pervasive Computing Paradigm","authors":"N. Malik, M. Javed, U. Mahmud","doi":"10.1109/NTMS.2008.ECP.97","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.97","url":null,"abstract":"This paper presents the threat modeling approach for pervasive environment's security. In pervasive computing, a user might be part of various security domains at any particular instant of time having various authentication mechanisms and different privileges in different security domains. A number of threat modeling approaches and methods have been defined in literature and are in use. However, because of the nature of the pervasive computing and ubiquitous networks, these approaches do not handle the inherent security problems and perspective of pervasive computing. The paper examines in detail the threat modeling and analysis approaches being developed at Microsoft and other methods used for threat modeling. The paper present a novel approach for addressing the threat modeling in pervasive computing and presents the model for threat modeling and risk analysis in pervasive environment.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129596257","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.67
Thirumal Kandasamy, Jaya Kumar Krishnan
Constant growth in the wireless sensor network (WSN) needs routing protocol which can cater for renewable energy sources as compared to conventionally used nonrenewable energy sources in sensor nodes. In this paper, adaptive topological knowledge (ATK) algorithm is used to periodically and locally determine the topological knowledge range (KR) of each solar-powered node, based on an estimated energy budget for the following period. Energy budget includes current energy, the predicted energy consumption and the energy expected from the solar cell. Multipath routing scheme (MRS) is used for route selection based on round-robin model. Thus energy optimization is attained during real-time route discovery and packet forwarding by reducing congestion in the network.
{"title":"Multipath Routing Scheme in Solar Powered Wireless Sensor Networks","authors":"Thirumal Kandasamy, Jaya Kumar Krishnan","doi":"10.1109/NTMS.2008.ECP.67","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.67","url":null,"abstract":"Constant growth in the wireless sensor network (WSN) needs routing protocol which can cater for renewable energy sources as compared to conventionally used nonrenewable energy sources in sensor nodes. In this paper, adaptive topological knowledge (ATK) algorithm is used to periodically and locally determine the topological knowledge range (KR) of each solar-powered node, based on an estimated energy budget for the following period. Energy budget includes current energy, the predicted energy consumption and the energy expected from the solar cell. Multipath routing scheme (MRS) is used for route selection based on round-robin model. Thus energy optimization is attained during real-time route discovery and packet forwarding by reducing congestion in the network.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130037485","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.33
Fahad Samad, Sadeq Ali Makram
Security and privacy threats in technological environment are great hindrances to use latest technologies for our benefits. Such threats also exist in RFID systems which are currently utilized to a great extent in ubiquitous communication. These systems can also work in combination with cellular networks to control user's physical objects in a secure way with sufficient privacy. This paper presents a secure system model which enables a user to control his possessions even sitting remotely from the objects' locations. The limitations of RFID tags are taken into account and it is shown that the system mitigates many threats keeping the privacy of the tags and the user intact.
{"title":"Controlling Physical Objects with Privacy using Secure RFID System","authors":"Fahad Samad, Sadeq Ali Makram","doi":"10.1109/NTMS.2008.ECP.33","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.33","url":null,"abstract":"Security and privacy threats in technological environment are great hindrances to use latest technologies for our benefits. Such threats also exist in RFID systems which are currently utilized to a great extent in ubiquitous communication. These systems can also work in combination with cellular networks to control user's physical objects in a secure way with sufficient privacy. This paper presents a secure system model which enables a user to control his possessions even sitting remotely from the objects' locations. The limitations of RFID tags are taken into account and it is shown that the system mitigates many threats keeping the privacy of the tags and the user intact.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116167682","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.75
A. Alzahrani, M. E. Woodward
Quality of service (QoS) routing has been proposed for supporting the requirements of network applications and satisfying connection constraints. A large amount of information needs to be exchanged periodically among routers. Therefore, in order to satisfy such requirements localized QoS routing algorithms have been proposed. This is where source nodes make routing decisions based on statistics collected locally. Using local information for routing avoids the overheads of exchanging global information with other nodes. In this paper we present a localized bandwidth-based QoS routing (BBR) algorithm, which relies on residual bandwidth that each path can support to make routing decisions. We compare our scheme with credit based routing (CBR) and the commonly used global WSP routing scheme under different traffic loads and network topologies. We demonstrated through simulation that our scheme performs better than CBR and outperforms the WSP scheme in some network topologies, even for a small update interval of link state.
{"title":"Path Selection Method for Localized QoS Routing","authors":"A. Alzahrani, M. E. Woodward","doi":"10.1109/NTMS.2008.ECP.75","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.75","url":null,"abstract":"Quality of service (QoS) routing has been proposed for supporting the requirements of network applications and satisfying connection constraints. A large amount of information needs to be exchanged periodically among routers. Therefore, in order to satisfy such requirements localized QoS routing algorithms have been proposed. This is where source nodes make routing decisions based on statistics collected locally. Using local information for routing avoids the overheads of exchanging global information with other nodes. In this paper we present a localized bandwidth-based QoS routing (BBR) algorithm, which relies on residual bandwidth that each path can support to make routing decisions. We compare our scheme with credit based routing (CBR) and the commonly used global WSP routing scheme under different traffic loads and network topologies. We demonstrated through simulation that our scheme performs better than CBR and outperforms the WSP scheme in some network topologies, even for a small update interval of link state.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134214698","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.71
K. Walkowiak
Peer-to-peer (P2P) systems gain much attention in recent years. According to many statistics, P2P systems contribute a significant portion of the Internet traffic. Individual Internet users that commonly employ P2P software to download electronic music, movies, software provide considerable income for Internet service providers (ISP). However, the use of P2P systems produces many problems related to traffic engineering, optimization, network congestion, etc. In this paper we propose a generic approach to offline modeling of flows in P2P systems. We focus exclusively on P2P file sharing systems. We show how various constraints following from real P2P systems can be formulated. The formulations can be applied for designing and optimization of P2P systems. To illustrate our approach we present results obtained from CPLEX solver.
{"title":"Offline Approach to Modeling and Optimization of Flows in Peer-to-Peer Systems","authors":"K. Walkowiak","doi":"10.1109/NTMS.2008.ECP.71","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.71","url":null,"abstract":"Peer-to-peer (P2P) systems gain much attention in recent years. According to many statistics, P2P systems contribute a significant portion of the Internet traffic. Individual Internet users that commonly employ P2P software to download electronic music, movies, software provide considerable income for Internet service providers (ISP). However, the use of P2P systems produces many problems related to traffic engineering, optimization, network congestion, etc. In this paper we propose a generic approach to offline modeling of flows in P2P systems. We focus exclusively on P2P file sharing systems. We show how various constraints following from real P2P systems can be formulated. The formulations can be applied for designing and optimization of P2P systems. To illustrate our approach we present results obtained from CPLEX solver.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121857396","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.22
Jin-Woo Jung, M. A. Ingram
In this paper, the issues and methods regarding setting up the testbed for measuring the performance of cooperative transmission is introduced. Also, some experiments on both the testbed and the performance of cooperative transmission is introduced and discussed. This testbed is novel in the sense that it uses actual sensor devices along with the channel emulator, which allows us to emulate the exact channels we want without looking for suitable channel environments. We consider the two- hop relay network for our target network model, and cooperative transmission scheme we have selected is decode-and-forward fixed relaying scheme introduced.
{"title":"An RF Channel Emulator-Based Testbed for Cooperative Transmission Using Wireless Sensor Devices","authors":"Jin-Woo Jung, M. A. Ingram","doi":"10.1109/NTMS.2008.ECP.22","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.22","url":null,"abstract":"In this paper, the issues and methods regarding setting up the testbed for measuring the performance of cooperative transmission is introduced. Also, some experiments on both the testbed and the performance of cooperative transmission is introduced and discussed. This testbed is novel in the sense that it uses actual sensor devices along with the channel emulator, which allows us to emulate the exact channels we want without looking for suitable channel environments. We consider the two- hop relay network for our target network model, and cooperative transmission scheme we have selected is decode-and-forward fixed relaying scheme introduced.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124971306","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.90
L. Paladina, A. Biundo, M. Scarpa, A. Puliafito
Providing a powerful synchronization system is one of the most important goals to be pursued if an efficient utilization of sensor networks has to be addressed. The basic concept behind a Wireless Sensor Network is to deploy a large number of sensor nodes able to acquire and process data. Most of WSNs applications require sensor nodes to maintain local clocks both to determine the events order and to provide temporal information to measured data; to achieve this goal applications generally require a low synchronization precision, close to Milli seconds. This paper proposes a novel synchronization system based on Kohonen's Self Organizing Maps (SOMs), able to provide some Artificial Intelligence features to sensor nodes. A SOM is a particular neural network that learns to classify data without any supervision. In each sensor node, a SOM is implemented to evaluate the sensor node time, using a very little amount of storage and computing resources. In a scenario where thousands of sensor nodes are placed, this system evaluates the time of each sensor in a distributed manner, assuming a very little percentage of nodes knowing the actual time, thus ensuring an effective clock synchronization among all the sensors.
{"title":"Self Organizing Maps for Synchronization in Wireless Sensor Networks","authors":"L. Paladina, A. Biundo, M. Scarpa, A. Puliafito","doi":"10.1109/NTMS.2008.ECP.90","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.90","url":null,"abstract":"Providing a powerful synchronization system is one of the most important goals to be pursued if an efficient utilization of sensor networks has to be addressed. The basic concept behind a Wireless Sensor Network is to deploy a large number of sensor nodes able to acquire and process data. Most of WSNs applications require sensor nodes to maintain local clocks both to determine the events order and to provide temporal information to measured data; to achieve this goal applications generally require a low synchronization precision, close to Milli seconds. This paper proposes a novel synchronization system based on Kohonen's Self Organizing Maps (SOMs), able to provide some Artificial Intelligence features to sensor nodes. A SOM is a particular neural network that learns to classify data without any supervision. In each sensor node, a SOM is implemented to evaluate the sensor node time, using a very little amount of storage and computing resources. In a scenario where thousands of sensor nodes are placed, this system evaluates the time of each sensor in a distributed manner, assuming a very little percentage of nodes knowing the actual time, thus ensuring an effective clock synchronization among all the sensors.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126107167","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
扫码关注我们
求助内容：
应助结果提醒方式：