{"title":"Modeling End-to-end Distance for Given Number of Hops in Dense Planar Wireless Sensor Networks","authors":"Liang Zhao, Q. Liang","doi":"10.1109/SAHCN.2006.288556","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288556","url":null,"abstract":"We model the end-to-end distance for a given number of hops in dense planar wireless sensor networks in this paper. We derive that the closed-form formula for single-hop distance and postulate Beta distribution for 2-hop distance. When the number of hops increases beyond three, the multi-hop distance approaches Gaussian. The Gaussian approximation model is also applied to ranging, which achieves less distance error than Hop-TERRAIN and APS (ad hoc positioning system). Our error analysis also shows the distance error is be minimized by using our model","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"37 32 1","pages":"751-755"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82754833","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":"Ubiquitous Zone (U-Zone) based Community Networking Technologies","authors":"Y. Chung, Namhi Kang, Younghan Kim","doi":"10.1109/SAHCN.2006.288530","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288530","url":null,"abstract":"This work introduces ubiquitous zone (u-zone) based community networking technologies project aimed at providing ubiquitous computing environment for community networking. A u-zone network architecture with ubiquitous zone master (u-ZM), which manages u-zone, is proposed. These u-ZMs form a mesh network via wireless backbone (WBB). Thus, u-zone network can be considered as a hybrid network of MANET between u-ZM and nodes and mesh network between u-ZMs. Either proactive or reactive routing protocol can be used in intrazone routing and inter-zone routing in the u-zone network. Thus, four routing modes are proposed and the detailed operations of them are illustrated. Then, the pros and cons of the four routing modes are discussed. Also, the proposed u-zone network supports routing between nodes operating with heterogeneous routing protocols in the same u-zone by heterogeneous routing protocol coordinator (HRPC). Our u-zone network with u-ZMs will serve as a new network infrastructure for future community networking for ubiquitous computing","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"53 1","pages":"678-683"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86092350","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 Internet SIP Gateway for Ad-hoc Networks","authors":"J. Manner, Simone Leggio, K. Raatikainen","doi":"10.1109/SAHCN.2006.288554","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288554","url":null,"abstract":"Various forms of ad-hoc networking are slowly emerging. However, a wider diffusion of ad-hoc networking in everyday life will only be possible if existing common applications are adapted for use in ad-hoc networks. There has been some work on adapting Internet-based applications to function in ad-hoc networks. Yet, in order to make ad-hoc networking even more useful and interesting to people, applications must also be able to connect to the Internet. Many new Internet applications are based on sessions, e.g., instant messaging, VoIP and multimedia communications. The session initiation protocol (SIP) is a popular protocol to manage sessions in IP networks, based on centralized servers, and application-level routing. However, in order to establish SIP sessions between an ad-hoc network and the Internet, some logic must be built in the ad-hoc gateway node to make messages flow correctly to and from the ad-hoc network. In this paper, we present an intelligent SIP gateway that makes it possible to route messages properly between ad-hoc networks, and the Internet, even when the ad-hoc IP addresses are not globally routable","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"21 1","pages":"740-745"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79722866","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":"On the Importance of Modeling the Environment when Analyzing Sensor Networks","authors":"L. Samper, F. Maraninchi, Erwan Jahier","doi":"10.1109/SAHCN.2006.288569","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288569","url":null,"abstract":"A sensor network may be considered as a large and complex computer system embedded in the physical environment that has some influence on the sensors. The environment is the source of (almost) all activity that occurs in the network. With a simple example modeled in our tool GLONEMO, we show the influence of an environment model that allows to describe correlated stimuli on the set of sensors at a given instant, and also correlations between successive instants","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"4 1","pages":"835-841"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82664053","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":"Supervised Learning in Sensor Networks: New Approaches with Routing, Reliability Optimizations","authors":"Yong Wang, M. Martonosi, L. Peh","doi":"10.1109/SAHCN.2006.288430","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288430","url":null,"abstract":"Routing in sensor networks maintains information on neighbor states and potentially many other factors in order to make informed decisions. Challenges arise both in (a) performing accurate and adaptive information discovery and (b) processing/analyzing the gathered data to extract useful features and correlations. To address such challenges, this paper explores using supervised learning techniques to make informed decisions in the context of wireless sensor networks. In consideration of the unique characteristics of sensor networks, our approach consists of two phases: an offline learning phase and an online classification phase. We use two case studies to demonstrate the effectiveness of our approach. In the first, we present MetricMap, a metric-based routing protocol that derives link quality using our classifiers when the traditional ETX-based approach fails. In the second, we present SHARP, an extension to the PSFQ protocol, which uses knowledge gathered in the training phase to control its caching policy for saving constrained storage space. Evaluation is performed on a 30-node real-world testbed and a multihop sensor network in our lab. Our results show that MetricMap can achieve up to 300% improvement in data delivery rate for a high data-rate application, without compromising other performance metrics; SHARP can reduce the memory footprint of PSFQ by 46.4% with a modest increase of 4.7% in fetch miss rate","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"55 1","pages":"256-265"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89482455","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":"Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks","authors":"Nabhendra Bisnik, A. Abouzeid","doi":"10.1109/SAHCN.2006.288575","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288575","url":null,"abstract":"In this paper we focus on characterizing the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with stationary nodes. We present an analytical model that takes into account the number of nodes, the random packet arrival process, the extent of locality of traffic, and the back off and collision avoidance mechanisms of random access MAC. We model random access multihop wireless networks as open G/G/1 queuing networks and use diffusion approximation to evaluate closed form expressions for the average end-to-end delay. The mean service time of nodes is derived and used to obtain the maximum achievable per-node throughput. The analytical results obtained here from the queuing network analysis are discussed with regard to similarities and differences from the well established information-theoretic results on throughput and delay scaling laws in ad hoc networks. We also investigate the extent of deviation of delay and achievable throughput in a real world network from the analytical results presented in this paper. We perform extensive simulations and verify that the analytical results closely match the results obtained from simulations","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"44 1","pages":"874-880"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88632711","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}
R. Lau, S. Demers, Y. Ling, B. Siegell, E. Vollset, K. Birman, R. V. Renesse, H. Shrobe, J. Bachrach, L. Foster
{"title":"Cognitive Adaptive Radio Teams","authors":"R. Lau, S. Demers, Y. Ling, B. Siegell, E. Vollset, K. Birman, R. V. Renesse, H. Shrobe, J. Bachrach, L. Foster","doi":"10.1109/SAHCN.2006.288570","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288570","url":null,"abstract":"Cognitive adaptive radio teams (CART) is a new platform developed by our group in support of collaborative mapping of complex communications-challenged environments, for example in support of search and rescue operations in environments lacking an adequate communications infrastructure. Experience during the 9/11 terrorist attacks, Asian tsunami, Kashmir earthquake, and post-Katrina Gulf Coast make it clear that rescue workers cannot count upon computer networks or even cell telephone support in the immediate aftermath of such events. Similarly, military urban warfare operations must also be conducted in locations lacking communication infrastructure. CART combines state-of-the-art ad-hoc networking technology with machine learning and prediction algorithms to offer new capabilities under these very difficult conditions","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"53 1","pages":"842-847"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87860105","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 Communication Architecture for Mobile Wireless Sensor and Actor Networks","authors":"T. Melodia, D. Pompili, I. Akyildiz","doi":"10.1109/SAHCN.2006.288415","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288415","url":null,"abstract":"In wireless sensor and actor networks (WSANs), the collaborative operation of sensors enables the distributed sensing of a physical phenomenon, while actors collect and process sensor data and perform appropriate actions. In this paper, the coordination and communication problems in WSANs with mobile actors are studied. A hybrid location management scheme is introduced to handle the mobility of actors with minimal energy expenditure. Actors broadcast location updates limiting their scope based on Voronoi diagrams, whereas sensors predict the movement of actors based on Kalman filtering of previously received updates. An optimal energy-aware forwarding rule is then derived for sensor-actor communication, based on geographical routing. The proposed scheme allows controlling the delay of the data-delivery process based on power control, and deals with network congestion by forcing multiple actors to be recipients for traffic generated in the event area. The motion of actors is coordinated to optimally accomplish the tasks based on the characteristics of the events","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"5 1","pages":"109-118"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88100109","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":"On-Demand Connection- Oriented Multi-Channel MAC Protocol for Ad-Hoc Network","authors":"Peng-Jung Wu, Chung-Nan Lee","doi":"10.1109/SAHCN.2006.288521","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288521","url":null,"abstract":"This paper presents an on-demand connection-oriented multi-channel MAC protocol for ad-hoc networks. The major characteristics of proposed protocol are: (a) each mobile node is equipped with two network interfaces, (b) frame broadcasting is supported and (c) no time synchronization is needed. Compared with other multi-channel MAC protocols, the proposed protocol reduces the cost of channel negotiation by considering the property that a connection generates multiple frames for transmitting. NS-2 is used to evaluate the performance of the proposed protocol. Simulation results show that the proposed protocol can reduce the cost of channel negotiation and increase the network throughput","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"118 1","pages":"621-625"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83420920","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}