Pub Date : 2006-08-07DOI: 10.1109/COMSWA.2006.1665150
A. Sairam, G. Barua
In order to bridge the speed disparity at the LAN-WAN interface, enterprises install a number of policy-based devices to enforce administrative policies over the WAN access. The conventional techniques of bandwidth management concentrate only on the outgoing traffic from the local network, since that is the only traffic that can be controlled. However it is usually the incoming traffic that causes bottlenecks. This paper proposes a simple load balancing approach to optimize the use of WAN links in a multihomed environment. Incoming traffic on a link is controlled by diverting outgoing traffic from some nodes to other links. Incoming bandwidth is measured, thresholds are defined, and traffic diversion takes place to maintain the thresholds. We present a scheme to implement this. A prototype implementation has been done on an educational campus network. Preliminary experiments have shown that there are significant improvements in performance. These results are presented. Proposed future work to extend the scheme to an ISP network is described
{"title":"Effective Bandwidth Utilisation in Multihoming Networks","authors":"A. Sairam, G. Barua","doi":"10.1109/COMSWA.2006.1665150","DOIUrl":"https://doi.org/10.1109/COMSWA.2006.1665150","url":null,"abstract":"In order to bridge the speed disparity at the LAN-WAN interface, enterprises install a number of policy-based devices to enforce administrative policies over the WAN access. The conventional techniques of bandwidth management concentrate only on the outgoing traffic from the local network, since that is the only traffic that can be controlled. However it is usually the incoming traffic that causes bottlenecks. This paper proposes a simple load balancing approach to optimize the use of WAN links in a multihomed environment. Incoming traffic on a link is controlled by diverting outgoing traffic from some nodes to other links. Incoming bandwidth is measured, thresholds are defined, and traffic diversion takes place to maintain the thresholds. We present a scheme to implement this. A prototype implementation has been done on an educational campus network. Preliminary experiments have shown that there are significant improvements in performance. These results are presented. Proposed future work to extend the scheme to an ISP network is described","PeriodicalId":351986,"journal":{"name":"2006 1st International Conference on Communication Systems Software & Middleware","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115412861","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/COMSWA.2006.1665206
S. Chande
This short paper describes a form based Message oriented business application framework developed on the Symbian platform, hereafter referred to as mobileForms. MobileForms framework enables usage of forms over different communication infrastructure, such as: multimedia media messages (MMS), Bluetooth (Bth) messaging, Email and also over the conventional channel i.e. HTTP in cellular networks via GPRS/3G connections. The different addressing mechanisms corresponding to the above communication channel are supported respectively. The mobileForms application framework has been developed to function in an offline mode (locally cached, rendered, used and processed). We will discuss in this paper the motivation why we developed the mobileForms prototype in addition to the architecture and implementation aspects taken into consideration
{"title":"Form based Structured Mobile Messaging Framework for Mobilizing Business Applications","authors":"S. Chande","doi":"10.1109/COMSWA.2006.1665206","DOIUrl":"https://doi.org/10.1109/COMSWA.2006.1665206","url":null,"abstract":"This short paper describes a form based Message oriented business application framework developed on the Symbian platform, hereafter referred to as mobileForms. MobileForms framework enables usage of forms over different communication infrastructure, such as: multimedia media messages (MMS), Bluetooth (Bth) messaging, Email and also over the conventional channel i.e. HTTP in cellular networks via GPRS/3G connections. The different addressing mechanisms corresponding to the above communication channel are supported respectively. The mobileForms application framework has been developed to function in an offline mode (locally cached, rendered, used and processed). We will discuss in this paper the motivation why we developed the mobileForms prototype in addition to the architecture and implementation aspects taken into consideration","PeriodicalId":351986,"journal":{"name":"2006 1st International Conference on Communication Systems Software & Middleware","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124397597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/COMSWA.2006.1665227
N. A. Vasanthi, S. Annadurai, Asst. Professor, Sri Krishna
Target tracking sensor networks monitor and track the movement of a target object. Energy management in these sensor networks is crucial to prolong the network lifetime. We propose a new protocol EST (energy saving schedule for target tracking sensor networks) that provides a dynamic sleep schedule for the radios such that maximum energy is saved without affecting the sensors' activities. When there is no target, the communication modules of sensor nodes are put into sleep using a static schedule, except the border nodes. Interior nodes do not perform the sensing activity in the surveillance state. If a target arrives, the sleep schedule for the radios is changed dynamically in order to send the arrival message to neighboring sensors. By receiving the arrival message, the sleeping neighbor nodes start sensing. The objectives of our protocol are to (1) balance the lifetime of all the sensor nodes in the network to increase the network lifetime (2) reduce the energy consumption by activating the sensors only when the target arrives in that region. Simulation results show that EST provides a significant amount of energy savings and potentially increases the network lifetime by 25% more than S-MAC at low load
{"title":"Energy Saving Schedule for Target Tracking Sensor Networks to Maximize the Network Lifetime","authors":"N. A. Vasanthi, S. Annadurai, Asst. Professor, Sri Krishna","doi":"10.1109/COMSWA.2006.1665227","DOIUrl":"https://doi.org/10.1109/COMSWA.2006.1665227","url":null,"abstract":"Target tracking sensor networks monitor and track the movement of a target object. Energy management in these sensor networks is crucial to prolong the network lifetime. We propose a new protocol EST (energy saving schedule for target tracking sensor networks) that provides a dynamic sleep schedule for the radios such that maximum energy is saved without affecting the sensors' activities. When there is no target, the communication modules of sensor nodes are put into sleep using a static schedule, except the border nodes. Interior nodes do not perform the sensing activity in the surveillance state. If a target arrives, the sleep schedule for the radios is changed dynamically in order to send the arrival message to neighboring sensors. By receiving the arrival message, the sleeping neighbor nodes start sensing. The objectives of our protocol are to (1) balance the lifetime of all the sensor nodes in the network to increase the network lifetime (2) reduce the energy consumption by activating the sensors only when the target arrives in that region. Simulation results show that EST provides a significant amount of energy savings and potentially increases the network lifetime by 25% more than S-MAC at low load","PeriodicalId":351986,"journal":{"name":"2006 1st International Conference on Communication Systems Software & Middleware","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117120714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/COMSWA.2006.1665208
N. Suri, Y. Narahari, D. Manjunath
In many applications of wireless ad hoc networks, wireless nodes are owned by rational and intelligent users. In this paper, we call nodes selfish if they are owned by independent users and their only objective is to maximize their individual goals. In such situations, it may not be possible to use the existing protocols for wireless ad hoc networks as these protocols assume that nodes follow the prescribed protocol without deviation. Stimulating cooperation among these nodes is an interesting and challenging problem. Providing incentives and pricing the transactions are well known approaches to stimulate cooperation. In this paper, we present a game theoretic framework for truthful broadcast protocol and strategy proof pricing mechanism called immediate predecessor node pricing mechanism (IPNPM). The phrase strategy proof here means that truth revelation of cost is a weakly dominant-strategy (in game theoretic terms) for each node. In order to steer our mechanism-design approach towards practical implementation, we compute the payments to nodes using a distributed algorithm. We also propose a new protocol for broadcast in wireless ad hoc network with selfish nodes based on IPNPM. The features of the proposed broadcast protocol are reliability and a significantly reduced number of packet forwards compared to the number of network nodes, which in turn leads to less system-wide power consumption to broadcast a single packet. Our simulation results show the efficacy of the proposed broadcast protocol
{"title":"An Efficient Pricing Based Protocol for Broadcasting in Wireless Ad hoc Networks","authors":"N. Suri, Y. Narahari, D. Manjunath","doi":"10.1109/COMSWA.2006.1665208","DOIUrl":"https://doi.org/10.1109/COMSWA.2006.1665208","url":null,"abstract":"In many applications of wireless ad hoc networks, wireless nodes are owned by rational and intelligent users. In this paper, we call nodes selfish if they are owned by independent users and their only objective is to maximize their individual goals. In such situations, it may not be possible to use the existing protocols for wireless ad hoc networks as these protocols assume that nodes follow the prescribed protocol without deviation. Stimulating cooperation among these nodes is an interesting and challenging problem. Providing incentives and pricing the transactions are well known approaches to stimulate cooperation. In this paper, we present a game theoretic framework for truthful broadcast protocol and strategy proof pricing mechanism called immediate predecessor node pricing mechanism (IPNPM). The phrase strategy proof here means that truth revelation of cost is a weakly dominant-strategy (in game theoretic terms) for each node. In order to steer our mechanism-design approach towards practical implementation, we compute the payments to nodes using a distributed algorithm. We also propose a new protocol for broadcast in wireless ad hoc network with selfish nodes based on IPNPM. The features of the proposed broadcast protocol are reliability and a significantly reduced number of packet forwards compared to the number of network nodes, which in turn leads to less system-wide power consumption to broadcast a single packet. Our simulation results show the efficacy of the proposed broadcast protocol","PeriodicalId":351986,"journal":{"name":"2006 1st International Conference on Communication Systems Software & Middleware","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123414668","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}
VoIP network is proliferating worldwide in lightning pace. As it grows and matures in terms of number of users and variety of services, it faces the burden of overcrowding, overload and service sustenance challenges. In a typical scenario of recovery from a network-wide power outage, the VoIP telephony servers may face sudden and huge load of service requests coming from the users. This may lead to unwanted situations like congestion, service delay, service disruption, etc. causing a potentially disastrous revenue loss for the service providers. In usual overload control mechanism, valuable system resource is spent in constantly monitoring the traffic and performing additional work if an overload is detected. This may prove costly and ineffective under extreme load conditions. This paper presents a simple and novel way of handling very heavy load without any overload control overhead. We employ the inherent characteristics of IP and H.323 networks to handle sudden and extreme load in a H.323 based VoIP network, providing a cost effective disaster recovery solution
{"title":"A Low-Cost Disaster Recovery Method for 1.323 Based VoIP Network","authors":"Arava Uday Kumar, Srikanth Ballal Kunjibettu, Suresh S. Bhat, Dipanjan Dutta","doi":"10.1109/COMSWA.2006.1665160","DOIUrl":"https://doi.org/10.1109/COMSWA.2006.1665160","url":null,"abstract":"VoIP network is proliferating worldwide in lightning pace. As it grows and matures in terms of number of users and variety of services, it faces the burden of overcrowding, overload and service sustenance challenges. In a typical scenario of recovery from a network-wide power outage, the VoIP telephony servers may face sudden and huge load of service requests coming from the users. This may lead to unwanted situations like congestion, service delay, service disruption, etc. causing a potentially disastrous revenue loss for the service providers. In usual overload control mechanism, valuable system resource is spent in constantly monitoring the traffic and performing additional work if an overload is detected. This may prove costly and ineffective under extreme load conditions. This paper presents a simple and novel way of handling very heavy load without any overload control overhead. We employ the inherent characteristics of IP and H.323 networks to handle sudden and extreme load in a H.323 based VoIP network, providing a cost effective disaster recovery solution","PeriodicalId":351986,"journal":{"name":"2006 1st International Conference on Communication Systems Software & Middleware","volume":"288 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122635344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/COMSWA.2006.1665157
Ashima Gupta, Chao Gui, P. Mohapatra
Sensor networks typically comprise of a number of inexpensive small devices with processing, communication and sensing abilities that collaborate to perform a common task. Sensor devices use batteries as their sole power supply. The operational lifetime of a sensor network, therefore, depends entirely on the better utilization of the devices. Typically a sensor network is divided into clusters to optimize power utilization by performing division of labor and data aggregation within a cluster. This paper introduces a novel approach to naturally distributed clustering of sensor nodes in a sensor net using multi channel data planes. Our technique incorporates a virtual sense mechanism that reduces energy spent in sampling and transmission. It also decreases network traffic, thereby decreasing contention, potential collisions and retransmissions. This approach inherently implements a sleep-awake mechanism based on virtual sensing that contributes towards increasing the network lifetime by efficient utilization. The proposed technique can be used to track spreading phenomenon like forest fires and water flows. A spreading phenomenon can be represented by a field whose value changes dynamically with time over area. We focus on following the movement of such a dynamically changing field rather than obtaining the value of the field at different locations at disjoint random times
{"title":"Exploiting Multi-Channel Clustering for Power Efficiency in Sensor Networks","authors":"Ashima Gupta, Chao Gui, P. Mohapatra","doi":"10.1109/COMSWA.2006.1665157","DOIUrl":"https://doi.org/10.1109/COMSWA.2006.1665157","url":null,"abstract":"Sensor networks typically comprise of a number of inexpensive small devices with processing, communication and sensing abilities that collaborate to perform a common task. Sensor devices use batteries as their sole power supply. The operational lifetime of a sensor network, therefore, depends entirely on the better utilization of the devices. Typically a sensor network is divided into clusters to optimize power utilization by performing division of labor and data aggregation within a cluster. This paper introduces a novel approach to naturally distributed clustering of sensor nodes in a sensor net using multi channel data planes. Our technique incorporates a virtual sense mechanism that reduces energy spent in sampling and transmission. It also decreases network traffic, thereby decreasing contention, potential collisions and retransmissions. This approach inherently implements a sleep-awake mechanism based on virtual sensing that contributes towards increasing the network lifetime by efficient utilization. The proposed technique can be used to track spreading phenomenon like forest fires and water flows. A spreading phenomenon can be represented by a field whose value changes dynamically with time over area. We focus on following the movement of such a dynamically changing field rather than obtaining the value of the field at different locations at disjoint random times","PeriodicalId":351986,"journal":{"name":"2006 1st International Conference on Communication Systems Software & Middleware","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114346375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/COMSWA.2006.1665203
J. Light, B. Arunachalan
The proposed mobile middleware service architecture facilitates automating tasks by running small mobile agents with user convenient interfaces and connections in a mobile network. The architecture is scalable so that interfaces and agents can be just plugged in and out of the middleware according to the requirement of the application. Our goal is to develop a wireless communication software tool for sending patient data by the ambulance crew into the emergency medical services (EMS) or the hospital servers using the above middleware. The software tool also retrieves vital patient information such as the patient history and early treatments from the EMS/hospital servers to assist in the patient care process
{"title":"Mobile middleware service architecture for EMS application.","authors":"J. Light, B. Arunachalan","doi":"10.1109/COMSWA.2006.1665203","DOIUrl":"https://doi.org/10.1109/COMSWA.2006.1665203","url":null,"abstract":"The proposed mobile middleware service architecture facilitates automating tasks by running small mobile agents with user convenient interfaces and connections in a mobile network. The architecture is scalable so that interfaces and agents can be just plugged in and out of the middleware according to the requirement of the application. Our goal is to develop a wireless communication software tool for sending patient data by the ambulance crew into the emergency medical services (EMS) or the hospital servers using the above middleware. The software tool also retrieves vital patient information such as the patient history and early treatments from the EMS/hospital servers to assist in the patient care process","PeriodicalId":351986,"journal":{"name":"2006 1st International Conference on Communication Systems Software & Middleware","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125757816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/COMSWA.2006.1665188
Shipra Agrawal, P. Narayan, J. Ramamirtham, R. Rastogi, M. Smith, K. Swanson, M. Thottan
Service providers and enterprises all over the world are rapidly deploying Voice over IP (VoIP) networks because of reduced capital and operational expenditure, and easy creation of new services. Voice traffic has stringement requirements on the quality of service, like strict delay and loss requirements, and 99.999% network availability. However, IP networks have not been designed to easily meet the above requirements. Thus, service providers need service quality management tools that can proactively detect and mitigate service quality degradation of VoIP traffic. In this paper, we present active and passive probes that enable service providers to detect service impairments. We use the probes to compute the network parameters (delay, loss and jitter) that can be used to compute the call quality as a Mean Opinion Score using a voice quality metric, E-model. These tools can be used by service providers and enterprises to identify network impairments that cause service quality degradation and take corrective measures in real time so that the impact on the degradation perceived by end-users is minimal
{"title":"VoIP service quality monitoring using active and passive probes","authors":"Shipra Agrawal, P. Narayan, J. Ramamirtham, R. Rastogi, M. Smith, K. Swanson, M. Thottan","doi":"10.1109/COMSWA.2006.1665188","DOIUrl":"https://doi.org/10.1109/COMSWA.2006.1665188","url":null,"abstract":"Service providers and enterprises all over the world are rapidly deploying Voice over IP (VoIP) networks because of reduced capital and operational expenditure, and easy creation of new services. Voice traffic has stringement requirements on the quality of service, like strict delay and loss requirements, and 99.999% network availability. However, IP networks have not been designed to easily meet the above requirements. Thus, service providers need service quality management tools that can proactively detect and mitigate service quality degradation of VoIP traffic. In this paper, we present active and passive probes that enable service providers to detect service impairments. We use the probes to compute the network parameters (delay, loss and jitter) that can be used to compute the call quality as a Mean Opinion Score using a voice quality metric, E-model. These tools can be used by service providers and enterprises to identify network impairments that cause service quality degradation and take corrective measures in real time so that the impact on the degradation perceived by end-users is minimal","PeriodicalId":351986,"journal":{"name":"2006 1st International Conference on Communication Systems Software & Middleware","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115822863","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/COMSWA.2006.1665204
K. Ravindran, K. Kwiat, A. Sabbir, Bei Cao
In information assurance settings, majority voting among replica processes enhances the trust-worthiness of data collected from a hostile external environment. It allows a correct data fusion and dissemination by the end-users, in the presence of content corruptions and/or timing failures that may possibly occur during data collection. Two key elements are required of the voting functionality: i) fielding asynchronously generated real-time or near-real-time data, and ii) handling large sized non-numeric data sets with problem-specific interpretations-e.g., terrain images from radar stations. Under the constraints (i) and (ii), we describe a highly asynchronous voting service to effect a timely and low-overhead delivery of data to the users. The paper analyzes the service-level properties of a voting machinery to meet the stringent needs of IA applications. The externally visible properties are prescribed in terms of `safety' and `liveness' requirements of the underlying voting protocols that reflect the application-specific data integrity and availability constraints. When voting is provided as a middleware service, an application designer may prescribe the necessary service-level parameters: the level of resiliency and the performance aspects of data delivery
{"title":"Replica Voting: a Distributed Middleware Service for Real-time Dependable Systems","authors":"K. Ravindran, K. Kwiat, A. Sabbir, Bei Cao","doi":"10.1109/COMSWA.2006.1665204","DOIUrl":"https://doi.org/10.1109/COMSWA.2006.1665204","url":null,"abstract":"In information assurance settings, majority voting among replica processes enhances the trust-worthiness of data collected from a hostile external environment. It allows a correct data fusion and dissemination by the end-users, in the presence of content corruptions and/or timing failures that may possibly occur during data collection. Two key elements are required of the voting functionality: i) fielding asynchronously generated real-time or near-real-time data, and ii) handling large sized non-numeric data sets with problem-specific interpretations-e.g., terrain images from radar stations. Under the constraints (i) and (ii), we describe a highly asynchronous voting service to effect a timely and low-overhead delivery of data to the users. The paper analyzes the service-level properties of a voting machinery to meet the stringent needs of IA applications. The externally visible properties are prescribed in terms of `safety' and `liveness' requirements of the underlying voting protocols that reflect the application-specific data integrity and availability constraints. When voting is provided as a middleware service, an application designer may prescribe the necessary service-level parameters: the level of resiliency and the performance aspects of data delivery","PeriodicalId":351986,"journal":{"name":"2006 1st International Conference on Communication Systems Software & Middleware","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116877066","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/COMSWA.2006.1665155
Shushan Zhao, Daniel Jaskiewicz, J. Karvo
Public protection and disaster relief is a promising application area for ad-hoc networks. We propose architecture and show a prototype implementation of an application for helping network deployment on the scene. The application has a graphical interface showing network status and proposing actions for additional measures to ensure the uninterrupted and reliable operation of the network. The tool is designed for a user with no experience of network planning
{"title":"A Deployment Tool for Public Safety Ad-hoc Networks","authors":"Shushan Zhao, Daniel Jaskiewicz, J. Karvo","doi":"10.1109/COMSWA.2006.1665155","DOIUrl":"https://doi.org/10.1109/COMSWA.2006.1665155","url":null,"abstract":"Public protection and disaster relief is a promising application area for ad-hoc networks. We propose architecture and show a prototype implementation of an application for helping network deployment on the scene. The application has a graphical interface showing network status and proposing actions for additional measures to ensure the uninterrupted and reliable operation of the network. The tool is designed for a user with no experience of network planning","PeriodicalId":351986,"journal":{"name":"2006 1st International Conference on Communication Systems Software & Middleware","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121966905","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
扫码关注我们
求助内容：
应助结果提醒方式：