{"title":"Time-based sampling strategies for multi-channel wireless traffic characterization in tactical cognitive networks","authors":"B. R. Tamma, B. S. Manoj, R. Rao","doi":"10.1109/MILCOM.2008.4753338","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753338","url":null,"abstract":"Accurate characterization of wireless network traffic has many applications in military communication networks. However, the network traffic characterization is a challenging task in multi-channel wireless networks. Due to the presence of multiple channels, the existing count-based sampling methods demand continuous capture on each channel for selecting the desired packets of interest. Continuous traffic capture makes the cost of monitoring infrastructure very expensive and hence count-based sampling methods are not scalable. However, the time-based sampling methods which were considered inaccurate in wired network characterization, seem to offer a cost-effective and scalable solution. The contributions of this paper include the following: (i) proposal of a new metric, relative proportional inconsistency (RPI) for measuring the accuracy of sampling schemes, (ii) comparison of various time-based sampling strategies using RPI metric, (iii) studying the effect of sampling parameters on the accuracy of sampling, and (iv) preliminary results on characterization of wireless network data traffic from residential and campus environments.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126317097","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":"Hybrid multicast patching approach for video services","authors":"Can Li, Sungkown Park, S. Bahk","doi":"10.1109/MILCOM.2008.4753366","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753366","url":null,"abstract":"With the advancement of broadband networking technology, many clients are enabled to enjoy various video on demand (VoD) services. To provide VoD services to a number of clients, the network needs to consider various factors together; they are each viewerpsilas waiting time, buffer requirement at the client, channel management for video delivery, and complexity for video segmentation. Among the currently available VoD approaches, the polyharmonic broadcasting approach and the staircase multicasting approach show the best performance in terms of viewerpsilas waiting time and buffer requirement, respectively. However, these approaches need to divide a video into too many segments, and require many channels at a time. To overcome these limitations, we propose polyharmonic-staircase-staggered (PSS) multicasting approach which combines the Polyharmonic scheme with the staircase scheme. It is simple and bandwidth efficient. The numerical results demonstrate that each viewerpsilas waiting time in our approach is comparable to that in the polyharmonic approach, at the cost of a slight increase in bandwidth requirement, and its buffer requirement is about 60% less than that in the staircase approach by simply adjusting the front part of video segmentation. More importantly, our approach shows the best performance in number of channels to be managed and used simultaneously, which is a critical factor in real deployment.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126373760","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":"Impact of overlapped transmission on the performance of TCP in multihop ad hoc networks","authors":"S. Boppana, J. Shea","doi":"10.1109/MILCOM.2008.4753410","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753410","url":null,"abstract":"Multihop routing in wireless ad hoc networks creates situations in which some nodes know the content of packets being transmitted by neighboring nodes. This knowledge enables simplified interference cancellation schemes that can be used to schedule additional transmissions in the network. This approach, which we call overlapped transmission, can significantly improve the performance of ad hoc networks in a variety of scenarios. Recently, we proposed the Overlapped Carrier Sense Multiple Access (OCSMA) protocol to coordinate overlapped transmissions and increase the spatial reuse and throughput of wireless ad hoc networks. In this paper, we investigate the interactions between TCP and OCSMA in wireless ad hoc networks. We analyze the impact of overlapped transmission on the performance of TCP flows in a variety of network scenarios. Through network simulations, we demonstrate the superiority of OCSMA over conventional medium access control (MAC) protocols in addressing the fairness and medium contention issues of TCP in multihop wireless networks.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127995724","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":"Harmonised resilience, security and mobility capability for IP","authors":"R. Atkinson, S. Bhatti, S. Hailes","doi":"10.1109/MILCOM.2008.4753321","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753321","url":null,"abstract":"Military communications currently require secure end-to-end, resilient connectivity via multi-homed connections, and need to support both mobile hosts and mobile networks. Today, such functions are possible to some degree, but the functions are not harmonised. Standards that support these functions were designed independently and implemented in isolation. So, achieving converged capabilities for optimal communications in forward operating areas is a technical challenge, and results in a complex network landscape which is likely to be difficult to operate and manage, and brittle under failure conditions. From our ongoing work, we present a new naming approach and use this to formulate a proposal to provide the following capability harmoniously: (a) multi-homed connectivity for traffic engineering and resilience; (b) true end-to-end network-layer security with high compatibility with the HAIPE architecture; (c) support for mobile hosts and mobile networks. Our approach is backwards compatible with IPv6 network equipment (existing IPv6 backbones can be used), and is also incrementally deployable.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"97 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127996397","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":"Optimal sensor deployment for distributed detection in the presence of channel fading","authors":"S. Jayaweera, T. Wimalajeewa","doi":"10.1109/MILCOM.2008.4753637","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753637","url":null,"abstract":"The problem of optimal (fixed) wireless sensor network (WSN) design for distributed detection of a randomly-located target is addressed. This is an extension of the previous work reported in [1] where the problem was addressed for a one-dimensional (1D) network assuming wireless channels between sensors and the fusion center undergo only the path-loss attenuation. In this paper we consider both one and two-dimensional (2-D), equi-spaced WSN models in the presence of short-term fading in addition to path-loss attenuation. The target is assumed to be exponentially distributed with a known mean. The optimal inter-node spacing is derived by optimizing the Bhattacharya bound on the error probability of the Bayesian detector. In the presence of fading, it is shown that the optimal node placement depends on the channel SNR, path loss exponent and the mean target location. However, we show that for low channel SNRpsilas, the optimal spacing obtained for no fading case, which is only a function of path-loss exponent and the mean target location, is a good approximation to that with fading. In particular, it is not a function of the channel SNR. It is shown that in many cases the deviation from optimal inter-node spacing can cost significant performance penalty. From numerical results, it is verified that the optimal inter-node spacing obtained based on the Bhattacharya bound holds true if the performance measure were to be the exact fusion error probability.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128126005","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}
N. Sofra, T. He, P. Zerfos, B. J. Ko, K. Lee, K. Leung
{"title":"Accuracy analysis of data aggregation for network monitoring","authors":"N. Sofra, T. He, P. Zerfos, B. J. Ko, K. Lee, K. Leung","doi":"10.1109/MILCOM.2008.4753388","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753388","url":null,"abstract":"The quality of computing certain aggregation functions based on incomplete measurements for the purpose of distributed network monitoring is considered. Network monitoring plays a fundamental role in network management systems by providing timely information on the network status, which is crucial for administration purposes. To reduce network overhead and for easier assimilation, this information is usually presented by calculating a few key aggregate metrics. The aggregates are periodically computed from a large number of detailed events collected continuously during the course of the network operations. Under errors induced by network delays, the accuracy of typical aggregation functions used in network management systems is evaluated both analytically and by simulations. The results provide a quantifiable trade-off between accuracy and timeliness of the information acquired, which can then be used to design and optimize network management systems.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128134638","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 defense technique against misbehavior in VANETs based on threshold authentication","authors":"Jinyuan Sun, Yuguang Fang","doi":"10.1109/MILCOM.2008.4753658","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753658","url":null,"abstract":"Vehicular Ad Hoc network (VANET) can offer various services and benefits to VANET users and thus deserves deployment effort. Misusing such network could cause destructive consequences. It is therefore necessary to discourage misbehavior and defend VANET systems against it, in order to ensure correct and smooth operations of the network. In this paper, we propose a defense technique to handle misbehavior in VANETs, caused by either malfunctioning hardware (unintentional) or purposeful attacks. It can be used in both inter-vehicle and vehicle-to-infrastructure communications, where user privacy is highly desirable but adds more complexity to the defense. By employing our misbehavior defense technique, users of the system can opt for allowing occasional or unintentional misbehavior while preventing frequent or disruptive misbehavior.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"39 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125742685","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":"Ultrawide bandwidth serial-search multi-dwell acquisition-Part II: System considerations","authors":"W. Suwansantisuk, M. Win","doi":"10.1109/MILCOM.2008.4753554","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753554","url":null,"abstract":"This paper quantifies the performance of ultrawide bandwidth (UWB) serial-search multi-dwell receivers operating in Nakagami-m fading channels. In particular, the receiver employs a bank of correlators with optimal detection thresholds. The mean acquisition time is given as a function of the signal-to-noise ratio (SNR) for different search strategies and numbers of correlators. The numerical results show that the improvement in acquisition performance from using intelligent serial search strategies is consistent with the analytical bounds derived in the companion paper for arbitrary fading channels.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132245583","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":"Network synchronization for distributed MANET","authors":"S. Mo, J. Hsu, J. Gu, Mingchuan Luo, R. Ghanadan","doi":"10.1109/MILCOM.2008.4753419","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753419","url":null,"abstract":"Mobile ad-hoc networks (MANET) are often characterized with rapidly changing topologies, presenting a constant challenge for time synchronization. This challenge holds especially true in tactical edge ground military networks, where topological instabilities are enhanced by hostile transmission environments. In the absence of GPS, time synchronization within the context of a tactical environment requires resilience and ease of deployment. Hardware requirements must be carefully controlled, while relying on distributed coordination techniques to avoid single points of failure. Current tactical ground networks are often deployed without high accuracy oscillators, but still require time synchronization on the order of 1us. Our work demonstrates a distributed synchronization approach with a resource efficient solution that handles these requirements. We introduce cross-layer ad-hoc network synchronization (CLANS), a low overhead time synchronization protocol designed for MANETs and enables coarse synchronization without relying on GPS data. CLANS leverages routing information, channel access schemes, and distributed scheduling protocols that typically exist in a MANET. This provides a resilient, distributed time synchronization solution with relaxed hardware requirements. Simulation results show that CLANS can achieve network synchronization within 1 us in lossy multi-hop networks with the presence of packet loss and measurement noise.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130473552","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":"Communication range extension for the Intelligent Munitions System","authors":"R. Sonalkar, J. Horn","doi":"10.1109/MILCOM.2008.4753352","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753352","url":null,"abstract":"Future variants of unattended Networked Munitions and Ground Sensors will be remotely deployed tens of kilometers forward of the control point. Systems like the next generation of the Intelligent Munitions System (IMS) will provide a means to dominate an area on the battlefield via remote control and prevent the passage of enemy forces while allowing for the safe passage of friendly forces by providing manual control of the armed and sensing states of the deployed IMS components. Given that the components need to be relatively small for low probability of detectability (LPD) and for remote delivery, the antennas for the communications systems are expected to be very close to the ground. Recognizing that limited Size Weight and Power (SWaP) and the proximity of the antennas to the ground severely limit the communications range, we examine alternatives for increasing the range and the challenges associated with each alternative. The alternatives can be partitioned into two broad categories; physical layer improvements and systems architecture. Systems architecture approaches consist of incorporating relays between the transmitter and receiver. In general, physical layer approaches can be categorized as HW and/or SW improvements. Some HW-based approaches are currently under consideration and being analyzed within the IMS. The primary issue in the system architecture approach would be to identify either existing resources of opportunity that could be used, such as satellite or Unmanned Aerial Systems (UASs), or to use specially designed relays in netted-sensors architecture. We examine these alternative architectures and recommend UAS relays as the most feasible range extension approach, albeit with its own challenges.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"400 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134214200","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}