Pub Date : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.35
P. Jayaraman, A. Zaslavsky, J. Delsing
Wireless sensor networks have emerged as a key area of research in recent years. With the dominance of ubiquitous and pervasive era of computing, these networks present a rich infrastructure for valuable information. In this paper we focus on efficient data collection in sensor networks by proposing an algorithm to compute a coverage (collection) area using smart mobile objects. The algorithm proposed computes a collection area dynamically covering nodes around the mobile objects current location. It uses a weighed graph technique to identify nodes from which data can be collected efficiently by the mobile object discarding the rest. The proposed algorithm computes the collection area using Voronoi Diagrams and Delaunay triangle. We validate the proposed algorithm by simulating the algorithm over a Bluetooth based sensor network. We also evaluate the algorithms efficiency to compute the coverage area by changing the mobile objects context parameters.
{"title":"Coverage Area Computation on the Run for Efficient Sensor Data Collection","authors":"P. Jayaraman, A. Zaslavsky, J. Delsing","doi":"10.1109/NTMS.2008.ECP.35","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.35","url":null,"abstract":"Wireless sensor networks have emerged as a key area of research in recent years. With the dominance of ubiquitous and pervasive era of computing, these networks present a rich infrastructure for valuable information. In this paper we focus on efficient data collection in sensor networks by proposing an algorithm to compute a coverage (collection) area using smart mobile objects. The algorithm proposed computes a collection area dynamically covering nodes around the mobile objects current location. It uses a weighed graph technique to identify nodes from which data can be collected efficiently by the mobile object discarding the rest. The proposed algorithm computes the collection area using Voronoi Diagrams and Delaunay triangle. We validate the proposed algorithm by simulating the algorithm over a Bluetooth based sensor network. We also evaluate the algorithms efficiency to compute the coverage area by changing the mobile objects context parameters.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"21 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":"125562006","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.41
G. Kbar, W. Mansoor
Wireless mesh networks become popular and are used everywhere as an alternative to broadband connections. The ease of configuration of wireless mesh LAN, the mobility of clients, and the large coverage make it attractive choice for supporting wireless technology in LAN and MAN. However, there are some concerns in assigning the multiple channels for different node and having efficient routing algorithm to route packet seamlessly without affecting the network performance. Multiple channel usage has been addressed in previous research paper, but efficient routing algorithm still to be researched. In this paper an efficient seamless non-broadcast routing algorithm has been developed to support the wireless mesh network. This algorithm is based on mapping the mesh wireless routing nodes geographically according to 2 coordinates. Each node will apply this algorithm to find the closet neighboring mode that lead to destination based on the mapped network without the need for broadcast such as the one used in traditional routing protocol in RIP, and OSPF.
{"title":"Efficient Seamless Non-Broadcast Routing Algorithm for Wireless Mesh Network","authors":"G. Kbar, W. Mansoor","doi":"10.1109/NTMS.2008.ECP.41","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.41","url":null,"abstract":"Wireless mesh networks become popular and are used everywhere as an alternative to broadband connections. The ease of configuration of wireless mesh LAN, the mobility of clients, and the large coverage make it attractive choice for supporting wireless technology in LAN and MAN. However, there are some concerns in assigning the multiple channels for different node and having efficient routing algorithm to route packet seamlessly without affecting the network performance. Multiple channel usage has been addressed in previous research paper, but efficient routing algorithm still to be researched. In this paper an efficient seamless non-broadcast routing algorithm has been developed to support the wireless mesh network. This algorithm is based on mapping the mesh wireless routing nodes geographically according to 2 coordinates. Each node will apply this algorithm to find the closet neighboring mode that lead to destination based on the mapped network without the need for broadcast such as the one used in traditional routing protocol in RIP, and OSPF.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"23 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":"121574599","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.19
Lingwen Zhang, Z. Tan
This paper proposes a hybrid time of arrival and angle of arrival localization method called hybrid localization method with RSS (HLMR) by using a novel single home base station localization technique and a novel RSS data fusion model. The result shows that compared with TOA/AOA and a classic NLOS error mitigation method, this method is more stable and accurate.
{"title":"An Improved Single Home Base Station Localization Method","authors":"Lingwen Zhang, Z. Tan","doi":"10.1109/NTMS.2008.ECP.19","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.19","url":null,"abstract":"This paper proposes a hybrid time of arrival and angle of arrival localization method called hybrid localization method with RSS (HLMR) by using a novel single home base station localization technique and a novel RSS data fusion model. The result shows that compared with TOA/AOA and a classic NLOS error mitigation method, this method is more stable and accurate.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"45 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":"132942854","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.101
S. Hammouda, L. Maalej, Z. Trabelsi
Covert channels exist in most communications systems and allow individuals to communicate truly undetectable and exchange hidden information. That's why their detection seems to be a big deal for security systems. However, till now, security systems do not include dedicated processes for covert channel detection. In this paper, we first propose mechanisms to detect common covert channels. Then, within a whole security system, we propose an optimized order regarding the execution of the three major security processes: Firewall, Intrusion Detection System (IDS) and Covert Channel Detection System (CCDS). It will be demonstrated that the proposed order would allow security systems to offer better processing performances.
{"title":"Towards Optimized TCP/IP Covert Channels Detection, IDS and Firewall Integration","authors":"S. Hammouda, L. Maalej, Z. Trabelsi","doi":"10.1109/NTMS.2008.ECP.101","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.101","url":null,"abstract":"Covert channels exist in most communications systems and allow individuals to communicate truly undetectable and exchange hidden information. That's why their detection seems to be a big deal for security systems. However, till now, security systems do not include dedicated processes for covert channel detection. In this paper, we first propose mechanisms to detect common covert channels. Then, within a whole security system, we propose an optimized order regarding the execution of the three major security processes: Firewall, Intrusion Detection System (IDS) and Covert Channel Detection System (CCDS). It will be demonstrated that the proposed order would allow security systems to offer better processing performances.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"35 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":"116214194","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.37
H. Vu, Sammy Chan
In this paper, we propose an analytical model to evaluate the average packet delay and its standard deviation in a saturated IEEE 802.16 network. In addition, the bandwidth utilization of an uplink data frame and packet loss probability are also derived from the model. We show that our analytical model is accurate for a range of parameters by comparing it with simulation results. Using the analytical model we then suggest an appropriate parameter setting for the uplink data frame to better utilize the bandwidth and to minimize the packet loss probability for both saturated and unsaturated networks.
{"title":"Delay Model for Saturated IEEE 802.16 Networks","authors":"H. Vu, Sammy Chan","doi":"10.1109/NTMS.2008.ECP.37","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.37","url":null,"abstract":"In this paper, we propose an analytical model to evaluate the average packet delay and its standard deviation in a saturated IEEE 802.16 network. In addition, the bandwidth utilization of an uplink data frame and packet loss probability are also derived from the model. We show that our analytical model is accurate for a range of parameters by comparing it with simulation results. Using the analytical model we then suggest an appropriate parameter setting for the uplink data frame to better utilize the bandwidth and to minimize the packet loss probability for both saturated and unsaturated networks.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"116 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":"128050717","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.12
S. Anand
The emergence of IMS (IP multimedia subsystem) and DLNA (digital living network alliance) using SIP (session initiation protocol) has major ramifications for the whole of mobile industry including network providers, end users and application developers. This paper focuses on the evolution of mobile applications to provide new services with respect to DLNA connecting IMS platform on the operator end. Our proposed system architecture for various uses cases discussed in this paper uses SIP as a core protocol in order to transmit messages for information exchange between network appliances within and outside of the home network. Our architecture leverages the existing DLNA & 3GPP standards, adding value by enabling the combination of software components and by implementing additional functions to work together. Our designed software modules can be deployed in different ways, partly depending on the use cases and partly depending on how the solutions are implemented. Moreover, we have given more emphasis on SIP's numerous applications and the evaluation of these enhanced services by means of prototyping is a topic of ongoing and future work.
{"title":"A New SIP Based Services Connecting IMS and DLNA for Future Converged Networks","authors":"S. Anand","doi":"10.1109/NTMS.2008.ECP.12","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.12","url":null,"abstract":"The emergence of IMS (IP multimedia subsystem) and DLNA (digital living network alliance) using SIP (session initiation protocol) has major ramifications for the whole of mobile industry including network providers, end users and application developers. This paper focuses on the evolution of mobile applications to provide new services with respect to DLNA connecting IMS platform on the operator end. Our proposed system architecture for various uses cases discussed in this paper uses SIP as a core protocol in order to transmit messages for information exchange between network appliances within and outside of the home network. Our architecture leverages the existing DLNA & 3GPP standards, adding value by enabling the combination of software components and by implementing additional functions to work together. Our designed software modules can be deployed in different ways, partly depending on the use cases and partly depending on how the solutions are implemented. Moreover, we have given more emphasis on SIP's numerous applications and the evaluation of these enhanced services by means of prototyping is a topic of ongoing and future work.","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":"126672109","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.49
Benjamin Schleinzer, Lawrence Cabac, D. Moldt, M. Duvigneau
Flexibility in software systems is needed to allow adaption to increasing demands of users. To ease the development of flexible architectures several approaches are used, which often differ already on the conceptual grounds. Two of these paradigms are characterized by the strong underlying metaphors plugins and agents. Plugins emphasize on an extension relation between pairs of components where each component participates in a clearly specified role. Agents have a wide variety of attributes, such as mobility, autonomy, adaptability and pro-activeness. The general relationship of agents is that of peers mutually offering and using their services - higher organizational abstractions have to be implemented based on this service-oriented view. This paper proposes to conjoin both paradigms of multi-agent systems and plugin systems, leading to the concept of a plugin-agent. First, we discuss characteristics of both concepts. The discussion clearly shows that agents and extensible components have structural similarities. This follows the combination of both concepts into the new concept of the plugin-agent. The approach presented in this paper is unique as it handles both concepts on the same architectural level - to our knowledge, all other existing combinations of agents and plugins use one of the concepts to model or implement the other.
{"title":"From Agents and Plugins to Plugin-Agents, Concepts for Flexible Architectures","authors":"Benjamin Schleinzer, Lawrence Cabac, D. Moldt, M. Duvigneau","doi":"10.1109/NTMS.2008.ECP.49","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.49","url":null,"abstract":"Flexibility in software systems is needed to allow adaption to increasing demands of users. To ease the development of flexible architectures several approaches are used, which often differ already on the conceptual grounds. Two of these paradigms are characterized by the strong underlying metaphors plugins and agents. Plugins emphasize on an extension relation between pairs of components where each component participates in a clearly specified role. Agents have a wide variety of attributes, such as mobility, autonomy, adaptability and pro-activeness. The general relationship of agents is that of peers mutually offering and using their services - higher organizational abstractions have to be implemented based on this service-oriented view. This paper proposes to conjoin both paradigms of multi-agent systems and plugin systems, leading to the concept of a plugin-agent. First, we discuss characteristics of both concepts. The discussion clearly shows that agents and extensible components have structural similarities. This follows the combination of both concepts into the new concept of the plugin-agent. The approach presented in this paper is unique as it handles both concepts on the same architectural level - to our knowledge, all other existing combinations of agents and plugins use one of the concepts to model or implement the other.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"39 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":"127085361","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.21
Slimane Bah, R. Glitho, R. Dssouli
Mobile ad hoc networks (MANETs) are an example of new networks that are gaining more and more momentum because of their flexibility and easy deployment. Service execution is an important phase in the service life cycle. SIP servlets are a promising service provisioning framework for MANETs. However, MANETs are very challenging because of their characteristics (e.g. node heterogeneity, no permanent centralized entity, transient links). Using SIP servlets in MANETs requires distributing the servlet engine first, due to resource constraints. As the distributed components need to interact, a cooperation scheme including self-organization and self-recovery is needed. Overlay networks are an attractive approach to cooperation because of their scalability and flexibility. In this paper we propose an overlay network for a SIP servlets-based service execution environment in MANETs. We assume a servlet engine distribution scheme that we have proposed in previous work. The architecture of the overlay network and the related procedures are presented. Results of a formal validation using Promela/SPIN are discussed.
{"title":"An Overlay Network for a SIP Servlet-Based Service Execution Environment in Stand Alone MANETs","authors":"Slimane Bah, R. Glitho, R. Dssouli","doi":"10.1109/NTMS.2008.ECP.21","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.21","url":null,"abstract":"Mobile ad hoc networks (MANETs) are an example of new networks that are gaining more and more momentum because of their flexibility and easy deployment. Service execution is an important phase in the service life cycle. SIP servlets are a promising service provisioning framework for MANETs. However, MANETs are very challenging because of their characteristics (e.g. node heterogeneity, no permanent centralized entity, transient links). Using SIP servlets in MANETs requires distributing the servlet engine first, due to resource constraints. As the distributed components need to interact, a cooperation scheme including self-organization and self-recovery is needed. Overlay networks are an attractive approach to cooperation because of their scalability and flexibility. In this paper we propose an overlay network for a SIP servlets-based service execution environment in MANETs. We assume a servlet engine distribution scheme that we have proposed in previous work. The architecture of the overlay network and the related procedures are presented. Results of a formal validation using Promela/SPIN are discussed.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"54 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":"127548544","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.62
F. Didi, Benamar Bouyedou, M. Feham, H. Labiod
In mobile Ad hoc network which consists of nodes that are usually battery operated, power-aware routing protocols aim to reduce the energy consumption of these nodes for extending their lifetime and that of the whole network. Thus, owing to the dynamic nature and mobility of nodes in such network, the performances of power-aware routing protocols can be significantly degraded. In this paper we investigate the impact of this mobility on the performances of an on-demand power-aware routing protocol that we have proposed and which called EMM-DSR (Extended Max-Min Dynamic Source Routing). From the simulation carried out, the obtained results illustrate the degradation of EMM-DSR performances when the degree of mobility increases. Thus, the best performances are obtained when nodes move according to the RPGM model.
{"title":"Mobility Impact on DSR-Based Power-Aware Ad hoc Routing Protocol","authors":"F. Didi, Benamar Bouyedou, M. Feham, H. Labiod","doi":"10.1109/NTMS.2008.ECP.62","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.62","url":null,"abstract":"In mobile Ad hoc network which consists of nodes that are usually battery operated, power-aware routing protocols aim to reduce the energy consumption of these nodes for extending their lifetime and that of the whole network. Thus, owing to the dynamic nature and mobility of nodes in such network, the performances of power-aware routing protocols can be significantly degraded. In this paper we investigate the impact of this mobility on the performances of an on-demand power-aware routing protocol that we have proposed and which called EMM-DSR (Extended Max-Min Dynamic Source Routing). From the simulation carried out, the obtained results illustrate the degradation of EMM-DSR performances when the degree of mobility increases. Thus, the best performances are obtained when nodes move according to the RPGM model.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"50 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132026909","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.92
P. Ayuso, R. M. Gasca, L. Maccari, L. Lefèvre
Firewalls have been traditionally used to apply filtering policies in wired networks, to divide zones with different level of trust. In wireless distributed networks, such as mesh networks for service delivery, firewalling is a valuable instrument to control the behavior of the clients and avoid certain attacks, such as DoS attacks coming from the inside of the network. In previous works we have outlined the possibility of applying stateless firewalling to distributed mesh networks using Bloom filters. In this paper we will expand this model to perform stateful firewalling in mesh networks, that will allow a more fine-grained control over the traffic passing over the network. Preliminary experimental results are also provided.
{"title":"Stateful Firewalling for Wireless Mesh Networks","authors":"P. Ayuso, R. M. Gasca, L. Maccari, L. Lefèvre","doi":"10.1109/NTMS.2008.ECP.92","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.92","url":null,"abstract":"Firewalls have been traditionally used to apply filtering policies in wired networks, to divide zones with different level of trust. In wireless distributed networks, such as mesh networks for service delivery, firewalling is a valuable instrument to control the behavior of the clients and avoid certain attacks, such as DoS attacks coming from the inside of the network. In previous works we have outlined the possibility of applying stateless firewalling to distributed mesh networks using Bloom filters. In this paper we will expand this model to perform stateful firewalling in mesh networks, that will allow a more fine-grained control over the traffic passing over the network. Preliminary experimental results are also provided.","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":"132981976","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
扫码关注我们
求助内容：
应助结果提醒方式：