miun.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Pettersson, Stefan
Publications (10 of 20) Show all publications
Kanter, T., Forsström, S., Kardeby, V., Walters, J., Österberg, P. & Pettersson, S. (2010). Ubiquitous Mobile Awareness from Sensor Networks. In: Enabling Context-Aware Web Services: Methods, Architectures, and Technologies (pp. 449-468). CRC Press
Open this publication in new window or tab >>Ubiquitous Mobile Awareness from Sensor Networks
Show others...
2010 (English)In: Enabling Context-Aware Web Services: Methods, Architectures, and Technologies, CRC Press, 2010, p. 449-468Chapter in book (Other academic)
Abstract [en]

Users require applications and services to be available everywhere, enabling users to focus on what is important to them. Therefore, context information from users (e.g., spatial data, preferences, available connectivity and devices, etc.) needs to be accessible to systems that deliver services via a heterogeneous infrastructure. We present a novel approach to support ubiquitous sensing and availability of context to services and applications. This approach offers a scalable, distributed storage of context derived from sensor networks wirelessly attached to mobile phones and other devices. The support handles frequent updates of sensor information and is interoperable with presence services in 3G mobile systems, thus enabling ubiquitous sensing applications. We demonstrate these concepts and the principle operation in a sample ubiquitous mobile awareness service. The importance of this contribution, in comparison to earlier work, lies in the availability of real-time ubiquitous sensing to both applications on the Internet as well as applications in mobile systems.

Place, publisher, year, edition, pages
CRC Press, 2010
National Category
Computer Sciences
Identifiers
urn:nbn:se:miun:diva-9947 (URN)10.1201/EBK1439809853-c16 (DOI)978-1-4398-0985-3 (ISBN)978-1-4398-0986-0 (ISBN)
Available from: 2009-09-30 Created: 2009-09-30 Last updated: 2018-01-13Bibliographically approved
Kanter, T., Pettersson, S., Forsström, S., Kardeby, V., Norling, R., Walters, J. & Österberg, P. (2009). Distributed Context Support for Ubiquitous Mobile Awareness Services. In: 2009 Fourth International ICST Conference on Communications and Networking in China. ChinaCom'09.. Paper presented at 2009 4th International Conference on Communications and Networking in China, CHINACOM 2009; Xian; 26 August 2009 through 28 August 2009; Category number CFP0970A; Code 78908 (pp. 869-873). IEEE conference proceedings
Open this publication in new window or tab >>Distributed Context Support for Ubiquitous Mobile Awareness Services
Show others...
2009 (English)In: 2009 Fourth International ICST Conference on Communications and Networking in China. ChinaCom'09., IEEE conference proceedings, 2009, p. 869-873Conference paper, Published paper (Refereed)
Abstract [en]

Context-aware applications and services require ubiquitous access to context information about the users or sensors such as preferences, spatial & environmental data, available connectivity, and device capabilities. Systems for the brokering or the provisioning of context data via wireless networks do so with centralized servers or by employing protocols that do not scale well with real-time distribution capabilities. In other cases, such as the extending of presence systems, the data models are limited in expressive capabilities and consequently incur unnecessary signaling overhead. This paper presents a distributed protocol, the Distributed Context eXchange Protocol (DCXP), and an architecture for the real-time distribution of context information to ubiquitous mobile services: We present the architecture and its principle operation in a sample ubiquitous mobile awareness service. Preliminary results indicate that our approach scales well for the ubiquitous provision of context data in real-time to clients on the Internet via 3G wireless systems. Performed measurements show that DCXP can reduce the time to process context data with a factor of 20 compared to similar approaches.

 

