{"title":"Model-based resource prediction for multi-hop wireless networks","authors":"Yuan Sun, Xia Gao, E. Belding-Royer, J. Kempf","doi":"10.1109/MAHSS.2004.1392086","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392086","url":null,"abstract":"Ad hoc networks have been proposed for a variety of applications where support for real time, multimedia services may be necessary. This requires that the network is able to offer quality of service (QoS) appropriate for the latency and throughput bounds needed to meet the real time constraint. An important component for QoS provisioning is resource estimation and quality prediction. The paper describes a model-based resource prediction (MBRP) mechanism to support real time communication in multi-hop wireless networks. Specifically, we develop an analytical model for differentiated MAC scheduling protocols. The model can predict per-flow and system-wide throughput and delivery latency, thereby enabling admission control of the flows and providing an efficient network management utility. After describing the basic model, we propose enhanced MBRP (EMBRP) for realistic network environments. Our proposed quality prediction method is beneficial in the deployment of a real ad hoc network where knowledge of resource allocation and consumption is needed to meet the service requirements. Analytical and simulation results show that EMBRP provides accurate flow quality prediction. The results also demonstrate the effectiveness of EMBRP as an admission control solution in multi-hop ad hoc networks.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127126361","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}
Xiaohui Cui, C. Hardin, R. Ragade, Adel Said Elmaghraby
{"title":"A swarm-based fuzzy logic control mobile sensor network for hazardous contaminants localization","authors":"Xiaohui Cui, C. Hardin, R. Ragade, Adel Said Elmaghraby","doi":"10.1109/MAHSS.2004.1392158","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392158","url":null,"abstract":"We describe a swarm-based fuzzy logic control (FLC) mobile sensor network approach for collaboratively locating the hazardous contaminants in an unknown large-scale area. The mobile sensor network is composed of a collection of distributed nodes (robots), each of which has limited sensing, intelligence and communication capabilities. An ad-hoc wireless network is established among all nodes, and each node considers other nodes as extended sensors. By gathering other nodes' locations and measurement data, each node's FLC can independently determine its next optimal deployment location. Simultaneously, by applying the three properties of the swarm behavior: separation, cohesion and alignment, the approach can ensure the sensor network attains wide regional coverage and dynamically stable connectivity. The simulation presented in this paper shows the swarm-based FLC mobile sensor network can achieve better performance and have higher fault tolerance in the event of partial node failures and sensor measurement errors.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128129401","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":"Localized topology control for heterogeneous wireless ad-hoc networks","authors":"Xiangyang Li, Wenzhan Song, Yang Wang","doi":"10.1109/MAHSS.2004.1392167","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392167","url":null,"abstract":"We study topology control in heterogeneous wireless ad hoc networks, where mobile hosts may have different maximum transmission powers and two nodes are connected if they are within the maximum transmission range of each other. We present several strategies so that all wireless nodes self-maintain sparse and power efficient topologies in heterogeneous network environments with low communication cost. The first structure is sparse and can be used for broadcasting. The second structure keeps the minimum power consumption path, and the third structure is a length and power spanner with a bounded degree. Both the second and third structures are power efficient and can be used for unicast. Here a structure is power efficient if the total power consumption of the least cost path connecting any two nodes in it is no more than a small constant factor of that in the original heterogeneous communication graph. All our methods use at most O(n) total messages, where each message has O(logn) bits.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125828816","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":"Offered load control in IEEE 802.11 multi-hop ad-hoc networks","authors":"P. Ng, S. Liew","doi":"10.1109/MAHSS.2004.1392078","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392078","url":null,"abstract":"In a multi-hop ad-hoc network, stations may pump more traffic into it than can be supported, resulting in high packet-loss rate, rerouting instability and unfairness problems. The paper shows that controlling the offered load at the sources can eliminate these problems. In addition, we provide an analysis to estimate the optimal offered load that maximizes the throughput of a multi-hop traffic flow. We use this result to devise schemes that can achieve fairness when there are multiple flows from different sources to different destinations. We believe this is the first paper in the literature to provide a quantitative analysis (as opposed to simulation) for the impact of hidden nodes, exposed nodes, and signal capture on sustainable throughput. The analysis is based on the observation that a large-scale 802.11 network with hidden nodes is a network in which the carrier-sensing capability breaks down partially. Its performance is therefore somewhere between a carrier-sensing network and an ALOHA network. Indeed, our analytical closed-form solution has the appearance of the throughput equation of the ALOHA network. Our approach allows one to identify whether the performance of an 802.11 network is hidden-node limited or spatial-reuse limited.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130138347","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 data aggregation middleware for wireless sensor networks","authors":"Mukul Kumar, L. Schwiebert, M. Brockmeyer","doi":"10.1109/MAHSS.2004.1392214","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392214","url":null,"abstract":"This paper describes a data aggregation and consensus algorithm for object location and tracking applications deployed on wireless sensor networks. This consensus algorithm permits ad-hoc, in-network, group formation in response to a detected event. By reaching a consensus in the network, only a single message indicating the detected event needs to be forwarded to the tracking application at a base station, leading to significant savings in communication costs and prolonging of the life of the network. Our ad-hoc approach offers superior detecting power to other approaches, which statically partition the network into detection regions. The use of a quorum mechanism to achieve consensus leads to higher availability under failure conditions. Moreover, the algorithm exploits the broadcast communication and synchrony properties of wireless sensor networks. Our experimental results show that the algorithm exhibits low overhead despite faults and converges quickly to a single consensus even if multiple nodes initiate the consensus protocol.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117304549","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}
Witold Drytkiewicz, I. Radusch, S. Arbanowski, R. Popescu-Zeletin
{"title":"pREST: a REST-based protocol for pervasive systems","authors":"Witold Drytkiewicz, I. Radusch, S. Arbanowski, R. Popescu-Zeletin","doi":"10.1109/MAHSS.2004.1392173","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392173","url":null,"abstract":"The convergence of embedded systems and wireless communication enables interconnection of electronic devices to render control and provide information to the user. Offices, apartments, and public spaces are or in the near future will be able to deliver information and services to their occupants ranging from instant Internet access to configuration and control in a context dependent, personalized way. Despite progressing internetworking and sophistication, we are still dealing with islands of functionality rather than the invisible computer envisioned by Mark Weiser. We believe that the spread and acceptance of smart environments will depend on common standards as well as a simple and flexible way to access data and devices and compose services from existing ones. A good example of such a system is the World Wide Web, whose success is mainly due to the simplicity with which all kinds of content can be published and referenced. We present an access protocol to bring the Web's simplicity and holistic view on data and services to pervasive systems. Our approach is based on the representational state transfer architectural style and emphasizes abstraction of data and services as resources, interoperation via self describing data and service orchestration with loosely typed components. A particular concern is to provide for functionality in the absence of proxy nodes or infrastructure services like directory servers.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133726542","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":"Stable group model in mobile peer-to-peer media streaming system","authors":"Guangtao Xue, Minglu Li, Qianni Deng, Jinyuan You","doi":"10.1109/MAHSS.2004.1392172","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392172","url":null,"abstract":"We study two key problems arising from mobile peer-to-peer media streaming: the stability of interconnection between supplying peers and requesting peers in the mobile peer-to-peer streaming system; and fast capacity amplification of the entire mobile peer-to-peer streaming system. Many algorithms for the fast capacity amplification of the peer-to-peer streaming system have been proposed. However, these algorithms are inefficient in the mobile ad-hoc networks. Topological dynamics of mobile peer-to-peer are exacerbated by the changes of mobile user's location and interest. We observe that the mobile users exhibit correlated mobility patterns in practical ad-hoc networks. We use the stable group algorithm to characterize user mobility in mobile ad-hoc networks. Based on the stable group, we then propose a distributed stable-group differentiated admission control algorithm (SGDAC/sub p2p/), which leads to fast amplifying of the system's total streaming capacity using self-growing. Finally, extensive simulation results are presented to compare between the SGDAC/sub p2p/ and traditional methods to prove the superiority of the algorithm.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132998136","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":"Scalable routing in hybrid cellular and ad-hoc networks","authors":"Ioannis Ioannidis, Bogdan Carbunar","doi":"10.1109/MAHSS.2004.1392195","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392195","url":null,"abstract":"As wireless ad-hoc networking approaches its maturity, an architecture that can support the massive deployment of such networks has not been established. Hybrid networks are a promising architecture that builds ad hoc wireless networks around the existing cellular telephony infrastructure. We present a routing protocol (DST) for hybrid networks that maintains a close to optimal spanning tree of the network with the use of distributed topology trees. DST is fully dynamic and generates only O(log n) messages per update operation. We demonstrate experimentally that the performance of DST scales excellently with the network size and activity, making it ideal for the metropolitan environment hybrid networks are expected to operate in.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129103740","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 multicast tree algorithm for ad hoc networks","authors":"A. Penttinen","doi":"10.1109/MAHSS.2004.1392194","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392194","url":null,"abstract":"We propose an efficient heuristic algorithm for multicast tree construction in ad hoc networks. The objective is to connect a source node to a set of destination nodes with a sequence of transmissions so that the number of transmissions is minimized. The algorithm utilizes shortest path information, which can be obtained from unicast routing tables for fully distributed implementation. In addition to multicast routing, the algorithm is applicable to stateless multicast forwarding for small multicast groups.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"785 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122997580","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":"Reliable routing in mobile ad hoc networks based on mobility prediction","authors":"Jian Tang, G. Xue, Weiyi Zhang","doi":"10.1109/MAHSS.2004.1392187","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392187","url":null,"abstract":"Reliability is a major issue in mobile ad hoc routing. Shortest paths are usually used to route packets in mobile ad hoc networks (MANET) However, a shortest path may fail quickly, because some of the wireless links on the shortest path may be broken shortly after the path is established due to mobility of mobile nodes. Rediscovering routes can result in substantial data loss and communication overheads. We consider a MANET in the urban environment. We formulate and study two optimization problems related to reliable routing in MANET. In the minimum cost duration-bounded path (MCDBP) routing problem, we seek a minimum cost source to destination path with duration no less than a given threshold. In the maximum duration cost-bounded path (MDCBP) routing problem, we seek a maximum duration source to destination path with cost no greater than a given constraint. We use a waypoint graph to model the working area of a MANET and present an offline algorithm to compute a duration prediction table for the given waypoint graph. An entry in the duration prediction table contains the guaranteed worst-case duration of the corresponding wireless link. We then present an efficient algorithm which computes a minimum cost duration-bounded path, using the information provided in the duration prediction table. We also present an heuristic algorithm for the MDCBP routing problem. Our simulation results show that our mobility prediction based routing algorithms lead to better network throughput and longer average path duration, compared with the shortest path algorithm.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114651210","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}