@inproceedings {27373,
	title = {Lessons Learned on Research Co-Creation: Making Industry-Academia Collaboration Work},
	journal = {The 46th Euromicro Conference on Software Engineering and Advanced Applications (SEAA)},
	year = {2020},
	publisher = {Euromicro},
	author = {Marijan, Dusica and Gotlieb, Arnaud},
	editor = {IEEE, }
}
@inproceedings {27372,
	title = {Neural Network Classification for Improving Continuous Regression Testing},
	journal = {The IEEE Second International Conference On Artificial Intelligence Testing (AITest 2020)},
	year = {2020},
	publisher = { IEEE},
	author = {Marijan, Dusica and Gotlieb, Arnaud and Sapkota, Abhijeet},
	editor = {IEEE, }
}
@inproceedings {26562,
	title = {Challenges of Testing Machine Learning Based Systems},
	journal = {Proceedings of the 1st IEEE Artificial Intelligence Testing Conference (AI Test 2019)},
	year = {2019},
	publisher = { IEEE},
	address = {San Francisco, CA, USA},
	author = {Marijan, Dusica and Gotlieb, Arnaud and Mohit Kumar {Ahuja}},
	editor = {IEEE, }
}
@inproceedings {25273,
	title = {Optimal Delay Constrained Offloading for Vehicular Edge Computing Networks},
	journal = {2017 IEEE International Conference on Communications (ICC)},
	year = {2017},
	publisher = {IEEE},
	abstract = {The increasing number of smart vehicles and their resource hungry applications pose new challenges in terms of computation and processing for providing reliable and efficient vehicular services. Mobile Edge Computing (MEC) is a new paradigm with potential to improve vehicular services through computation offloading in close proximity to mobile vehicles. However, in the road with dense traffic flow, the computation limitation of these MEC servers may endanger the quality of offloading service. To address the problem, we propose a hierarchical cloud-based Vehicular Edge Computing (VEC) offloading framework, where a backup computing server in the neighborhood is introduced to make up for the deficit computing resources of MEC servers. Based on this framework, we adopt a Stackelberg game theoretic approach to design an optimal multilevel offloading scheme, which maximizes the utilities of both the vehicles and the computing servers. Furthermore, to obtain the optimal offloading strategies, we present an iterative distributed algorithm and prove its convergence. Numerical results indicate that our proposed scheme greatly enhances the utility of the offloading service providers.},
	isbn = {978-1-4673-8999-0},
	issn = {1938-1883},
	doi = {10.1109/ICC.2017.7997360},
	author = {Zhang, Ke and Mao, Yuming and Leng, Supeng and Maharjan, Sabita and Zhang, Yan},
	editor = {IEEE, }
}
@inproceedings {25464,
	title = {RCIA: Automated Change Impact Analysis to Facilitate a Practical Cancer Registry System},
	journal = {The International Conference on Software Maintenance and Evolution (ICSME)},
	year = {2017},
	pages = {603-612},
	publisher = {IEEE},
	abstract = {The Cancer Registry of Norway (CRN) employs a cancer registry system to collect cancer patient data (e.g., diagnosis and treatments) from various medical entities (e.g., clinic hospitals). The collected data are then checked for validity (i.e., validation) and assembled as cancer cases (i.e., aggregation) based on more than 1000 cancer coding rules in the system. However, it is frequent in practice that the collected cancer data changes due to various reasons (e.g., different treatments) and the cancer coding rules can also change/evolve due to new medical knowledge. Thus, such a cancer registry system requires an efficient means to automatically analyze these changes and provide consequent impacts to medical experts for further actions. This paper proposes an automated Rule-based Change Impact Analysis (CIA) approach named RCIA that includes: 1) a change classification to capture the potential changes that can occur at CRN; 2) in total 80 change impact analysis rules including 50 dependency rules and 30 impact rules; and 3) an efficient algorithm to analyze changes and produce consequent impacts. We evaluate RCIA via a case study with 12 real change sets from CRN and a conducted interview. The results showed that RCIA managed to produce 100\% actual change impacts and the medical expert at CRN is quite positive to apply RCIA to facilitate their cancer registry system. We also shared a set of lessons learned based on the collaboration with CRN.\&nbsp;},
	author = {Wang, Shuai and Schwitalla, Thomas and Yue, Tao and Ali, Shaukat and Nyg{\r a}rd, Jan},
	editor = {IEEE, }
}
@inproceedings {Simula.simula.2512,
	title = {LEDBAT-MP - on the Application of Lower-Than-Best-Effort for Concurrent Multipath Transfer},
	journal = {Proceedings of the 4th International Workshop on Protocols and Applications with Multi-Homing Support (PAMS)},
	year = {2014},
	month = {May},
	publisher = {IEEE},
	type = {Workshop},
	address = {Victoria, British Columbia/Canada},
	abstract = {The Internet is based on best effort communication, i.e. it tries to deliver packets but does not provide any guarantees. A transport protocol can make use of this best effort service to provide a suitable service to its applications. Also, its congestion control is responsible for a fair distribution of the resources within the Internet. However, background data transfer applications (like file sharing or update fetching) do not require \&quot;best effort\&quot;; they in fact could use a \&quot;lower-than-best-effort\&quot; service to leave resources to more important applications if needed. For this purpose, the Low Extra Delay Background Transport (LEDBAT) algorithm has been standardized by the IETF. Nowadays, multi-homing is becoming increasingly common in modern networks and several approaches to exploit this feature (e.g. CMT-SCTP, MPTCP) have evolved that are able to combine resources of multiple paths. For background traffic oriented algorithms like LEDBAT, this feature could be of great use, too, i.e. by increasing the overall bandwidth while shifting the transmission away from paths which are used by other flows. This could be particularly useful for non-critical bulk transfers in data centers. In this paper, we introduce our approach LEDBAT for Multi-Path - denoted as LEDBAT-MP - and analyse its performance by simulations. With this paper, we want to highlight some generic design questions and start a discussion on how a solid universal background multi-path congestion control strategy should behave.},
	keywords = {Workshop},
	author = {Adhari, Hakim and Dreibholz, Thomas and Werner, Sebastian and Rathgeb, Erwin},
	editor = {IEEE, }
}
@inproceedings {Simula.simula.2726,
	title = {Transmission of Correlated Gaussian Sources With Opportunistic Interference},
	journal = {Wireless Communications and Networking Conference (WCNC)},
	year = {2014},
	month = {April},
	publisher = {IEEE},
	type = {1},
	abstract = {Interfering transmissions of independent sources is shown to provide benefits at a cost of complex receiver design. In this paper, we study the optimum transmission of correlated Gaussian sources by allowing opportunistic interference in order to minimize the expected distortion. We assume a successive interference cancellation decoder at the destination and consider a Wyner-Ziv type setup to transmit the correlated sources along with interference. We show how interference can be utilized to improve the end-to-end distortion for correlated sources.},
	author = {Alay, {\"O}zg{\"u} and Argyriou, Antonios},
	editor = {IEEE, }
}
@inproceedings {DSRE2013,
	title = {Evidence Management for Evolutionary Safety Assurance and Certification},
	journal = {21st International Requirements Engineering Conference},
	year = {2013},
	pages = {385-388},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Safety assurance and certification are amongst the most expensive and time-consuming activities in the development of safety-critical systems. Deeming a system to be safe involves gathering convincing evidence to argue the safe operation of the system, usually according to the requirements of some safety standard. To handle large collections of safety evidence effectively, practitioners need knowledge of how to classify different types of evidence, how to structure the evidence to show fulfilment of standards\&$\#$39; requirements, and how to assess the evidence. However, the notion of evidence is vague and safety standards\&acute; requirements can be ambiguous and difficult to understand. Major problems also arise when a system evolves, as the body of safety evidence has to be adequately maintained in order to ensure system safety and allow its demonstration. In this context, this PhD aims to propose a framework for safety evidence management in evolutionary scenarios. The thesis work will concentrate on devising a model-based and customizable infrastructure for storage, manipulation, reuse, and analysis of evolving safety evidence. The infrastructure will be developed and evaluated in the scope of OPENCOSS, a large-scale European research project.},
	doi = {10.1109/RE.2013.6636761 },
	author = {Nair, Sunil},
	editor = {IEEE, }
}
@inproceedings {Simula.simula.1748,
	title = {Symbolic Path-Oriented Test Data Generation for Floating-Point Programs},
	journal = {Proc. of Int. Conf. on Soft. Testing, Validation and Verification (ICST{\textquoteright}2013) - 10 pages},
	year = {2013},
	month = {March},
	publisher = {IEEE},
	type = {Conference},
	address = {Luxembourg},
	author = {Bagnara, Roberto and Carlier, Matthieu and Gori, Roberta and Gotlieb, Arnaud},
	editor = {IEEE, }
}
@inproceedings {Simula.simula.2178,
	title = {Test Case Prioritization for Continuous Regression Testing: an Industrial Case Study},
	journal = {Proceedings of the International Conference on Software Maintenance (ICSM)},
	year = {2013},
	publisher = {IEEE},
	type = {1},
	address = {Eindhoven},
	author = {Marijan, Dusica and Gotlieb, Arnaud and Sen, Sagar},
	editor = {IEEE, }
}
@inproceedings {Simula.simula.2622,
	title = {Test Generation for Robotized Paint Systems Using Constraint Programming in a Continuous Integration Environment},
	journal = {IEEE ICST 2013  (2 pages)},
	year = {2013},
	month = {April},
	pages = {489-290},
	publisher = {IEEE},
	type = {Conference},
	address = {Luxembourg},
	author = {Mossige, Morten and Gotlieb, Arnaud and Meling, Hein},
	editor = {IEEE, }
}
@inproceedings {Simula.simula.1768,
	title = {Hybrid Spectrum Access in Cognitive Neighborhood Area Networks in the Smart Grid},
	journal = {IEEE WCNC 2012},
	year = {2012},
	publisher = {IEEE},
	type = {Conference},
	author = {Yu, Rong},
	editor = {IEEE, }
}
@inproceedings {Simula.simula.2168,
	title = {A Review of Two Experiences From Applying Model Based Testing in Practice},
	journal = {International Symposium on Software Reliability Engineering Workshops (ISSREW)},
	year = {2012},
	publisher = {IEEE},
	type = {1},
	address = {Dallas, TX},
	author = {Marijan, Dusica},
	editor = {IEEE, }
}
@inproceedings {Simula.simula.870,
	title = {Distributed Spectrum Sensing in Cognitive Radio Networks With Fairness Consideration: Efficiency of Correlated Equilibrium},
	journal = {IEEE 8th International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS)},
	year = {2011},
	month = {October},
	pages = {540-549},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Cooperative spectrum sensing improves the relia- bility of detection. However, if the secondary users are selfish, they may not collaborate for sensing. In order to address this problem, Medium Access Control (MAC) protocols can be designed to enforce cooperation among secondary users for spectrum sensing. In this paper, we investigate this problem using game theoretical framework. We introduce the concept of correlated equilibrium for the cooperative spectrum sensing game among non-cooperative secondary users and formulate the optimization problem for the case where secondary users have heterogeneous traffic dynamics. We show that the correlated equilibrium improves the system utility, as compared to the mixed strategy Nash equilibrium. While maximizing system payoff is important, fairness is also equally important in systems with dissimilar users. In order to address fairness issue, we propose a new fair social welfare correlated equilibrium, which maximizes the system utility and ensures that the less well-off users do not starve. We employ a no-regret learning algorithm for distributed implementation of the correlated equilibrium. Finally, we propose a neighbourhood based learning algorithm and show that it achieves better performance than the no-regret algorithm.},
	keywords = {Conference},
	isbn = {978-0-7695-4469-4},
	author = {Maharjan, Sabita and Zhang, Yan and Yuen, Chau and Gjessing, Stein},
	editor = {IEEE, }
}
@inproceedings {gronsund-et-al-globecom-2011,
	title = {Evaluation of Interference Requirements in a Sensor Aided Cognitive Radio System},
	journal = {54th IEEE Global Communications Conference (GLOBECOM)},
	year = {2011},
	month = {December},
	publisher = {IEEE},
	type = {Conference},
	abstract = {To better exploit the spectrum resources a wireless sensor network can be used to assists a secondary cognitive radio network by providing information about the current primary spectrum occupancy. In this paper we study the performance of the secondary network when it is co-located with and having similar cell size as a mobile primary network that uses a cellular reuse pattern with seven frequencies. Especially we study how relaxed requirements for the maximum interference generated by the cognitive radios affect the performance of the secondary and primary network in terms of throughput, packet loss, delay, coverage and connectivity. We show that it is possible to find interference limits for the cognitive radio that allow full throughput and coverage for the secondary system at the cost of a slight reduction in throughput and an increase in packet loss per user of 2\% on average for the primary system.},
	author = {P{\r a}l Rolfsen {Gr{\o}nsund} and Gr{\o}ndalen, Ole},
	editor = {IEEE, }
}
@inproceedings {Simula.simula.716,
	title = {A Model-Driven Engineering Approach to Support the Verification of Compliance to Safety Standards},
	journal = {22th IEEE International Symposium on Software Reliability Engineering (ISSRE 2011)},
	year = {2011},
	pages = {30-39},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Certification of safety-critical systems according to well-recognised standards is the norm in many industries where the failure of such systems can harm people or the environment. Certification bodies examine such systems, based on evidence that the system suppliers provide, to ensure that the relevant safety risks have been sufficiently mitigated. The evidence is aimed at satisfying the requirements of the standards used for certification, and naturally a key prerequisite for effective collection of evidence, is that the supplier be aware of these requirements and the evidence they require. This often proves to be a very challenging task because of the sheer size of the standards and the fact that the textual standards are amenable to subjective interpretation. In this paper, we propose an approach based on UML profiles and model-driven engineering. It addresses not only the above challenge but also enables the automated verification of compliance to standards based on evidence. Specifically, a profile is created, based on a conceptual model of a given standard, which provides a succinct and explicit interpretation of the underlying standard. The profile is augmented with constraints that help system suppliers with establishing a relationship between the concepts in the safety standard of interest and the concepts in the application domain. This in turn enables suppliers to demonstrate how their system development artifacts achieve compliance to the standard. We illustrate our approach by showing how the concepts in the domain of sub-sea control systems can be aligned with the evidence requirements in the IEC61508 standard, which is one of the most commonly used certification standard for control systems.},
	isbn = {978-0-7695-4568-4},
	author = {Rajwinder Kaur {Panesar-Walawege} and Sabetzadeh, Mehrdad and Briand, Lionel},
	editor = {IEEE, }
}
@inproceedings {gronsund-et-al-pimrc-2011,
	title = {Performance of a Sensor Network Aided Cognitive Radio System},
	journal = {22th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)},
	year = {2011},
	month = {September},
	publisher = {IEEE},
	type = {Conference},
	abstract = {A Sensor Network Aided Cognitive Radio Network uses the concept of a wireless sensor network that assists a cognitive radio network by providing information about the current primary spectrum occupancy. In this paper we study the performance of the cognitive network for various cell sizes and transmit power levels when deployed co-located with a mobile primary system that uses a cellular reuse pattern with seven frequencies. Co-location of secondary and primary base stations has been found to be very important in order to reduce network costs. An expression for the degree of co-location of secondary and primary base stations is derived and used for identifying optimal secondary cell sizes. For these optimal secondary cell sizes, we determine the performance in terms of throughput, packet loss, delay, coverage and connectivity when using spectrum holes in the space, time and frequency domains. Especially, we {fi}nd that cell size and transmit power levels are crucial for secondary system performance, and that smaller cell sizes and less expensive base stations for the secondary system such as WiFi access points and femto-cells is beneficial.},
	author = {P{\r a}l Rolfsen {Gr{\o}nsund} and Gr{\o}ndalen, Ole},
	editor = {IEEE, }
}
@inproceedings {Simula.simula.868,
	title = {Sensing-Delay Tradeoff for Communication in Cognitive Radio Enabled Smart Grid},
	journal = {2nd IEEE International Conference on Smart Grid Communications - SmartGridComm 2011},
	year = {2011},
	month = {October},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Smart grid is widely considered to be the next gen- eration of power grid, which will be integrated with information feedback communication to improve agility, reliability, efficiency and security. One of the key foundations of smart grid is timely access to meter data via reliable communication infrastructure. In this paper, we introduce cognitive radio into home area networks of smart grid, whose framework and result can be trivially extended to neighborhood and wide area networks. By means of spectrum sensing and channel switching techniques, smart meters can decide to transmit meter data either on the original unlicensed channel or the additional licensed channel, in order to improve reliability and timeliness. We find optimal sensing time to reduce packet loss rate and delay, under the constraint that the PU is sufficiently protected. We formulate the sensing-delay tradeoff problem and prove that it has unique optimal sensing time which yields the minimum delay. Simulation results are provided, which match very well with the theoretical results.},
	isbn = {978-1-4577-1704-8},
	doi = {10.1109/SmartGridComm.2011.6102309},
	author = {Deng, Ruilong and Maharjan, Sabita and Cao, Xianghui and Chen, Jiming and Zhang, Yan and Gjessing, Stein},
	editor = {IEEE, }
}
@inproceedings {Simula.simula.279,
	title = {On Update Rate-Limiting in BGP},
	journal = {IEEE International Conference on Communications ICC 2011},
	year = {2011},
	month = {June},
	pages = {1-6},
	publisher = {IEEE},
	type = {Conference},
	abstract = {In order to reduce the number of BGP updates that routers need to process, it is common to rate-limit such updates using a timer that specifies the minimum time between two consecutive updates for a given destination prefix. Rate-limiting plays an important role in determining the number of routing updates that are generated after a routing event, and the time it takes before the network converges to a new stable state. Still, there are few guidelines for how rate-limiting timers should be configured in order to achieve the desired convergence properties. This work takes a first step in this direction, by exploring how different rate-limiting implementations and configurations affect the resulting churn level in a live BGP session. Measurements are performed on multiple parallel BGP sessions to a stub AS, configured with and without rate-limiting timers. We find that the daily rate of updates is reduced by two thirds when configuring the timer to the default value recommended by BGP standards. We further investigate different rate-limiting implementations and configurations using the measured BGP update patterns on emulated BGP sessions, and find that increasing the rate-limiting timer gives a logarithmic decrease in churn. Finally, using BGP update traces from RouteViews, we present the first empirical model that quantifies the impact of rate-limiting in terms of churn reduction given the observed arrival pattern of BGP updates.},
	isbn = {978-1-61284-232-5},
	doi = {10.1109/icc.2011.5962884},
	author = {Elmokashfi, Ahmed and Kvalbein, Amund and Cicic, Tarik},
	editor = {IEEE, }
}
@inproceedings {Simula.simula.524,
	title = {Delay Reduction for Real Time Services in IEEE 802.22 Wireless Regional Area Network},
	journal = {The 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2010)},
	year = {2010},
	month = {September 2010},
	pages = {1836-1841},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Real time traffic such as voice and video have strict requirements on the acceptable end-to-end packet delay. When there are different types of traffic with different requirements on tolerable latency, priority based packet scheduling schemes are normally used in order to reduce the queuing delay for real time services. However, in cognitive radio networks, the time that the system spends on spectrum sensing adds further delay to the packet transmission. In this paper, we propose a new scheme to significantly reduce the overall packet delay, including the delay due to sensing for real time services in cognitive radio networks. We derive the expression for average packet delay for the proposed scheme and the simulation results match well with the analytical results. The numerical results show that the priority based scheduling scheme combined with our scheme substantially reduces the packet delay for real time applications.},
	isbn = {978-1-4244-8017-3},
	doi = {10.1109/PIMRC.2010.5671631},
	author = {Maharjan, Sabita and Xiang, Jie and Zhang, Yan and Gjessing, Stein},
	editor = {IEEE, }
}
@inproceedings {Simula.simula.584,
	title = {Distributed Spectrum Sensing for Cognitive Radio Networks With Heterogeneous Traffic (Invited Paper)},
	journal = {3rd International Workshop on Cognitive Radio and Advanced Spectrum Management},
	year = {2010},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Cooperative spectrum sensing improves reliability and the detection performance of sensing. However, the fully cooperative scenario may not be realistic to assume in many cases. We consider a cognitive radio network with heavy traffic users and light traffic users and analyze their behavior towards sensing using the concept of mixed strategy Nash equilibrium. Further, we design a distributed game using evolutionary game theory such that as long as light traffic users are present, they share the sensing responsibility while heavy traffic users get a free ride. Finally, the evolution dynamics is shown to converge to the evolutionarily stable strategy for the case of multiple users.},
	isbn = {978-1-4244-8132-3},
	author = {Maharjan, Sabita and Zhang, Yan and Gjessing, Stein},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.379,
	title = {Enhancing Video-on-Demand Playout Over Multiple Heterogeneous Access Networks},
	journal = {Consumer Communications and Networking Conference (CCNC)},
	year = {2010},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Multimedia streaming is increasing in popularity and has become one of the dominating services on the Internet today. Even though user devices are often equipped with multiple network interfaces and in reach of several access networks at the same time, media streams are normally communicated over only one of the available Internet connections. In this paper, we explore the challenges and potential benefits of using multiple access networks simultaneously. Exploiting HTTP{\textquoteright}s capability of handling requests for specific byte ranges of a file, we present the implementation of a lightweight, application-layer, on-demand streaming service that requires no changes to existing servers and infrastructure. Based on real-world experiments with a multihomed host, we investigate the potential performance gains of video-on-demand playout. We achieve a bandwidth aggregation efficiency of 90\% when downloading over 3 heterogeneous access networks in parallel. In addition, we analyze the effect of file segmentation on the buffer requirements and the startup latency.},
	isbn = {978-1-4244-5176-0},
	author = {Kaspar, Dominik and Evensen, Kristian and Paal Einar {Engelstad} and Audun Fosselie {Hansen} and Halvorsen, P{\r a}l and Griwodz, Carsten},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.257,
	title = {Cross-Layer Optimized Routing for Wireless Sensor Networks Using Dynamic Programming},
	journal = {the IEEE International Conference on Communications (ICC), ICC 2009},
	year = {2009},
	publisher = {IEEE},
	type = {Conference},
	isbn = {978-1-4244-3435-0},
	author = {Song, L. and Zhang, Yan and Yu, Rong and Yao, W.},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.259,
	title = {Spectrum Handoff in Cognitive Radio Networks: Opportunistic and Negotiated Situations},
	journal = {the IEEE International Conference on Communications (ICC), ICC 2009},
	year = {2009},
	publisher = {IEEE},
	type = {Conference},
	isbn = {978-1-4244-3435-0},
	author = {Zhang, Yan},
	editor = {IEEE, }
}
@inproceedings {Simula.simula.516,
	title = {Yield-Oriented Evaluation Methodology of Network-on-Chip Routing Implementations},
	journal = {SOC{\textquoteright}09 Proceedings of the 11th international conference on System-on-chip},
	year = {2009},
	publisher = {IEEE},
	type = {Conference},
	isbn = {978-1-4244-4466-3},
	doi = {10.1109/SOCC.2009.5335667},
	author = {Samuel Rodrigo {Mocholi} and Hernandez, Carles and Flich, Jos{\'e} and Silla, Federico and Duato, Jose and Medardoni, Simone and Bertozzi, Davide and Mej{\'\i}a, Andres and Dai, Donglai},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.91,
	title = {An Analysis of K-Connectivity in Shadowing and Nakagami Fading Wireless Multi-Hop Networks},
	journal = {the IEEE 67th Vehicular Technology Conference (VTC2008-Spring)},
	year = {2008},
	publisher = {IEEE},
	type = {Conference},
	isbn = {9781424416448},
	author = {Zhang, L. and Soong, B. and Zhang, Yan and Ma, M. and Guan, Y.},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.92,
	title = {Authentication Overhead in Wireless Networks},
	journal = {the IEEE International Conference on Communications (ICC), ICC 2008},
	year = {2008},
	publisher = {IEEE},
	type = {Conference},
	isbn = {978-1-4244-2075-9},
	author = {Zhang, Yan},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.93,
	title = {Call Admission Control in OFDM Wireless Multimedia Networks},
	journal = {the IEEE International Conference on Communications (ICC), ICC 2008},
	year = {2008},
	publisher = {IEEE},
	type = {Conference},
	isbn = {978-1-4244-2075-9},
	author = {Zhang, Yan},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.141,
	title = {Demystifying Spatial White Spaces Using Stochastic Geometry},
	journal = {International Conference on Communications, Circuits and Systems (ICCCAS 2008)},
	year = {2008},
	publisher = {IEEE},
	type = {Conference},
	isbn = {978-1-4244-2063-6},
	author = {Hong, X. and Wang, C. and Thompson, J. and Zhang, Yan},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.94,
	title = {Dynamic Spectrum Access in Cognitive Radio Wireless Networks},
	journal = {the IEEE International Conference on Communications (ICC), ICC 2008},
	year = {2008},
	publisher = {IEEE},
	type = {Conference},
	isbn = {978-1-4244-2075-9},
	author = {Zhang, Yan},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.143,
	title = {Extended Iterative Flipping Algorithm for PAPR Reduction in OFDM Systems},
	journal = {International Conference on Communications and Networking in China (CHINACOM 2008)},
	year = {2008},
	publisher = {IEEE},
	type = {Conference},
	isbn = {978-1-4244-2373-6},
	author = {Zhu, Xiaofei and Zhu, G. and Jiang, T. and Zhang, Yan},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.243,
	title = {Geographic Routing in Wireless Multimedia Sensor Networks},
	journal = {The 2nd International Conference on Future Generation Communication and Networking (FGCN 2008)},
	year = {2008},
	publisher = {IEEE Computer Society},
	type = {Conference},
	isbn = {978-0-7695-3431-2},
	author = {Shu, L. and Zhang, Yan and Yang, L. and Wang, Y. and Hauswirth, M.},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.84,
	title = {Making an SCI Fabric Dynamically Fault Tolerant},
	journal = {Workshop on Communication Architecture for Clusters (CAC 2008)},
	year = {2008},
	month = {April},
	pages = {1-8},
	publisher = {IEEE},
	type = {Conference},
	abstract = {In this paper we present a method for dynamic fault tolerant routing for SCI networks implemented on Dolphin Interconnect Solutions hardware. By dynamic fault tolerance, we mean that the interconnection network reroutes affected packets around a fault, while the rest of the network is fully functional. To the best of our knowledge this is the first reported case of dynamic fault tolerant routing available on commercial off the shelf interconnection network technology without duplicating hardware resources. The development is focused around a 2-D torus topology, and is compatible with the existing hardware, and software stack. We look into the existing mechanisms for routing in SCI. We describe how to make the nodes that detect the faulty component do routing decisions, and what changes are needed in the existing routing to enable support for local rerouting. The new routing algorithm is tested on clusters with real hardware. Our tests show that distributed databases like MySQL can run uninterruptedly while the network reacts to faults. The solution is now part of Dolphin Interconnect Solutions SCI driver, and hardware development to further decrease the reaction time is underway.},
	isbn = {9781424416936},
	author = {H{\r a}kon Kvale {Stensland} and Lysne, Olav and Nordstr{\o}m, Roy and Kohmann, Hugo},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.245,
	title = {NetTopo: Beyond Simulator and Visualizer for Wireless Sensor Networks},
	journal = {The 2nd International Conference on Future Generation Communication and Networking (FGCN 2008)},
	year = {2008},
	publisher = {IEEE Computer Society},
	type = {Conference},
	isbn = {978-0-7695-3431-2},
	author = {Shu, L. and Wu, C. and Zhang, Yan and Chen, J. and Wang, L. and Hauswirth, M.},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.247,
	title = {A Novel Multi-Channel MAC Scheme for Vehicular Ad Hoc Networks},
	journal = {First International Conference on Wireless Access in Vehicular Environments (WAVE 2008)},
	year = {2008},
	publisher = {IEEE VTS},
	type = {Conference},
	isbn = {1424434483},
	author = {Wang, Q. and Fu, H. and Zhang, Yan},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.163,
	title = {Optimal Rate Routing in Wireless Sensor Networks With Guaranteed Lifetime},
	journal = {IEEE Global Communications Conference (IEEE GLOBECOM 2008)},
	year = {2008},
	publisher = {IEEE},
	type = {Conference},
	isbn = {978-1-4244-2324-8},
	author = {Xu, W. and Chen, J. and Zhang, Yan and Xiao, Y. and Sun, Y.},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.72,
	title = {Relaxed Multiple Routing Configurations for IP Fast Reroute},
	journal = {IEEE/IFIP Network Operations and Management Symposium (NOMS{\textquoteright}08)},
	year = {2008},
	month = {April},
	publisher = {IEE},
	type = {Conference},
	abstract = {Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). First, it can support guaranteed, instantaneous recovery from any link or node failure. Second, different failures result in routing over different network topologies, which augments the parameter space for load distribution optimizations. Multiple Routing Configurations (MRC) is the state-of-the-art IP FRR scheme based on multi-topology routing today. In this paper we present a new, enhanced IP FRR scheme which we call {\textquotedblleft}relaxed MRC{\textquotedblright} (rMRC). rMRC simplifies the topology construction and increases the routing flexibility in each topology. According to our experimental evaluation, rMRC has several benefits compared to MRC. The number of backup topologies required to provide protection against the same set of failures is reduced, hence reducing state in routers. In addition, the backup paths are shorter, and the link utilization is significantly better.},
	isbn = {978-1-4244-2066-7},
	author = {Cicic, Tarik and Audun Fosselie {Hansen} and Kvalbein, Amund and Hartmann, Matthias and Martin, R"udiger and Menth, Michael},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.145,
	title = {Revenue-Based Admission Control for Cognitive Radio Cellular Systems},
	journal = {2008 International Workshop on Cognitive Networks and Communications (COGCOM 2008), in conjunction with CHINACOM 2008},
	year = {2008},
	publisher = {IEEE VTS},
	type = {Workshop},
	isbn = {978-1-4244-2373-6},
	author = {Xie, Lang and Xiang, Jie and Zhang, Yan},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.95,
	title = {Utility-Based Weighted Prioritization in Heterogeneous Wireless Networks},
	journal = {the IEEE International Conference on Circuits \& Systems for Communications (ICCSC), ICCSC 2008},
	year = {2008},
	publisher = {IEEE},
	type = {Conference},
	isbn = {978-1-4244-1708-7},
	author = {Zhang, Yan and Soong, B. and Zhang, L.},
	editor = {IEEE, }
}
@inproceedings {Zhang.2007.2,
	title = {Call Admission Control in Wireless Networks Over Rayleigh Fading Channel},
	journal = {IEEE Wireless Communications and Networking Conference (WCNC), WCNC{\textquoteright}2007},
	year = {2007},
	pages = {3030-3034},
	publisher = {IEEE},
	type = {Conference},
	isbn = {1-4244-0659-5},
	author = {Zhang, Yan},
	editor = {IEEE, }
}
@inproceedings {Chen.2007.1,
	title = {Cross-Correlation Analysis of Generalized Distributed Antenna Systems With Cooperative Diversity},
	journal = {the 65th IEEE Vehicular Technology Conference (VTC2007-Spring)},
	year = {2007},
	pages = {309-313},
	publisher = {IEEE},
	type = {Conference},
	isbn = {1-4244-0266-2},
	author = {Chen, Y. and Yuen, C. and Zhang, Yan and Zhang, Z.},
	editor = {IEEE, }
}
@inproceedings {Chen.2007.2,
	title = {Diversity Gains of Generalized Distributed Antenna Systems With Cooperative Users},
	journal = {IEEE Wireless Communications and Networking Conference (WCNC), WCNC{\textquoteright}2007},
	year = {2007},
	pages = {798-803},
	publisher = {IEEE},
	type = {Conference},
	isbn = {1-4244-0659-5},
	author = {Chen, Y. and Yuen, C. and Zhang, Yan and Zhang, Z.},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.14,
	title = {Energy and QoS Aware Packet Forwarding in Wireless Sensor Networks},
	journal = {the IEEE International Conference on Communications (ICC), ICC 2007},
	year = {2007},
	pages = {3277-3282},
	publisher = {IEEE},
	type = {Conference},
	isbn = {1-4244-0353-7},
	author = {Yu, Rong and Zhang, Yan and Sun, Z. and Mei, S.},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.7,
	title = {Fast Proactive Recovery From Concurrent Failures},
	journal = {IEEE International Conference on Communications (ICC 2007)},
	year = {2007},
	month = {June},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Recovery of traffic in connectionless pure IP networks has traditionally been handled by a full re-convergence of the network state. This process operates in a time scale that is not compatible with new real time and highly dependable services. Recently, schemes for fast local and proactive recovery in connectionless IP networks have been proposed. All these schemes are designed to guarantee recovery of the failure of one component. As IP protocols are used to carry more highly dependable services and new wireless infrastructures are approaching, guaranteed failure coverage of more than one failure becomes necessary. In this paper we present and evaluate a scheme that guarantees to handle any two concurrent failures in a network. We are not aware of any other schemes that addresses such guarantees. We evaluate and compare it with other known recovery schemes, and we show how it gives substantially better recovery success rates than the schemes designed for one fault tolerance, also for more than two failures.},
	isbn = {1-4244-0353-7},
	author = {Audun Fosselie {Hansen} and Lysne, Olav and Cicic, Tarik and Gjessing, Stein},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.5,
	title = {Handoff Probability in Wireless Networks Over Rayleigh Fading Channel: a Cross-Layer Approach},
	journal = {the IEEE International Conference on Communications (ICC), ICC{\textquoteright}2007},
	year = {2007},
	month = {June},
	pages = {5660-5664},
	publisher = {IEEE},
	type = {Conference},
	isbn = {1-4244-0353-7},
	author = {Zhang, Yan},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.39,
	title = {NetForecast: a Delay Prediction Scheme for Provider Controlled Networks},
	journal = {IEEE Globecom 2007},
	year = {2007},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Over the last years, the Internet has evolved towards becoming the dominant platform for deploying real time and multimedia services. This evolution has had as a consequence that the selection of an appropriate server, proxy or super node with reference to some specific QoS parameter becomes of paramount importance. We consider in our paper the specific case of delay estimation. An investigation of existing approaches for the estimation and prediction of network delay is provided. Based on that, we further suggest NetForecast as a way to overcome limitations of existing prediction methods. NetForecast is an algorithm for delay prediction in provider controlled networks. The algorithm is based on a combination of landmark-based distance estimation, clustering and a triangulation principle. The paper reports on preliminary performance of NetForecast, as provided by a simulation study. Our results show the feasibility of the suggested method.},
	isbn = {N/A},
	author = {Elmokashfi, Ahmed and kleis, Michael and Popescu, Adrian},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.108,
	title = {A Novel Model-Based Indoor Positioning Using Signal Strength},
	journal = {18th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)},
	year = {2007},
	month = {September},
	pages = {1 - 5},
	publisher = {IEEE},
	type = {Conference},
	abstract = {A simple technique to estimate the position of a mobile node inside a building is based on the Received Signal Strength (RSS). In a previous publication, we investigated the feasibility of using circular array antennas and beamforming in order to enable an access point to estimate the position of a mobile inside a building. The approach utilized the two dimensional information (i.e. RSS for various azimuth directions) that is captured in a priori measured radio map. Generating these radio maps is not only extremely labor-intensive and time consuming but also sensitive to changes in the environment and possible source of interference. It would be interesting to find out if a deterministic propagation model such as ray tracing can be used to construct a radio map that effectively replaces the off-line manual measurements. In this paper, we investigate this issue and provide a novel positioning methodology that exhibits acceptable performance without the need for extensive set of measurements in the off-line mode. The performance for various parameters and building model accuracy will be presented and discussed.},
	isbn = {978-1-4244-1144-3},
	author = {Sayrafian-Pour, Kamran and Kaspar, Dominik},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.10,
	title = {Performance Evaluation of RFID Anti-Collision Algorithm With FPGA Implementation},
	journal = {the Second IEEE International Symposium on Pervasive Computing and Ad Hoc Communications (PCAC-07)},
	year = {2007},
	publisher = {IEEE Computer Society Press},
	type = {Conference},
	isbn = {0-7695-2847-3},
	author = {Ning, H. and Cong, Y. and Xu, Z. and Hong, T. and Zhao, J. and Zhang, Yan},
	editor = {IEEE, }
}
@inproceedings {Zhang.2007.3,
	title = {Performance Modeling of Energy Management Mechanism in IEEE 802.16e Mobile WiMAX},
	journal = {IEEE Wireless Communications and Networking Conference (WCNC), WCNC{\textquoteright}2007},
	year = {2007},
	pages = {3205-3209},
	publisher = {IEEE},
	type = {Conference},
	isbn = {1-4244-0659-5},
	author = {Zhang, Yan},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.12,
	title = {Quantitative Analysis of Location Management and QoS in Wireless Mobile Networks},
	journal = {the IEEE 21st International Conference on Advanced Information Networking and Applications (AINA-07)},
	year = {2007},
	pages = {573-579},
	publisher = {IEEE Computer Society Press},
	type = {Conference},
	isbn = {0-7695-2846-5},
	author = {Zhang, Yan and Laurence T. {Yang} and Ma, J. and Zhang, Jin and Xiao, S.},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.38,
	title = {Queueing Analysis of OFDM Subcarrier Allocation in Wireless Multimedia Networks},
	journal = {IEEE International Symposium on Wireless Communication Systems 2007 (IEEE ISWCS{\textquoteright}07)},
	year = {2007},
	pages = {81-85},
	publisher = {IEEE},
	type = {Conference},
	isbn = {978-1-4244-0979-2},
	author = {Zhang, Yan and Chen, Y.},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.34,
	title = {Redundant Trees for Fast IP Recovery},
	journal = {Broadnets 2007},
	year = {2007},
	month = {Sept.},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Slow convergence of IP routing in case of network component failures represents a problem for emerging time-critical network applications. It has motivated work on IP fast reroute mechanisms that use local, proactive recovery in order to immediately provide alternative routes for the affected data packets. We present a new mechanism for IP fast recovery called IP Redundant Trees (IPRT). IPRT builds two redundant trees per network destination and pre-calculates backup next hops based on them. Combined with a smart forwarding scheme, IPRT provides proactive, local and loop-free recovery in connectionless IP networks. IPRT is simple and flexible, and requires a low increase of the routing state amount. We evaluate several key performance metrics in IPRT and other actual IP fast recovery proposals and argue that IPRT indeed has very attractive properties.},
	isbn = {0000000},
	author = {Cicic, Tarik and Audun Fosselie {Hansen} and Ole Kristoffer {Apeland}},
	editor = {IEEE, }
}
@inproceedings {Zhang.2007.1,
	title = {A Simple and Effective QoS Differentiation Scheme in IEEE 802.16 WiMAX Mesh Networking},
	journal = {IEEE Wireless Communications and Networking Conference (WCNC), WCNC{\textquoteright}2007},
	year = {2007},
	pages = {3216-3220},
	publisher = {IEEE},
	type = {Conference},
	isbn = {1-4244-0659-5},
	author = {Zhang, Yan and Zhang, Jin and Li, W.},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.107,
	title = {Source-Assisted Direction Estimation Inside Buildings},
	journal = {25th IEEE International Conference on Computer Communications (INFOCOM)},
	year = {2006},
	month = {April},
	pages = {1 - 8},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Direction estimation inside buildings is a difficult and challenging task due to severe multipath signal propagation. Numerous algorithms and techniques exist that provide high resolution direction estimation under certain conditions and channel models; however, to our knowledge they all perform poorly at indoor environments. Here, we propose a technique that enables a receiver to achieve greater reliability in estimating source direction through some collaboration with the source. We assume that the receiver and the transmitter are synchronized and they are equipped with circular phased array antennas that have beamforming capability. If the transmitter-receiver pair always steer their main lobes into opposite directions, the spatial spectrum of the received power can be used as a mean for estimating the direction of the transmitting source. In this paper, we investigate the feasibility of this methodology, and show the achieved improvement.},
	isbn = {1-4244-0221-2},
	author = {Sayrafian-Pour, Kamran and Kaspar, Dominik},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.106,
	title = {Indoor Positioning Using Spatial Power Spectrum},
	journal = {16th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)},
	year = {2005},
	pages = {2722 - 2726},
	publisher = {IEEE},
	type = {Conference},
	abstract = {A simple technique to estimate the position of a given mobile source inside a building is based on the received signal strength. For this methodology to have a reasonable accuracy, radio visibility of the mobile by at least three access points is required. To reduce the number of the required access points and therefore, simplify the underlying coverage design problem, we propose a new scheme that takes into account the distribution of RF energy around the receiver. In other words, we assume that the receiver is equipped with a circular antenna with beamforming capability. In this way, the spatial spectrum of the received power can be measured by rotating the antenna beam around the 360-degree field of view. This spatial spectrum can be used by a single receiver as a mean for estimating the position of a mobile transmitter. In this paper, we investigate the feasibility of this methodology, and show the improvement achieved in the positioning accuracy.},
	isbn = {9783800729098},
	author = {Sayrafian-Pour, Kamran and Kaspar, Dominik},
	editor = {IEEE, }
}
@inproceedings {Vik.2004.2,
	title = {Quality of Service-Aware Source-Initiated Ad-Hoc Routing},
	journal = {IEEE Sensor and Ad-hoc Networks Conference (SECON)},
	year = {2004},
	month = {October},
	pages = {108-117},
	publisher = {IEEE},
	type = {Conference},
	edition = {First},
	abstract = {Desirable features of routing protocols for Mobile Ad Hoc Networks (MANETs) include ability to adapt to changing network conditions due to mobility and provide quality control mechanisms during the life time of a route. Current routing protocols that provide Quality of service (QoS) for MANETs have proposed routing based on a single QoS metric. This paper proposes a QoS aware source initiated ad-hoc routing protocol (QuaSAR) that adds quality control to all the phases of an on-demand routing protocol. QuaSAR gathers information about battery power, signal strength, bandwidth and latency during route discovery and uses in route choosing. Additionally, our approach has proactive route maintenance features in addition to the reactive maintenance. We conducted simulation experiments using ns-2 network simulator and compared our results with Dynamic Source Routing (DSR). Our performance results demonstrate that our technique has increased throughput and packet delivery ratio.},
	isbn = {0-7803-8796-1},
	author = {Vik, Knut-Helge and Medidi, Sirisha},
	editor = {IEEE, }
}