Place, publisher, year, edition, pages
IEEE conference proceedings, 2009
Keywords
3G wireless; Centralized server; Context aware applications; Context data; Context information; Data models; Distributed protocols; Environmental data; Exchange protocols; Mobile awareness; Mobile service; Time distribution; Ubiquitous access, Internet protocols; Network architecture; Network protocols; Real time systems; Wireless networks; Wireless telecommunication systems
National Category
Computer Sciences
Identifiers
urn:nbn:se:miun:diva-9669 (URN)10.1109/CHINACOM.2009.5339728 (DOI)2-s2.0-71749111713 (Scopus ID)978-1-4244-4337-6 (ISBN)
Conference
2009 4th International Conference on Communications and Networking in China, CHINACOM 2009; Xian; 26 August 2009 through 28 August 2009; Category number CFP0970A; Code 78908
Available from: 2009-09-17 Created: 2009-09-17 Last updated: 2018-01-13Bibliographically approved
Kanter, T., Österberg, P., Walters, J., Kardeby, V., Forsström, S. & Pettersson, S. (2009). The MediaSense Framework. In: Proceedings - 2009 4th International Conference on Digital Telecommunications, ICDT 2009. Paper presented at 2009 4th International Conference on Digital Telecommunications, ICDT 2009; Colmar; 20 July 2009 through 25 July 2009 (pp. 144-147). New York: IEEE conference proceedings
Open this publication in new window or tab >>The MediaSense Framework
Show others...
2009 (English)In: Proceedings - 2009 4th International Conference on Digital Telecommunications, ICDT 2009, New York: IEEE conference proceedings, 2009, p. 144-147Conference paper, Published paper (Refereed)
Abstract [en]

Mobile telecommunication is evolving rapidly. People no longer only communicate with each other regardless of time and place, but also share other information that is important for tasks with which they are involved. In response to this growing trend the MediaSense framework addresses the intelligent delivery of any information to any host, anywhere, based on context-aware information regarding personal preferences, presence information, and sensor values. This includes another challenge to achieve seamless delivery, especially of multimedia content, and multimodal services via heterogeneous connections.

Place, publisher, year, edition, pages
New York: IEEE conference proceedings, 2009
National Category
Computer Sciences
Identifiers
urn:nbn:se:miun:diva-9662 (URN)10.1109/ICDT.2009.34 (DOI)000274805500029 ()2-s2.0-70449561027 (Scopus ID)978-0-7695-3695-8 (ISBN)
Conference
2009 4th International Conference on Digital Telecommunications, ICDT 2009; Colmar; 20 July 2009 through 25 July 2009
Projects
MediaSense
Available from: 2009-09-17 Created: 2009-09-17 Last updated: 2018-01-13Bibliographically approved
Kanter, T., Pettersson, S., Forsström, S., Kardeby, V. & Österberg, P. (2009). Ubiquitous Mobile Awareness from Sensor Networks. In: Lecture Notes of the Institute for Computer Sciences Social Informatics and Telecommunications Engineering Volume 12: . Paper presented at Workshops on Mobile Wireless Middleware, Operating Systems, and Applications, Mobilware 2009; Berlin; Germany; 28 April 2009 through 29 April 2009 (pp. 147-150). Springer
Open this publication in new window or tab >>Ubiquitous Mobile Awareness from Sensor Networks
Show others...
2009 (English)In: Lecture Notes of the Institute for Computer Sciences Social Informatics and Telecommunications Engineering Volume 12, Springer, 2009, p. 147-150Conference paper, Published paper (Refereed)
Abstract [en]

Users require applications and services to be available everywhere,enabling them to focus on what is important to them. Therefore, contextinformation (e.g., spatial data, user preferences, available connectivity anddevices, etc.) has to be accessible to applications that run in end systems closeto users. In response to this, we present a novel architecture for ubiquitoussensing and sharing of context in mobile services and applications. Thearchitecture offers distributed storage of context derived from sensor networkswirelessly attached to mobile phones and other devices. The architecture alsohandles frequent updates of sensor information and is interoperable withpresence in 3G mobile systems, thus enabling ubiquitous sensing applications.We demonstrate these concepts and the principle operation in a sampleubiquitous Mobile Awareness service.

Place, publisher, year, edition, pages
Springer, 2009
National Category
Computer Sciences
Identifiers
urn:nbn:se:miun:diva-9949 (URN)000302334000018 ()2-s2.0-84885888176 (Scopus ID)
Conference
Workshops on Mobile Wireless Middleware, Operating Systems, and Applications, Mobilware 2009; Berlin; Germany; 28 April 2009 through 29 April 2009
Available from: 2009-09-30 Created: 2009-09-30 Last updated: 2018-01-13Bibliographically approved
Wang, Q., Zhang, T. & Pettersson, S. (2008). An effort to understand the optimal routing performance in wireless sensor network. In: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications: AINA2008, Ginowan City , Okinawa, Japan. 25-28 March 2008. Paper presented at IEEE 22nd International Conference on Advanced Information Networking and Applications (pp. 279-286). IEEE conference proceedings
Open this publication in new window or tab >>An effort to understand the optimal routing performance in wireless sensor network
2008 (English)In: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications: AINA2008, Ginowan City , Okinawa, Japan. 25-28 March 2008, IEEE conference proceedings, 2008, p. 279-286Conference paper, Published paper (Refereed)
Abstract [en]

