{"title":"Improving energy savings in power adaptive broadcasting in MANETs","authors":"Mehmet Baysan, Saipriya Gowdamachandran, K. Saraç","doi":"10.1109/BROADNETS.2004.44","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.44","url":null,"abstract":"Network wide broadcast is a frequently used operation in mobile ad hoc networks (MANETs). Many unicast protocols including dynamic source routing (DSR) and ad hoc on-demand distance vector (AODV) protocol use broadcast to discover the unicast routes toward destinations. In addition, depending on the application, broadcast can be used to deliver actual data packets to all the nodes in the network. Nodes in MANETs work with limited battery power and the efficient utilization of this power is important for increasing the lifetime of the individual nodes as well as the overall network. As a result, it is important to utilize energy efficient algorithms in achieving network wide broadcast in MANETs. In this poster paper, the authors improve the energy efficiency in power adaptive broadcast using local information. In this proposal, the authors introduce an improved algorithm for deciding the transmission power level. The paper also attempts to further increase the energy savings by reducing the redundant transmission by including an efficient forward node set at the selection algorithm.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"64 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":"126766163","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 data aggregation quality and energy efficiency of wireless sensor network protocols - extended summary","authors":"Tri Pham, Eun Jik Kim, M. Moh","doi":"10.1109/BROADNETS.2004.51","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.51","url":null,"abstract":"In-network data gathering and data fusion are essential for the efficient operation of wireless sensor networks. While most existing data gathering routing protocols addressed the issue of energy efficiency, few of them, however, have considered the quality of the implied data aggregation process. In this work, an information model for sensed data is first formulated. A new metric for evaluating data aggregation process, data aggregation quality (DAQ), is formally derived. DAQ does not assume any prior knowledge on values or on statistical distributions of sensing data, and may be applied to most data gathering protocols. Next, two new protocols are proposed: the enhanced LEACH and the clustered PEGASIS, enhanced from two major existing protocols: the cluster-based LEACH and the chain-based PEGASIS. By carefully accounting for listening energy, energy efficiency of all four protocols is evaluated. In addition, DAQ is applied to evaluate their data aggregation process. It is found that, while chain-based protocols are more energy efficient than cluster-based protocols, they however suffer from poor data aggregation quality. DAQ may be readily applied to most of continuous data gathering protocols; it is therefore significant to future development of sensor network protocols.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"34 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":"127704357","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":"Survivable mapping algorithm by ring trimming (SMART) for large IP-over-WDM networks","authors":"M. Kurant, Patrick Thiran","doi":"10.1109/BROADNETS.2004.79","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.79","url":null,"abstract":"We develop a fast and efficient algorithm that finds a survivable (i.e., robust to single fiber failures) mapping of IP topology on the mesh of fibers in IP-over-WDM networks; we call it SMART. A number of algorithms solving this problem can be found in the literature. Since ILP solutions are highly complex, many heuristics were proposed. They usually start with some initial mapping and then try to gradually improve it. This involves the evaluation of the entire topology at each iteration, which is costly for large topologies. We propose a different approach. The SMART algorithm breaks down the task into a set of independent and very simple subtasks. The combination of solutions of these subtasks is a survivable mapping. This is why SMART is orders of magnitude faster than other proposals, especially when dealing with large topologies. We also extend the SMART algorithm to obtain a mapping resilient to fiber span failures, node failures and double-link failures. Finally, we show that the scalability of the standard heuristic approaches is additionally limited (contrary to SMART) when applied to double-link failures.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"11 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":"130402045","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":"Capacity-efficient protection with fast recovery in optically transparent mesh networks","authors":"Sun-il Kim, S. Lumetta","doi":"10.1109/BROADNETS.2004.22","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.22","url":null,"abstract":"Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is exacerbated by the higher data rates available in optical networks. It is therefore imperative to address network survivability in an efficient manner in order to design and operate reliable networks. Transparent optical networks (TONs) provide several advantages over optically opaque networks for supporting the growing communication demands, but suffer from several drawbacks that reduce the efficacy of most applicable capacity-efficient survivability techniques. In this paper, we introduce a novel protection algorithm (for single link and node failures) called streams. The streams algorithm is similar to 1:1 dedicated path protection in terms of implementation and operation overhead, and has identical recovery speeds while requiring less capacity. We compare the streams algorithm with dedicated and shared path protection in terms of capacity requirements, path lengths, and recovery time. We also extend the flooding based mesh restoration algorithm (FBMR) in order to provide a fair comparison in online routing scenarios, and report the relative tradeoffs between the different algorithms. Our results show that dynamically routed streams offer attractive tradeoffs in terms of capacity, path length, recovery speed, data loss and implementation complexity.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"83 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":"133108226","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":"PeterNet: an emergent technology based radio access network architecture for next generation cellular wireless systems","authors":"Samik Ghosh, P. De, K. Basu, Sajal K. Das","doi":"10.1109/BROADNETS.2004.63","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.63","url":null,"abstract":"For next generation wireless cellular networks, the radio access network (RAN) component is destined to evolve into a high-capacity, flexible and reconfigurable network architecture supporting smaller cell sites and newer technologies. Based on the well-known Petersen graph, in this paper we propose a RAN architecture, named PeterNet, that interconnects the network elements in a mesh topology. Focusing on optical wireless as the underlying transmission technology, we analyze our architecture on two key indices - carrier-class network reliability (99.999%) and infrastructure cost - providing comparative performance analysis with existing tree/star and regular grid networks. Furthermore, we generalize our architecture to what we call, the GPeterNet, which allows dynamic reconfiguration and redesign of the access network while leveraging the underlying salient features.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"19 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":"133291824","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":"Diverse routing for shared risk resource groups (SRRG) failures in WDM optical networks","authors":"P. Datta, Arun Kumar Somani","doi":"10.1109/BROADNETS.2004.34","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.34","url":null,"abstract":"Failure resilience is one of the desired features of the Internet. Most of the traditional restoration architectures are based on single-failure assumption which is unrealistic. Multiple link failure models, in the form of shared-risk link groups (SRLG's) and shared risk node groups (SRNG's) are becoming critical in survivable optical network design. We classify both these form of failures under a common heading of shared-risk resource groups (SRRG) failures. In our research, we propose graph transformation techniques for tolerating multiple failures arising out of shared resource group (SRRG) failures. Diverse routing in such multi-failure scenario essentially necessitates finding out two paths between a source and a destination that are SRRG disjoint. The generalized diverse routing problem has been proved to be NP-complete. The proposed transformation techniques however provide a polynomial time solution for certain restrictive failure sets. We study how restorability can be achieved for dependent or shared risk link failures and multiple node failures and prove the validity of our approach for different network scenarios.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"11 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":"123966144","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 scalable algorithm for survivable routing in IP-over-WDM networks","authors":"F. Ducatelle, L. Gambardella","doi":"10.1109/BROADNETS.2004.11","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.11","url":null,"abstract":"In IP-over-WDM networks, a logical IP network has to be routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call a routing survivable if the connectivity of the logical network is guaranteed in case of a failure in the physical network. In this paper we describe FastSurv, a local search algorithm which can provide survivable routing in the presence of physical link failures. The algorithm can easily be extended for the case of node failures and multiple simultaneous link failures. In a large series of test runs, we show that FastSurv is much more scalable with respect to the number of nodes in the network than current state-of-the-art algorithms, both in terms of solution quality and run time.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"13 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":"116997686","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 simple mechanism on MAC layer to improve the performance of IEEE 802.11 DCF","authors":"Chonggang Wang, W. Tang, K. Sohraby, Bo Li","doi":"10.1109/BROADNETS.2004.13","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.13","url":null,"abstract":"Based on the current standardized IEEE 802.11 distributed coordination function (DCF) protocol, this paper proposes a new efficient collision resolution mechanism, called GDCF. Our main motivation is based on the observation that 802.11 DCF decreases the contention window to the initial value after each success transmission, which essentially assumes that each successful transmission is an indication that the system is under low traffic loading. GDCF takes a more conservative measure by halving the contention window size after c consecutive successful transmissions. This \"gentle\" decrease can reduce the collision probability, especially when the number of competing nodes is large. We compute the optimal value for c, and the numerical results from both analysis and simulation demonstrate that GDCF significantly improve the performance of 802.11 DCF including throughput, fairness, and energy efficiency. In addition, GDCF is flexible for supporting priority access by selecting different values of c for different traffic types; it is very easy to implement it, as it does not requires any changes in control message structure and access procedures in DCF.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","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":"116065051","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":"Performance of IEEE 802.15.4 beacon enabled PAN with uplink transmissions in non-saturation mode - access delay for finite buffers","authors":"J. Misic, V. Mišić, S. Shafi","doi":"10.1109/BROADNETS.2004.61","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.61","url":null,"abstract":"In this work, we derive the probability distribution of access delay and calculate throughput of a personal area network operating under the IEEE standard 802.15.4 in the beacon enabled mode. We model the network using the theory of discrete time Markov chains and M/G/1/K queues. The model considers acknowledged uplink transmission in non-saturation mode, and includes the impact of different parameters such as packet arrival rate, number of stations, the finite size of individual node buffers, packet size, and inactive period between the beacons. Our model also captures the problem of congestion at the beginning of the superframe due to multiple transmissions delayed from the previous superframe. The results show that average access delays, even for small buffer sizes, may be quite high if the throughput exceeds 50%, which can seriously affect applications with delay bounds. Values of throughput larger than 50% can be achieved at the expense of larger buffer sizes, which imposes implementation problems on devices with small memory resources.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"29 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":"123077609","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}
Fanchun Jin, G. Sahin, Amrinder Arora, Hyeong-Ah Choi
{"title":"The effects of the sub-carrier grouping on multi-carrier channel aware scheduling","authors":"Fanchun Jin, G. Sahin, Amrinder Arora, Hyeong-Ah Choi","doi":"10.1109/BROADNETS.2004.85","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.85","url":null,"abstract":"This paper studies the effects of the sub-carrier grouping on the scheduling problem in a wireless network with multiple carriers. In particular, the authors consider the trade-offs between the size of the sub-carrier groups and the link throughput for various sub-carrier grouping models, with each corresponding to a different level of CSI tracking and system design complexity. The paper assumes that a single user is communicating with the base station using the entire sub-carriers. This assumption is motivated by the OFDM, which uses multiple carriers in order to benefit from the frequency selective fading introduced by spreading the information bits over the entire signal band. An offline dynamic programming algorithm for finding an optimal solution for the case of spectrum- and time-perfect estimates is also presented. The performance can potentially be improved by using high-level modulation on the sub-carriers with good channel conditions.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"30 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":"125003298","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}