{"title":"ArDeZ: a low power asymmetric rendezvous MAC for sensor networks","authors":"Kwan-Wu Chin, R. Raad","doi":"10.1109/ICCCN.2005.1523818","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523818","url":null,"abstract":"We present a rendezvous based medium access control (MAC), culled ArDeZ, for use in sensor networks. ArDeZ is a TDMA based medium access scheme that does not rely on strict time slot positioning and assignments, making ArDeZ easily deployable in large sensor networks without having to adhere to strict time slot boundaries. ArDeZ establishes two independent peer-to-peer time channels between nodes, and these channels do not necessarily have the same duty cycle. Each channel has a set of rendezvous periods associated with it that are generated from a seed exchanged during the setup process. Further, the duration and frequency of each channel's rendezvous periods are easily changed by an application for each link on a given path, thereby allowing the application to balance traffic and energy requirements. We have implemented ArDeZ in the ns-2 simulator, and our results show that ArDeZ is capable of very low power consumption.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132745465","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}
{"title":"Bandwidth reservation and QoS in Internet MANETs","authors":"N. Shenoy, Yin Pan, V. Reddy","doi":"10.1109/ICCCN.2005.1523885","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523885","url":null,"abstract":"Provisioning QoS in MANETs is very challenging. Some of the factors that affect QoS provisioning in MANETs are-lossy wireless environment, the movement of nodes, medium access scheme-due to contention for shared medium and routing protocols-as the routes are dynamic. Hence it is difficult to propose one scheme that will best support QoS in MANETs suitable for all application scenarios. We decided to investigate QoS in MANETs from an application perspective. In this work, we are interested in QoS provisioning in Internet connected MANETs- which are expected to support users roaming in from cellular or WLANs with an active call. Hence we are interested in such performance metrics like network joining delays, end-to-end frame delivery delays and upstream and downstream throughput. We proposed a solution after identifying the unique requirements of such an Internet connected MANET. The solution includes a routing and forwarding scheme at layer 2 called multi-meshed tree routing with a simple carrier sense random backoff based medium access. Details of simulation studies and results of the above identified performance metrics are presented here.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131780665","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}
Shoji Yoshimura, Hajime Ueno, K. Kawano, K. Kinoshita, K. Murakami
{"title":"Mobile multicast routing for broadband communication services","authors":"Shoji Yoshimura, Hajime Ueno, K. Kawano, K. Kinoshita, K. Murakami","doi":"10.1109/ICCCN.2005.1523955","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523955","url":null,"abstract":"Mobile multicasting is a key technology to provide broadband services for mobile hosts. This paper also describes existing mobile multicast protocol and the proposed MFA selection method. Thus the proposed method provides relatively stable broadband services continuously.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124316597","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}
{"title":"A new low-delay matching algorithm for input-queued switches","authors":"Madhusudan Hosaagrahara, H. Sethu","doi":"10.1109/ICCCN.2005.1523911","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523911","url":null,"abstract":"This paper presents a randomized algorithm, called degree-sequenced matching (DSM), for scheduling packets in an input-queued switch. Previously known high-throughput, randomized algorithms implicitly prioritize the matching of ports with larger degrees and causes longer delays at the low-degree ports. Our algorithm, however, achieves a lower average delay but without compromising the throughput. The DSM algorithm sorts nodes based on their node-degrees and begin each iteration of the algorithm by matching the lowest degree nodes. Using real gateway traffic traces as well as synthetically generated traffic, we present simulation results showing that DSM achieves a low average delay, while still achieving near maximum throughput.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127862900","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}
{"title":"A bandwidth allocation framework for adaptive multimedia traffic with flexible time adaptability in wireless and mobile networks","authors":"P. Chanda, Qing-An Zeng","doi":"10.1109/ICCCN.2005.1523906","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523906","url":null,"abstract":"Next generation wireless networks are expected to support multi-class variable bandwidth real-time multimedia applications. High user mobility and inherent instability of wireless channels makes quality of service (QoS) provisioning a challenging issue in wireless networks. In this paper, we propose a novel resource management scheme, FATP, for QoS provisioning in wireless networks for adaptive multimedia calls. We improve handoff call dropping probabilities and reduce bandwidth fluctuations a call suffers by making the call time adaptable to bandwidth changes. Simulation results show that our scheme maintains low handoff call dropping probabilities and significantly reduces bandwidth variations at the end users.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129212373","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}
{"title":"Resource management and QoS control in multiple traffic wireless and mobile Internet systems","authors":"Yong Xu, Huazhou Liu, Qing-An Zeng","doi":"10.1002/wcm.360","DOIUrl":"https://doi.org/10.1002/wcm.360","url":null,"abstract":"In a multiple service wireless and mobile system, different numbers of channels (or bandwidth) are assigned to different services according to their QoS requirements. Real-time services have the lowest delay tolerance, while they might not need very large bandwidth. Non-real-time services can improve their performance if they are given more bandwidth and they are also not as sensitive to delay as the real-time services. Many channel allocation and resource management schemes have been carried out for wireless system with differentiated services. However, the link status of channel has not been considered very well in those schemes. Many of them just assume that all channels are homogeneous and their status will not charge throughout the service durations. This is not true in real world. In this paper, we take into account the physical channel status in our preemptive priority channel allocation scheme. Transmission rate changes dynamically according to variational channel status as a result of shadowing and fading. Our scheme uses the transmission rate of each channel as one important fact in choosing the channel candidate to be preempted. When the channel originally having a poor transmission rate is assigned to a new user, its link status is very likely to gain some improvements. Therefore, both the user QoS and the system utilization get a boost using this scheme. We evaluate the system performance in terms of blocking probabilities, forced termination probabilities, and average number of user in the system.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117208535","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}
{"title":"An integrated and flexible approach to robust and secure routing for wireless multihop ad-hoc networks","authors":"R. Guru, Geoffrey Huang, K. Obraczka","doi":"10.1109/ICCCN.2005.1523887","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523887","url":null,"abstract":"This paper introduces robust and secure routing (RoST), an integrated and flexible approach to secure routing in wireless mobile ad hoc networks (MANETs). RoST incorporates robustness and security into the underlying MANET routing protocol. By using a layered approach, RoST offers flexibility to the target MANET application to choose the required level of security. Most secure MANET routing solutions to-date either assume that security services (e.g., key distribution) is handled externally or propose cryptographic schemes that target MANETs. RoST, on the other hand, combines both robustness and security techniques integrating them into a protocol suite. At its core, it takes advantage of the network's inherent redundancy to efficiently discover multiple routes ensuring robust delivery; additional layers provide in-built key exchange, authentication, data integrity and privacy. We implemented RoST by extending the dynamic source routing (DSR) protocol. Through simulations, we demonstrate how RoST can circumvent security attacks. We also show that, under normal operating conditions, RoST and DSR exhibit similar performance. Thus, RoST is able to provide robustness and security without significantly impacting performance.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125884371","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}
{"title":"Detecting denial-of-service attacks with incomplete audit data","authors":"A. Patcha, J. Park","doi":"10.1109/ICCCN.2005.1523864","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523864","url":null,"abstract":"With the ever increasing deployment and usage of gigabit networks, traditional network anomaly detection based intrusion detection systems have not scaled accordingly. Most, if not all, systems deployed assume the availability of complete and clean data for the purpose of intrusion detection. We contend that this assumption is not valid. Factors like noise in the audit data, mobility of the nodes and the large amount of network data generated by the network make it difficult to build a normal traffic profile of the network for the purpose of anomaly detection. From this perspective, we present an anomaly detection scheme, called SCAN (stochastic clustering algorithm for network anomaly detection), that has the capability to detect intrusions with high accuracy even when audit data is not complete. We use the expectation-maximization algorithm to cluster the incoming audit data and compute the missing values in the audit data. We improve the speed of convergence of the clustering process by using Bloom filters and data summaries. We evaluate SCAN using the 1999 DARPA/Lincoln Laboratory intrusion detection evaluation dataset.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121808067","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}
{"title":"A practical spanning tree based MANET routing algorithm","authors":"W. Peng, Zhuo Li, F. Haddix","doi":"10.1109/ICCCN.2005.1523799","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523799","url":null,"abstract":"We present a new and practical spanning tree based routing algorithm for mobile ad hoc networks (MANET). The algorithm, named LCMRMGCS, extends and significantly enhances the LCMRMG MANET routing algorithm previously proposed in W. Peng et al., (2003). Hosts in a LCMRMGCS MANET form non-overlapping trees. Our simulation results show that LCMRMGCS consistently outperforms LCMRMG in both maintenance cost and delivery ratio.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131932916","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}
{"title":"Efficient on-demand topology control for wireless ad hoc networks","authors":"Yang Wang, Xinghua Shi","doi":"10.1109/ICCCN.2005.1523833","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523833","url":null,"abstract":"Topology control in wireless ad hoc networks has been heavily studied recently. Different geometric topologies were proposed to be used as the underlying network topologies, in order to achieve the sparseness of the communication network or to guarantee the package delivery of specific routing methods. However, most of the proposed topology control algorithms were applied for all nodes in the networks at the initial network startup stage, and the constructed topologies were kept being maintained thereafter. The overhead of topology control at each node at any time is notable, and this affects the performance of the network and wastes energy for each wireless node. This paper seeks to investigate the practices of efficient on-demand topology control protocol for wireless ad hoc networks. In our new protocol, we only apply the specific topology control technique where and when the wireless node needs it. Our simulation confirms that our scheme has better performance than several existing methods.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129678907","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}