Wireless sensor network is remarkable for its promising use on human-unattended information collection, such as forest fire monitoring. In order to support efficient communication, many routing algorithms specially designed for such networks have been proposed. However, there is no idea about whether these proposed routing algorithms are already good enough or still have a long way to become “perfect”, since there is currently a lack of understanding about the optimal routing performance. This paper makes a progress in the understanding of the optimal routing performance. Metrics here used to measure the routing performance are the network lifetime finally acquired and the total information finally collected. The condition used to judge the network’s death is defined by the user’s requirement on the guaranteed network information collecting ability. Optimization models based on the metrics and death condition mentioned above are proposed. Experiments show some existing routing proposals already work well when the user’s requirement is strict, but few of them satisfy when the user’s requirement is loose.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2008
Keywords
Optimal Routing, Wireless Senson Networks
National Category
Computer Sciences
Identifiers
urn:nbn:se:miun:diva-4401 (URN)10.1109/AINA.2008.47 (DOI)2-s2.0-50249133776 (Scopus ID)5320 (Local ID)978-0-7695-3095-6 (ISBN)5320 (Archive number)5320 (OAI)
Conference
IEEE 22nd International Conference on Advanced Information Networking and Applications
Projects
STC - Sensible Things that Communicate
Available from: 2008-09-30 Created: 2009-07-28 Last updated: 2018-01-12Bibliographically approved
Jennehag, U. & Pettersson, S. (2008). On Synchronization Frames for Channel Switching in a GOP-based IPTV Environment. In: 2008 5TH IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-3: . Paper presented at 5th IEEE Consumer Communications and Networking Conference, Jan 10-12, 2008, Las Vegas (pp. 638-642). New York: IEEE conference proceedings
Open this publication in new window or tab >>On Synchronization Frames for Channel Switching in a GOP-based IPTV Environment
2008 (English)In: 2008 5TH IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-3, New York: IEEE conference proceedings, 2008, p. 638-642Conference paper, Published paper (Refereed)
Abstract [en]

Traditionally, Group of Pictures (GOP) is used to solve IPTV channel tune-in issues. However, channel changes issued by a TV viewer are quite rare which indicates it is redundant to solve channel tune-in with GOP. In this paper we extend our earlier work on Synchronization Frames for Channel Switching (SFCS) for reducing bandwidth utilization in IPTV networks to include encoding/decoding standards not supporting SI/SP-frames. We propose modifications to SFCS to work with MPEG-2. Channel tune-in quality and synchronization stream generation is also addressed. We provide bandwidth estimation expressions which are verified with an experimental simulation. Results show that SFCS adapted to MPEG-2 can reduce the bandwidth utilization with 9% compared to a traditional GOP system with equal steady state quality.

Place, publisher, year, edition, pages
New York: IEEE conference proceedings, 2008
Keywords
iptv mpeg-2 fast channel change
National Category
Computer Sciences
Identifiers
urn:nbn:se:miun:diva-411 (URN)10.1109/ccnc08.2007.147 (DOI)000259262700141 ()2-s2.0-51949092441 (Scopus ID)5135 (Local ID)978-1-4244-1456-7 (ISBN)5135 (Archive number)5135 (OAI)
Conference
5th IEEE Consumer Communications and Networking Conference, Jan 10-12, 2008, Las Vegas
Projects
STC - Sensible Things that Communicate
Available from: 2007-12-21 Created: 2007-12-21 Last updated: 2018-01-13Bibliographically approved
Reiman, U., Zhang, T. & Pettersson, S. (2007). A secure multicast downstream authentication protocol in sensor network.
Open this publication in new window or tab >>A secure multicast downstream authentication protocol in sensor network
2007 (English)Conference paper, Published paper (Refereed)
Abstract [en]

A secure multicast downstream authentication protocol in sensor network: we develop a authentication protocol for sensor networks where the transmitted data is protected by algorithms� for privacy and authentication

Keywords
Sensor network, authentication
National Category
Computer Sciences
Identifiers
urn:nbn:se:miun:diva-6319 (URN)4784 (Local ID)4784 (Archive number)4784 (OAI)
Available from: 2011-07-20 Created: 2011-07-20 Last updated: 2018-01-12Bibliographically approved
Wang, Q., Zhang, T. & Pettersson, S. (2007). Bounding the Information Collection performance of Wireless Sensor Network Routing. In: CNSR 2007: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research: . Paper presented at 5th Annual Conference on Communication Networks and Services Research, May 14-17, 2007, Fredericton, Canada (pp. 55-62). Washing, DC. USA: IEEE conference proceedings
Open this publication in new window or tab >>Bounding the Information Collection performance of Wireless Sensor Network Routing
2007 (English)In: CNSR 2007: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research, Washing, DC. USA: IEEE conference proceedings, 2007, p. 55-62Conference paper, Published paper (Refereed)
Abstract [en]

Wireless sensor networks have maily been designed for information-collecting purposes, such as habitat monitoring, product process tracing, battlefield surveillance, etc. In order to support efficient communications for such networks, many routing protocols have been proposed. However, protocol designs are out-pacing formal analysis. We propose an optimization model in this paper to bound the routing performance in terms of network information collection. We first argue that a network can only be given a death sentence when it fails to satisfy the application's requirement and propose a more reasonable network lifetime definition. Then, the optimization model concerning maximizing information collection routing is presented based on this new network lifetime definition. Existing typical routing algorithms: MH, MTE, FA and MREP are simulated as references to validate the model proposed. Results show our model can provide a tight upper bound and thus can be used to evaluate existing and up-coming routing algorithms.

Place, publisher, year, edition, pages
Washing, DC. USA: IEEE conference proceedings, 2007
Keywords
bound, information collection, network lifetime, sensor network routing
National Category
Computer Sciences
Identifiers
urn:nbn:se:miun:diva-4042 (URN)10.1109/CNSR.2007.19 (DOI)000246988200011 ()2-s2.0-34548329768 (Scopus ID)4858 (Local ID)978-0-7695-2835-9 (ISBN)4858 (Archive number)4858 (OAI)
Conference
5th Annual Conference on Communication Networks and Services Research, May 14-17, 2007, Fredericton, Canada
Projects
STC - Sensible Things that Communicate
Available from: 2008-11-29 Created: 2008-11-29 Last updated: 2018-01-12Bibliographically approved
Pettersson, S. (2007). Efficient Data Gathering in Wireless Sensor Networks with Power Control.
Open this publication in new window or tab >>Efficient Data Gathering in Wireless Sensor Networks with Power Control
2007 (English)Conference paper, Published paper (Other academic)
Keywords
Wireless sensor networks, Power Control, Data Gathering
Identifiers
urn:nbn:se:miun:diva-6339 (URN)3947 (Local ID)3947 (Archive number)3947 (OAI)
Available from: 2011-12-11 Created: 2011-12-11Bibliographically approved
Jennehag, U., Zhang, T. & Pettersson, S. (2007). Improving transmission efficiency in H.264 based IPTV systems. IEEE transactions on broadcasting, 53(1), 69-78
Open this publication in new window or tab >>Improving transmission efficiency in H.264 based IPTV systems
2007 (English)In: IEEE transactions on broadcasting, ISSN 0018-9316, E-ISSN 1557-9611, Vol. 53, no 1, p. 69-78Article in journal (Refereed) Published
Abstract [en]

In this paper, a novel proposal regarding the transmission of the next generation of live-TV content in an IPTV environment is presented. Today live-TV IP transmission systems utilizes a Group Of Pictures (GOP) structure in order to provide stream synchronization points for the clients. Synchronization points are used when a TV-channel switch occurs. The number of channel switches made by TV audiences have been shown to be rather rare. It is therefore redundant to send synchronization events in a GOP manner. Our proposal, Synchronization Frames for Channel Switching (SFCS), only requests synchronization points when required. Due to channel popularity distributions and the number of connected users, the total number of synchronization requests for a popular channel can increase to a level that makes SFCS less effective than GOP. Therefore, we introduce an SFCS-GOP hybrid. A complete network traffic analysis model, verified by a simple simulation environment, is also presented and the results show that the SFCS-GOP hybrid significantly increases the bandwidth utilization compared to a traditional GOP system

Keywords
Interactive TV, Multicast channels, Video coding
National Category
Computer Sciences
Identifiers
urn:nbn:se:miun:diva-8472 (URN)10.1109/TBC.2006.887167 (DOI)000244615200008 ()2-s2.0-33847725014 (Scopus ID)
Projects
STC - Sensible Things that Communicate
Note

VR-Computer Science

Available from: 2009-01-26 Created: 2009-01-26 Last updated: 2018-01-13Bibliographically approved
Organisations

Search in DiVA

Show all publications